{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RPNANXLI2EYFZAAX3HRIDLTOM7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b241da76ac608f32f36eb7c7496a00fdde41a8e5361359082907f2d28cc79d22","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-25T15:54:44Z","title_canon_sha256":"efcf529e0c2a6969b861ecabf0f795e00d90eac4e438d05dbd9a00e9b9990724"},"schema_version":"1.0","source":{"id":"1905.03038","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03038","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03038v2","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03038","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"pith_short_12","alias_value":"RPNANXLI2EYF","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RPNANXLI2EYFZAAX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RPNANXLI","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:11d07a76af04bc076ee843db3660e4b0b2f28451342cb3f321fcbe8d1606c8f2","target":"graph","created_at":"2026-05-17T23:46:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Miroslaw Truszczynski, Zbigniew Lonc","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-25T15:54:44Z","title":"Maximin share allocations on cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03038","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9847576ca0669376c550cfad73120b46245941bdb51327bdd1bbe1aa9ff94d9b","target":"record","created_at":"2026-05-17T23:46:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b241da76ac608f32f36eb7c7496a00fdde41a8e5361359082907f2d28cc79d22","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-25T15:54:44Z","title_canon_sha256":"efcf529e0c2a6969b861ecabf0f795e00d90eac4e438d05dbd9a00e9b9990724"},"schema_version":"1.0","source":{"id":"1905.03038","kind":"arxiv","version":2}},"canonical_sha256":"8bda06dd68d1305c8017d9e281ae6e67df69b0e3ac21bf9a1b0d27c247058230","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bda06dd68d1305c8017d9e281ae6e67df69b0e3ac21bf9a1b0d27c247058230","first_computed_at":"2026-05-17T23:46:35.646780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:35.646780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dw8BQVjAevmNEqQd7NLjq9ARIiHEc5zhNdtJB61EvxCdZdHKzrWBLEx5Dho1Q0vvS4XkuRYd55QRCRNHwVEhCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:35.647542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03038","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9847576ca0669376c550cfad73120b46245941bdb51327bdd1bbe1aa9ff94d9b","sha256:11d07a76af04bc076ee843db3660e4b0b2f28451342cb3f321fcbe8d1606c8f2"],"state_sha256":"9a51dde88233edfb1a4dbf9ee3693948f2d79e1017fac75888a32020a962e119"}