{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5WNTEDZ6XSLRWEVRK2AN3PTAH6","short_pith_number":"pith:5WNTEDZ6","schema_version":"1.0","canonical_sha256":"ed9b320f3ebc971b12b15680ddbe603fa304b53a1a4bc50c5cb89431d0820280","source":{"kind":"arxiv","id":"2406.12413","version":2},"attestation_state":"computed","paper":{"title":"Pushing the Frontier on Approximate EFX Allocations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.GT","authors_text":"Alkmini Sgouritsa, Aris Filos-Ratsikas, Georgios Amanatidis","submitted_at":"2024-06-18T09:01:37Z","abstract_excerpt":"We study the problem of allocating a set of indivisible goods to a set of agents with additive valuation functions, aiming to achieve approximate envy-freeness up to any good ($\\alpha$-EFX). The state-of-the-art results on the problem include that (exact) EFX allocations exist when (a) there are at most three agents, or (b) the agents' valuation functions can take at most two values, or (c) the agents' valuation functions can be represented via a graph. For $\\alpha$-EFX, it is known that a $0.618$-EFX allocation exists for any number of agents with additive valuation functions. In this paper, "},"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":"2406.12413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-06-18T09:01:37Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"c9e47244ea40c2444d08ed83552bc857614e6ed42e2ba1104280295c59e7f129","abstract_canon_sha256":"9676651163f3de9dc66b650a0f4b9e05db05075c49be033ea0fc5382ed117851"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:54.699894Z","signature_b64":"t7LAaehLgKzZqu/mKrQDHzEXuobpPnfeSyxG7KGM6veJlOZdumwpvDy3Gd8JibKfAA1gVoMa5YaL8eUYtf8tBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed9b320f3ebc971b12b15680ddbe603fa304b53a1a4bc50c5cb89431d0820280","last_reissued_at":"2026-07-05T10:52:54.699309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:54.699309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pushing the Frontier on Approximate EFX Allocations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.GT","authors_text":"Alkmini Sgouritsa, Aris Filos-Ratsikas, Georgios Amanatidis","submitted_at":"2024-06-18T09:01:37Z","abstract_excerpt":"We study the problem of allocating a set of indivisible goods to a set of agents with additive valuation functions, aiming to achieve approximate envy-freeness up to any good ($\\alpha$-EFX). The state-of-the-art results on the problem include that (exact) EFX allocations exist when (a) there are at most three agents, or (b) the agents' valuation functions can take at most two values, or (c) the agents' valuation functions can be represented via a graph. For $\\alpha$-EFX, it is known that a $0.618$-EFX allocation exists for any number of agents with additive valuation functions. In this paper, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12413","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/2406.12413/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":"2406.12413","created_at":"2026-07-05T10:52:54.699386+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.12413v2","created_at":"2026-07-05T10:52:54.699386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12413","created_at":"2026-07-05T10:52:54.699386+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WNTEDZ6XSLR","created_at":"2026-07-05T10:52:54.699386+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WNTEDZ6XSLRWEVR","created_at":"2026-07-05T10:52:54.699386+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WNTEDZ6","created_at":"2026-07-05T10:52:54.699386+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09288","citing_title":"Improved Approximate EFX Guarantees for Multigraphs","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5WNTEDZ6XSLRWEVRK2AN3PTAH6","json":"https://pith.science/pith/5WNTEDZ6XSLRWEVRK2AN3PTAH6.json","graph_json":"https://pith.science/api/pith-number/5WNTEDZ6XSLRWEVRK2AN3PTAH6/graph.json","events_json":"https://pith.science/api/pith-number/5WNTEDZ6XSLRWEVRK2AN3PTAH6/events.json","paper":"https://pith.science/paper/5WNTEDZ6"},"agent_actions":{"view_html":"https://pith.science/pith/5WNTEDZ6XSLRWEVRK2AN3PTAH6","download_json":"https://pith.science/pith/5WNTEDZ6XSLRWEVRK2AN3PTAH6.json","view_paper":"https://pith.science/paper/5WNTEDZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.12413&json=true","fetch_graph":"https://pith.science/api/pith-number/5WNTEDZ6XSLRWEVRK2AN3PTAH6/graph.json","fetch_events":"https://pith.science/api/pith-number/5WNTEDZ6XSLRWEVRK2AN3PTAH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WNTEDZ6XSLRWEVRK2AN3PTAH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WNTEDZ6XSLRWEVRK2AN3PTAH6/action/storage_attestation","attest_author":"https://pith.science/pith/5WNTEDZ6XSLRWEVRK2AN3PTAH6/action/author_attestation","sign_citation":"https://pith.science/pith/5WNTEDZ6XSLRWEVRK2AN3PTAH6/action/citation_signature","submit_replication":"https://pith.science/pith/5WNTEDZ6XSLRWEVRK2AN3PTAH6/action/replication_record"}},"created_at":"2026-07-05T10:52:54.699386+00:00","updated_at":"2026-07-05T10:52:54.699386+00:00"}