{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:XFFQJVCSUZHHLGAC446VTPPQVY","short_pith_number":"pith:XFFQJVCS","canonical_record":{"source":{"id":"2211.16143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-11-29T12:16:56Z","cross_cats_sorted":[],"title_canon_sha256":"0a2d0f47f7601e71d681fe6d154ad67e27b95a5e6f0a8848ad9281b01436c966","abstract_canon_sha256":"1575d88e548f8536a225304041c3f10676a04d76b889b8cba5478fe238bfe22b"},"schema_version":"1.0"},"canonical_sha256":"b94b04d452a64e759802e73d59bdf0ae086afb621297cfd3f76c8bcc28abf3f5","source":{"kind":"arxiv","id":"2211.16143","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.16143","created_at":"2026-07-05T05:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"2211.16143v1","created_at":"2026-07-05T05:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.16143","created_at":"2026-07-05T05:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"XFFQJVCSUZHH","created_at":"2026-07-05T05:20:23Z"},{"alias_kind":"pith_short_16","alias_value":"XFFQJVCSUZHHLGAC","created_at":"2026-07-05T05:20:23Z"},{"alias_kind":"pith_short_8","alias_value":"XFFQJVCS","created_at":"2026-07-05T05:20:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:XFFQJVCSUZHHLGAC446VTPPQVY","target":"record","payload":{"canonical_record":{"source":{"id":"2211.16143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-11-29T12:16:56Z","cross_cats_sorted":[],"title_canon_sha256":"0a2d0f47f7601e71d681fe6d154ad67e27b95a5e6f0a8848ad9281b01436c966","abstract_canon_sha256":"1575d88e548f8536a225304041c3f10676a04d76b889b8cba5478fe238bfe22b"},"schema_version":"1.0"},"canonical_sha256":"b94b04d452a64e759802e73d59bdf0ae086afb621297cfd3f76c8bcc28abf3f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:23.821963Z","signature_b64":"MBQBBaaSf8rCJtTlkM8y40ljDff4+otyAu1loGCoyVdeMykzykvIfXSMQBvkpuYeYNyW93eT+epsgJRe6UqnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b94b04d452a64e759802e73d59bdf0ae086afb621297cfd3f76c8bcc28abf3f5","last_reissued_at":"2026-07-05T05:20:23.821565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:23.821565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.16143","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-07-05T05:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tqT25JNjySqv5c9ChOnXKj3xwZLF4uZr3cWTHarfKB5MnIumhhvmWNNdy3wF8bwaVbA7oVsFEAmn/m9Ui6D+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T19:53:48.068099Z"},"content_sha256":"9df1a0828efffa11c1034efb7121db88ba1c3eedf8c4220e1120fec9e37429e6","schema_version":"1.0","event_id":"sha256:9df1a0828efffa11c1034efb7121db88ba1c3eedf8c4220e1120fec9e37429e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:XFFQJVCSUZHHLGAC446VTPPQVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fair Division with Prioritized Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Biaoshuai Tao, Jiaxin Song, Shengxin Liu, Xiaolin Bu, Zihao Li","submitted_at":"2022-11-29T12:16:56Z","abstract_excerpt":"We consider the fair division problem of indivisible items. It is well-known that an envy-free allocation may not exist, and a relaxed version of envy-freeness, envy-freeness up to one item (EF1), has been widely considered. In an EF1 allocation, an agent may envy others' allocated shares, but only up to one item. In many applications, we may wish to specify a subset of prioritized agents where strict envy-freeness needs to be guaranteed from these agents to the remaining agents, while ensuring the whole allocation is still EF1. Prioritized agents may be those agents who are envious in a previ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.16143","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.16143/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j8Gps2dmISwwiKz9Uk1f4pgWP4y97UVPTx4wLaN6Enjzt3naSkPYv2eZgLYhHss1FwG8ot8PFXCDRVi+JLR9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T19:53:48.068781Z"},"content_sha256":"46953a443d89eedd09f6ec7d346f2b8de3b962a8e7e913627fa3ff1e8aeb7490","schema_version":"1.0","event_id":"sha256:46953a443d89eedd09f6ec7d346f2b8de3b962a8e7e913627fa3ff1e8aeb7490"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY/bundle.json","state_url":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFFQJVCSUZHHLGAC446VTPPQVY/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-07-12T19:53:48Z","links":{"resolver":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY","bundle":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY/bundle.json","state":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFFQJVCSUZHHLGAC446VTPPQVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:XFFQJVCSUZHHLGAC446VTPPQVY","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":"1575d88e548f8536a225304041c3f10676a04d76b889b8cba5478fe238bfe22b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-11-29T12:16:56Z","title_canon_sha256":"0a2d0f47f7601e71d681fe6d154ad67e27b95a5e6f0a8848ad9281b01436c966"},"schema_version":"1.0","source":{"id":"2211.16143","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.16143","created_at":"2026-07-05T05:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"2211.16143v1","created_at":"2026-07-05T05:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.16143","created_at":"2026-07-05T05:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"XFFQJVCSUZHH","created_at":"2026-07-05T05:20:23Z"},{"alias_kind":"pith_short_16","alias_value":"XFFQJVCSUZHHLGAC","created_at":"2026-07-05T05:20:23Z"},{"alias_kind":"pith_short_8","alias_value":"XFFQJVCS","created_at":"2026-07-05T05:20:23Z"}],"graph_snapshots":[{"event_id":"sha256:46953a443d89eedd09f6ec7d346f2b8de3b962a8e7e913627fa3ff1e8aeb7490","target":"graph","created_at":"2026-07-05T05:20:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.16143/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the fair division problem of indivisible items. It is well-known that an envy-free allocation may not exist, and a relaxed version of envy-freeness, envy-freeness up to one item (EF1), has been widely considered. In an EF1 allocation, an agent may envy others' allocated shares, but only up to one item. In many applications, we may wish to specify a subset of prioritized agents where strict envy-freeness needs to be guaranteed from these agents to the remaining agents, while ensuring the whole allocation is still EF1. Prioritized agents may be those agents who are envious in a previ","authors_text":"Biaoshuai Tao, Jiaxin Song, Shengxin Liu, Xiaolin Bu, Zihao Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-11-29T12:16:56Z","title":"Fair Division with Prioritized Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.16143","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:9df1a0828efffa11c1034efb7121db88ba1c3eedf8c4220e1120fec9e37429e6","target":"record","created_at":"2026-07-05T05:20:23Z","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":"1575d88e548f8536a225304041c3f10676a04d76b889b8cba5478fe238bfe22b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-11-29T12:16:56Z","title_canon_sha256":"0a2d0f47f7601e71d681fe6d154ad67e27b95a5e6f0a8848ad9281b01436c966"},"schema_version":"1.0","source":{"id":"2211.16143","kind":"arxiv","version":1}},"canonical_sha256":"b94b04d452a64e759802e73d59bdf0ae086afb621297cfd3f76c8bcc28abf3f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b94b04d452a64e759802e73d59bdf0ae086afb621297cfd3f76c8bcc28abf3f5","first_computed_at":"2026-07-05T05:20:23.821565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:20:23.821565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MBQBBaaSf8rCJtTlkM8y40ljDff4+otyAu1loGCoyVdeMykzykvIfXSMQBvkpuYeYNyW93eT+epsgJRe6UqnAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:20:23.821963Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.16143","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9df1a0828efffa11c1034efb7121db88ba1c3eedf8c4220e1120fec9e37429e6","sha256:46953a443d89eedd09f6ec7d346f2b8de3b962a8e7e913627fa3ff1e8aeb7490"],"state_sha256":"d1b0c191e4e53784b247708c3cb44e698ac55931e59cf5b89aed269440d36bf5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4idfCq05Xf6dkHSld/ezNs4ZvWwOc1LVHQO4wi72HF9Uiv+s+wAAsBZMFHJodFS333VzEYMbN7V+AwZ5fI2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T19:53:48.072978Z","bundle_sha256":"17dcaac1665a68ff8263c3dffb91b8a773cb2f5262a4a684f4a8b425ee981f6d"}}