{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JF3Z4GLY4QH5Q2XSDVTHXTNM4L","short_pith_number":"pith:JF3Z4GLY","schema_version":"1.0","canonical_sha256":"49779e1978e40fd86af21d667bcdace2e6be46433502297ed4fbd08396dec2a5","source":{"kind":"arxiv","id":"2608.08864","version":1},"attestation_state":"computed","paper":{"title":"A Simple Polynomial-Time EFX Repair for Cancelable Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Arash Ashuri, Bhaskar Ray Chaudhury, Hannaneh Akrami, Kurt Mehlhorn, Maksim Soldatov","submitted_at":"2026-08-09T19:02:11Z","abstract_excerpt":"The leximin++ proof of Plaut and Roughgarden for agents with identical monotone valuations gives a natural EFX-repair procedure: starting from an arbitrary partition, repeatedly transfer an eligible item to a minimum-valued bundle. The procedure terminates, but the standard argument gives no polynomial bound on the number of transfers, even for additive valuations.\n  We show that a single deterministic tie-breaking rule makes this repair procedure polynomial for the broader class of cancelable valuations. Fix an ordering of the items consistent with their singleton values and always transfer t"},"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":"2608.08864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-08-09T19:02:11Z","cross_cats_sorted":[],"title_canon_sha256":"749eae3d3bfe42da9c8cf12caa70a1bd869a65b6e2456655c911cc0c20153b0a","abstract_canon_sha256":"7fb4dec91e5d9a03edd132e3b2b9091df8cfb6dd1d1b5ec82bb9149608d6cc1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:25:33.872763Z","signature_b64":"G0eyRYTJK4fA2OIc8+sNI1UL+KtduEHM8w3a70JWwM+Ih6mG2DylshGWF6x17WfUTAh8BZpEzVJgi8eNf7tqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49779e1978e40fd86af21d667bcdace2e6be46433502297ed4fbd08396dec2a5","last_reissued_at":"2026-08-11T01:25:33.870305Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:25:33.870305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Polynomial-Time EFX Repair for Cancelable Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Arash Ashuri, Bhaskar Ray Chaudhury, Hannaneh Akrami, Kurt Mehlhorn, Maksim Soldatov","submitted_at":"2026-08-09T19:02:11Z","abstract_excerpt":"The leximin++ proof of Plaut and Roughgarden for agents with identical monotone valuations gives a natural EFX-repair procedure: starting from an arbitrary partition, repeatedly transfer an eligible item to a minimum-valued bundle. The procedure terminates, but the standard argument gives no polynomial bound on the number of transfers, even for additive valuations.\n  We show that a single deterministic tie-breaking rule makes this repair procedure polynomial for the broader class of cancelable valuations. Fix an ordering of the items consistent with their singleton values and always transfer t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08864","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/2608.08864/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":"2608.08864","created_at":"2026-08-11T01:25:33.871187+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.08864v1","created_at":"2026-08-11T01:25:33.871187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08864","created_at":"2026-08-11T01:25:33.871187+00:00"},{"alias_kind":"pith_short_12","alias_value":"JF3Z4GLY4QH5","created_at":"2026-08-11T01:25:33.871187+00:00"},{"alias_kind":"pith_short_16","alias_value":"JF3Z4GLY4QH5Q2XS","created_at":"2026-08-11T01:25:33.871187+00:00"},{"alias_kind":"pith_short_8","alias_value":"JF3Z4GLY","created_at":"2026-08-11T01:25:33.871187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JF3Z4GLY4QH5Q2XSDVTHXTNM4L","json":"https://pith.science/pith/JF3Z4GLY4QH5Q2XSDVTHXTNM4L.json","graph_json":"https://pith.science/api/pith-number/JF3Z4GLY4QH5Q2XSDVTHXTNM4L/graph.json","events_json":"https://pith.science/api/pith-number/JF3Z4GLY4QH5Q2XSDVTHXTNM4L/events.json","paper":"https://pith.science/paper/JF3Z4GLY"},"agent_actions":{"view_html":"https://pith.science/pith/JF3Z4GLY4QH5Q2XSDVTHXTNM4L","download_json":"https://pith.science/pith/JF3Z4GLY4QH5Q2XSDVTHXTNM4L.json","view_paper":"https://pith.science/paper/JF3Z4GLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.08864&json=true","fetch_graph":"https://pith.science/api/pith-number/JF3Z4GLY4QH5Q2XSDVTHXTNM4L/graph.json","fetch_events":"https://pith.science/api/pith-number/JF3Z4GLY4QH5Q2XSDVTHXTNM4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JF3Z4GLY4QH5Q2XSDVTHXTNM4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JF3Z4GLY4QH5Q2XSDVTHXTNM4L/action/storage_attestation","attest_author":"https://pith.science/pith/JF3Z4GLY4QH5Q2XSDVTHXTNM4L/action/author_attestation","sign_citation":"https://pith.science/pith/JF3Z4GLY4QH5Q2XSDVTHXTNM4L/action/citation_signature","submit_replication":"https://pith.science/pith/JF3Z4GLY4QH5Q2XSDVTHXTNM4L/action/replication_record"}},"created_at":"2026-08-11T01:25:33.871187+00:00","updated_at":"2026-08-11T01:25:33.871187+00:00"}