{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:55YLJH3TWLCHAIQXNRTRRXBBO5","short_pith_number":"pith:55YLJH3T","canonical_record":{"source":{"id":"1412.2226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-06T11:54:33Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"721d3b30f4d3e2fb9e3a2ed8d48d0d2c626dbb6dceda3077cec7bc3e18d9c426","abstract_canon_sha256":"1189dcaca0c122d88fbf3c7ee116d8368035b2826d3b565646dab601c46abbb6"},"schema_version":"1.0"},"canonical_sha256":"ef70b49f73b2c47022176c6718dc217762f3265e10921af1fd7063381d587eea","source":{"kind":"arxiv","id":"1412.2226","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2226","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2226v1","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2226","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"55YLJH3TWLCH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"55YLJH3TWLCHAIQX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"55YLJH3T","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:55YLJH3TWLCHAIQXNRTRRXBBO5","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-06T11:54:33Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"721d3b30f4d3e2fb9e3a2ed8d48d0d2c626dbb6dceda3077cec7bc3e18d9c426","abstract_canon_sha256":"1189dcaca0c122d88fbf3c7ee116d8368035b2826d3b565646dab601c46abbb6"},"schema_version":"1.0"},"canonical_sha256":"ef70b49f73b2c47022176c6718dc217762f3265e10921af1fd7063381d587eea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:58.581617Z","signature_b64":"IEbPUKUJNVH1cK9/2imIGla1n1hFE6aPeQqP13vl04611pMDBmS/TWcEkG/lR3v0UB4EuqiRDUns2hhAbkI7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef70b49f73b2c47022176c6718dc217762f3265e10921af1fd7063381d587eea","last_reissued_at":"2026-05-18T02:31:58.580921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:58.580921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2226","source_version":1,"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-18T02:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGJpqkoEs1YSLEKUo/BbgQAx2NZtNB6Ynvrng82xanS5J92q8kdoTggvgQ/FeZtuNQKtVidM2NaS9tLAGBSIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:21:11.817809Z"},"content_sha256":"230cb25c70538853c7b0ca5898c8fb07d13f24027a77b71ebbd474c4f579fddb","schema_version":"1.0","event_id":"sha256:230cb25c70538853c7b0ca5898c8fb07d13f24027a77b71ebbd474c4f579fddb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:55YLJH3TWLCHAIQXNRTRRXBBO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Possible and Necessary Allocations via Sequential Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Haris Aziz, Lirong Xia, Toby Walsh","submitted_at":"2014-12-06T11:54:33Z","abstract_excerpt":"A simple mechanism for allocating indivisible resources is sequential allocation in which agents take turns to pick items. We focus on possible and necessary allocation problems, checking whether allocations of a given form occur in some or all mechanisms for several commonly used classes of sequential allocation mechanisms. In particular, we consider whether a given agent receives a given item, a set of items, or a subset of items for five natural classes of sequential allocation mechanisms: balanced, recursively balanced, balanced alternating, strictly alternating and all policies. We identi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2226","kind":"arxiv","version":1},"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-18T02:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tc6OhNSsNLU+QZKrrMCtj0+emZWj787/DvF09W1c8etRH31tppjTEWSw5EXN/VJCqECjsi8QFtv6JuLhZ/7OBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:21:11.818487Z"},"content_sha256":"d7e286246915d09cc2ad6a96d0ac7d245ce95cda69ef81f51d4c5d38f88459dc","schema_version":"1.0","event_id":"sha256:d7e286246915d09cc2ad6a96d0ac7d245ce95cda69ef81f51d4c5d38f88459dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55YLJH3TWLCHAIQXNRTRRXBBO5/bundle.json","state_url":"https://pith.science/pith/55YLJH3TWLCHAIQXNRTRRXBBO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55YLJH3TWLCHAIQXNRTRRXBBO5/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-05-27T22:21:11Z","links":{"resolver":"https://pith.science/pith/55YLJH3TWLCHAIQXNRTRRXBBO5","bundle":"https://pith.science/pith/55YLJH3TWLCHAIQXNRTRRXBBO5/bundle.json","state":"https://pith.science/pith/55YLJH3TWLCHAIQXNRTRRXBBO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55YLJH3TWLCHAIQXNRTRRXBBO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:55YLJH3TWLCHAIQXNRTRRXBBO5","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":"1189dcaca0c122d88fbf3c7ee116d8368035b2826d3b565646dab601c46abbb6","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-06T11:54:33Z","title_canon_sha256":"721d3b30f4d3e2fb9e3a2ed8d48d0d2c626dbb6dceda3077cec7bc3e18d9c426"},"schema_version":"1.0","source":{"id":"1412.2226","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2226","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2226v1","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2226","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"55YLJH3TWLCH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"55YLJH3TWLCHAIQX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"55YLJH3T","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:d7e286246915d09cc2ad6a96d0ac7d245ce95cda69ef81f51d4c5d38f88459dc","target":"graph","created_at":"2026-05-18T02:31:58Z","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":"A simple mechanism for allocating indivisible resources is sequential allocation in which agents take turns to pick items. We focus on possible and necessary allocation problems, checking whether allocations of a given form occur in some or all mechanisms for several commonly used classes of sequential allocation mechanisms. In particular, we consider whether a given agent receives a given item, a set of items, or a subset of items for five natural classes of sequential allocation mechanisms: balanced, recursively balanced, balanced alternating, strictly alternating and all policies. We identi","authors_text":"Haris Aziz, Lirong Xia, Toby Walsh","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-06T11:54:33Z","title":"Possible and Necessary Allocations via Sequential Mechanisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2226","kind":"arxiv","version":1},"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:230cb25c70538853c7b0ca5898c8fb07d13f24027a77b71ebbd474c4f579fddb","target":"record","created_at":"2026-05-18T02:31:58Z","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":"1189dcaca0c122d88fbf3c7ee116d8368035b2826d3b565646dab601c46abbb6","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-06T11:54:33Z","title_canon_sha256":"721d3b30f4d3e2fb9e3a2ed8d48d0d2c626dbb6dceda3077cec7bc3e18d9c426"},"schema_version":"1.0","source":{"id":"1412.2226","kind":"arxiv","version":1}},"canonical_sha256":"ef70b49f73b2c47022176c6718dc217762f3265e10921af1fd7063381d587eea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef70b49f73b2c47022176c6718dc217762f3265e10921af1fd7063381d587eea","first_computed_at":"2026-05-18T02:31:58.580921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:58.580921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IEbPUKUJNVH1cK9/2imIGla1n1hFE6aPeQqP13vl04611pMDBmS/TWcEkG/lR3v0UB4EuqiRDUns2hhAbkI7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:58.581617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2226","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:230cb25c70538853c7b0ca5898c8fb07d13f24027a77b71ebbd474c4f579fddb","sha256:d7e286246915d09cc2ad6a96d0ac7d245ce95cda69ef81f51d4c5d38f88459dc"],"state_sha256":"e462a5bb1a4d4756e6c058f456e66d8281e209b4551ae9fbab31b7f5153b5259"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2zhsCzpSpUbMbmU0bzdHlR9knXe5SWoJBlcDiQEMBkqP5aXbRIWdm3kd8yZto/E6fTK2xFE/A/Kpe0hGeOODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:21:11.821395Z","bundle_sha256":"c70629233b0070314d0cee09becce3fd2b6474380952991a5a24e85df5aca8af"}}