{"as_of":"2026-08-15T06:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:451ccea1a37ae0bcf08d66ff05c96e27164f0c0253ae6bfbe66726df803f2570","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T17:36:43.772362Z","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-10T20:34:04.273633Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.06996","last_updated":"2024-10-10T02:15:15Z","snapshot_observed_at":"2026-08-13T13:22:24.180147Z","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:8e659d085a77fe30273ede8eb0e2d4a7ef4b4c9cde9908f2b14a1426022cf26e","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":{"arxiv_id":"2212.06996","last_updated":"2024-10-10T02:15:15Z","snapshot_observed_at":"2026-08-13T13:22:24.180147Z","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":"2212.06996","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.06996","snapshot_observed_at":"2026-08-10T20:34:04.273633Z","title":"Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation","venue":"math.ST","work_id":"a49ee913-5608-4136-af83-9cf30f853c8f","year":2022},"citing_paper":{"arxiv_id":"2501.07975","last_updated":"2025-01-14T09:48:48Z","snapshot_observed_at":"2026-08-15T05:06:36.623115Z","submitted_at":"2025-01-14T09:48:48Z","title":"Some observations on the ambivalent role of symmetries in Bayesian inference problems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T20:34:04.065655Z"},"links":{"cited_paper":"/paper/2212.06996","citing_paper":"/paper/2501.07975"},"observation_digest":"sha256:fd3c7c6cc57ff57fbb9eef10231c5489ded9c6549d759b85f44ea7a01eca5ea2","observation_id":"e42c3990-21f3-4f3c-939e-87dd1a35884a","resolution":{"observed_at":"2026-08-10T20:34:04.276743Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2212.06996/citation-record","integrity":"/paper/2212.06996/integrity","json":"/paper/2212.06996/citation-record.json","paper":"/paper/2212.06996"},"outbound":[],"paper":{"arxiv_id":"2212.06996","last_updated":"2024-10-10T02:15:15Z","latest_version":2,"primary_category":"math.ST","snapshot_observed_at":"2026-08-13T13:22:24.180147Z","submitted_at":"2022-12-14T03:05:09Z","title":"Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2212.06996."}