{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EFLMJR2F4TQJK24BL65ERGQ4HI","short_pith_number":"pith:EFLMJR2F","schema_version":"1.0","canonical_sha256":"2156c4c745e4e0956b815fba489a1c3a1ed4a847e8a4e024845eb763f0b628e9","source":{"kind":"arxiv","id":"2404.13527","version":2},"attestation_state":"computed","paper":{"title":"On the structure of EFX orientations on graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.GT","authors_text":"Jinghan A Zeng, Ruta Mehta","submitted_at":"2024-04-21T04:44:34Z","abstract_excerpt":"Fair division is the problem of allocating a set of items among agents in a fair manner. One of the most sought-after fairness notions is envy-freeness (EF), requiring that no agent envies another's allocation. When items are indivisible, it ceases to exist, and envy-freeness up to any good (EFX) emerged as one of its strongest relaxations. The existence of EFX allocations is arguably the biggest open question within fair division. Recently, Christodoulou, Fiat, Koutsoupias, and Sgouritsa (EC 2023) showed that EFX allocations exist for the case of graphical valuations where an instance is repr"},"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":"2404.13527","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-04-21T04:44:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0334f034810e4fc69612f62eaac754c2ada2284e8931a041eaac61b223a84f40","abstract_canon_sha256":"49e0d7c92d7dcc9a98445bc2836de7baf94138f36b5ab0bb9dc2d30dbda320a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:51.620249Z","signature_b64":"pbwHL/RaRzaWDtwpIL4jxt3DMd/yb6q9ZR7Mk11r+3G3iCymvyFoTWxupWLYUz2OiMkDL/r5+mKjf9xSyVujDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2156c4c745e4e0956b815fba489a1c3a1ed4a847e8a4e024845eb763f0b628e9","last_reissued_at":"2026-07-05T08:47:51.619812Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:51.619812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the structure of EFX orientations on graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.GT","authors_text":"Jinghan A Zeng, Ruta Mehta","submitted_at":"2024-04-21T04:44:34Z","abstract_excerpt":"Fair division is the problem of allocating a set of items among agents in a fair manner. One of the most sought-after fairness notions is envy-freeness (EF), requiring that no agent envies another's allocation. When items are indivisible, it ceases to exist, and envy-freeness up to any good (EFX) emerged as one of its strongest relaxations. The existence of EFX allocations is arguably the biggest open question within fair division. Recently, Christodoulou, Fiat, Koutsoupias, and Sgouritsa (EC 2023) showed that EFX allocations exist for the case of graphical valuations where an instance is repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.13527","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/2404.13527/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":"2404.13527","created_at":"2026-07-05T08:47:51.619865+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.13527v2","created_at":"2026-07-05T08:47:51.619865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.13527","created_at":"2026-07-05T08:47:51.619865+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFLMJR2F4TQJ","created_at":"2026-07-05T08:47:51.619865+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFLMJR2F4TQJK24B","created_at":"2026-07-05T08:47:51.619865+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFLMJR2F","created_at":"2026-07-05T08:47:51.619865+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.14421","citing_title":"Fair Division in a Variable Setting","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2506.20317","citing_title":"Exact and approximate maximin share allocations in multi-graphs","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EFLMJR2F4TQJK24BL65ERGQ4HI","json":"https://pith.science/pith/EFLMJR2F4TQJK24BL65ERGQ4HI.json","graph_json":"https://pith.science/api/pith-number/EFLMJR2F4TQJK24BL65ERGQ4HI/graph.json","events_json":"https://pith.science/api/pith-number/EFLMJR2F4TQJK24BL65ERGQ4HI/events.json","paper":"https://pith.science/paper/EFLMJR2F"},"agent_actions":{"view_html":"https://pith.science/pith/EFLMJR2F4TQJK24BL65ERGQ4HI","download_json":"https://pith.science/pith/EFLMJR2F4TQJK24BL65ERGQ4HI.json","view_paper":"https://pith.science/paper/EFLMJR2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.13527&json=true","fetch_graph":"https://pith.science/api/pith-number/EFLMJR2F4TQJK24BL65ERGQ4HI/graph.json","fetch_events":"https://pith.science/api/pith-number/EFLMJR2F4TQJK24BL65ERGQ4HI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFLMJR2F4TQJK24BL65ERGQ4HI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFLMJR2F4TQJK24BL65ERGQ4HI/action/storage_attestation","attest_author":"https://pith.science/pith/EFLMJR2F4TQJK24BL65ERGQ4HI/action/author_attestation","sign_citation":"https://pith.science/pith/EFLMJR2F4TQJK24BL65ERGQ4HI/action/citation_signature","submit_replication":"https://pith.science/pith/EFLMJR2F4TQJK24BL65ERGQ4HI/action/replication_record"}},"created_at":"2026-07-05T08:47:51.619865+00:00","updated_at":"2026-07-05T08:47:51.619865+00:00"}