{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:N6MXKND3SHBCRHMNOAQGPZBCMW","short_pith_number":"pith:N6MXKND3","canonical_record":{"source":{"id":"1304.5892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-22T09:38:56Z","cross_cats_sorted":["cs.GT","cs.MA"],"title_canon_sha256":"55d1810b7e145f0d377edcccb05e8a4e47f340b2f3fc0a5b3e5fb5b4c4184dc3","abstract_canon_sha256":"731b31ef0a90a043d99969fa71e239e783bdf7204f22b2c7c5314be0819acc34"},"schema_version":"1.0"},"canonical_sha256":"6f9975347b91c2289d8d702067e42265862152d0f053bf12539e8c20ef2ecdd2","source":{"kind":"arxiv","id":"1304.5892","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5892","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5892v2","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5892","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"pith_short_12","alias_value":"N6MXKND3SHBC","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N6MXKND3SHBCRHMN","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N6MXKND3","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:N6MXKND3SHBCRHMNOAQGPZBCMW","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-22T09:38:56Z","cross_cats_sorted":["cs.GT","cs.MA"],"title_canon_sha256":"55d1810b7e145f0d377edcccb05e8a4e47f340b2f3fc0a5b3e5fb5b4c4184dc3","abstract_canon_sha256":"731b31ef0a90a043d99969fa71e239e783bdf7204f22b2c7c5314be0819acc34"},"schema_version":"1.0"},"canonical_sha256":"6f9975347b91c2289d8d702067e42265862152d0f053bf12539e8c20ef2ecdd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:22.442961Z","signature_b64":"G5FVBN+2HDEyf1Eq/IVuNiP1agKM8si6M+6smm1zeSWT40vvHFKgZvp8DZ/De6Ae8kuhWKXbyg+OgiXs3X55AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f9975347b91c2289d8d702067e42265862152d0f053bf12539e8c20ef2ecdd2","last_reissued_at":"2026-05-18T03:27:22.442298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:22.442298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5892","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:27:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1lmT4CYjjZWhGZOH3qDXZvUn6z8cfV0rO4lFSQZ/Gtae0j6XYRGhYbIAJbI0TwQPWPTHY/0abI+Dq8oSKPHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:34:33.815529Z"},"content_sha256":"a594914be7ff5a38c1ea85d467f36031e9c9d5dd2cafba8f59ec8491dc0f9a4e","schema_version":"1.0","event_id":"sha256:a594914be7ff5a38c1ea85d467f36031e9c9d5dd2cafba8f59ec8491dc0f9a4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:N6MXKND3SHBCRHMNOAQGPZBCMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Social Welfare Optimal Sequential Allocation Procedure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.AI","authors_text":"Nina Nardoytska, Thomas Kalinowski, Toby Walsh","submitted_at":"2013-04-22T09:38:56Z","abstract_excerpt":"We consider a simple sequential allocation procedure for sharing indivisible items between agents in which agents take turns to pick items. Supposing additive utilities and independence between the agents, we show that the expected utility of each agent is computable in polynomial time. Using this result, we prove that the expected utilitarian social welfare is maximized when agents take alternate turns. We also argue that this mechanism remains optimal when agents behave strategically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5892","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:27:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KtKx8VNwqVwE2Hv2RT9EHdhwAB7NAM31KF8vvLYlhX7ZlNcyk4rlrXRNZX44P9lJKBadIOxoyQveurJZwB5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:34:33.816239Z"},"content_sha256":"2050901fcb9fe322d2ed2f179c80e369d5ff6fa147c5b81526f3fb487ca5fb32","schema_version":"1.0","event_id":"sha256:2050901fcb9fe322d2ed2f179c80e369d5ff6fa147c5b81526f3fb487ca5fb32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6MXKND3SHBCRHMNOAQGPZBCMW/bundle.json","state_url":"https://pith.science/pith/N6MXKND3SHBCRHMNOAQGPZBCMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6MXKND3SHBCRHMNOAQGPZBCMW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T01:34:33Z","links":{"resolver":"https://pith.science/pith/N6MXKND3SHBCRHMNOAQGPZBCMW","bundle":"https://pith.science/pith/N6MXKND3SHBCRHMNOAQGPZBCMW/bundle.json","state":"https://pith.science/pith/N6MXKND3SHBCRHMNOAQGPZBCMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6MXKND3SHBCRHMNOAQGPZBCMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:N6MXKND3SHBCRHMNOAQGPZBCMW","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":"731b31ef0a90a043d99969fa71e239e783bdf7204f22b2c7c5314be0819acc34","cross_cats_sorted":["cs.GT","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-22T09:38:56Z","title_canon_sha256":"55d1810b7e145f0d377edcccb05e8a4e47f340b2f3fc0a5b3e5fb5b4c4184dc3"},"schema_version":"1.0","source":{"id":"1304.5892","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5892","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5892v2","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5892","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"pith_short_12","alias_value":"N6MXKND3SHBC","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N6MXKND3SHBCRHMN","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N6MXKND3","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:2050901fcb9fe322d2ed2f179c80e369d5ff6fa147c5b81526f3fb487ca5fb32","target":"graph","created_at":"2026-05-18T03:27:22Z","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":"We consider a simple sequential allocation procedure for sharing indivisible items between agents in which agents take turns to pick items. Supposing additive utilities and independence between the agents, we show that the expected utility of each agent is computable in polynomial time. Using this result, we prove that the expected utilitarian social welfare is maximized when agents take alternate turns. We also argue that this mechanism remains optimal when agents behave strategically","authors_text":"Nina Nardoytska, Thomas Kalinowski, Toby Walsh","cross_cats":["cs.GT","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-22T09:38:56Z","title":"A Social Welfare Optimal Sequential Allocation Procedure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5892","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:a594914be7ff5a38c1ea85d467f36031e9c9d5dd2cafba8f59ec8491dc0f9a4e","target":"record","created_at":"2026-05-18T03:27:22Z","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":"731b31ef0a90a043d99969fa71e239e783bdf7204f22b2c7c5314be0819acc34","cross_cats_sorted":["cs.GT","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-22T09:38:56Z","title_canon_sha256":"55d1810b7e145f0d377edcccb05e8a4e47f340b2f3fc0a5b3e5fb5b4c4184dc3"},"schema_version":"1.0","source":{"id":"1304.5892","kind":"arxiv","version":2}},"canonical_sha256":"6f9975347b91c2289d8d702067e42265862152d0f053bf12539e8c20ef2ecdd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f9975347b91c2289d8d702067e42265862152d0f053bf12539e8c20ef2ecdd2","first_computed_at":"2026-05-18T03:27:22.442298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:22.442298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G5FVBN+2HDEyf1Eq/IVuNiP1agKM8si6M+6smm1zeSWT40vvHFKgZvp8DZ/De6Ae8kuhWKXbyg+OgiXs3X55AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:22.442961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5892","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a594914be7ff5a38c1ea85d467f36031e9c9d5dd2cafba8f59ec8491dc0f9a4e","sha256:2050901fcb9fe322d2ed2f179c80e369d5ff6fa147c5b81526f3fb487ca5fb32"],"state_sha256":"44bfa2696a27af361f8e6f6e6314d96ed6894d9a212fb4ad1c828d24aa98de26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buJiEpKE3HtuM6jhliY6CpqQ3R6UNWYrAYpIvx/GZZ3ga5w3hoQWcl0OOeegdUPKsLgDjdvvgwuj+vSUpt+AAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:34:33.819909Z","bundle_sha256":"864e4c6c6f7d266d9b432f8b0c9883a314dee6a6be9ed3bd8eff0a59c9207a06"}}