{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:W6APUYSGPKYMAOL7BWYEQ6VYFQ","short_pith_number":"pith:W6APUYSG","canonical_record":{"source":{"id":"1604.01734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-06T19:08:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e7f16797e63dd3aabfa0cc5aeb8f006817d843d7df7c45d24328aaded4806f73","abstract_canon_sha256":"f8c39b8fd0875faee7e9aafde4ed6a6b9f0727d1b68f8f3296cae0f6107d425b"},"schema_version":"1.0"},"canonical_sha256":"b780fa62467ab0c0397f0db0487ab82c3116eb66f50654ea62fcced06de20d58","source":{"kind":"arxiv","id":"1604.01734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01734","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01734v1","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01734","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"W6APUYSGPKYM","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W6APUYSGPKYMAOL7","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W6APUYSG","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:W6APUYSGPKYMAOL7BWYEQ6VYFQ","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-06T19:08:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e7f16797e63dd3aabfa0cc5aeb8f006817d843d7df7c45d24328aaded4806f73","abstract_canon_sha256":"f8c39b8fd0875faee7e9aafde4ed6a6b9f0727d1b68f8f3296cae0f6107d425b"},"schema_version":"1.0"},"canonical_sha256":"b780fa62467ab0c0397f0db0487ab82c3116eb66f50654ea62fcced06de20d58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:35.684080Z","signature_b64":"zuCdiZMYUZ8ZEnkcQmnxEF3xBN7gLlQPv+OAsgWwQF8vXWW7kh0G8qMua85zAQK0eDfg2BNi8RgHUgQ3egAKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b780fa62467ab0c0397f0db0487ab82c3116eb66f50654ea62fcced06de20d58","last_reissued_at":"2026-05-18T01:17:35.683375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:35.683375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01734","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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4D+n3pWxhhsXjZWsEumt7nsoszX9hoH+vYZ8JPBwhHHBIwqA65UsoQPXMkbn9lhtss5Vfee8tIdrYB8T9YrVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:07:37.951624Z"},"content_sha256":"dbd6c59b63e1f357d60d0134cabd1d4ad9045b904f4ff2c43c479541e644e9b5","schema_version":"1.0","event_id":"sha256:dbd6c59b63e1f357d60d0134cabd1d4ad9045b904f4ff2c43c479541e644e9b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:W6APUYSGPKYMAOL7BWYEQ6VYFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Michel Lema\\^itre (Toulouse), Sylvain Bouveret","submitted_at":"2016-04-06T19:08:34Z","abstract_excerpt":"In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is the following: at each stage, a designated agent picks one object among those that remain. This paper, restricted to the case where the agents have numerical additive preferences over objects, revisits to some extent the seminal paper by Brams and King [9] which was specific to ordinal and linear order preferences over items. We point out similarities and differences with this latter context. In particular, we show that any Pareto-optimal alloca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01734","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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/WSsjKHMNCLieMvUMjVNwybury9C3lGDBiowtWG8bqipdNdkI8vDWwQIJ2kiekAXIocRy/QHlFo8tWqaXx8PCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:07:37.951981Z"},"content_sha256":"09a0a36d078d9ae3c56d9c50dc64b8839c4448d7a23f120ce64c3a2e5e88c4cd","schema_version":"1.0","event_id":"sha256:09a0a36d078d9ae3c56d9c50dc64b8839c4448d7a23f120ce64c3a2e5e88c4cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W6APUYSGPKYMAOL7BWYEQ6VYFQ/bundle.json","state_url":"https://pith.science/pith/W6APUYSGPKYMAOL7BWYEQ6VYFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W6APUYSGPKYMAOL7BWYEQ6VYFQ/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-04T15:07:37Z","links":{"resolver":"https://pith.science/pith/W6APUYSGPKYMAOL7BWYEQ6VYFQ","bundle":"https://pith.science/pith/W6APUYSGPKYMAOL7BWYEQ6VYFQ/bundle.json","state":"https://pith.science/pith/W6APUYSGPKYMAOL7BWYEQ6VYFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W6APUYSGPKYMAOL7BWYEQ6VYFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W6APUYSGPKYMAOL7BWYEQ6VYFQ","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":"f8c39b8fd0875faee7e9aafde4ed6a6b9f0727d1b68f8f3296cae0f6107d425b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-06T19:08:34Z","title_canon_sha256":"e7f16797e63dd3aabfa0cc5aeb8f006817d843d7df7c45d24328aaded4806f73"},"schema_version":"1.0","source":{"id":"1604.01734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01734","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01734v1","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01734","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"W6APUYSGPKYM","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W6APUYSGPKYMAOL7","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W6APUYSG","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:09a0a36d078d9ae3c56d9c50dc64b8839c4448d7a23f120ce64c3a2e5e88c4cd","target":"graph","created_at":"2026-05-18T01:17: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":"In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is the following: at each stage, a designated agent picks one object among those that remain. This paper, restricted to the case where the agents have numerical additive preferences over objects, revisits to some extent the seminal paper by Brams and King [9] which was specific to ordinal and linear order preferences over items. We point out similarities and differences with this latter context. In particular, we show that any Pareto-optimal alloca","authors_text":"Michel Lema\\^itre (Toulouse), Sylvain Bouveret","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-06T19:08:34Z","title":"Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01734","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:dbd6c59b63e1f357d60d0134cabd1d4ad9045b904f4ff2c43c479541e644e9b5","target":"record","created_at":"2026-05-18T01:17: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":"f8c39b8fd0875faee7e9aafde4ed6a6b9f0727d1b68f8f3296cae0f6107d425b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-06T19:08:34Z","title_canon_sha256":"e7f16797e63dd3aabfa0cc5aeb8f006817d843d7df7c45d24328aaded4806f73"},"schema_version":"1.0","source":{"id":"1604.01734","kind":"arxiv","version":1}},"canonical_sha256":"b780fa62467ab0c0397f0db0487ab82c3116eb66f50654ea62fcced06de20d58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b780fa62467ab0c0397f0db0487ab82c3116eb66f50654ea62fcced06de20d58","first_computed_at":"2026-05-18T01:17:35.683375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:35.683375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zuCdiZMYUZ8ZEnkcQmnxEF3xBN7gLlQPv+OAsgWwQF8vXWW7kh0G8qMua85zAQK0eDfg2BNi8RgHUgQ3egAKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:35.684080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbd6c59b63e1f357d60d0134cabd1d4ad9045b904f4ff2c43c479541e644e9b5","sha256:09a0a36d078d9ae3c56d9c50dc64b8839c4448d7a23f120ce64c3a2e5e88c4cd"],"state_sha256":"e59a522fc84cf4b432907728fe330a9a6d8a596522d006ce8dd4d9517ac83bdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37xAnfLzuBONcgiOJ8KnnQ1J7R+WhzPqL0R6MK0gMLO1ioIKc631k0VteywrhugUQpFcl4rupT+QqQiHwP57Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:07:37.954380Z","bundle_sha256":"c63759fd1825262e9334010deca6a6b32a94569a54800a33d282bf8354db5c3b"}}