{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MLSX5LA5H5JIUDOPAUQYR77OKF","short_pith_number":"pith:MLSX5LA5","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"},"canonical_sha256":"62e57eac1d3f528a0dcf052188ffee517bba7a1bd3c15c6812c47ac71a0bf383","source":{"kind":"arxiv","id":"2503.02088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.02088","created_at":"2026-07-05T11:42:26Z"},{"alias_kind":"arxiv_version","alias_value":"2503.02088v1","created_at":"2026-07-05T11:42:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.02088","created_at":"2026-07-05T11:42:26Z"},{"alias_kind":"pith_short_12","alias_value":"MLSX5LA5H5JI","created_at":"2026-07-05T11:42:26Z"},{"alias_kind":"pith_short_16","alias_value":"MLSX5LA5H5JIUDOP","created_at":"2026-07-05T11:42:26Z"},{"alias_kind":"pith_short_8","alias_value":"MLSX5LA5","created_at":"2026-07-05T11:42:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MLSX5LA5H5JIUDOPAUQYR77OKF","target":"record","payload":{"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"},"canonical_sha256":"62e57eac1d3f528a0dcf052188ffee517bba7a1bd3c15c6812c47ac71a0bf383","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"},"source_kind":"arxiv","source_id":"2503.02088","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-05T11:42:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BO88rPHGvg2HmUdpOC/xLl/6Mtyc31Pug88Ke02CMQXe0HekNI9KUvEBl52X0OFDmxJcyWXzBBbI4FdRmbHjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:51:12.490207Z"},"content_sha256":"275d33d3358f968efc094897b9f6a697403bcd1eb860307600bb2f5ccec18912","schema_version":"1.0","event_id":"sha256:275d33d3358f968efc094897b9f6a697403bcd1eb860307600bb2f5ccec18912"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MLSX5LA5H5JIUDOPAUQYR77OKF","target":"graph","payload":{"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"},"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-05T11:42:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"siNoHUs2MWeGHndUuKS7cfhP9Te/0vQ71uQ6SitkCDkCn0N6jMWFqGiv+qhX8H9WflaZcfuvMLT40RTlEfV0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:51:12.490712Z"},"content_sha256":"186f29610ace3d778da0859c99c82beb49a5d4cabc8976532671f9705ef7d44c","schema_version":"1.0","event_id":"sha256:186f29610ace3d778da0859c99c82beb49a5d4cabc8976532671f9705ef7d44c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF/bundle.json","state_url":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLSX5LA5H5JIUDOPAUQYR77OKF/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-08T22:51:12Z","links":{"resolver":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF","bundle":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF/bundle.json","state":"https://pith.science/pith/MLSX5LA5H5JIUDOPAUQYR77OKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLSX5LA5H5JIUDOPAUQYR77OKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MLSX5LA5H5JIUDOPAUQYR77OKF","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":"cc6064aa17502659818a8981aa419db79a327f24fb01d00c5b01e525b9c9abba","cross_cats_sorted":["cs.DS","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-03-03T22:14:03Z","title_canon_sha256":"93ce96dfbf193eb46285ae2ac603efa5b27098d389499b186a7ee7c2887675c2"},"schema_version":"1.0","source":{"id":"2503.02088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.02088","created_at":"2026-07-05T11:42:26Z"},{"alias_kind":"arxiv_version","alias_value":"2503.02088v1","created_at":"2026-07-05T11:42:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.02088","created_at":"2026-07-05T11:42:26Z"},{"alias_kind":"pith_short_12","alias_value":"MLSX5LA5H5JI","created_at":"2026-07-05T11:42:26Z"},{"alias_kind":"pith_short_16","alias_value":"MLSX5LA5H5JIUDOP","created_at":"2026-07-05T11:42:26Z"},{"alias_kind":"pith_short_8","alias_value":"MLSX5LA5","created_at":"2026-07-05T11:42:26Z"}],"graph_snapshots":[{"event_id":"sha256:186f29610ace3d778da0859c99c82beb49a5d4cabc8976532671f9705ef7d44c","target":"graph","created_at":"2026-07-05T11:42:26Z","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/2503.02088/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Parnian Shahkar, Pooja Kulkarni, Ruta Mehta","cross_cats":["cs.DS","cs.MA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-03-03T22:14:03Z","title":"Online Fair Division: Towards Ex-Post Constant MMS Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.02088","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:275d33d3358f968efc094897b9f6a697403bcd1eb860307600bb2f5ccec18912","target":"record","created_at":"2026-07-05T11:42:26Z","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":"cc6064aa17502659818a8981aa419db79a327f24fb01d00c5b01e525b9c9abba","cross_cats_sorted":["cs.DS","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-03-03T22:14:03Z","title_canon_sha256":"93ce96dfbf193eb46285ae2ac603efa5b27098d389499b186a7ee7c2887675c2"},"schema_version":"1.0","source":{"id":"2503.02088","kind":"arxiv","version":1}},"canonical_sha256":"62e57eac1d3f528a0dcf052188ffee517bba7a1bd3c15c6812c47ac71a0bf383","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62e57eac1d3f528a0dcf052188ffee517bba7a1bd3c15c6812c47ac71a0bf383","first_computed_at":"2026-07-05T11:42:26.678698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:42:26.678698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZS96EmlSs26nvh96BshyEZ4Q9aoAv4a0i175SEYCj/FvQuTE3j7UBYxXa5f/vXcZixaWFjXvDePiTMB+kfLCDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:42:26.679135Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.02088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:275d33d3358f968efc094897b9f6a697403bcd1eb860307600bb2f5ccec18912","sha256:186f29610ace3d778da0859c99c82beb49a5d4cabc8976532671f9705ef7d44c"],"state_sha256":"fb16bc21d240eca16975171641124e59350c7aa7dec2a04a2c900e02656391f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGIwfA5OMxUmMs8mCcmgFPPTZmN0tEJUF+35lXLXdioTcyTM3hqums5rJWid7sEwMNP+6a/ugcY9sYujHI21Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T22:51:12.495241Z","bundle_sha256":"4f9a54c004f2f897927723a9390cbcfc2f9f6337700a578644d4e1e188a7371b"}}