{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DAX2UOLKXC7O54ZTDSSRM4UOVU","short_pith_number":"pith:DAX2UOLK","canonical_record":{"source":{"id":"2411.01810","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-11-04T05:28:53Z","cross_cats_sorted":[],"title_canon_sha256":"2f7f9c54451d696dce506c1b3c3db851dae0bb835497c857b41e7083664e61b4","abstract_canon_sha256":"d163789b73e07222c839df291636189544b428b19d126720fa67c82bf34b655d"},"schema_version":"1.0"},"canonical_sha256":"182faa396ab8beeef3331ca516728ead27071be6cd88df328f322ea97785ba2b","source":{"kind":"arxiv","id":"2411.01810","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.01810","created_at":"2026-07-05T09:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"2411.01810v1","created_at":"2026-07-05T09:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01810","created_at":"2026-07-05T09:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"DAX2UOLKXC7O","created_at":"2026-07-05T09:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"DAX2UOLKXC7O54ZT","created_at":"2026-07-05T09:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"DAX2UOLK","created_at":"2026-07-05T09:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DAX2UOLKXC7O54ZTDSSRM4UOVU","target":"record","payload":{"canonical_record":{"source":{"id":"2411.01810","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-11-04T05:28:53Z","cross_cats_sorted":[],"title_canon_sha256":"2f7f9c54451d696dce506c1b3c3db851dae0bb835497c857b41e7083664e61b4","abstract_canon_sha256":"d163789b73e07222c839df291636189544b428b19d126720fa67c82bf34b655d"},"schema_version":"1.0"},"canonical_sha256":"182faa396ab8beeef3331ca516728ead27071be6cd88df328f322ea97785ba2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:36.671206Z","signature_b64":"hkK/NqaM0ZwZCZ18H5TQBadbhfofB2cTAhSKbv7Ms+JyhPazPtnIEj8xz7PKeOGoZVjFnQA8/EjlMjf4x+FuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"182faa396ab8beeef3331ca516728ead27071be6cd88df328f322ea97785ba2b","last_reissued_at":"2026-07-05T09:30:36.670701Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:36.670701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.01810","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-05T09:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAdTazmVmEsX6XQHeNvC/gdYH+y7XDhiMtjg7PocbMw5SPaX9ANqHzAzW+WRCrPLkU4kn14l8tLYBXz7fZVIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:30:25.848359Z"},"content_sha256":"6c748d470144400bb339ceaef0fea663ee47c324f933136ca7cbdeffa48a2c34","schema_version":"1.0","event_id":"sha256:6c748d470144400bb339ceaef0fea663ee47c324f933136ca7cbdeffa48a2c34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DAX2UOLKXC7O54ZTDSSRM4UOVU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial-Time Algorithm for Fair and Efficient Allocation with a Fixed Number of Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ryoga Mahara","submitted_at":"2024-11-04T05:28:53Z","abstract_excerpt":"We study the problem of fairly and efficiently allocating indivisible goods among agents with additive valuation functions. Envy-freeness up to one good (EF1) is a well-studied fairness notion for indivisible goods, while Pareto optimality (PO) and its stronger variant, fractional Pareto optimality (fPO), are widely recognized efficiency criteria. Although each property is straightforward to achieve individually, simultaneously ensuring both fairness and efficiency is challenging. Caragiannis et al.~\\cite{caragiannis2019unreasonable} established the surprising result that maximizing Nash socia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01810","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/2411.01810/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-05T09:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ImiUNNeQU111juCgbvd+ezK4rEwNtfSNSOL0dEZcN+QEH37IBRBMKAekT1CcCNBylo/2Evs21BGJyDO2HKSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:30:25.848923Z"},"content_sha256":"b1095b287f4c30fe7cdef4895067ec3b75292ca112f6509d790e5397c9ff61a3","schema_version":"1.0","event_id":"sha256:b1095b287f4c30fe7cdef4895067ec3b75292ca112f6509d790e5397c9ff61a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAX2UOLKXC7O54ZTDSSRM4UOVU/bundle.json","state_url":"https://pith.science/pith/DAX2UOLKXC7O54ZTDSSRM4UOVU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAX2UOLKXC7O54ZTDSSRM4UOVU/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-08-16T16:30:25Z","links":{"resolver":"https://pith.science/pith/DAX2UOLKXC7O54ZTDSSRM4UOVU","bundle":"https://pith.science/pith/DAX2UOLKXC7O54ZTDSSRM4UOVU/bundle.json","state":"https://pith.science/pith/DAX2UOLKXC7O54ZTDSSRM4UOVU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAX2UOLKXC7O54ZTDSSRM4UOVU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DAX2UOLKXC7O54ZTDSSRM4UOVU","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":"d163789b73e07222c839df291636189544b428b19d126720fa67c82bf34b655d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-11-04T05:28:53Z","title_canon_sha256":"2f7f9c54451d696dce506c1b3c3db851dae0bb835497c857b41e7083664e61b4"},"schema_version":"1.0","source":{"id":"2411.01810","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.01810","created_at":"2026-07-05T09:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"2411.01810v1","created_at":"2026-07-05T09:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01810","created_at":"2026-07-05T09:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"DAX2UOLKXC7O","created_at":"2026-07-05T09:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"DAX2UOLKXC7O54ZT","created_at":"2026-07-05T09:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"DAX2UOLK","created_at":"2026-07-05T09:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:b1095b287f4c30fe7cdef4895067ec3b75292ca112f6509d790e5397c9ff61a3","target":"graph","created_at":"2026-07-05T09:30:36Z","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/2411.01810/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of fairly and efficiently allocating indivisible goods among agents with additive valuation functions. Envy-freeness up to one good (EF1) is a well-studied fairness notion for indivisible goods, while Pareto optimality (PO) and its stronger variant, fractional Pareto optimality (fPO), are widely recognized efficiency criteria. Although each property is straightforward to achieve individually, simultaneously ensuring both fairness and efficiency is challenging. Caragiannis et al.~\\cite{caragiannis2019unreasonable} established the surprising result that maximizing Nash socia","authors_text":"Ryoga Mahara","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-11-04T05:28:53Z","title":"A Polynomial-Time Algorithm for Fair and Efficient Allocation with a Fixed Number of Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01810","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:6c748d470144400bb339ceaef0fea663ee47c324f933136ca7cbdeffa48a2c34","target":"record","created_at":"2026-07-05T09:30:36Z","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":"d163789b73e07222c839df291636189544b428b19d126720fa67c82bf34b655d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-11-04T05:28:53Z","title_canon_sha256":"2f7f9c54451d696dce506c1b3c3db851dae0bb835497c857b41e7083664e61b4"},"schema_version":"1.0","source":{"id":"2411.01810","kind":"arxiv","version":1}},"canonical_sha256":"182faa396ab8beeef3331ca516728ead27071be6cd88df328f322ea97785ba2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"182faa396ab8beeef3331ca516728ead27071be6cd88df328f322ea97785ba2b","first_computed_at":"2026-07-05T09:30:36.670701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:30:36.670701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hkK/NqaM0ZwZCZ18H5TQBadbhfofB2cTAhSKbv7Ms+JyhPazPtnIEj8xz7PKeOGoZVjFnQA8/EjlMjf4x+FuDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:30:36.671206Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.01810","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c748d470144400bb339ceaef0fea663ee47c324f933136ca7cbdeffa48a2c34","sha256:b1095b287f4c30fe7cdef4895067ec3b75292ca112f6509d790e5397c9ff61a3"],"state_sha256":"f5c9ddd3ed8033be4073cc3bc238a73451551f7d20300c1b7664344f0d1d299d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2YMtOZIWZ5DXt2Bbo767OreQGWSQHvTPxd3OgsHwGI6r7m10T1HXqxD/3Hx/zLdDHs6g7Rmapo5jI+8YLcPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T16:30:25.853012Z","bundle_sha256":"5272e27eb2553650492513076cc6133bdac9dd2c4cf3b9c48da854e2b928bcf0"}}