{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IKG4W2ROWG2TGA6QFDJJ5TDXPO","short_pith_number":"pith:IKG4W2RO","canonical_record":{"source":{"id":"2605.19625","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-19T10:04:37Z","cross_cats_sorted":[],"title_canon_sha256":"af51f91431518aa1a0f91dd1a5fcd0844168491c6eb533845ce0ccdef3fbb226","abstract_canon_sha256":"660d29f9a18a610e58fcd02aefdbd57682b2de75cc741a8cd497aff8ab5f1e45"},"schema_version":"1.0"},"canonical_sha256":"428dcb6a2eb1b53303d028d29ecc777ba69e4afe161342d0093b3442764d4baf","source":{"kind":"arxiv","id":"2605.19625","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19625","created_at":"2026-05-20T01:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19625v1","created_at":"2026-05-20T01:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19625","created_at":"2026-05-20T01:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"IKG4W2ROWG2T","created_at":"2026-05-20T01:05:54Z"},{"alias_kind":"pith_short_16","alias_value":"IKG4W2ROWG2TGA6Q","created_at":"2026-05-20T01:05:54Z"},{"alias_kind":"pith_short_8","alias_value":"IKG4W2RO","created_at":"2026-05-20T01:05:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IKG4W2ROWG2TGA6QFDJJ5TDXPO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.19625","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-19T10:04:37Z","cross_cats_sorted":[],"title_canon_sha256":"af51f91431518aa1a0f91dd1a5fcd0844168491c6eb533845ce0ccdef3fbb226","abstract_canon_sha256":"660d29f9a18a610e58fcd02aefdbd57682b2de75cc741a8cd497aff8ab5f1e45"},"schema_version":"1.0"},"canonical_sha256":"428dcb6a2eb1b53303d028d29ecc777ba69e4afe161342d0093b3442764d4baf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:54.772052Z","signature_b64":"rPNE9ZEEDXrG4/RZtVBe+fReh71DUi6I2AqTN+iX29BTj291rJbkyckUdo+8bfEnXCJlju3qqvER4R0y5Gb3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428dcb6a2eb1b53303d028d29ecc777ba69e4afe161342d0093b3442764d4baf","last_reissued_at":"2026-05-20T01:05:54.771397Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:54.771397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.19625","source_version":1,"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-20T01:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zdUOov8mpfL1RGz/zYcn4imTtQ20SBjAor+78K4ZKIvE9XapvIsm6/6NhZvdIaEag6iOQCfy1+wzzEUF7W8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:01:26.981310Z"},"content_sha256":"8777435d814aaa347f8630a0d255dfb20b77a8b883583e59ca137afda373c68a","schema_version":"1.0","event_id":"sha256:8777435d814aaa347f8630a0d255dfb20b77a8b883583e59ca137afda373c68a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IKG4W2ROWG2TGA6QFDJJ5TDXPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Reconstruction from Linear Queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elizaveta Nesterova, Shay Moran, Yuval Filmus","submitted_at":"2026-05-19T10:04:37Z","abstract_excerpt":"We study the problem of reconstructing an unknown point in $\\mathbb{R}^d$ from approximate linear queries. This setting arises naturally in applications ranging from low-dimensional remote sensing and signal recovery to high-dimensional data analysis and privacy-sensitive inference. Our main goal is to characterize the optimal reconstruction error as a function of the number of queries $T$, the ambient dimension $d$, and the noise parameter $\\delta$.\n  We first analyze the limit $T \\to \\infty$ and show that the optimal reconstruction error converges to the explicit value $\\sqrt{2d/(d+1)} \\delt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19625","kind":"arxiv","version":1},"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/2605.19625/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-20T01:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X090w2PrO86+TsmM2klAZBmdvdADUh5darU+GgXxDQksTUS5MT5wDBRqs+YbhL3bbZtwTU3z+O2IVpdrnIMgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:01:26.981689Z"},"content_sha256":"d75f6faa1ef7d4812a0ec1526c989fe10b1b04caff7015993ecbd3c6161b58e5","schema_version":"1.0","event_id":"sha256:d75f6faa1ef7d4812a0ec1526c989fe10b1b04caff7015993ecbd3c6161b58e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO/bundle.json","state_url":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO/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-01T05:01:26Z","links":{"resolver":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO","bundle":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO/bundle.json","state":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IKG4W2ROWG2TGA6QFDJJ5TDXPO","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":"660d29f9a18a610e58fcd02aefdbd57682b2de75cc741a8cd497aff8ab5f1e45","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-19T10:04:37Z","title_canon_sha256":"af51f91431518aa1a0f91dd1a5fcd0844168491c6eb533845ce0ccdef3fbb226"},"schema_version":"1.0","source":{"id":"2605.19625","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19625","created_at":"2026-05-20T01:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19625v1","created_at":"2026-05-20T01:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19625","created_at":"2026-05-20T01:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"IKG4W2ROWG2T","created_at":"2026-05-20T01:05:54Z"},{"alias_kind":"pith_short_16","alias_value":"IKG4W2ROWG2TGA6Q","created_at":"2026-05-20T01:05:54Z"},{"alias_kind":"pith_short_8","alias_value":"IKG4W2RO","created_at":"2026-05-20T01:05:54Z"}],"graph_snapshots":[{"event_id":"sha256:d75f6faa1ef7d4812a0ec1526c989fe10b1b04caff7015993ecbd3c6161b58e5","target":"graph","created_at":"2026-05-20T01:05:54Z","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/2605.19625/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of reconstructing an unknown point in $\\mathbb{R}^d$ from approximate linear queries. This setting arises naturally in applications ranging from low-dimensional remote sensing and signal recovery to high-dimensional data analysis and privacy-sensitive inference. Our main goal is to characterize the optimal reconstruction error as a function of the number of queries $T$, the ambient dimension $d$, and the noise parameter $\\delta$.\n  We first analyze the limit $T \\to \\infty$ and show that the optimal reconstruction error converges to the explicit value $\\sqrt{2d/(d+1)} \\delt","authors_text":"Elizaveta Nesterova, Shay Moran, Yuval Filmus","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-19T10:04:37Z","title":"Optimal Reconstruction from Linear Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19625","kind":"arxiv","version":1},"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:8777435d814aaa347f8630a0d255dfb20b77a8b883583e59ca137afda373c68a","target":"record","created_at":"2026-05-20T01:05:54Z","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":"660d29f9a18a610e58fcd02aefdbd57682b2de75cc741a8cd497aff8ab5f1e45","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-19T10:04:37Z","title_canon_sha256":"af51f91431518aa1a0f91dd1a5fcd0844168491c6eb533845ce0ccdef3fbb226"},"schema_version":"1.0","source":{"id":"2605.19625","kind":"arxiv","version":1}},"canonical_sha256":"428dcb6a2eb1b53303d028d29ecc777ba69e4afe161342d0093b3442764d4baf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"428dcb6a2eb1b53303d028d29ecc777ba69e4afe161342d0093b3442764d4baf","first_computed_at":"2026-05-20T01:05:54.771397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:54.771397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rPNE9ZEEDXrG4/RZtVBe+fReh71DUi6I2AqTN+iX29BTj291rJbkyckUdo+8bfEnXCJlju3qqvER4R0y5Gb3AA==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:54.772052Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19625","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8777435d814aaa347f8630a0d255dfb20b77a8b883583e59ca137afda373c68a","sha256:d75f6faa1ef7d4812a0ec1526c989fe10b1b04caff7015993ecbd3c6161b58e5"],"state_sha256":"d0e8c2108754d6117300a3a97fa3421a6ee00b8e4a753ca7ae2e1e75b6203ff7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KNxVGJvCDM8MoAG61SUsYqaLinDVdmFtXC2XgsNhKDm90/WeZ6Gd99PQCTwk4DNPYzNHJu627BsndrnqgePVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:01:26.983512Z","bundle_sha256":"0fa080cfbbb81b359f4e56ae4231fe87a036c669f8cfdd7340f5914f0e161ded"}}