{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZYQH5FEPZUZ7JYJ7QINE7ZRJHM","short_pith_number":"pith:ZYQH5FEP","schema_version":"1.0","canonical_sha256":"ce207e948fcd33f4e13f821a4fe6293b03ad75871229f49def90c8b8d6996a71","source":{"kind":"arxiv","id":"2508.15380","version":1},"attestation_state":"computed","paper":{"title":"Almost and Approximate EFX for Few Types of Agents","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Prajakta Nimbhorkar, Ruta Mehta, Vishwa Prakash HV","submitted_at":"2025-08-21T09:20:06Z","abstract_excerpt":"We study the problem of fair allocation of a set of indivisible goods among $n$ agents with $k$ distinct additive valuations, with the goal of achieving approximate envy-freeness up to any good ($\\alpha-\\mathrm{EFX}$).\n  It is known that EFX allocations exist for $n$ agents when there are at most three distinct valuations due to HV et al. Furthermore, Amanatidis et al. showed that a $\\frac{2}{3}-\\mathrm{EFX}$ allocation is guaranteed to exist when number of agents is at most seven. In this paper, we show that a $\\frac{2}{3}-\\mathrm{EFX}$ allocation exists for any number of agents when there ar"},"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":"2508.15380","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2025-08-21T09:20:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8d5918c1cc8722f004032c28e73f736040b5763f9da0d0d8602bfda6627e3412","abstract_canon_sha256":"d4c4eed3793aeb2339d480385e283e55b7c2a7e32c78e8a84fde187555a444fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:11.229723Z","signature_b64":"kwnZMp0xrs3Kji2+QQAGjmxNgzv4rU4DAI05UvKVqzdhAeeOmrMPu73QbfRKkmFDtTjo0f9NR6zxDAiKia3mAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce207e948fcd33f4e13f821a4fe6293b03ad75871229f49def90c8b8d6996a71","last_reissued_at":"2026-07-05T11:57:11.229290Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:11.229290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost and Approximate EFX for Few Types of Agents","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Prajakta Nimbhorkar, Ruta Mehta, Vishwa Prakash HV","submitted_at":"2025-08-21T09:20:06Z","abstract_excerpt":"We study the problem of fair allocation of a set of indivisible goods among $n$ agents with $k$ distinct additive valuations, with the goal of achieving approximate envy-freeness up to any good ($\\alpha-\\mathrm{EFX}$).\n  It is known that EFX allocations exist for $n$ agents when there are at most three distinct valuations due to HV et al. Furthermore, Amanatidis et al. showed that a $\\frac{2}{3}-\\mathrm{EFX}$ allocation is guaranteed to exist when number of agents is at most seven. In this paper, we show that a $\\frac{2}{3}-\\mathrm{EFX}$ allocation exists for any number of agents when there ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.15380","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/2508.15380/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":"2508.15380","created_at":"2026-07-05T11:57:11.229354+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.15380v1","created_at":"2026-07-05T11:57:11.229354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.15380","created_at":"2026-07-05T11:57:11.229354+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYQH5FEPZUZ7","created_at":"2026-07-05T11:57:11.229354+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYQH5FEPZUZ7JYJ7","created_at":"2026-07-05T11:57:11.229354+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYQH5FEP","created_at":"2026-07-05T11:57:11.229354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26948","citing_title":"Almost EFX in Hypergraphs","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10371","citing_title":"Approximate Envy-Free Allocations up to any $k$ Goods","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM","json":"https://pith.science/pith/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM.json","graph_json":"https://pith.science/api/pith-number/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM/graph.json","events_json":"https://pith.science/api/pith-number/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM/events.json","paper":"https://pith.science/paper/ZYQH5FEP"},"agent_actions":{"view_html":"https://pith.science/pith/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM","download_json":"https://pith.science/pith/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM.json","view_paper":"https://pith.science/paper/ZYQH5FEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.15380&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM/action/storage_attestation","attest_author":"https://pith.science/pith/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM/action/author_attestation","sign_citation":"https://pith.science/pith/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM/action/citation_signature","submit_replication":"https://pith.science/pith/ZYQH5FEPZUZ7JYJ7QINE7ZRJHM/action/replication_record"}},"created_at":"2026-07-05T11:57:11.229354+00:00","updated_at":"2026-07-05T11:57:11.229354+00:00"}