{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KGNXC235VUWA7QNQY5RVZXVNI3","short_pith_number":"pith:KGNXC235","schema_version":"1.0","canonical_sha256":"519b716b7dad2c0fc1b0c7635cdead46c2ddd99bdfcfec6259326e89093d5bf9","source":{"kind":"arxiv","id":"2602.06361","version":2},"attestation_state":"computed","paper":{"title":"Envy-Free Allocation of Indivisible Goods via Noisy Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"cs.GT","authors_text":"Jonathan Scarlett, Warut Suksompong, Yan Hao Ling, Zihan Li","submitted_at":"2026-02-06T03:44:40Z","abstract_excerpt":"We introduce a problem of fairly allocating indivisible goods (items) in which the agents' valuations cannot be observed directly, but instead can only be accessed via noisy queries. In the two-agent setting with Gaussian noise and bounded valuations, we derive upper and lower bounds on the required number of queries for finding an envy-free allocation in terms of the number of items, $m$, and the negative-envy of the optimal allocation, $\\Delta$. In particular, when $\\Delta$ is not too small (namely, $\\Delta \\gg m^{1/4}$), we establish that the optimal number of queries scales as $\\frac{\\sqrt"},"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":"2602.06361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-06T03:44:40Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"2f5d582865c277457ca026f1177469f397978b30b90749fe8dd6d00017550c95","abstract_canon_sha256":"bd61505e34f6ff201fee2a4ed415a785ca452feb507cbd12fef9f392cc4661b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:03.793208Z","signature_b64":"4fllA4T2Uw9DnHnxzRF6x5vgfd1uoHvrGvF0S/eYPT09TIYLeawJNY7Bs8cPXFBA/UVo3CJ6OTI6D0/Gj4KoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"519b716b7dad2c0fc1b0c7635cdead46c2ddd99bdfcfec6259326e89093d5bf9","last_reissued_at":"2026-05-29T01:05:03.792277Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:03.792277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Envy-Free Allocation of Indivisible Goods via Noisy Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"cs.GT","authors_text":"Jonathan Scarlett, Warut Suksompong, Yan Hao Ling, Zihan Li","submitted_at":"2026-02-06T03:44:40Z","abstract_excerpt":"We introduce a problem of fairly allocating indivisible goods (items) in which the agents' valuations cannot be observed directly, but instead can only be accessed via noisy queries. In the two-agent setting with Gaussian noise and bounded valuations, we derive upper and lower bounds on the required number of queries for finding an envy-free allocation in terms of the number of items, $m$, and the negative-envy of the optimal allocation, $\\Delta$. In particular, when $\\Delta$ is not too small (namely, $\\Delta \\gg m^{1/4}$), we establish that the optimal number of queries scales as $\\frac{\\sqrt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.06361","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/2602.06361/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":"2602.06361","created_at":"2026-05-29T01:05:03.792423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.06361v2","created_at":"2026-05-29T01:05:03.792423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06361","created_at":"2026-05-29T01:05:03.792423+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGNXC235VUWA","created_at":"2026-05-29T01:05:03.792423+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGNXC235VUWA7QNQ","created_at":"2026-05-29T01:05:03.792423+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGNXC235","created_at":"2026-05-29T01:05:03.792423+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/KGNXC235VUWA7QNQY5RVZXVNI3","json":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3.json","graph_json":"https://pith.science/api/pith-number/KGNXC235VUWA7QNQY5RVZXVNI3/graph.json","events_json":"https://pith.science/api/pith-number/KGNXC235VUWA7QNQY5RVZXVNI3/events.json","paper":"https://pith.science/paper/KGNXC235"},"agent_actions":{"view_html":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3","download_json":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3.json","view_paper":"https://pith.science/paper/KGNXC235","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.06361&json=true","fetch_graph":"https://pith.science/api/pith-number/KGNXC235VUWA7QNQY5RVZXVNI3/graph.json","fetch_events":"https://pith.science/api/pith-number/KGNXC235VUWA7QNQY5RVZXVNI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3/action/storage_attestation","attest_author":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3/action/author_attestation","sign_citation":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3/action/citation_signature","submit_replication":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3/action/replication_record"}},"created_at":"2026-05-29T01:05:03.792423+00:00","updated_at":"2026-05-29T01:05:03.792423+00:00"}