{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RPNANXLI2EYFZAAX3HRIDLTOM7","short_pith_number":"pith:RPNANXLI","schema_version":"1.0","canonical_sha256":"8bda06dd68d1305c8017d9e281ae6e67df69b0e3ac21bf9a1b0d27c247058230","source":{"kind":"arxiv","id":"1905.03038","version":2},"attestation_state":"computed","paper":{"title":"Maximin share allocations on cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.SI","authors_text":"Miroslaw Truszczynski, Zbigniew Lonc","submitted_at":"2019-04-25T15:54:44Z","abstract_excerpt":"The problem of fair division of indivisible goods is a fundamental problem of social choice. Recently, the problem was extended to the case when goods form a graph and the goal is to allocate goods to agents so that each agent's bundle forms a connected subgraph. For the maximin share fairness criterion researchers proved that if goods form a tree, allocations offering each agent a bundle of at least her maximin share value always exist. Moreover, they can be found in polynomial time. We consider here the problem of maximin share allocations of goods on a cycle. Despite the simplicity of the g"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1905.03038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-25T15:54:44Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"efcf529e0c2a6969b861ecabf0f795e00d90eac4e438d05dbd9a00e9b9990724","abstract_canon_sha256":"b241da76ac608f32f36eb7c7496a00fdde41a8e5361359082907f2d28cc79d22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:35.647542Z","signature_b64":"Dw8BQVjAevmNEqQd7NLjq9ARIiHEc5zhNdtJB61EvxCdZdHKzrWBLEx5Dho1Q0vvS4XkuRYd55QRCRNHwVEhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bda06dd68d1305c8017d9e281ae6e67df69b0e3ac21bf9a1b0d27c247058230","last_reissued_at":"2026-05-17T23:46:35.646780Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:35.646780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximin share allocations on cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.SI","authors_text":"Miroslaw Truszczynski, Zbigniew Lonc","submitted_at":"2019-04-25T15:54:44Z","abstract_excerpt":"The problem of fair division of indivisible goods is a fundamental problem of social choice. Recently, the problem was extended to the case when goods form a graph and the goal is to allocate goods to agents so that each agent's bundle forms a connected subgraph. For the maximin share fairness criterion researchers proved that if goods form a tree, allocations offering each agent a bundle of at least her maximin share value always exist. Moreover, they can be found in polynomial time. We consider here the problem of maximin share allocations of goods on a cycle. Despite the simplicity of the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03038","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.03038","created_at":"2026-05-17T23:46:35.646907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03038v2","created_at":"2026-05-17T23:46:35.646907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03038","created_at":"2026-05-17T23:46:35.646907+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPNANXLI2EYF","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPNANXLI2EYFZAAX","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPNANXLI","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPNANXLI2EYFZAAX3HRIDLTOM7","json":"https://pith.science/pith/RPNANXLI2EYFZAAX3HRIDLTOM7.json","graph_json":"https://pith.science/api/pith-number/RPNANXLI2EYFZAAX3HRIDLTOM7/graph.json","events_json":"https://pith.science/api/pith-number/RPNANXLI2EYFZAAX3HRIDLTOM7/events.json","paper":"https://pith.science/paper/RPNANXLI"},"agent_actions":{"view_html":"https://pith.science/pith/RPNANXLI2EYFZAAX3HRIDLTOM7","download_json":"https://pith.science/pith/RPNANXLI2EYFZAAX3HRIDLTOM7.json","view_paper":"https://pith.science/paper/RPNANXLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03038&json=true","fetch_graph":"https://pith.science/api/pith-number/RPNANXLI2EYFZAAX3HRIDLTOM7/graph.json","fetch_events":"https://pith.science/api/pith-number/RPNANXLI2EYFZAAX3HRIDLTOM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPNANXLI2EYFZAAX3HRIDLTOM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPNANXLI2EYFZAAX3HRIDLTOM7/action/storage_attestation","attest_author":"https://pith.science/pith/RPNANXLI2EYFZAAX3HRIDLTOM7/action/author_attestation","sign_citation":"https://pith.science/pith/RPNANXLI2EYFZAAX3HRIDLTOM7/action/citation_signature","submit_replication":"https://pith.science/pith/RPNANXLI2EYFZAAX3HRIDLTOM7/action/replication_record"}},"created_at":"2026-05-17T23:46:35.646907+00:00","updated_at":"2026-05-17T23:46:35.646907+00:00"}