{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3SRHZFSA6ICU3RGTWFJ6QIZE7O","short_pith_number":"pith:3SRHZFSA","schema_version":"1.0","canonical_sha256":"dca27c9640f2054dc4d3b153e82324fbb774cb46608ca1f6c4365c8bf95aa7ae","source":{"kind":"arxiv","id":"2105.05308","version":3},"attestation_state":"computed","paper":{"title":"Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Tradeoff Curve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.OC"],"primary_cat":"cs.GT","authors_text":"Christina Lee Yu, Gauri Jain, Sean R. Sinclair, Siddhartha Banerjee","submitted_at":"2021-05-11T19:09:59Z","abstract_excerpt":"We consider the problem of dividing limited resources to individuals arriving over $T$ rounds. Each round has a random number of individuals arrive, and individuals can be characterized by their type (i.e. preferences over the different resources). A standard notion of 'fairness' in this setting is that an allocation simultaneously satisfy envy-freeness and efficiency. The former is an individual guarantee, requiring that each agent prefers their own allocation over the allocation of any other; in contrast, efficiency is a global property, requiring that the allocations clear the available res"},"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":"2105.05308","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2021-05-11T19:09:59Z","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"title_canon_sha256":"d7964eabc70cd3c5fc7d376e7339613d862cb7e8be7ba7665a772adcabe5b439","abstract_canon_sha256":"8695863a28fe58bf3539c13273a68a71dffb51fb96d99ac067af3ac31dc1b0c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:02:08.867177Z","signature_b64":"Fa53h9sg1OB/GjkIoQ9zAa0+FsWXRJV+hi27Fqghsatbps6tFpZfu5V4sUt5n4mOa9FBlVhWbtfa69ZecRJ8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dca27c9640f2054dc4d3b153e82324fbb774cb46608ca1f6c4365c8bf95aa7ae","last_reissued_at":"2026-07-05T05:02:08.866707Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:02:08.866707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Tradeoff Curve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.OC"],"primary_cat":"cs.GT","authors_text":"Christina Lee Yu, Gauri Jain, Sean R. Sinclair, Siddhartha Banerjee","submitted_at":"2021-05-11T19:09:59Z","abstract_excerpt":"We consider the problem of dividing limited resources to individuals arriving over $T$ rounds. Each round has a random number of individuals arrive, and individuals can be characterized by their type (i.e. preferences over the different resources). A standard notion of 'fairness' in this setting is that an allocation simultaneously satisfy envy-freeness and efficiency. The former is an individual guarantee, requiring that each agent prefers their own allocation over the allocation of any other; in contrast, efficiency is a global property, requiring that the allocations clear the available res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.05308","kind":"arxiv","version":3},"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/2105.05308/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":"2105.05308","created_at":"2026-07-05T05:02:08.866770+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.05308v3","created_at":"2026-07-05T05:02:08.866770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.05308","created_at":"2026-07-05T05:02:08.866770+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SRHZFSA6ICU","created_at":"2026-07-05T05:02:08.866770+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SRHZFSA6ICU3RGT","created_at":"2026-07-05T05:02:08.866770+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SRHZFSA","created_at":"2026-07-05T05:02:08.866770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22174","citing_title":"Online Fair Division for Personalized $2$-Value Instances","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3SRHZFSA6ICU3RGTWFJ6QIZE7O","json":"https://pith.science/pith/3SRHZFSA6ICU3RGTWFJ6QIZE7O.json","graph_json":"https://pith.science/api/pith-number/3SRHZFSA6ICU3RGTWFJ6QIZE7O/graph.json","events_json":"https://pith.science/api/pith-number/3SRHZFSA6ICU3RGTWFJ6QIZE7O/events.json","paper":"https://pith.science/paper/3SRHZFSA"},"agent_actions":{"view_html":"https://pith.science/pith/3SRHZFSA6ICU3RGTWFJ6QIZE7O","download_json":"https://pith.science/pith/3SRHZFSA6ICU3RGTWFJ6QIZE7O.json","view_paper":"https://pith.science/paper/3SRHZFSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.05308&json=true","fetch_graph":"https://pith.science/api/pith-number/3SRHZFSA6ICU3RGTWFJ6QIZE7O/graph.json","fetch_events":"https://pith.science/api/pith-number/3SRHZFSA6ICU3RGTWFJ6QIZE7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SRHZFSA6ICU3RGTWFJ6QIZE7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SRHZFSA6ICU3RGTWFJ6QIZE7O/action/storage_attestation","attest_author":"https://pith.science/pith/3SRHZFSA6ICU3RGTWFJ6QIZE7O/action/author_attestation","sign_citation":"https://pith.science/pith/3SRHZFSA6ICU3RGTWFJ6QIZE7O/action/citation_signature","submit_replication":"https://pith.science/pith/3SRHZFSA6ICU3RGTWFJ6QIZE7O/action/replication_record"}},"created_at":"2026-07-05T05:02:08.866770+00:00","updated_at":"2026-07-05T05:02:08.866770+00:00"}