{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KGNXC235VUWA7QNQY5RVZXVNI3","short_pith_number":"pith:KGNXC235","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"},"canonical_sha256":"519b716b7dad2c0fc1b0c7635cdead46c2ddd99bdfcfec6259326e89093d5bf9","source":{"kind":"arxiv","id":"2602.06361","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.06361","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2602.06361v2","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06361","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"KGNXC235VUWA","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"KGNXC235VUWA7QNQ","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"KGNXC235","created_at":"2026-05-29T01:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KGNXC235VUWA7QNQY5RVZXVNI3","target":"record","payload":{"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"},"canonical_sha256":"519b716b7dad2c0fc1b0c7635cdead46c2ddd99bdfcfec6259326e89093d5bf9","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"},"source_kind":"arxiv","source_id":"2602.06361","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-29T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EmpKFR2rUEs01A1ZlUNjvlvfdDH4WfcM2fo7aob637Ob3JRMF6cTOk8/7Db9tBPI6hOX2sqA13lv7Kn/R5lyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:46:12.281454Z"},"content_sha256":"71dfaa868e16436134466485d26ce42d73f49fe20c9b29952bc2feed5e4b52d8","schema_version":"1.0","event_id":"sha256:71dfaa868e16436134466485d26ce42d73f49fe20c9b29952bc2feed5e4b52d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KGNXC235VUWA7QNQY5RVZXVNI3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-29T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9AsLsNZNm0KUSagGLMx2qmiFbzWu9iVZHLX+rgqwmrgws+SNOotj6q6InCglJykC9e22Yo/YekRxQ1N3o+qqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:46:12.281877Z"},"content_sha256":"4eff1553d05e1df34c1e5f16542190c0034000c3b254ed0e59da88c540347da8","schema_version":"1.0","event_id":"sha256:4eff1553d05e1df34c1e5f16542190c0034000c3b254ed0e59da88c540347da8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3/bundle.json","state_url":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGNXC235VUWA7QNQY5RVZXVNI3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T02:46:12Z","links":{"resolver":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3","bundle":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3/bundle.json","state":"https://pith.science/pith/KGNXC235VUWA7QNQY5RVZXVNI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGNXC235VUWA7QNQY5RVZXVNI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KGNXC235VUWA7QNQY5RVZXVNI3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bd61505e34f6ff201fee2a4ed415a785ca452feb507cbd12fef9f392cc4661b4","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-06T03:44:40Z","title_canon_sha256":"2f5d582865c277457ca026f1177469f397978b30b90749fe8dd6d00017550c95"},"schema_version":"1.0","source":{"id":"2602.06361","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.06361","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2602.06361v2","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06361","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"KGNXC235VUWA","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"KGNXC235VUWA7QNQ","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"KGNXC235","created_at":"2026-05-29T01:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:4eff1553d05e1df34c1e5f16542190c0034000c3b254ed0e59da88c540347da8","target":"graph","created_at":"2026-05-29T01:05:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.06361/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jonathan Scarlett, Warut Suksompong, Yan Hao Ling, Zihan Li","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-06T03:44:40Z","title":"Envy-Free Allocation of Indivisible Goods via Noisy Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.06361","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:71dfaa868e16436134466485d26ce42d73f49fe20c9b29952bc2feed5e4b52d8","target":"record","created_at":"2026-05-29T01:05:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bd61505e34f6ff201fee2a4ed415a785ca452feb507cbd12fef9f392cc4661b4","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-06T03:44:40Z","title_canon_sha256":"2f5d582865c277457ca026f1177469f397978b30b90749fe8dd6d00017550c95"},"schema_version":"1.0","source":{"id":"2602.06361","kind":"arxiv","version":2}},"canonical_sha256":"519b716b7dad2c0fc1b0c7635cdead46c2ddd99bdfcfec6259326e89093d5bf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"519b716b7dad2c0fc1b0c7635cdead46c2ddd99bdfcfec6259326e89093d5bf9","first_computed_at":"2026-05-29T01:05:03.792277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T01:05:03.792277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4fllA4T2Uw9DnHnxzRF6x5vgfd1uoHvrGvF0S/eYPT09TIYLeawJNY7Bs8cPXFBA/UVo3CJ6OTI6D0/Gj4KoAQ==","signature_status":"signed_v1","signed_at":"2026-05-29T01:05:03.793208Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.06361","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71dfaa868e16436134466485d26ce42d73f49fe20c9b29952bc2feed5e4b52d8","sha256:4eff1553d05e1df34c1e5f16542190c0034000c3b254ed0e59da88c540347da8"],"state_sha256":"de19a20c8328ed4d782f194646c6ec07d24c3ca3f7a050b70912733d52be3fb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tr9a/K2xqWm7SIP271A0ggfSjyyRBBlj2ZB6X0FYZ/jvnvdb7S6DvxcWjYbglSGoU9yKipRTgtwOgohC3Iy0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:46:12.285124Z","bundle_sha256":"a00b736e9799a77fb9311aff438e609e7891e0a038ac7ecaf85947f994308b3f"}}