{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XLKPNHBEGMFUP6LP4ZOTXP6OXD","short_pith_number":"pith:XLKPNHBE","schema_version":"1.0","canonical_sha256":"bad4f69c24330b47f96fe65d3bbfceb8db24db2d1cbfc94df4ec70283a20cf14","source":{"kind":"arxiv","id":"2306.02040","version":2},"attestation_state":"computed","paper":{"title":"Getting More by Knowing Less: Bayesian Incentive Compatible Mechanisms for Fair Division","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexandros Psomas, Paritosh Verma, Vasilis Gkatzelis, Xizhi Tan","submitted_at":"2023-06-03T07:43:59Z","abstract_excerpt":"We study fair resource allocation with strategic agents. It is well-known that, across multiple fundamental problems in this domain, truthfulness and fairness are incompatible. For example, when allocating indivisible goods, no truthful and deterministic mechanism can guarantee envy-freeness up to one item (EF1), even for two agents with additive valuations. Or, in cake-cutting, no truthful and deterministic mechanism always outputs a proportional allocation, even for two agents with piecewise constant valuations. Our work stems from the observation that, in the context of fair division, truth"},"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":"2306.02040","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-06-03T07:43:59Z","cross_cats_sorted":[],"title_canon_sha256":"56dbf95c515268ee1271afa74733fefc5f8cc98aedfb2d5cf51af7eb66f7c9d7","abstract_canon_sha256":"b6caecca457e060a2dd728132a01ff9882e8d5d08c3d6f7814521ec113b9266d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:19:56.396893Z","signature_b64":"Fyzd825NI9jGl+hzdS7i0bATn/NSspSdqb23smEugA8N3Ypa2Ab5zjpXZA/XVTAERMLhtqgFvK9C9YaFRZ/GAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bad4f69c24330b47f96fe65d3bbfceb8db24db2d1cbfc94df4ec70283a20cf14","last_reissued_at":"2026-07-05T08:19:56.396422Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:19:56.396422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Getting More by Knowing Less: Bayesian Incentive Compatible Mechanisms for Fair Division","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexandros Psomas, Paritosh Verma, Vasilis Gkatzelis, Xizhi Tan","submitted_at":"2023-06-03T07:43:59Z","abstract_excerpt":"We study fair resource allocation with strategic agents. It is well-known that, across multiple fundamental problems in this domain, truthfulness and fairness are incompatible. For example, when allocating indivisible goods, no truthful and deterministic mechanism can guarantee envy-freeness up to one item (EF1), even for two agents with additive valuations. Or, in cake-cutting, no truthful and deterministic mechanism always outputs a proportional allocation, even for two agents with piecewise constant valuations. Our work stems from the observation that, in the context of fair division, truth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.02040","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/2306.02040/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":"2306.02040","created_at":"2026-07-05T08:19:56.396483+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.02040v2","created_at":"2026-07-05T08:19:56.396483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.02040","created_at":"2026-07-05T08:19:56.396483+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLKPNHBEGMFU","created_at":"2026-07-05T08:19:56.396483+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLKPNHBEGMFUP6LP","created_at":"2026-07-05T08:19:56.396483+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLKPNHBE","created_at":"2026-07-05T08:19:56.396483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07414","citing_title":"Bayesian Fair Division: Truthfulness in Picking Sequence with Correlated Valuations","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XLKPNHBEGMFUP6LP4ZOTXP6OXD","json":"https://pith.science/pith/XLKPNHBEGMFUP6LP4ZOTXP6OXD.json","graph_json":"https://pith.science/api/pith-number/XLKPNHBEGMFUP6LP4ZOTXP6OXD/graph.json","events_json":"https://pith.science/api/pith-number/XLKPNHBEGMFUP6LP4ZOTXP6OXD/events.json","paper":"https://pith.science/paper/XLKPNHBE"},"agent_actions":{"view_html":"https://pith.science/pith/XLKPNHBEGMFUP6LP4ZOTXP6OXD","download_json":"https://pith.science/pith/XLKPNHBEGMFUP6LP4ZOTXP6OXD.json","view_paper":"https://pith.science/paper/XLKPNHBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.02040&json=true","fetch_graph":"https://pith.science/api/pith-number/XLKPNHBEGMFUP6LP4ZOTXP6OXD/graph.json","fetch_events":"https://pith.science/api/pith-number/XLKPNHBEGMFUP6LP4ZOTXP6OXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLKPNHBEGMFUP6LP4ZOTXP6OXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLKPNHBEGMFUP6LP4ZOTXP6OXD/action/storage_attestation","attest_author":"https://pith.science/pith/XLKPNHBEGMFUP6LP4ZOTXP6OXD/action/author_attestation","sign_citation":"https://pith.science/pith/XLKPNHBEGMFUP6LP4ZOTXP6OXD/action/citation_signature","submit_replication":"https://pith.science/pith/XLKPNHBEGMFUP6LP4ZOTXP6OXD/action/replication_record"}},"created_at":"2026-07-05T08:19:56.396483+00:00","updated_at":"2026-07-05T08:19:56.396483+00:00"}