{"created":"2025-01-19T01:32:24.922368+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00231864","sets":["1164:2592:11452:11453"]},"path":["11453"],"owner":"44499","recid":"231864","title":["輪番割当6分の5予想の解決"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-01-13"},"_buckets":{"deposit":"0596da08-7374-442e-be0f-96c271a930f6"},"_deposit":{"id":"231864","pid":{"type":"depid","value":"231864","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"輪番割当6分の5予想の解決","author_link":["627079"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"輪番割当6分の5予想の解決"}]},"item_type_id":"4","publish_date":"2024-01-13","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"京都大学"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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/231864/files/IPSJ-AL24196001.pdf","label":"IPSJ-AL24196001.pdf"},"date":[{"dateType":"Available","dateValue":"2026-01-13"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL24196001.pdf","filesize":[{"value":"966.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"7096e76d-1fc6-4de3-904a-5a2a8111da9a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"河村, 彰星"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"幾つかある仕事のそれぞれについて，連続する○○日には必ず一度以上やるべしという日数が指定されている．これを満し続けながら毎日いずれか一つだけ仕事をしたい．勿論これが可能であるには指定された日数の逆数の和が 1 以下である必要がある．一方この逆数和が 6 分の 5 以下なら十分である，という陳と錢（1993）の予想が示されたので報告する．証明は有限個の場合を計算機で確かめることでなされた．この有限個で十分であることは，日数を整数から実数へ適切に拡張する議論により示される．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"3","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-01-13","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2024-AL-196"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":231864,"updated":"2025-01-19T10:37:13.337944+00:00","links":{}}