{"links":{},"id":2008633,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:02008633","sets":["1:1762310620030:1762318361976"]},"path":["1762318361976"],"owner":"13","recid":"2008633","title":["5分で分かる!? 有名論文ナナメ読み：Petter Brändén, June Huh : Lorentzian Polynomials"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2026-03-15"},"_buckets":{"deposit":"fdde7017-44c9-48ed-ab7c-7d3acdb27ba4"},"_deposit":{"id":"2008633","pid":{"type":"depid","value":"2008633","revision_id":0},"owner":"13","owners":[13],"status":"published","created_by":13},"item_title":"5分で分かる!? 有名論文ナナメ読み：Petter Brändén, June Huh : Lorentzian Polynomials","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"5分で分かる!? 有名論文ナナメ読み：Petter Brändén, June Huh : Lorentzian Polynomials","subitem_title_language":"ja"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"連載","subitem_subject_scheme":"Other"}]},"item_type_id":"30","publish_date":"2026-03-15","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_30_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"京都大学"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/2008633/files/IPSJ-MGN670409.pdf","label":"IPSJ-MGN670409.pdf"},"date":[{"dateType":"Available","dateValue":"2028-03-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MGN670409.pdf","filesize":[{"value":"664.3 KB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"63e0b0b7-0cde-49d5-a0cc-edb80ad3c925","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2026 by the Information Processing Society of Japan"}]},"item_30_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"藤井,海斗"}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"article"}]},"item_30_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116625","subitem_source_identifier_type":"NCID"}]},"item_30_publisher_14":{"attribute_name":"公開者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"item_30_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"連続最適化では，目的関数の凸性が問題の解きやすさに通じていることが知られています．離散最適化におけるマトロイドも，解きやすい問題に共通する性質として知られており，局所最適性が大域最適性を導くという点で凸性と似ています．本稿で紹介する論文は，マトロイドと凸性の間に，多項式を介した新しい繋がりがあることを明らかにしました．さらに，この性質は高速なサンプリングアルゴリズムの設計にも応用されています．","subitem_description_type":"Other"}]},"item_30_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"173","bibliographic_titles":[{"bibliographic_title":"情報処理"}],"bibliographicPageStart":"172","bibliographicIssueDates":{"bibliographicIssueDate":"2026-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"67"}]},"relation_version_is_last":true,"item_30_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.20729/0002008633","subitem_identifier_reg_type":"JaLC"}]},"weko_creator_id":"13"},"created":"2026-03-05T08:02:03.510442+00:00","updated":"2026-05-27T05:33:54.799816+00:00"}