{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2HB7J4G5U2GDUMGK65DWUB57YN","short_pith_number":"pith:2HB7J4G5","canonical_record":{"source":{"id":"1602.06940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-02-22T20:56:34Z","cross_cats_sorted":[],"title_canon_sha256":"51d2cd921487ecaedfcabbe34465912bf292c48e00f0cdff6848f2a8cea6b8f2","abstract_canon_sha256":"f12e25e78f576bcb97defb016f1454c0f62088460d45e38ab7a77485b74f9b5f"},"schema_version":"1.0"},"canonical_sha256":"d1c3f4f0dda68c3a30caf7476a07bfc37ee92ed0c53bd52d683930c7498fc2f0","source":{"kind":"arxiv","id":"1602.06940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06940","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06940v1","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06940","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"2HB7J4G5U2GD","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2HB7J4G5U2GDUMGK","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2HB7J4G5","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2HB7J4G5U2GDUMGK65DWUB57YN","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-02-22T20:56:34Z","cross_cats_sorted":[],"title_canon_sha256":"51d2cd921487ecaedfcabbe34465912bf292c48e00f0cdff6848f2a8cea6b8f2","abstract_canon_sha256":"f12e25e78f576bcb97defb016f1454c0f62088460d45e38ab7a77485b74f9b5f"},"schema_version":"1.0"},"canonical_sha256":"d1c3f4f0dda68c3a30caf7476a07bfc37ee92ed0c53bd52d683930c7498fc2f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:12.828828Z","signature_b64":"2XTayT/X9RbViQyEDj63x4fBGcbBB7B+dIkTi3qjso5z7UiZO08f0lF8npsl+UyOtYnhMqvHPzFBKcoHKdfBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1c3f4f0dda68c3a30caf7476a07bfc37ee92ed0c53bd52d683930c7498fc2f0","last_reissued_at":"2026-05-18T01:20:12.828212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:12.828212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06940","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-18T01:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dAqZJBGLpLyi/8hF5zFonoHA7eKo+wZL0aUsotyW6jdPQ35NawPPqTE5NygIUHrkjvx0yFoys3rsmdF4+jwIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:53:44.019613Z"},"content_sha256":"4e1b4401e58803182f76988e144973382b0bbf4db4d6f89dbb389bb9be188826","schema_version":"1.0","event_id":"sha256:4e1b4401e58803182f76988e144973382b0bbf4db4d6f89dbb389bb9be188826"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2HB7J4G5U2GDUMGK65DWUB57YN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Manipulating Sequential Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Jerome Lang, Simon Mackenzie, Sylvain Bouveret","submitted_at":"2016-02-22T20:56:34Z","abstract_excerpt":"Sequential allocation is a simple allocation mechanism in which agents are given pre-specified turns and each agents gets the most preferred item that is still available. It has long been known that sequential allocation is not strategyproof.\n  Bouveret and Lang (2014) presented a polynomial-time algorithm to compute a best response of an agent with respect to additively separable utilities and claimed that (1) their algorithm correctly finds a best response, and (2) each best response results in the same allocation for the manipulator. We show that both claims are false via an example. We the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06940","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-18T01:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zOmZXAm1JRAaYBvyzwGzwkRKWpE2zS0FQuhPVcOg1RM+Ck79yoolrXbDGuq5wZzG/iTsDtAkpJyF0wijcidgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:53:44.020229Z"},"content_sha256":"7a0c3d9daf5d584037b966965ae65a95e0f4b46fcbe427c6b4f32d1e5a4644c1","schema_version":"1.0","event_id":"sha256:7a0c3d9daf5d584037b966965ae65a95e0f4b46fcbe427c6b4f32d1e5a4644c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HB7J4G5U2GDUMGK65DWUB57YN/bundle.json","state_url":"https://pith.science/pith/2HB7J4G5U2GDUMGK65DWUB57YN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HB7J4G5U2GDUMGK65DWUB57YN/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-27T15:53:44Z","links":{"resolver":"https://pith.science/pith/2HB7J4G5U2GDUMGK65DWUB57YN","bundle":"https://pith.science/pith/2HB7J4G5U2GDUMGK65DWUB57YN/bundle.json","state":"https://pith.science/pith/2HB7J4G5U2GDUMGK65DWUB57YN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HB7J4G5U2GDUMGK65DWUB57YN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2HB7J4G5U2GDUMGK65DWUB57YN","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":"f12e25e78f576bcb97defb016f1454c0f62088460d45e38ab7a77485b74f9b5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-02-22T20:56:34Z","title_canon_sha256":"51d2cd921487ecaedfcabbe34465912bf292c48e00f0cdff6848f2a8cea6b8f2"},"schema_version":"1.0","source":{"id":"1602.06940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06940","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06940v1","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06940","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"2HB7J4G5U2GD","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2HB7J4G5U2GDUMGK","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2HB7J4G5","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:7a0c3d9daf5d584037b966965ae65a95e0f4b46fcbe427c6b4f32d1e5a4644c1","target":"graph","created_at":"2026-05-18T01:20:12Z","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":"Sequential allocation is a simple allocation mechanism in which agents are given pre-specified turns and each agents gets the most preferred item that is still available. It has long been known that sequential allocation is not strategyproof.\n  Bouveret and Lang (2014) presented a polynomial-time algorithm to compute a best response of an agent with respect to additively separable utilities and claimed that (1) their algorithm correctly finds a best response, and (2) each best response results in the same allocation for the manipulator. We show that both claims are false via an example. We the","authors_text":"Haris Aziz, Jerome Lang, Simon Mackenzie, Sylvain Bouveret","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-02-22T20:56:34Z","title":"Complexity of Manipulating Sequential Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06940","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:4e1b4401e58803182f76988e144973382b0bbf4db4d6f89dbb389bb9be188826","target":"record","created_at":"2026-05-18T01:20:12Z","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":"f12e25e78f576bcb97defb016f1454c0f62088460d45e38ab7a77485b74f9b5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-02-22T20:56:34Z","title_canon_sha256":"51d2cd921487ecaedfcabbe34465912bf292c48e00f0cdff6848f2a8cea6b8f2"},"schema_version":"1.0","source":{"id":"1602.06940","kind":"arxiv","version":1}},"canonical_sha256":"d1c3f4f0dda68c3a30caf7476a07bfc37ee92ed0c53bd52d683930c7498fc2f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1c3f4f0dda68c3a30caf7476a07bfc37ee92ed0c53bd52d683930c7498fc2f0","first_computed_at":"2026-05-18T01:20:12.828212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:12.828212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2XTayT/X9RbViQyEDj63x4fBGcbBB7B+dIkTi3qjso5z7UiZO08f0lF8npsl+UyOtYnhMqvHPzFBKcoHKdfBCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:12.828828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e1b4401e58803182f76988e144973382b0bbf4db4d6f89dbb389bb9be188826","sha256:7a0c3d9daf5d584037b966965ae65a95e0f4b46fcbe427c6b4f32d1e5a4644c1"],"state_sha256":"3e2785e9aa606125be0dacbc1f97dfe69a4f4fb92565a47fdd65caf5aa8d8bae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ND/iaSvHGBFaNApucwHFjDLI2E/u5bDat+UaKz/QfBGJB+4gsw4Uw8ulAoqE1v8OYS+7TLiogGu2PKxoVN3ABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:53:44.023251Z","bundle_sha256":"bd45e80ba2b4444fcf582e5a51f0f773e74b031431416ded6d5ea3609b470b0e"}}