{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FZBTVWGCHMQ6XPNVIA267AXT5H","short_pith_number":"pith:FZBTVWGC","schema_version":"1.0","canonical_sha256":"2e433ad8c23b21ebbdb54035ef82f3e9ffecee129173d25c9aa9325239be2f63","source":{"kind":"arxiv","id":"2407.05139","version":2},"attestation_state":"computed","paper":{"title":"Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alireza Kaviani, AmirMohammad Shahrezaei, Masoud Seddighin","submitted_at":"2024-07-06T17:31:58Z","abstract_excerpt":"The existence of $\\textsf{EFX}$ allocations stands as one of the main challenges in discrete fair division.In this paper, we present symmetrical results on the existence of $\\textsf{EFX}$ and its approximate variations for two distinct valuations: restricted additive valuations and $(p,q)$-bounded valuations introduced by Christodoulou \\etal \\cite{christodoulou2023fair}. In a $(p,q)$-bounded instance, each good has relevance for at most $p$ agents, and any pair of agents shares at most $q$ common relevant goods.\n  We show that instances with $(\\infty,1)$-bounded valuations admit $\\textsf{EF2X}"},"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":"2407.05139","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-07-06T17:31:58Z","cross_cats_sorted":[],"title_canon_sha256":"e28b6722233f0a627072b4f9b66da0bdec4dd8f7e72dd599785892fdadf8ddb9","abstract_canon_sha256":"6f1c36f7e5e1626255c430230f3f953eede2f91f084115689ae86108db2b99f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:51.343500Z","signature_b64":"Loc95aygZXdOTJnivz1oe+TnM6+2zLDk4cS484BNx26PS9poWiR4KuX0CqiVGNAsKgjR35wgefet3SzhRF+8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e433ad8c23b21ebbdb54035ef82f3e9ffecee129173d25c9aa9325239be2f63","last_reissued_at":"2026-07-05T09:45:51.342960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:51.342960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alireza Kaviani, AmirMohammad Shahrezaei, Masoud Seddighin","submitted_at":"2024-07-06T17:31:58Z","abstract_excerpt":"The existence of $\\textsf{EFX}$ allocations stands as one of the main challenges in discrete fair division.In this paper, we present symmetrical results on the existence of $\\textsf{EFX}$ and its approximate variations for two distinct valuations: restricted additive valuations and $(p,q)$-bounded valuations introduced by Christodoulou \\etal \\cite{christodoulou2023fair}. In a $(p,q)$-bounded instance, each good has relevance for at most $p$ agents, and any pair of agents shares at most $q$ common relevant goods.\n  We show that instances with $(\\infty,1)$-bounded valuations admit $\\textsf{EF2X}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05139","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/2407.05139/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":"2407.05139","created_at":"2026-07-05T09:45:51.343017+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05139v2","created_at":"2026-07-05T09:45:51.343017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05139","created_at":"2026-07-05T09:45:51.343017+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZBTVWGCHMQ6","created_at":"2026-07-05T09:45:51.343017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZBTVWGCHMQ6XPNV","created_at":"2026-07-05T09:45:51.343017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZBTVWGC","created_at":"2026-07-05T09:45:51.343017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05613","citing_title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FZBTVWGCHMQ6XPNVIA267AXT5H","json":"https://pith.science/pith/FZBTVWGCHMQ6XPNVIA267AXT5H.json","graph_json":"https://pith.science/api/pith-number/FZBTVWGCHMQ6XPNVIA267AXT5H/graph.json","events_json":"https://pith.science/api/pith-number/FZBTVWGCHMQ6XPNVIA267AXT5H/events.json","paper":"https://pith.science/paper/FZBTVWGC"},"agent_actions":{"view_html":"https://pith.science/pith/FZBTVWGCHMQ6XPNVIA267AXT5H","download_json":"https://pith.science/pith/FZBTVWGCHMQ6XPNVIA267AXT5H.json","view_paper":"https://pith.science/paper/FZBTVWGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05139&json=true","fetch_graph":"https://pith.science/api/pith-number/FZBTVWGCHMQ6XPNVIA267AXT5H/graph.json","fetch_events":"https://pith.science/api/pith-number/FZBTVWGCHMQ6XPNVIA267AXT5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZBTVWGCHMQ6XPNVIA267AXT5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZBTVWGCHMQ6XPNVIA267AXT5H/action/storage_attestation","attest_author":"https://pith.science/pith/FZBTVWGCHMQ6XPNVIA267AXT5H/action/author_attestation","sign_citation":"https://pith.science/pith/FZBTVWGCHMQ6XPNVIA267AXT5H/action/citation_signature","submit_replication":"https://pith.science/pith/FZBTVWGCHMQ6XPNVIA267AXT5H/action/replication_record"}},"created_at":"2026-07-05T09:45:51.343017+00:00","updated_at":"2026-07-05T09:45:51.343017+00:00"}