{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:I4LCLGHGSJXSA66SG7E6U6KWTG","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":"2bd7313f6afe9c3966bc5b46c920840e8f7e25272a0dd57effd76bf2bc9e3f45","cross_cats_sorted":["cs.CR","cs.DM","math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-19T13:53:43Z","title_canon_sha256":"4d85f65bec7dec7f388a02b3e57d3feeaf2798837eedabfdece492d65e8062a0"},"schema_version":"1.0","source":{"id":"2411.12512","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12512","created_at":"2026-07-05T09:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12512v1","created_at":"2026-07-05T09:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12512","created_at":"2026-07-05T09:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"I4LCLGHGSJXS","created_at":"2026-07-05T09:37:44Z"},{"alias_kind":"pith_short_16","alias_value":"I4LCLGHGSJXSA66S","created_at":"2026-07-05T09:37:44Z"},{"alias_kind":"pith_short_8","alias_value":"I4LCLGHG","created_at":"2026-07-05T09:37:44Z"}],"graph_snapshots":[{"event_id":"sha256:e87d1786607e742fdd11c7b8c7315b77224a44a1fb1fe3fd9f7e57929ba932a5","target":"graph","created_at":"2026-07-05T09:37:44Z","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/2411.12512/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a polynomial-time reduction from solving noisy linear equations over $\\mathbb{Z}/q\\mathbb{Z}$ in dimension $\\Theta(k\\log n/\\mathsf{poly}(\\log k,\\log q,\\log\\log n))$ with a uniformly random coefficient matrix to noisy linear equations over $\\mathbb{Z}/q\\mathbb{Z}$ in dimension $n$ where each row of the coefficient matrix has uniformly random support of size $k$. This allows us to deduce the hardness of sparse problems from their dense counterparts. In particular, we derive hardness results in the following canonical settings. 1) Assuming the $\\ell$-dimensional (dense) LWE over a poly","authors_text":"Guy Bresler, Kiril Bangachev, Stefan Tiegel, Vinod Vaikuntanathan","cross_cats":["cs.CR","cs.DM","math.ST","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12512","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:430d0ad0b22ef871044c9a6d5e5c4e42141fb734ac14e12765b5fd587327a668","target":"record","created_at":"2026-07-05T09:37:44Z","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":"2bd7313f6afe9c3966bc5b46c920840e8f7e25272a0dd57effd76bf2bc9e3f45","cross_cats_sorted":["cs.CR","cs.DM","math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-19T13:53:43Z","title_canon_sha256":"4d85f65bec7dec7f388a02b3e57d3feeaf2798837eedabfdece492d65e8062a0"},"schema_version":"1.0","source":{"id":"2411.12512","kind":"arxiv","version":1}},"canonical_sha256":"47162598e6926f207bd237c9ea7956999eda84df8038d95996454b13a66df0ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47162598e6926f207bd237c9ea7956999eda84df8038d95996454b13a66df0ac","first_computed_at":"2026-07-05T09:37:44.283070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:37:44.283070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PTHr3hSLZVEjmyI7W+4J7BXvgNnr67XCUER/4v3bETS2+IrVMGUIE9E2dHdcklNhsXOi6RhQmK1qqz9+8zapCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:37:44.283557Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.12512","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:430d0ad0b22ef871044c9a6d5e5c4e42141fb734ac14e12765b5fd587327a668","sha256:e87d1786607e742fdd11c7b8c7315b77224a44a1fb1fe3fd9f7e57929ba932a5"],"state_sha256":"4cc951a63e2c51ff5435ca2027d8ff897a7a448f411eccc0745b53bbd3d8d0ea"}