{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IKG4W2ROWG2TGA6QFDJJ5TDXPO","short_pith_number":"pith:IKG4W2RO","schema_version":"1.0","canonical_sha256":"428dcb6a2eb1b53303d028d29ecc777ba69e4afe161342d0093b3442764d4baf","source":{"kind":"arxiv","id":"2605.19625","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.19625","created_at":"2026-05-20T01:05:54.771506+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19625v1","created_at":"2026-05-20T01:05:54.771506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19625","created_at":"2026-05-20T01:05:54.771506+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKG4W2ROWG2T","created_at":"2026-05-20T01:05:54.771506+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKG4W2ROWG2TGA6Q","created_at":"2026-05-20T01:05:54.771506+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKG4W2RO","created_at":"2026-05-20T01:05:54.771506+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/IKG4W2ROWG2TGA6QFDJJ5TDXPO","json":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO.json","graph_json":"https://pith.science/api/pith-number/IKG4W2ROWG2TGA6QFDJJ5TDXPO/graph.json","events_json":"https://pith.science/api/pith-number/IKG4W2ROWG2TGA6QFDJJ5TDXPO/events.json","paper":"https://pith.science/paper/IKG4W2RO"},"agent_actions":{"view_html":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO","download_json":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO.json","view_paper":"https://pith.science/paper/IKG4W2RO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19625&json=true","fetch_graph":"https://pith.science/api/pith-number/IKG4W2ROWG2TGA6QFDJJ5TDXPO/graph.json","fetch_events":"https://pith.science/api/pith-number/IKG4W2ROWG2TGA6QFDJJ5TDXPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO/action/storage_attestation","attest_author":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO/action/author_attestation","sign_citation":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO/action/citation_signature","submit_replication":"https://pith.science/pith/IKG4W2ROWG2TGA6QFDJJ5TDXPO/action/replication_record"}},"created_at":"2026-05-20T01:05:54.771506+00:00","updated_at":"2026-05-20T01:05:54.771506+00:00"}