{"created":"2023-05-15T14:23:38.864407+00:00","id":5752,"links":{},"metadata":{"_buckets":{"deposit":"e6bbc849-145a-4248-bf8a-92bcc5a18f42"},"_deposit":{"created_by":3,"id":"5752","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"5752"},"status":"published"},"_oai":{"id":"oai:bunkyo.repo.nii.ac.jp:00005752","sets":["1:26:229"]},"author_link":["7092"],"item_5_biblio_info_13":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2000-01-01"},"bibliographicPageEnd":"53","bibliographicPageStart":"43","bibliographicVolumeNumber":"25","bibliographic_titles":[{"bibliographic_title":"情報研究"},{"bibliographic_title":"Information and Communication Studies"}]}]},"item_5_date_43":{"attribute_name":"作成日","attribute_value_mlt":[{"subitem_date_issued_datetime":"2011-02-23"}]},"item_5_description_12":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"　Antimatroids are antipodal to matroids, which are considered as combinatorial abstraction of　convexity. We consider an extension of Dilworth's decomposition theorem for partially ordered sets,　which states that the maximum size of antichains is equal to the minimum number of chains which　cover the ground set for any partially ordered set. In particular, we investigate the relationship between\nthe extended statement and circuits of antimatroids.","subitem_description_type":"Abstract"}]},"item_5_description_33":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"情報学シンポジウム特集号\\nタイトル日本語表記 : アンチマトロイドのサーキットとDilworthの分解定理\\n著者名日本語表記 : 岡本, 吉央","subitem_description_type":"Other"}]},"item_5_description_38":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_5_source_id_19":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"03893367"}]},"item_5_text_39":{"attribute_name":"本文言語","attribute_value_mlt":[{"subitem_text_value":"英語"}]},"item_5_text_42":{"attribute_name":"ID","attribute_value_mlt":[{"subitem_text_value":"BKSJ250007"}]},"item_5_text_8":{"attribute_name":"所属機関","attribute_value_mlt":[{"subitem_text_value":"東京大学大学院"}]},"item_5_text_9":{"attribute_name":"Institution","attribute_value_mlt":[{"subitem_text_value":"Department of Systems Science, Graduate School of Arts and Sciences, The University of Tokyo"}]},"item_5_version_type_35":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Okamoto, Yoshio"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-03-24"}],"displaytype":"detail","filename":"BKSJ250007.pdf","filesize":[{"value":"543.4 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"BKSJ250007.pdf","url":"https://bunkyo.repo.nii.ac.jp/record/5752/files/BKSJ250007.pdf"},"version_id":"f530a22c-71b3-407f-8495-9395eb3ff5be"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Circuits of Antimatoriods and Dilworth's Decomposition Theorem","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Circuits of Antimatoriods and Dilworth's Decomposition Theorem"}]},"item_type_id":"5","owner":"3","path":["229"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-02-23"},"publish_date":"2011-02-23","publish_status":"0","recid":"5752","relation_version_is_last":true,"title":["Circuits of Antimatoriods and Dilworth's Decomposition Theorem"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-05-15T16:17:46.637775+00:00"}