{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3PH6MI47X4ODDVVAVUTG5YCJXO","short_pith_number":"pith:3PH6MI47","canonical_record":{"source":{"id":"2406.02402","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T15:14:10Z","cross_cats_sorted":["cs.GT","stat.ML"],"title_canon_sha256":"5f10b25a6abbf7c65be4d7ae4d4c4fbacee2d1d2adfc0f858a2ff5b9d1714de8","abstract_canon_sha256":"21b98f47c2e22af8fe7db20c362f9289cca61a5ea1b7356760be86aad2af3785"},"schema_version":"1.0"},"canonical_sha256":"dbcfe6239fbf1c31d6a0ad266ee049bb8f20b211de8859b93071552ff2a51a62","source":{"kind":"arxiv","id":"2406.02402","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.02402","created_at":"2026-07-07T02:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"2406.02402v3","created_at":"2026-07-07T02:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02402","created_at":"2026-07-07T02:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"3PH6MI47X4OD","created_at":"2026-07-07T02:17:03Z"},{"alias_kind":"pith_short_16","alias_value":"3PH6MI47X4ODDVVA","created_at":"2026-07-07T02:17:03Z"},{"alias_kind":"pith_short_8","alias_value":"3PH6MI47","created_at":"2026-07-07T02:17:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3PH6MI47X4ODDVVAVUTG5YCJXO","target":"record","payload":{"canonical_record":{"source":{"id":"2406.02402","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T15:14:10Z","cross_cats_sorted":["cs.GT","stat.ML"],"title_canon_sha256":"5f10b25a6abbf7c65be4d7ae4d4c4fbacee2d1d2adfc0f858a2ff5b9d1714de8","abstract_canon_sha256":"21b98f47c2e22af8fe7db20c362f9289cca61a5ea1b7356760be86aad2af3785"},"schema_version":"1.0"},"canonical_sha256":"dbcfe6239fbf1c31d6a0ad266ee049bb8f20b211de8859b93071552ff2a51a62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:17:03.559599Z","signature_b64":"2HcYIcJgEvU3bC3buerRVU1bvLX52fXc3bnsQFLjMOAG60pk4O5DQXBQlqGwVX/DkCu0BOB/b8KXcacHK2XSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbcfe6239fbf1c31d6a0ad266ee049bb8f20b211de8859b93071552ff2a51a62","last_reissued_at":"2026-07-07T02:17:03.558684Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:17:03.558684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.02402","source_version":3,"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-07T02:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kt5AvCBOWybV1qJ8X9Lh+5GTWnc5P65eaHNYbFAVo/jLN5F+Rl55FgUieHABR5rvD1xqcu0tQHzBIA+7jWvTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:22:20.978845Z"},"content_sha256":"687d70f63b528d505ac49259b6c082e8507a0af91958ba23d3f1bef8a85a6670","schema_version":"1.0","event_id":"sha256:687d70f63b528d505ac49259b6c082e8507a0af91958ba23d3f1bef8a85a6670"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3PH6MI47X4ODDVVAVUTG5YCJXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Fair Allocation of Perishable Resources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","stat.ML"],"primary_cat":"math.OC","authors_text":"Chamsi Hssaine, Sean R. Sinclair, Siddhartha Banerjee","submitted_at":"2024-06-04T15:14:10Z","abstract_excerpt":"We consider a practically motivated variant of the canonical online fair allocation problem: a decision-maker has a budget of perishable resources to allocate over a fixed number of rounds. Each round sees a random number of arrivals, and the decision-maker must commit to an allocation for these individuals before moving on to the next round. The goal is to construct a sequence of allocations that is envy-free and efficient. Our work makes two important contributions toward this problem: we first derive strong lower bounds on the optimal envy-efficiency trade-off, demonstrating that a decision"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02402","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/2406.02402/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-07T02:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RfJZAXSDfGqyjoWnimucUaqJaxgoi/J3gZ4d9yMDA7BRt96hOwo7iFkOarGAeoKrGXU7TZKJnvUZgonXoP8JBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:22:20.979407Z"},"content_sha256":"bbc8c4345172a8b85ba541faf463c00c3ab225a7b767b7120f64e351e3d7fc17","schema_version":"1.0","event_id":"sha256:bbc8c4345172a8b85ba541faf463c00c3ab225a7b767b7120f64e351e3d7fc17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO/bundle.json","state_url":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PH6MI47X4ODDVVAVUTG5YCJXO/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-08T09:22:20Z","links":{"resolver":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO","bundle":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO/bundle.json","state":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PH6MI47X4ODDVVAVUTG5YCJXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3PH6MI47X4ODDVVAVUTG5YCJXO","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":"21b98f47c2e22af8fe7db20c362f9289cca61a5ea1b7356760be86aad2af3785","cross_cats_sorted":["cs.GT","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T15:14:10Z","title_canon_sha256":"5f10b25a6abbf7c65be4d7ae4d4c4fbacee2d1d2adfc0f858a2ff5b9d1714de8"},"schema_version":"1.0","source":{"id":"2406.02402","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.02402","created_at":"2026-07-07T02:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"2406.02402v3","created_at":"2026-07-07T02:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02402","created_at":"2026-07-07T02:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"3PH6MI47X4OD","created_at":"2026-07-07T02:17:03Z"},{"alias_kind":"pith_short_16","alias_value":"3PH6MI47X4ODDVVA","created_at":"2026-07-07T02:17:03Z"},{"alias_kind":"pith_short_8","alias_value":"3PH6MI47","created_at":"2026-07-07T02:17:03Z"}],"graph_snapshots":[{"event_id":"sha256:bbc8c4345172a8b85ba541faf463c00c3ab225a7b767b7120f64e351e3d7fc17","target":"graph","created_at":"2026-07-07T02:17:03Z","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/2406.02402/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a practically motivated variant of the canonical online fair allocation problem: a decision-maker has a budget of perishable resources to allocate over a fixed number of rounds. Each round sees a random number of arrivals, and the decision-maker must commit to an allocation for these individuals before moving on to the next round. The goal is to construct a sequence of allocations that is envy-free and efficient. Our work makes two important contributions toward this problem: we first derive strong lower bounds on the optimal envy-efficiency trade-off, demonstrating that a decision","authors_text":"Chamsi Hssaine, Sean R. Sinclair, Siddhartha Banerjee","cross_cats":["cs.GT","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T15:14:10Z","title":"Online Fair Allocation of Perishable Resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02402","kind":"arxiv","version":3},"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:687d70f63b528d505ac49259b6c082e8507a0af91958ba23d3f1bef8a85a6670","target":"record","created_at":"2026-07-07T02:17:03Z","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":"21b98f47c2e22af8fe7db20c362f9289cca61a5ea1b7356760be86aad2af3785","cross_cats_sorted":["cs.GT","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T15:14:10Z","title_canon_sha256":"5f10b25a6abbf7c65be4d7ae4d4c4fbacee2d1d2adfc0f858a2ff5b9d1714de8"},"schema_version":"1.0","source":{"id":"2406.02402","kind":"arxiv","version":3}},"canonical_sha256":"dbcfe6239fbf1c31d6a0ad266ee049bb8f20b211de8859b93071552ff2a51a62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbcfe6239fbf1c31d6a0ad266ee049bb8f20b211de8859b93071552ff2a51a62","first_computed_at":"2026-07-07T02:17:03.558684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:17:03.558684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2HcYIcJgEvU3bC3buerRVU1bvLX52fXc3bnsQFLjMOAG60pk4O5DQXBQlqGwVX/DkCu0BOB/b8KXcacHK2XSDg==","signature_status":"signed_v1","signed_at":"2026-07-07T02:17:03.559599Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.02402","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:687d70f63b528d505ac49259b6c082e8507a0af91958ba23d3f1bef8a85a6670","sha256:bbc8c4345172a8b85ba541faf463c00c3ab225a7b767b7120f64e351e3d7fc17"],"state_sha256":"65b0af7f33064b211584fa2289cfb26b255f2fba5893396fa8382e6ca8955dc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTI+en5hQH86QDuQTcWG/bMwPNLvZIJWxB0Wk29YIWBOlA07kXmHDOINpb+XGi5OZhvfxkr33buJSTOn+7iuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:22:20.983117Z","bundle_sha256":"21fb61e27d7ead294374f8fb0fa54318e79c0b8fef5e9d597cef85a1c4413f89"}}