{"as_of":"2026-08-15T09:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:da65ce90b54669911292a90552420d013ed92a085df84a290815c29193e5585e","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T01:05:50.645155Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.05834/citation-record","integrity":"/paper/2606.05834/integrity","json":"/paper/2606.05834/citation-record.json","paper":"/paper/2606.05834"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.10056","last_updated":"2026-05-12T03:03:30Z","snapshot_observed_at":"2026-08-13T16:16:09.873927Z","submitted_at":"2026-05-11T06:34:37Z","title":"Hardness Amplification for (Sparse) LPN","version":2},"cited_work":{"arxiv_id":"2605.10056","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.10056","snapshot_observed_at":"2026-07-02T13:46:58.831535Z","title":"Hardness Amplification for (Sparse) LPN","venue":"cs.CR","work_id":"4735249a-fa58-40c9-9da8-9e1f483b53d6","year":2026},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"cited_paper":"/paper/2605.10056","citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:0c84e08149d899d255b715c928f02eedc37be0f7481aec7e2c790ea9eb0e2704","observation_id":"254d1df3-2a90-4b0d-8919-2ac7a64a0031","resolution":{"observed_at":"2026-07-02T13:46:58.833143Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sfcs","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T06:04:34.519622Z","title":"Simplified and improved resolution lower bounds","venue":null,"work_id":"3e0fb018-e1e5-4f24-bd61-1505d886731c","year":1995},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:47fc1aaef7fe3282f5645ea126bfc3b37b947dd05478e3f6128e236b243238e0","observation_id":"5e6fa5f6-abb0-48e8-afda-98378f5e2b0a","resolution":{"observed_at":"2026-06-28T01:11:28.456669Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2026","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"23,doi:10.4230/LIPICS.ITCS.2026.23","venue":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)","work_id":"c301f5fe-123a-4f1c-8008-aec4a32045a5","year":2026},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:6b1dec5ed8f2a84b149e4e5f13946bf43bb4949e226cbc58b412a7fab61bb292","observation_id":"59abfa8a-59e6-45b2-a2cc-590b8239274c","resolution":{"observed_at":"2026-06-28T01:11:28.461385Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-48329-2_24","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"14 [BJMM12] Anja Becker, Antoine Joux, Alexander May, and Alexander Meurer","venue":"Lecture notes in computer science","work_id":"13c35c05-536f-4c83-b489-bf0017f80a45","year":2012},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:ac252f8840b9209fa51fb1bd8b706fc900ff48b669412f8fc3bc43b48a982134","observation_id":"68eb7646-e8bf-4a58-9b19-fefb43ae09bb","resolution":{"observed_at":"2026-06-28T01:11:28.458692Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-29011-4_31","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.1007/978-3-642-29011-4_31","venue":"Lecture notes in computer science","work_id":"1cc4933d-97a1-4974-9953-f5343e40a267","year":null},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:eace1f708afb3d476ea51741aa728bc382b3ea3bd2cf82e5ff5b93951d224b96","observation_id":"d937a56f-876f-4465-85c9-96cc16f931a2","resolution":{"observed_at":"2026-06-28T01:11:28.460601Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T01:05:50.645155Z","title":"Worst-case hardness for LPN and cryptographic hashing via code smoothing","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:48da589b0e31ed05b9f6acff7dc5ca5edf702afeea7350d4e0479c5025b4851d","observation_id":"a60449b6-4907-4d94-9fd5-9912e6e09299","resolution":{"observed_at":"2026-06-28T01:05:50.645155Z","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-06-28T01:05:50.645155Z","title":"[BM17] Leif Both and Alexander May","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:5551e9a8aed7e82a6181a7d19f1ca20218c8b053a01c3513e12557fd18046c5f","observation_id":"87f2decc-05e8-41e2-bddb-afd0faa745ef","resolution":{"observed_at":"2026-06-28T01:05:50.645155Z","resolver_source":null,"status":"malformed_identifier"},"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-06-28T01:05:50.645155Z","title":"[BM18] Leif Both and Alexander May","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:6e682ecd761fb721035c46d08adc098fdbd22bf41a1c1d4bd7273dfb110d6388","observation_id":"e1b09c0a-8a98-424a-9fb1-02e29741dec5","resolution":{"observed_at":"2026-06-28T01:05:50.645155Z","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/978-3-319-79063-3_2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.1007/978-3-319-79063-3_2","venue":"Lecture notes in computer science","work_id":"e5e9e7e8-4b57-4ef7-809d-949b6ce8a692","year":2023},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:617f797e60cdbef8438ec2fbfb3f5f460e6cf7041977b9c7d6297fbd1a882dd6","observation_id":"e7d73bc4-4ba0-4242-8587-51b4c08ebe68","resolution":{"observed_at":"2026-06-28T01:11:28.479837Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-58754-2_6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[DR25] Thomas Debris-Alazard and Nicolas Resch","venue":"Lecture notes in computer science","work_id":"b4b17ec2-3502-4eba-b48f-cf1768dde77d","year":2025},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:72a672f5e5c374e2da9e573bf98b8a74494dc0bc56f02e6bbefe938c34d44b58","observation_id":"b18d8c77-1640-46f6-9dbd-2e8c813fb80d","resolution":{"observed_at":"2026-06-28T01:11:28.477351Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-91823-0_","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T01:11:28.480400Z","title":null,"venue":null,"work_id":"ac7e362e-87c1-4fa1-bb9e-6f25417ad9d6","year":null},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:e0eec26454e2850c29b9a51d61530155cc5dbe7543a5475b061418c33862fdf9","observation_id":"98308c39-5ea2-4415-908c-2dca9994ca74","resolution":{"observed_at":"2026-06-28T01:11:28.481650Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11538462_32","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem","venue":"Lecture notes in computer science","work_id":"25500b16-2efb-40c8-a3bc-253d42ea3648","year":2005},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:e23f8949bd7a492194dbb2b018c8a929084a9c6c6fba6428df305a6a19e17dd5","observation_id":"fbf7aeb8-d213-4878-b655-196dd9cdb96e","resolution":{"observed_at":"2026-06-28T01:11:28.483769Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-22792-9_26","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[MMT11] Alexander May, Alexander Meurer, and Enrico Thomae","venue":"Lecture notes in computer science","work_id":"c64e1cb5-a1d3-4a0d-93c5-668f65942da8","year":2011},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:44013cde506ed53d03699290010b853f77440f5e09cad2003ce01d8f25fd98e7","observation_id":"71b50f4b-d039-4ee5-ab7d-e7facc0d415d","resolution":{"observed_at":"2026-06-28T01:11:28.485429Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-25385-0_6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.1007/978-3-642-25385-0_6","venue":"Lecture notes in computer science","work_id":"c198c086-2b96-4f34-a4d3-55b6d898dfb3","year":2015},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:745d03f3854b9b052d56f773274d4c550da809f5e56d1421599255db7210d362","observation_id":"e1d0049f-fb09-4e67-bd8a-2c0daa4f0c8e","resolution":{"observed_at":"2026-06-28T01:11:28.489341Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-46800-5_9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[PB25] Madhura Pathegama and Alexander Barg","venue":"Lecture notes in computer science","work_id":"ec202021-475e-416c-886c-70c9fc803fc4","year":null},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:bd01491b8763d546933e52d642830915a0b87c4b9891273c4c361466504805d1","observation_id":"6c5a8abf-c4cf-4143-85ee-d636331715ae","resolution":{"observed_at":"2026-06-28T01:11:28.487595Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10623-025-01617-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[Pei09] Chris Peikert","venue":"Designs Codes and Cryptography","work_id":"eddc47db-715b-4d4e-9e51-e26cde4fdfc1","year":null},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:8e041071e0fa56fcb2a427d301ec035e505b22883a554645bf7b76eac961a3f7","observation_id":"cc5fa87b-a01a-4e1c-9316-d94294022389","resolution":{"observed_at":"2026-06-28T01:11:28.465678Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6414.153646","doi":"10.1145/1536414.1536461","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing , pages =","venue":null,"work_id":"dc08bb8d-dfc2-40ec-81f3-accd722f0087","year":2009},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:26b52fea7644d42a11f65ab61fbda0ddb60d95bb0d7a778e433e9ed9c9d1ba2f","observation_id":"f1fb9db0-6078-4f83-b254-c0fdc9530dc2","resolution":{"observed_at":"2026-06-28T01:11:28.488373Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1962.105777","doi":"10.1109/tit.1962.1057777","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"semanticscholar.org/CorpusID:8357564","venue":"IEEE Transactions on Information Theory","work_id":"216d8767-0f52-4cc7-8e18-80a85282cef9","year":1962},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:ebdaae0825f543c047ebebc3cf6ba830fe69b6afdd42a35a4e2439a4b7ba8efc","observation_id":"0d85b6d7-534a-498b-a296-5912e589babc","resolution":{"observed_at":"2026-06-28T01:11:28.473702Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0019850","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A method for finding codewords of small weight","venue":"Lecture notes in computer science","work_id":"a8ceb118-dcec-44de-b33f-90c556825bdd","year":1989},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:b20974650bec1ca23236f402a88bcc2f482583cf26965ca1ad040088ba4f6e60","observation_id":"0c277516-bb15-440f-8445-7fc46dd49e5c","resolution":{"observed_at":"2026-06-28T01:11:28.483606Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-53018-4_9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[YZ21] Yu Yu and Jiang Zhang","venue":"Lecture notes in computer science","work_id":"4d7ec9a2-0965-443a-8a92-559771dd3501","year":2021},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:07dd0bf4a5d62a60f45c9ef405c3d83dc0ecbb81bb966812e4bb9a4d2879dddb","observation_id":"b2bf887c-02a3-45c2-85f5-397b51f06b08","resolution":{"observed_at":"2026-06-28T01:11:28.468293Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-84252-9_16","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Deferred Proof Fact 2.1.(Piling Up Lemma).LetX 1, X2,","venue":"Lecture notes in computer science","work_id":"ec9c3a55-09c8-42b0-aeac-bfd1cad66989","year":null},"citing_paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T01:05:50.645155Z"},"links":{"citing_paper":"/paper/2606.05834"},"observation_digest":"sha256:fbd9722d8b79f47962ce14a35bbbf90bc7782a9446911be12e0f587ef2835c86","observation_id":"94aa2e75-635d-4af7-9c6b-49f5d09a4740","resolution":{"observed_at":"2026-06-28T01:11:28.490575Z","resolver_source":"doi","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"}}],"paper":{"arxiv_id":"2606.05834","last_updated":"2026-06-04T08:11:23Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:11:23Z","title":"Towards Worst-case Hardness for Low-Noise LPN"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":2,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":2,"verified_exact":15,"verified_fuzzy":0},"total_outbound_references":21},"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 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2606.05834."}