{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MLSX5LA5H5JIUDOPAUQYR77OKF","short_pith_number":"pith:MLSX5LA5","schema_version":"1.0","canonical_sha256":"62e57eac1d3f528a0dcf052188ffee517bba7a1bd3c15c6812c47ac71a0bf383","source":{"kind":"arxiv","id":"2503.02088","version":1},"attestation_state":"computed","paper":{"title":"Online Fair Division: Towards Ex-Post Constant MMS Guarantees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.MA"],"primary_cat":"cs.GT","authors_text":"Parnian Shahkar, Pooja Kulkarni, Ruta Mehta","submitted_at":"2025-03-03T22:14:03Z","abstract_excerpt":"We investigate the problem of fairly allocating $m$ indivisible items among $n$ sequentially arriving agents with additive valuations, under the sought-after fairness notion of maximin share (MMS). We first observe a strong impossibility: without appropriate knowledge about the valuation functions of the incoming agents, no online algorithm can ensure any non-trivial MMS approximation, even when there are only two agents. Motivated by this impossibility, we introduce OnlineKTypeFD (online $k$-type fair division), a model that balances theoretical tractability with real-world applicability. In "},"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":"2503.02088","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-03-03T22:14:03Z","cross_cats_sorted":["cs.DS","cs.MA"],"title_canon_sha256":"93ce96dfbf193eb46285ae2ac603efa5b27098d389499b186a7ee7c2887675c2","abstract_canon_sha256":"cc6064aa17502659818a8981aa419db79a327f24fb01d00c5b01e525b9c9abba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:26.679135Z","signature_b64":"ZS96EmlSs26nvh96BshyEZ4Q9aoAv4a0i175SEYCj/FvQuTE3j7UBYxXa5f/vXcZixaWFjXvDePiTMB+kfLCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62e57eac1d3f528a0dcf052188ffee517bba7a1bd3c15c6812c47ac71a0bf383","last_reissued_at":"2026-07-05T11:42:26.678698Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:26.678698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Fair Division: Towards Ex-Post Constant MMS Guarantees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.MA"],"primary_cat":"cs.GT","authors_text":"Parnian Shahkar, Pooja Kulkarni, Ruta Mehta","submitted_at":"2025-03-03T22:14:03Z","abstract_excerpt":"We investigate the problem of fairly allocating $m$ indivisible items among $n$ sequentially arriving agents with additive valuations, under the sought-after fairness notion of maximin share (MMS). We first observe a strong impossibility: without appropriate knowledge about the valuation functions of the incoming agents, no online algorithm can ensure any non-trivial MMS approximation, even when there are only two agents. Motivated by this impossibility, we introduce OnlineKTypeFD (online $k$-type fair division), a model that balances theoretical tractability with real-world applicability. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.02088","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/2503.02088/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":"2503.02088","created_at":"2026-07-05T11:42:26.678753+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.02088v1","created_at":"2026-07-05T11:42:26.678753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.02088","created_at":"2026-07-05T11:42:26.678753+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLSX5LA5H5JI","created_at":"2026-07-05T11:42:26.678753+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLSX5LA5H5JIUDOP","created_at":"2026-07-05T11:42:26.678753+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLSX5LA5","created_at":"2026-07-05T11:42:26.678753+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":2025,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF","json":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF.json","graph_json":"https://pith.science/api/pith-number/MLSX5LA5H5JIUDOPAUQYR77OKF/graph.json","events_json":"https://pith.science/api/pith-number/MLSX5LA5H5JIUDOPAUQYR77OKF/events.json","paper":"https://pith.science/paper/MLSX5LA5"},"agent_actions":{"view_html":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF","download_json":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF.json","view_paper":"https://pith.science/paper/MLSX5LA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.02088&json=true","fetch_graph":"https://pith.science/api/pith-number/MLSX5LA5H5JIUDOPAUQYR77OKF/graph.json","fetch_events":"https://pith.science/api/pith-number/MLSX5LA5H5JIUDOPAUQYR77OKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF/action/storage_attestation","attest_author":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF/action/author_attestation","sign_citation":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF/action/citation_signature","submit_replication":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF/action/replication_record"}},"created_at":"2026-07-05T11:42:26.678753+00:00","updated_at":"2026-07-05T11:42:26.678753+00:00"}