{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:M3GRV2X6RHH33FFWO5INUACESK","short_pith_number":"pith:M3GRV2X6","canonical_record":{"source":{"id":"2505.24321","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-05-30T08:04:07Z","cross_cats_sorted":[],"title_canon_sha256":"471953171345867ec797166cab02a73c742d16d65974d12d6f3508a87c148e87","abstract_canon_sha256":"8edd361cd56ecad352d3b327757939f7f5f5c80037dd378d634043a4a1bcd214"},"schema_version":"1.0"},"canonical_sha256":"66cd1aeafe89cfbd94b67750da0044928c0ba142b938c8b2f16fbb3c76d9b9ea","source":{"kind":"arxiv","id":"2505.24321","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24321","created_at":"2026-07-05T12:07:08Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24321v2","created_at":"2026-07-05T12:07:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24321","created_at":"2026-07-05T12:07:08Z"},{"alias_kind":"pith_short_12","alias_value":"M3GRV2X6RHH3","created_at":"2026-07-05T12:07:08Z"},{"alias_kind":"pith_short_16","alias_value":"M3GRV2X6RHH33FFW","created_at":"2026-07-05T12:07:08Z"},{"alias_kind":"pith_short_8","alias_value":"M3GRV2X6","created_at":"2026-07-05T12:07:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:M3GRV2X6RHH33FFWO5INUACESK","target":"record","payload":{"canonical_record":{"source":{"id":"2505.24321","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-05-30T08:04:07Z","cross_cats_sorted":[],"title_canon_sha256":"471953171345867ec797166cab02a73c742d16d65974d12d6f3508a87c148e87","abstract_canon_sha256":"8edd361cd56ecad352d3b327757939f7f5f5c80037dd378d634043a4a1bcd214"},"schema_version":"1.0"},"canonical_sha256":"66cd1aeafe89cfbd94b67750da0044928c0ba142b938c8b2f16fbb3c76d9b9ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:08.025547Z","signature_b64":"5VuFaoQh5h7WX5HuU/zYWjzigwuP+N5ogBBnL6Q7KzzjRzHjfPPtMU6HuP5hlY8PkYmTosZNy3eIdtL1L+ieDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66cd1aeafe89cfbd94b67750da0044928c0ba142b938c8b2f16fbb3c76d9b9ea","last_reissued_at":"2026-07-05T12:07:08.024927Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:08.024927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.24321","source_version":2,"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-05T12:07:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+j+eBW0sORJwJ9z3aRlBgQs6KqDTbjw0mlqsyPlAJS3NKJ53lM7gsodAT2B3XqjQOPvuTqzqifUhL7adgJiLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:35:06.134175Z"},"content_sha256":"bb93ce9a4d652b01b26a6e96c494c2a91bdae40868f58423b09d62aa80f4339b","schema_version":"1.0","event_id":"sha256:bb93ce9a4d652b01b26a6e96c494c2a91bdae40868f58423b09d62aa80f4339b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:M3GRV2X6RHH33FFWO5INUACESK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Fair Allocations with Binary Valuations and Beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Tianze Wei, Yuanyuan Wang","submitted_at":"2025-05-30T08:04:07Z","abstract_excerpt":"In an online fair allocation problem, a sequence of indivisible items arrives online and needs to be allocated to offline agents immediately and irrevocably. In our paper, we study the online allocation of either goods or chores. We employ popular fairness notions, including envy-freeness up to one item (EF1) and maximin share fairness (MMS) to capture fairness, and utilitarian social welfare (USW) to measure efficiency. For both settings of items, we present a series of positive results regarding the existence of fair and efficient allocations with widely studied classes of additive binary an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24321","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/2505.24321/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-05T12:07:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJqU5kj6XxVmKRSEIvQIbaiWvww24RXsG3V8bu5EunwQNvlcXWooT51ndQhd00Gsn30gJ8BilNcziMH8EHmBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:35:06.134708Z"},"content_sha256":"fa24e4440e7727065cf556acfa4266eefc9f12f6bc17a5c107920c10270e98c8","schema_version":"1.0","event_id":"sha256:fa24e4440e7727065cf556acfa4266eefc9f12f6bc17a5c107920c10270e98c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3GRV2X6RHH33FFWO5INUACESK/bundle.json","state_url":"https://pith.science/pith/M3GRV2X6RHH33FFWO5INUACESK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3GRV2X6RHH33FFWO5INUACESK/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-07T23:35:06Z","links":{"resolver":"https://pith.science/pith/M3GRV2X6RHH33FFWO5INUACESK","bundle":"https://pith.science/pith/M3GRV2X6RHH33FFWO5INUACESK/bundle.json","state":"https://pith.science/pith/M3GRV2X6RHH33FFWO5INUACESK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3GRV2X6RHH33FFWO5INUACESK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:M3GRV2X6RHH33FFWO5INUACESK","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":"8edd361cd56ecad352d3b327757939f7f5f5c80037dd378d634043a4a1bcd214","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-05-30T08:04:07Z","title_canon_sha256":"471953171345867ec797166cab02a73c742d16d65974d12d6f3508a87c148e87"},"schema_version":"1.0","source":{"id":"2505.24321","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24321","created_at":"2026-07-05T12:07:08Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24321v2","created_at":"2026-07-05T12:07:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24321","created_at":"2026-07-05T12:07:08Z"},{"alias_kind":"pith_short_12","alias_value":"M3GRV2X6RHH3","created_at":"2026-07-05T12:07:08Z"},{"alias_kind":"pith_short_16","alias_value":"M3GRV2X6RHH33FFW","created_at":"2026-07-05T12:07:08Z"},{"alias_kind":"pith_short_8","alias_value":"M3GRV2X6","created_at":"2026-07-05T12:07:08Z"}],"graph_snapshots":[{"event_id":"sha256:fa24e4440e7727065cf556acfa4266eefc9f12f6bc17a5c107920c10270e98c8","target":"graph","created_at":"2026-07-05T12:07:08Z","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/2505.24321/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In an online fair allocation problem, a sequence of indivisible items arrives online and needs to be allocated to offline agents immediately and irrevocably. In our paper, we study the online allocation of either goods or chores. We employ popular fairness notions, including envy-freeness up to one item (EF1) and maximin share fairness (MMS) to capture fairness, and utilitarian social welfare (USW) to measure efficiency. For both settings of items, we present a series of positive results regarding the existence of fair and efficient allocations with widely studied classes of additive binary an","authors_text":"Tianze Wei, Yuanyuan Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-05-30T08:04:07Z","title":"Online Fair Allocations with Binary Valuations and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24321","kind":"arxiv","version":2},"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:bb93ce9a4d652b01b26a6e96c494c2a91bdae40868f58423b09d62aa80f4339b","target":"record","created_at":"2026-07-05T12:07:08Z","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":"8edd361cd56ecad352d3b327757939f7f5f5c80037dd378d634043a4a1bcd214","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-05-30T08:04:07Z","title_canon_sha256":"471953171345867ec797166cab02a73c742d16d65974d12d6f3508a87c148e87"},"schema_version":"1.0","source":{"id":"2505.24321","kind":"arxiv","version":2}},"canonical_sha256":"66cd1aeafe89cfbd94b67750da0044928c0ba142b938c8b2f16fbb3c76d9b9ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66cd1aeafe89cfbd94b67750da0044928c0ba142b938c8b2f16fbb3c76d9b9ea","first_computed_at":"2026-07-05T12:07:08.024927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:07:08.024927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5VuFaoQh5h7WX5HuU/zYWjzigwuP+N5ogBBnL6Q7KzzjRzHjfPPtMU6HuP5hlY8PkYmTosZNy3eIdtL1L+ieDw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:07:08.025547Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.24321","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb93ce9a4d652b01b26a6e96c494c2a91bdae40868f58423b09d62aa80f4339b","sha256:fa24e4440e7727065cf556acfa4266eefc9f12f6bc17a5c107920c10270e98c8"],"state_sha256":"2e2505f2ec3d819c0ad8d50e2830935bc825c858d1846ca0e4010742eb9a52a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i8S4lrR5DgOb7Vb2pSf9iRPT3zc1JD40sm6ze8kYqdPR8Pea7Q0WGNGZ+DiN1JwvtOKekc8CLTXDVNo3uhdZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T23:35:06.138300Z","bundle_sha256":"6f0024c9554bfd356b2934d5afd7735ec42e141cada441bd439f9dcd89a26337"}}