{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JARNNMCZ57S6DQRAV6J4FYJ7Q5","short_pith_number":"pith:JARNNMCZ","schema_version":"1.0","canonical_sha256":"4822d6b059efe5e1c220af93c2e13f87619cc290e40da7df31fe5459366824a4","source":{"kind":"arxiv","id":"1707.04731","version":2},"attestation_state":"computed","paper":{"title":"Finding Fair and Efficient Allocations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Rohit Vaish, Sanath Kumar Krishnamurthy, Siddharth Barman","submitted_at":"2017-07-15T12:35:50Z","abstract_excerpt":"We study the problem of allocating a set of indivisible goods among a set of agents in a fair and efficient manner. An allocation is said to be fair if it is envy-free up to one good (EF1), which means that each agent prefers its own bundle over the bundle of any other agent up to the removal of one good. In addition, an allocation is deemed efficient if it satisfies Pareto optimality (PO). While each of these well-studied properties is easy to achieve separately, achieving them together is far from obvious. Recently, Caragiannis et al. (2016) established the surprising result that when agents"},"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":"1707.04731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-15T12:35:50Z","cross_cats_sorted":[],"title_canon_sha256":"4eefab0703528deccb1be34e3c7fc8e850196ab00d3a1d4a40ba6d3942eb96aa","abstract_canon_sha256":"361b88d46b9e209ea03092f30c78969b65334aa80eed494307f604049d89bda2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:14.482745Z","signature_b64":"8GB6OO+4y+G/ojAZOQHIxwbhSkyNQdgmljWWLNs5LAwtjMPn1zgPupcOOYaaua3e8flUsZ7R3n9/gAyg92QkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4822d6b059efe5e1c220af93c2e13f87619cc290e40da7df31fe5459366824a4","last_reissued_at":"2026-05-18T00:16:14.482008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:14.482008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Fair and Efficient Allocations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Rohit Vaish, Sanath Kumar Krishnamurthy, Siddharth Barman","submitted_at":"2017-07-15T12:35:50Z","abstract_excerpt":"We study the problem of allocating a set of indivisible goods among a set of agents in a fair and efficient manner. An allocation is said to be fair if it is envy-free up to one good (EF1), which means that each agent prefers its own bundle over the bundle of any other agent up to the removal of one good. In addition, an allocation is deemed efficient if it satisfies Pareto optimality (PO). While each of these well-studied properties is easy to achieve separately, achieving them together is far from obvious. Recently, Caragiannis et al. (2016) established the surprising result that when agents"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04731","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":""},"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":"1707.04731","created_at":"2026-05-18T00:16:14.482137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04731v2","created_at":"2026-05-18T00:16:14.482137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04731","created_at":"2026-05-18T00:16:14.482137+00:00"},{"alias_kind":"pith_short_12","alias_value":"JARNNMCZ57S6","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"JARNNMCZ57S6DQRA","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"JARNNMCZ","created_at":"2026-05-18T12:31:21.493067+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/JARNNMCZ57S6DQRAV6J4FYJ7Q5","json":"https://pith.science/pith/JARNNMCZ57S6DQRAV6J4FYJ7Q5.json","graph_json":"https://pith.science/api/pith-number/JARNNMCZ57S6DQRAV6J4FYJ7Q5/graph.json","events_json":"https://pith.science/api/pith-number/JARNNMCZ57S6DQRAV6J4FYJ7Q5/events.json","paper":"https://pith.science/paper/JARNNMCZ"},"agent_actions":{"view_html":"https://pith.science/pith/JARNNMCZ57S6DQRAV6J4FYJ7Q5","download_json":"https://pith.science/pith/JARNNMCZ57S6DQRAV6J4FYJ7Q5.json","view_paper":"https://pith.science/paper/JARNNMCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04731&json=true","fetch_graph":"https://pith.science/api/pith-number/JARNNMCZ57S6DQRAV6J4FYJ7Q5/graph.json","fetch_events":"https://pith.science/api/pith-number/JARNNMCZ57S6DQRAV6J4FYJ7Q5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JARNNMCZ57S6DQRAV6J4FYJ7Q5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JARNNMCZ57S6DQRAV6J4FYJ7Q5/action/storage_attestation","attest_author":"https://pith.science/pith/JARNNMCZ57S6DQRAV6J4FYJ7Q5/action/author_attestation","sign_citation":"https://pith.science/pith/JARNNMCZ57S6DQRAV6J4FYJ7Q5/action/citation_signature","submit_replication":"https://pith.science/pith/JARNNMCZ57S6DQRAV6J4FYJ7Q5/action/replication_record"}},"created_at":"2026-05-18T00:16:14.482137+00:00","updated_at":"2026-05-18T00:16:14.482137+00:00"}