{"as_of":"2026-08-17T05:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:03a8c0f0b9c098d34e7345cb6148f8288b752fe6931102d337999fd7abb1cca0","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T17:36:43.795826Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:24:23.495397Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T04:24:28.892814Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"cited_work":{"arxiv_id":"2411.12512","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.12512","snapshot_observed_at":"2026-08-07T04:24:28.892814Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","venue":"cs.CC","work_id":"735dd2f3-3379-4043-b1ea-8ba1e21174c2","year":2024},"citing_paper":{"arxiv_id":"2506.10748","last_updated":"2025-06-12T14:35:26Z","snapshot_observed_at":"2026-08-14T18:28:43.937637Z","submitted_at":"2025-06-12T14:35:26Z","title":"Computational Complexity of Statistics: New Insights from Low-Degree Polynomials","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:23.495397Z"},"links":{"cited_paper":"/paper/2411.12512","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:d3908b2dee8205a13fefab144774b86f4ba3c21e5b609678324745bf28808e8b","observation_id":"ac17c1da-afb1-4357-ae43-ec66bac437d3","resolution":{"observed_at":"2026-08-07T04:24:28.896781Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.12512/citation-record","integrity":"/paper/2411.12512/integrity","json":"/paper/2411.12512/citation-record.json","paper":"/paper/2411.12512"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T17:36:43.787225Z","title":"Cryptography from Learning Pa rity with Noise","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"reference_index":342,"source":"pdf_text","source_observed_at":"2026-08-12T17:36:43.787225Z"},"links":{"citing_paper":"/paper/2411.12512"},"observation_digest":"sha256:d7fc238c00e6d0d6745b69c9f562d25843ac0f9005bf08ad460409e3556b5417","observation_id":"6f62d59a-1ea9-4673-a74f-27d8477d21db","resolution":{"observed_at":"2026-08-12T17:36:43.787225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T17:36:43.767609Z","title":"Continuous LWE is as Hard as LWE and Applications to Learning Gaussian Mixtures","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"reference_index":1002,"source":"pdf_text","source_observed_at":"2026-08-12T17:36:43.767609Z"},"links":{"citing_paper":"/paper/2411.12512"},"observation_digest":"sha256:53d6608fef9b95634b011dfaffcc1d8eb690c726b79cc77502b77b0d91b67453","observation_id":"fabd1726-cfd7-4037-bad9-f14a8c418f0c","resolution":{"observed_at":"2026-08-12T17:36:43.767609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3601.18736","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T17:36:43.951646Z","title":"A Time-Space Lower Bound for a Large Class of Lea rning Problems","venue":null,"work_id":"1bad8221-c05f-433b-8648-929c5736c5cd","year":1987},"citing_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"reference_index":1075,"source":"pdf_text","source_observed_at":"2026-08-12T17:36:43.791467Z"},"links":{"citing_paper":"/paper/2411.12512"},"observation_digest":"sha256:dcaf771176fbfa55140c82db386c8f22de4ab5699c528d57c255c8a08f2fc3f6","observation_id":"7e131bbe-a04e-4181-81b1-c8a5a2922ac5","resolution":{"observed_at":"2026-08-12T17:36:43.958241Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.06996","last_updated":"2024-10-10T02:15:15Z","snapshot_observed_at":"2026-08-16T16:08:50.248371Z","submitted_at":"2022-12-14T03:05:09Z","title":"Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.06996","snapshot_observed_at":"2026-08-12T17:36:43.772362Z","title":"Hardness of SIS a nd LWE with Small Parameters","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"reference_index":1566,"source":"pdf_text","source_observed_at":"2026-08-12T17:36:43.772362Z"},"links":{"cited_paper":"/paper/2212.06996","citing_paper":"/paper/2411.12512"},"observation_digest":"sha256:5fbf080109b253565689040bcaf35846bebc9852937857216351fc204e14688e","observation_id":"831d9079-61df-44b9-b550-b40097c400f2","resolution":{"observed_at":"2026-08-12T17:36:43.772362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-45708-919","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T17:36:43.825722Z","title":"An improved algorithm for learning sparse parities in the presence of noise","venue":null,"work_id":"72dffd16-52e6-48be-9eb2-414bfadac53d","year":2021},"citing_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-12T17:36:43.795826Z"},"links":{"citing_paper":"/paper/2411.12512"},"observation_digest":"sha256:e0a2bd6702b7f8166ce4959a14c491925b0068b7201c715b78f1ac437e29c67d","observation_id":"0d3422fd-1c6f-4905-997f-89858e37aebc","resolution":{"observed_at":"2026-08-12T17:36:43.832265Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08135","last_updated":"2023-04-17T10:38:08Z","snapshot_observed_at":"2026-08-16T15:39:57.805068Z","submitted_at":"2023-04-17T10:38:08Z","title":"Detection of Dense Subhypergraphs by Low-Degree Polynomials","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08135","snapshot_observed_at":"2026-08-12T17:36:43.756866Z","title":"From local pseudorandom gener ators to hardness of learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-12T17:36:43.756866Z"},"links":{"cited_paper":"/paper/2304.08135","citing_paper":"/paper/2411.12512"},"observation_digest":"sha256:e025dde8ee225a81a095c5e4e39e9815c82bf01c0750d7ff057e2671a98da8b3","observation_id":"85fa3172-cdd2-431f-a6be-0d3d1977fc09","resolution":{"observed_at":"2026-08-12T17:36:43.756866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T17:36:43.782638Z","title":"Public-key cryptosystems from the w orst-case shortest vector problem: ex- tended abstract","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-12T17:36:43.782638Z"},"links":{"citing_paper":"/paper/2411.12512"},"observation_digest":"sha256:c3292ac13bd83315da8eaef20b7a7c4638122ca1b4b324207532576778d80e3d","observation_id":"13752d00-8cb9-4093-92cd-c4e9942a4f92","resolution":{"observed_at":"2026-08-12T17:36:43.782638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0270.36005","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T17:36:44.262929Z","title":"Mult i-party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN","venue":null,"work_id":"ca3b2cde-45c6-4332-a1e2-9f1c22727398","year":2022},"citing_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-12T17:36:43.751899Z"},"links":{"citing_paper":"/paper/2411.12512"},"observation_digest":"sha256:1be4e113647cbf97a7e0d3596aaf0977e7dfa4aeb97cb98fadb72914e2ea8633","observation_id":"b8d6b243-9906-422f-864a-973e5a659767","resolution":{"observed_at":"2026-08-12T17:36:44.269438Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T17:36:43.763012Z","title":"Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-12T17:36:43.763012Z"},"links":{"citing_paper":"/paper/2411.12512"},"observation_digest":"sha256:df022b56f40ade1e0e269b2ea0e2edd7c36fa804beaebd1b5277f04e6557fa01","observation_id":"9ae4780c-b4a5-4f8f-a39b-a871d3608a21","resolution":{"observed_at":"2026-08-12T17:36:43.763012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.00289","last_updated":"2025-04-24T17:02:02Z","snapshot_observed_at":"2026-08-16T14:46:58.865566Z","submitted_at":"2023-11-01T04:41:16Z","title":"Precise Error Rates for Computationally Efficient Testing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.00289","snapshot_observed_at":"2026-08-12T17:36:43.778071Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-12T17:36:43.778071Z"},"links":{"cited_paper":"/paper/2311.00289","citing_paper":"/paper/2411.12512"},"observation_digest":"sha256:d31712e8a27948c3f48cf2007701e380e76e1abf2291a1e832c52fb714076dbc","observation_id":"8e696cab-53ee-4a3a-876c-69de0542c6f4","resolution":{"observed_at":"2026-08-12T17:36:43.778071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":10},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 1 inbound Pith citation observation for arXiv:2411.12512."}