{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AWFC4R75RDXHQJDTE64HAXLF7Z","short_pith_number":"pith:AWFC4R75","canonical_record":{"source":{"id":"1604.01091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-04T23:58:33Z","cross_cats_sorted":[],"title_canon_sha256":"b7362060f3ae76913bb89e166045c5a7727c72b8d094894d8837b38b123bb9a6","abstract_canon_sha256":"ef506f40053afda4bbfc69b2e747156180fff7bb1532347677ae664407f5de74"},"schema_version":"1.0"},"canonical_sha256":"058a2e47fd88ee78247327b8705d65fe6abbb7ff451c2d1073227c2fbbe4e486","source":{"kind":"arxiv","id":"1604.01091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01091","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01091v2","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01091","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"AWFC4R75RDXH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AWFC4R75RDXHQJDT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AWFC4R75","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AWFC4R75RDXHQJDTE64HAXLF7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-04T23:58:33Z","cross_cats_sorted":[],"title_canon_sha256":"b7362060f3ae76913bb89e166045c5a7727c72b8d094894d8837b38b123bb9a6","abstract_canon_sha256":"ef506f40053afda4bbfc69b2e747156180fff7bb1532347677ae664407f5de74"},"schema_version":"1.0"},"canonical_sha256":"058a2e47fd88ee78247327b8705d65fe6abbb7ff451c2d1073227c2fbbe4e486","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:47.583590Z","signature_b64":"2qiMCs5lWHLNA9OALlKxhfOxR3MYRISLShGo03k3M+tFH5xIcoLlWD/cxxjosKa08NY1ycFMXxlCYiD3eCIvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"058a2e47fd88ee78247327b8705d65fe6abbb7ff451c2d1073227c2fbbe4e486","last_reissued_at":"2026-05-18T00:15:47.582968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:47.582968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01091","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-18T00:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FAlnlCQ8fTPmjhkVYT9BsMPB3+YThb72aVrKwun7OyZh58XxSIjzZAlO4rOakoCXsyEYqwaIQeS1TZ/ELWULAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:42.902679Z"},"content_sha256":"d105d0dd93b1f041735b26f7b3cacc589ba8b06b405412e9f729ee37c0b5ee92","schema_version":"1.0","event_id":"sha256:d105d0dd93b1f041735b26f7b3cacc589ba8b06b405412e9f729ee37c0b5ee92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AWFC4R75RDXHQJDTE64HAXLF7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Reallocation under Additive and Responsive Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Jerome Lang, Jerome Monnot, Julien Lesca, Peter Biro","submitted_at":"2016-04-04T23:58:33Z","abstract_excerpt":"Reallocating resources to get mutually beneficial outcomes is a fundamental problem in various multi-agent settings. While finding an arbitrary Pareto optimal allocation is generally easy, checking whether a particular allocation is Pareto optimal can be much more difficult. This problem is equivalent to checking that the allocated objects cannot be reallocated in such a way that at least one agent prefers her new share to his old one, and no agent prefers her old share to her new one. We consider the problem for two related types of preference relations over sets of objects. In the first part"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01091","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-18T00:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BeGaTXqOZ6/WwEqYxlb7j81c5KQ5k4jm4jqWMBChoSvyFggrQqz+G+g9N4ENBAtW7dFD07JEIygEhJ+cQWs3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:42.903478Z"},"content_sha256":"f780ba9eaaf5eb0484c1b59b8dd9f9affdfb7e8aa9577aefb1c5b8f4d6eb47c6","schema_version":"1.0","event_id":"sha256:f780ba9eaaf5eb0484c1b59b8dd9f9affdfb7e8aa9577aefb1c5b8f4d6eb47c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWFC4R75RDXHQJDTE64HAXLF7Z/bundle.json","state_url":"https://pith.science/pith/AWFC4R75RDXHQJDTE64HAXLF7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWFC4R75RDXHQJDTE64HAXLF7Z/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-27T19:19:42Z","links":{"resolver":"https://pith.science/pith/AWFC4R75RDXHQJDTE64HAXLF7Z","bundle":"https://pith.science/pith/AWFC4R75RDXHQJDTE64HAXLF7Z/bundle.json","state":"https://pith.science/pith/AWFC4R75RDXHQJDTE64HAXLF7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWFC4R75RDXHQJDTE64HAXLF7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AWFC4R75RDXHQJDTE64HAXLF7Z","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":"ef506f40053afda4bbfc69b2e747156180fff7bb1532347677ae664407f5de74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-04T23:58:33Z","title_canon_sha256":"b7362060f3ae76913bb89e166045c5a7727c72b8d094894d8837b38b123bb9a6"},"schema_version":"1.0","source":{"id":"1604.01091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01091","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01091v2","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01091","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"AWFC4R75RDXH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AWFC4R75RDXHQJDT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AWFC4R75","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:f780ba9eaaf5eb0484c1b59b8dd9f9affdfb7e8aa9577aefb1c5b8f4d6eb47c6","target":"graph","created_at":"2026-05-18T00:15:47Z","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":"Reallocating resources to get mutually beneficial outcomes is a fundamental problem in various multi-agent settings. While finding an arbitrary Pareto optimal allocation is generally easy, checking whether a particular allocation is Pareto optimal can be much more difficult. This problem is equivalent to checking that the allocated objects cannot be reallocated in such a way that at least one agent prefers her new share to his old one, and no agent prefers her old share to her new one. We consider the problem for two related types of preference relations over sets of objects. In the first part","authors_text":"Haris Aziz, Jerome Lang, Jerome Monnot, Julien Lesca, Peter Biro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-04T23:58:33Z","title":"Efficient Reallocation under Additive and Responsive Preferences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01091","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:d105d0dd93b1f041735b26f7b3cacc589ba8b06b405412e9f729ee37c0b5ee92","target":"record","created_at":"2026-05-18T00:15:47Z","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":"ef506f40053afda4bbfc69b2e747156180fff7bb1532347677ae664407f5de74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-04T23:58:33Z","title_canon_sha256":"b7362060f3ae76913bb89e166045c5a7727c72b8d094894d8837b38b123bb9a6"},"schema_version":"1.0","source":{"id":"1604.01091","kind":"arxiv","version":2}},"canonical_sha256":"058a2e47fd88ee78247327b8705d65fe6abbb7ff451c2d1073227c2fbbe4e486","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"058a2e47fd88ee78247327b8705d65fe6abbb7ff451c2d1073227c2fbbe4e486","first_computed_at":"2026-05-18T00:15:47.582968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:47.582968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2qiMCs5lWHLNA9OALlKxhfOxR3MYRISLShGo03k3M+tFH5xIcoLlWD/cxxjosKa08NY1ycFMXxlCYiD3eCIvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:47.583590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d105d0dd93b1f041735b26f7b3cacc589ba8b06b405412e9f729ee37c0b5ee92","sha256:f780ba9eaaf5eb0484c1b59b8dd9f9affdfb7e8aa9577aefb1c5b8f4d6eb47c6"],"state_sha256":"43096d97a61535b80adbebf4176b284c54eb992c9ba6648497ecb9e18c0fb821"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VWgm2ofALa+V5Q/R88ZJOchK1+9H11ODjIJnnb9VEvWsVKPHy6Pb3uONOFto2kCGJXQW0iJnGzCLSzQ6xDDwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:19:42.907831Z","bundle_sha256":"724d9ed0e3d766bc3c7d826867fa25f8a94bd168401c7648368ee60e4a9cc4a1"}}