{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:V2EF2CVMGXGETCT3TKFGSP2DXM","short_pith_number":"pith:V2EF2CVM","schema_version":"1.0","canonical_sha256":"ae885d0aac35cc498a7b9a8a693f43bb088208cd99709ce59b81efd449c13945","source":{"kind":"arxiv","id":"2408.12845","version":2},"attestation_state":"computed","paper":{"title":"Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arun Verma, Bryan Kian Hsiang Low, Indrajit Saha, Makoto Yokoo","submitted_at":"2024-08-23T05:25:58Z","abstract_excerpt":"This paper considers a novel variant of the online fair division problem involving multiple agents in which a learner sequentially observes an indivisible item that has to be irrevocably allocated to one of the agents while satisfying a fairness and efficiency constraint. Existing algorithms assume a small number of items with a sufficiently large number of copies, which ensures a good utility estimation for all item-agent pairs from noisy bandit feedback. However, this assumption may not hold in many real-life applications, for example, an online platform that has a large number of users (ite"},"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":"2408.12845","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-23T05:25:58Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"80bccf560477a3f3177e004daabcddc1932ea4230a08056db7523f5ddc3fcdfc","abstract_canon_sha256":"11b0539c3b478279ea56db1e01c03e24faf6357ac485dbbf681d13ddba419358"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:10.854813Z","signature_b64":"l3XpBjUI184tcyNk5m0JJ0cEQtaawfGSz+TWpNFwT70FroZw1b8AcprHmNj5fquLO4fyatZ7gBd81NWcfKZODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae885d0aac35cc498a7b9a8a693f43bb088208cd99709ce59b81efd449c13945","last_reissued_at":"2026-07-05T11:12:10.854252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:10.854252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arun Verma, Bryan Kian Hsiang Low, Indrajit Saha, Makoto Yokoo","submitted_at":"2024-08-23T05:25:58Z","abstract_excerpt":"This paper considers a novel variant of the online fair division problem involving multiple agents in which a learner sequentially observes an indivisible item that has to be irrevocably allocated to one of the agents while satisfying a fairness and efficiency constraint. Existing algorithms assume a small number of items with a sufficiently large number of copies, which ensures a good utility estimation for all item-agent pairs from noisy bandit feedback. However, this assumption may not hold in many real-life applications, for example, an online platform that has a large number of users (ite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12845","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/2408.12845/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":"2408.12845","created_at":"2026-07-05T11:12:10.854305+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.12845v2","created_at":"2026-07-05T11:12:10.854305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12845","created_at":"2026-07-05T11:12:10.854305+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2EF2CVMGXGE","created_at":"2026-07-05T11:12:10.854305+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2EF2CVMGXGETCT3","created_at":"2026-07-05T11:12:10.854305+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2EF2CVM","created_at":"2026-07-05T11:12:10.854305+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.24503","citing_title":"Online Fair Division with Additional Information","ref_index":94,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V2EF2CVMGXGETCT3TKFGSP2DXM","json":"https://pith.science/pith/V2EF2CVMGXGETCT3TKFGSP2DXM.json","graph_json":"https://pith.science/api/pith-number/V2EF2CVMGXGETCT3TKFGSP2DXM/graph.json","events_json":"https://pith.science/api/pith-number/V2EF2CVMGXGETCT3TKFGSP2DXM/events.json","paper":"https://pith.science/paper/V2EF2CVM"},"agent_actions":{"view_html":"https://pith.science/pith/V2EF2CVMGXGETCT3TKFGSP2DXM","download_json":"https://pith.science/pith/V2EF2CVMGXGETCT3TKFGSP2DXM.json","view_paper":"https://pith.science/paper/V2EF2CVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.12845&json=true","fetch_graph":"https://pith.science/api/pith-number/V2EF2CVMGXGETCT3TKFGSP2DXM/graph.json","fetch_events":"https://pith.science/api/pith-number/V2EF2CVMGXGETCT3TKFGSP2DXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2EF2CVMGXGETCT3TKFGSP2DXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2EF2CVMGXGETCT3TKFGSP2DXM/action/storage_attestation","attest_author":"https://pith.science/pith/V2EF2CVMGXGETCT3TKFGSP2DXM/action/author_attestation","sign_citation":"https://pith.science/pith/V2EF2CVMGXGETCT3TKFGSP2DXM/action/citation_signature","submit_replication":"https://pith.science/pith/V2EF2CVMGXGETCT3TKFGSP2DXM/action/replication_record"}},"created_at":"2026-07-05T11:12:10.854305+00:00","updated_at":"2026-07-05T11:12:10.854305+00:00"}