{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Y3ICF2ZZVWNPJXF2W57YRAZ6XH","short_pith_number":"pith:Y3ICF2ZZ","schema_version":"1.0","canonical_sha256":"c6d022eb39ad9af4dcbab77f88833eb9f71afc1af9538aed7a4d58891367906a","source":{"kind":"arxiv","id":"2606.02233","version":1},"attestation_state":"computed","paper":{"title":"Optimizing the Envy Cycle Elimination Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Karen Frilya Celine, Warut Suksompong","submitted_at":"2026-06-01T13:26:47Z","abstract_excerpt":"In the fair allocation of indivisible goods, a widely used notion of fairness is envy-freeness up to one good (EF1). A classical way to compute an EF1 allocation is the envy cycle elimination (ECE) algorithm, which iteratively assigns a good to an unenvied agent and, after each assignment, resolves any resulting envy cycle. Although the ECE algorithm always produces an EF1 allocation, it leaves considerable freedom in choosing both the next good to allocate and the agent to receive it. We investigate natural heuristics that exploit this flexibility to improve welfare guarantees. For example, w"},"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":"2606.02233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-01T13:26:47Z","cross_cats_sorted":[],"title_canon_sha256":"36018275eb7ccc0629760bcf6173a4e5165c7face4c031011c61d64169c8e919","abstract_canon_sha256":"35e6cf9cdad0d78ae763b48a4c21cf6af341ae18e9cc0f3acd844436326239bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:53.741888Z","signature_b64":"hvWtoDs0cOlP+uPmCuZoviV68FBX84Mwd2jUqKgHVhbrL0FRAGChg5QWzWB4z678hqeWGkwECArBlqGb6zU+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6d022eb39ad9af4dcbab77f88833eb9f71afc1af9538aed7a4d58891367906a","last_reissued_at":"2026-06-02T03:04:53.741502Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:53.741502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing the Envy Cycle Elimination Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Karen Frilya Celine, Warut Suksompong","submitted_at":"2026-06-01T13:26:47Z","abstract_excerpt":"In the fair allocation of indivisible goods, a widely used notion of fairness is envy-freeness up to one good (EF1). A classical way to compute an EF1 allocation is the envy cycle elimination (ECE) algorithm, which iteratively assigns a good to an unenvied agent and, after each assignment, resolves any resulting envy cycle. Although the ECE algorithm always produces an EF1 allocation, it leaves considerable freedom in choosing both the next good to allocate and the agent to receive it. We investigate natural heuristics that exploit this flexibility to improve welfare guarantees. For example, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02233","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/2606.02233/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":"2606.02233","created_at":"2026-06-02T03:04:53.741558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02233v1","created_at":"2026-06-02T03:04:53.741558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02233","created_at":"2026-06-02T03:04:53.741558+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3ICF2ZZVWNP","created_at":"2026-06-02T03:04:53.741558+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3ICF2ZZVWNPJXF2","created_at":"2026-06-02T03:04:53.741558+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3ICF2ZZ","created_at":"2026-06-02T03:04:53.741558+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/Y3ICF2ZZVWNPJXF2W57YRAZ6XH","json":"https://pith.science/pith/Y3ICF2ZZVWNPJXF2W57YRAZ6XH.json","graph_json":"https://pith.science/api/pith-number/Y3ICF2ZZVWNPJXF2W57YRAZ6XH/graph.json","events_json":"https://pith.science/api/pith-number/Y3ICF2ZZVWNPJXF2W57YRAZ6XH/events.json","paper":"https://pith.science/paper/Y3ICF2ZZ"},"agent_actions":{"view_html":"https://pith.science/pith/Y3ICF2ZZVWNPJXF2W57YRAZ6XH","download_json":"https://pith.science/pith/Y3ICF2ZZVWNPJXF2W57YRAZ6XH.json","view_paper":"https://pith.science/paper/Y3ICF2ZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02233&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3ICF2ZZVWNPJXF2W57YRAZ6XH/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3ICF2ZZVWNPJXF2W57YRAZ6XH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3ICF2ZZVWNPJXF2W57YRAZ6XH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3ICF2ZZVWNPJXF2W57YRAZ6XH/action/storage_attestation","attest_author":"https://pith.science/pith/Y3ICF2ZZVWNPJXF2W57YRAZ6XH/action/author_attestation","sign_citation":"https://pith.science/pith/Y3ICF2ZZVWNPJXF2W57YRAZ6XH/action/citation_signature","submit_replication":"https://pith.science/pith/Y3ICF2ZZVWNPJXF2W57YRAZ6XH/action/replication_record"}},"created_at":"2026-06-02T03:04:53.741558+00:00","updated_at":"2026-06-02T03:04:53.741558+00:00"}