{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:72CXZAU6B4UBKCFDY5HALHTL7O","short_pith_number":"pith:72CXZAU6","schema_version":"1.0","canonical_sha256":"fe857c829e0f281508a3c74e059e6bfba95ab931ad9c4a4aec720f0f790dedd4","source":{"kind":"arxiv","id":"1907.11672","version":2},"attestation_state":"computed","paper":{"title":"Fairness-Efficiency Tradeoffs in Dynamic Fair Division","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexandros Psomas, David Zeng","submitted_at":"2019-07-26T16:50:29Z","abstract_excerpt":"We investigate the tradeoffs between fairness and efficiency when allocating indivisible items over time. Suppose T items arrive over time and must be allocated upon arrival, immediately and irrevocably, to one of n agents. Agent i assigns a value v_{it} in [0,1] to the t-th item to arrive and has an additive valuation function. If the values are chosen by an adaptive adversary it is known that the algorithm that minimizes maximum pairwise envy simply allocates each item uniformly at random; the maximum pairwise envy is then sublinear in T. If the values are independently and identically drawn"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1907.11672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-26T16:50:29Z","cross_cats_sorted":[],"title_canon_sha256":"08a3bc043bbefb0ad3a824a9b7660cff7f9db0cced9c008a71da59bc230fde2a","abstract_canon_sha256":"324c694ac4943105b1ac1545c48801ff3c1859f728bcc5bdcc74630c2384c038"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:56.124405Z","signature_b64":"eb3uKyAvghbOMC7scI2M1eYsqcogZ/nOaFeJf/40qJAI60uUHEbBlxVjURWXCerlpu6eg9Uwehu+go3JcX9cDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe857c829e0f281508a3c74e059e6bfba95ab931ad9c4a4aec720f0f790dedd4","last_reissued_at":"2026-07-05T01:02:56.123919Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:56.123919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fairness-Efficiency Tradeoffs in Dynamic Fair Division","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexandros Psomas, David Zeng","submitted_at":"2019-07-26T16:50:29Z","abstract_excerpt":"We investigate the tradeoffs between fairness and efficiency when allocating indivisible items over time. Suppose T items arrive over time and must be allocated upon arrival, immediately and irrevocably, to one of n agents. Agent i assigns a value v_{it} in [0,1] to the t-th item to arrive and has an additive valuation function. If the values are chosen by an adaptive adversary it is known that the algorithm that minimizes maximum pairwise envy simply allocates each item uniformly at random; the maximum pairwise envy is then sublinear in T. If the values are independently and identically drawn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11672","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.11672/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.11672","created_at":"2026-07-05T01:02:56.123980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.11672v2","created_at":"2026-07-05T01:02:56.123980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11672","created_at":"2026-07-05T01:02:56.123980+00:00"},{"alias_kind":"pith_short_12","alias_value":"72CXZAU6B4UB","created_at":"2026-07-05T01:02:56.123980+00:00"},{"alias_kind":"pith_short_16","alias_value":"72CXZAU6B4UBKCFD","created_at":"2026-07-05T01:02:56.123980+00:00"},{"alias_kind":"pith_short_8","alias_value":"72CXZAU6","created_at":"2026-07-05T01:02:56.123980+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/72CXZAU6B4UBKCFDY5HALHTL7O","json":"https://pith.science/pith/72CXZAU6B4UBKCFDY5HALHTL7O.json","graph_json":"https://pith.science/api/pith-number/72CXZAU6B4UBKCFDY5HALHTL7O/graph.json","events_json":"https://pith.science/api/pith-number/72CXZAU6B4UBKCFDY5HALHTL7O/events.json","paper":"https://pith.science/paper/72CXZAU6"},"agent_actions":{"view_html":"https://pith.science/pith/72CXZAU6B4UBKCFDY5HALHTL7O","download_json":"https://pith.science/pith/72CXZAU6B4UBKCFDY5HALHTL7O.json","view_paper":"https://pith.science/paper/72CXZAU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.11672&json=true","fetch_graph":"https://pith.science/api/pith-number/72CXZAU6B4UBKCFDY5HALHTL7O/graph.json","fetch_events":"https://pith.science/api/pith-number/72CXZAU6B4UBKCFDY5HALHTL7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72CXZAU6B4UBKCFDY5HALHTL7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72CXZAU6B4UBKCFDY5HALHTL7O/action/storage_attestation","attest_author":"https://pith.science/pith/72CXZAU6B4UBKCFDY5HALHTL7O/action/author_attestation","sign_citation":"https://pith.science/pith/72CXZAU6B4UBKCFDY5HALHTL7O/action/citation_signature","submit_replication":"https://pith.science/pith/72CXZAU6B4UBKCFDY5HALHTL7O/action/replication_record"}},"created_at":"2026-07-05T01:02:56.123980+00:00","updated_at":"2026-07-05T01:02:56.123980+00:00"}