{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RYPKSOF762R7T52HV3KVIVWYZP","short_pith_number":"pith:RYPKSOF7","schema_version":"1.0","canonical_sha256":"8e1ea938bff6a3f9f747aed55456d8cbe66e36400412042136a6c374dc8354db","source":{"kind":"arxiv","id":"2410.06877","version":2},"attestation_state":"computed","paper":{"title":"Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Biaoshuai Tao, Shengxin Liu, Xiaolin Bu, Xinhang Lu, Zihao Li","submitted_at":"2024-10-09T13:42:37Z","abstract_excerpt":"We study the problem of fairly allocating either a set of indivisible goods or a set of mixed divisible and indivisible goods (i.e., mixed goods) to agents with additive utilities, taking the best-of-both-worlds perspective of guaranteeing fairness properties both ex ante and ex post. The ex-post fairness notions considered in this paper are relaxations of envy-freeness, specifically, EFX for indivisible-goods allocation, and EFM for mixed-goods allocation. For two agents, we show that there is a polynomial-time randomized algorithm that achieves ex-ante envy-freeness and ex-post EFX / EFM sim"},"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":"2410.06877","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-10-09T13:42:37Z","cross_cats_sorted":[],"title_canon_sha256":"8b6294020f6c500c1625f4271a2fd32448da0e3ff6760ea166cc5de761ea802f","abstract_canon_sha256":"8d5935b9b6976cd0a934dac010a19aa3b505127d53146991f885e393b1615dc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:01.995089Z","signature_b64":"W7EomI0rd2J9qm+JSWYpSfa6WDB0glMcwJJGVXaLRV4AG9tcliouqFfNpvJjMWyOzmE5p8owdWiQhRay6MJAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e1ea938bff6a3f9f747aed55456d8cbe66e36400412042136a6c374dc8354db","last_reissued_at":"2026-07-05T09:25:01.994649Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:01.994649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Biaoshuai Tao, Shengxin Liu, Xiaolin Bu, Xinhang Lu, Zihao Li","submitted_at":"2024-10-09T13:42:37Z","abstract_excerpt":"We study the problem of fairly allocating either a set of indivisible goods or a set of mixed divisible and indivisible goods (i.e., mixed goods) to agents with additive utilities, taking the best-of-both-worlds perspective of guaranteeing fairness properties both ex ante and ex post. The ex-post fairness notions considered in this paper are relaxations of envy-freeness, specifically, EFX for indivisible-goods allocation, and EFM for mixed-goods allocation. For two agents, we show that there is a polynomial-time randomized algorithm that achieves ex-ante envy-freeness and ex-post EFX / EFM sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06877","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/2410.06877/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":"2410.06877","created_at":"2026-07-05T09:25:01.994710+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.06877v2","created_at":"2026-07-05T09:25:01.994710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06877","created_at":"2026-07-05T09:25:01.994710+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYPKSOF762R7","created_at":"2026-07-05T09:25:01.994710+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYPKSOF762R7T52H","created_at":"2026-07-05T09:25:01.994710+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYPKSOF7","created_at":"2026-07-05T09:25:01.994710+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13057","citing_title":"Approximate Maximin Share with Subjective Divisibility: Beating the 1/2 Barrier","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RYPKSOF762R7T52HV3KVIVWYZP","json":"https://pith.science/pith/RYPKSOF762R7T52HV3KVIVWYZP.json","graph_json":"https://pith.science/api/pith-number/RYPKSOF762R7T52HV3KVIVWYZP/graph.json","events_json":"https://pith.science/api/pith-number/RYPKSOF762R7T52HV3KVIVWYZP/events.json","paper":"https://pith.science/paper/RYPKSOF7"},"agent_actions":{"view_html":"https://pith.science/pith/RYPKSOF762R7T52HV3KVIVWYZP","download_json":"https://pith.science/pith/RYPKSOF762R7T52HV3KVIVWYZP.json","view_paper":"https://pith.science/paper/RYPKSOF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.06877&json=true","fetch_graph":"https://pith.science/api/pith-number/RYPKSOF762R7T52HV3KVIVWYZP/graph.json","fetch_events":"https://pith.science/api/pith-number/RYPKSOF762R7T52HV3KVIVWYZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYPKSOF762R7T52HV3KVIVWYZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYPKSOF762R7T52HV3KVIVWYZP/action/storage_attestation","attest_author":"https://pith.science/pith/RYPKSOF762R7T52HV3KVIVWYZP/action/author_attestation","sign_citation":"https://pith.science/pith/RYPKSOF762R7T52HV3KVIVWYZP/action/citation_signature","submit_replication":"https://pith.science/pith/RYPKSOF762R7T52HV3KVIVWYZP/action/replication_record"}},"created_at":"2026-07-05T09:25:01.994710+00:00","updated_at":"2026-07-05T09:25:01.994710+00:00"}