{"as_of":"2026-08-12T16:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:39336ca5d81032ab58e30da11ee2ce086e3e6d50798328e55ecd5d1a5912dd66","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:47:07.349753Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2507.13222/citation-record","integrity":"/paper/2507.13222/integrity","json":"/paper/2507.13222/citation-record.json","paper":"/paper/2507.13222"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.253425Z","title":"Computational Complexity: A Modern Approach","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.253425Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:396620d427fb117923096c957b4dc45e0aa3362689a00f4cfc72e6b5d9fb6cd5","observation_id":"a07fc367-b664-491c-8240-2ef8e80f7e21","resolution":{"observed_at":"2026-08-06T16:47:07.253425Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.648141Z","title":"On basing lower-bounds for learning on worst-case assumptions","venue":null,"work_id":"ca8b244f-cdc5-44fb-8ef4-9d858e0479f0","year":2008},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.256534Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:fae880336222c00f133449f569fc399b673805901de9793f358c151f24929f12","observation_id":"157bfbd1-4355-4825-a01a-c6e1126c74ce","resolution":{"observed_at":"2026-08-06T16:47:07.650589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.640374Z","title":"On basing one-way functions on NP -hardness","venue":null,"work_id":"71ae725a-e017-4ac5-a4cf-e6f701f6f578","year":2006},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.259059Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:a6b865e3b342b9a42bfefeef66d45667fcb5c910ba78bd62168361a1a4623d80","observation_id":"9da1c529-3358-4169-97b2-bc074ce1156b","resolution":{"observed_at":"2026-08-06T16:47:07.642846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.632815Z","title":"The design and analysis of computer algorithms","venue":null,"work_id":"3c3e50ab-2aee-481c-9ccc-52fca2306cab","year":1974},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.261500Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:186f58bd86df4418854e1f213d6337451a01044951208f5d7092f500a517b03d","observation_id":"a6be7374-fe7e-4ea5-8580-8e9afb09a8f1","resolution":{"observed_at":"2026-08-06T16:47:07.635338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.625439Z","title":"Trading group theory for randomness","venue":null,"work_id":"4d45ebb9-4ef5-4bc1-91fc-9f620127bbda","year":1985},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.264641Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:b2cbc00173eb33a5db36a513d87d128a7ca13a9f8dec6d2ef066fa6085cab25d","observation_id":"599f7fa3-6afa-467d-a06e-46ac572b62fe","resolution":{"observed_at":"2026-08-06T16:47:07.628319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.618341Z","title":"Reducibility and statistical-computational gaps from secret leakage","venue":null,"work_id":"90bfdf1a-dd19-4def-8836-954ec290b973","year":2020},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.267188Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:69a1f1ee7ca5bc608f4f2a389b7141ab5aaab36f6bbe5b574d9a9e95d3d710df","observation_id":"e1280795-0bcb-4025-b622-75ed506faa15","resolution":{"observed_at":"2026-08-06T16:47:07.620910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.611180Z","title":"Learnability and the Vapnik-Chervonenkis dimension","venue":null,"work_id":"ac186ecb-2805-4ce2-ab7e-1e822add83ab","year":1989},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.270020Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:e61c767a986198f25f82ef435581762d0b84a38f2c04e4237249e717ae6a00d3","observation_id":"d994cae9-9032-4b15-90e3-98f88e6a486a","resolution":{"observed_at":"2026-08-06T16:47:07.613700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.604028Z","title":"Cryptographic primitives based on hard learning problems","venue":null,"work_id":"8a6a4007-170e-4a15-9180-79596d73c797","year":1993},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.272387Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:8f224648e2614adfa5ea9438d3a2638311d0c51d24c286991a132aa39e3eb3f2","observation_id":"64ce7ab0-f9bd-4d85-892d-466b03a77e9b","resolution":{"observed_at":"2026-08-06T16:47:07.606450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.596625Z","title":"Learning boolean functions in an infinite attribute space","venue":null,"work_id":"46081953-e64e-400b-9927-826787ed2c09","year":1990},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.274637Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:bb23e73d7acb241cd2f80b390307509afe2d8683ba2ead3a8768ee3d8c3f0303","observation_id":"bfa78b71-1902-47cf-8e1d-01f85185fdb7","resolution":{"observed_at":"2026-08-06T16:47:07.599226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.589547Z","title":"On worst-case to average-case reductions for NP problems","venue":null,"work_id":"499ad9d0-f696-4d3f-8083-7bbe23813a06","year":2006},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.277023Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:a0185ddb2126c82a11f5d89825d110ba5a478e8e0586f5df625d67d0fb47c8ce","observation_id":"49fd2964-8226-4b6c-bb3a-e65e90b3e874","resolution":{"observed_at":"2026-08-06T16:47:07.592179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.582156Z","title":"The complexity of unique k - SAT : An isolation lemma for k - CNFs","venue":null,"work_id":"6424e975-bd5a-42f8-8229-038e63f5876f","year":2008},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.279227Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:105bd0dd73b64c0d6cfe97767c865f9d2b0fbd28d3b4c7dc513e01ae56eaca76","observation_id":"28f94c20-5329-4c79-9ae2-732cbea3befe","resolution":{"observed_at":"2026-08-06T16:47:07.584940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.575332Z","title":"Randomness conductors and constant-degree lossless expanders","venue":null,"work_id":"62e2bcb5-3734-43b1-80df-eb5352f30b49","year":2002},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.281760Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:a3f5591311b9099b5e35a878140f57be054746694567becbe9c704dfc9999e4f","observation_id":"a21bcc98-9da4-4150-b6ed-93b3deb5a793","resolution":{"observed_at":"2026-08-06T16:47:07.577644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.568299Z","title":"Computational sample complexity","venue":null,"work_id":"341f13bb-9732-40c6-9e1f-36aa37d0435e","year":2000},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.284551Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:cc76242e82e48a4250145c475121f1b81a35576f4471c618a5598dc3db32f055","observation_id":"99a396e0-a570-4765-aa62-2604c1a3ce59","resolution":{"observed_at":"2026-08-06T16:47:07.570698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.561195Z","title":"Exponential time complexity of the Permanent and the Tutte polynomial","venue":null,"work_id":"430e2827-40c5-497e-971b-20c2204f81f7","year":2014},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.287302Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:22e71ee539cdf123ad7c453d788ec56f8f35dcc0d35efb391870466eb2a5ca98","observation_id":"0572db8f-c17c-4cd1-bebb-87148bc27fa2","resolution":{"observed_at":"2026-08-06T16:47:07.563833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.553996Z","title":"More data speeds up training time in learning halfspaces over sparse vectors","venue":null,"work_id":"69141c3e-b9e7-4596-a082-84ea6d5cb7be","year":2013},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.289468Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:70e80cf1ef3d50d8a093160231e52939f015774cdaf7ebd7cfcd05011fc4162e","observation_id":"0981f364-211b-4c2a-bcdb-5ff049c059aa","resolution":{"observed_at":"2026-08-06T16:47:07.556614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.546760Z","title":"From average case complexity to improper learning complexity","venue":null,"work_id":"62a0d41e-ba4b-44dc-9524-c7e6be7ce37d","year":2014},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.291929Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:38d566c9bbb4a81c86012ab7ac1239a0fe708e90be3b7d901a70ae508b99777d","observation_id":"0de6902e-d930-4311-b2a9-64d26fa65f60","resolution":{"observed_at":"2026-08-06T16:47:07.549300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.539870Z","title":"Hardness of proper learning","venue":null,"work_id":"a27abaa0-0ac8-468f-9c12-16b7dbe76fe2","year":2016},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.294267Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:60038014b4a9945a39b297084c6f14909deed77a1201569a3baa379d6c153a54","observation_id":"ebaac334-7a53-4f0c-8944-2faa96a8a72a","resolution":{"observed_at":"2026-08-06T16:47:07.542151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.532603Z","title":"Random-self-reducibility of complete sets","venue":null,"work_id":"98b4fc55-02f7-439d-95bd-7c44e5cb4585","year":1993},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.296643Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:91afa91af94546d8d6e4c2346c8f4b8ab4a663c785f6fc85fcfbb0d95a110d70","observation_id":"29143507-8e5d-4c4e-a131-80f674e842f0","resolution":{"observed_at":"2026-08-06T16:47:07.535075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.525070Z","title":"How to construct random functions","venue":null,"work_id":"8b181215-e6a5-4434-b654-514369d5cff6","year":1986},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.299059Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:60a88dcad68a891b14d607adacbde839a39336cbae084d844847899c2e967e34","observation_id":"d5802820-94d1-4a6b-8323-dacb7b7bac44","resolution":{"observed_at":"2026-08-06T16:47:07.527650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.518114Z","title":"Limited nondeterminism","venue":null,"work_id":"53e0d9a3-6372-463d-b766-842cdfe3b71b","year":1996},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.301521Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:4539e5bffb1ecd01f3bceadf39cd5faeb6aabb0c3a60a3f0d06376654c806561","observation_id":"eee2aa12-794d-4db2-ab03-1936e995daf0","resolution":{"observed_at":"2026-08-06T16:47:07.520523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.509283Z","title":"No better ways to generate hard NP instances than picking uniformly at random","venue":null,"work_id":"3911f4de-b8fd-40a7-ac32-2e0020321092","year":1990},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.303980Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:4761f73bfb2c7f86baa423da5b6d14149c2ddccfef52f1d06a9a2d3ccfe479a7","observation_id":"d74cdf61-277e-4db7-acc7-872ecd2ee1fd","resolution":{"observed_at":"2026-08-06T16:47:07.512643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.501777Z","title":"A personal view of average-case complexity","venue":null,"work_id":"a1c1e820-1aa7-4b9d-b4e5-edfb429e8d0d","year":1995},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.306365Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:bf0127f8d659f6bfc01c0f4d8cfc8bd717da809846b6f158a98cfb8cfcd34fea","observation_id":"e40111d9-a657-469e-ba22-b857c2f244fe","resolution":{"observed_at":"2026-08-06T16:47:07.504223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.494266Z","title":"Machine learning: Trends, perspectives, and prospects","venue":null,"work_id":"76aaa288-f145-4b82-ba48-395bb97591c2","year":2015},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.308661Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:2b5053c54000e803fe935742107c96a8790684369802ed26de33592b69ac3c5b","observation_id":"6d89bcdf-78a7-4ba5-be93-e403b86169e7","resolution":{"observed_at":"2026-08-06T16:47:07.496863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.486107Z","title":"Computations with a restricted number of nondeterministic steps","venue":null,"work_id":"16668c50-1880-4327-95ee-19ed81a6be54","year":1977},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.311119Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:a24fece80aab8e2b2ca8faff215a3258536915e734bf494304fe89d65a4dc57a","observation_id":"40f59845-bcbb-4a1e-9e85-8fd63b3b02d0","resolution":{"observed_at":"2026-08-06T16:47:07.488957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.478226Z","title":"Cryptographic limitations on learning B oolean formulae and finite automata","venue":null,"work_id":"8d66b848-a457-4c2f-8e08-135be0a9a2ed","year":1994},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.313401Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:a36d96a36f5353db225df9fc37988c7405763ad1447a6a8faa1afc50e1ba1080","observation_id":"5fd11ff4-ea02-47c1-ba93-ad521612829c","resolution":{"observed_at":"2026-08-06T16:47:07.480991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.470622Z","title":"Kearns and Umesh Vazirani","venue":null,"work_id":"d9d17aa7-6ed0-41bb-8267-5c5dfaa09641","year":1994},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.315958Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:b717bac980901cc6ea17bc866645aecca2d13088b1cda7fd584bac022926b3cd","observation_id":"e494e091-caf1-4f50-8ec6-c6e7b23760c8","resolution":{"observed_at":"2026-08-06T16:47:07.473380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T16:47:07.318427Z","title":"Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.318427Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:0ff79178ef77c18efc7b520b942f35816c6e3a5f473e384f201b3d109eeeaee8","observation_id":"db3fd5dc-6a37-49af-890a-32056284c0aa","resolution":{"observed_at":"2026-08-06T16:47:07.318427Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.458286Z","title":"From on-line to batch learning","venue":null,"work_id":"42b9eed8-1dee-4ca0-adb0-d1cae0f1693b","year":1989},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.321042Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:67f4be786eaefd96ae29e67215f933ea5d00c5f4a863083d58dc74ff0d0ad04b","observation_id":"4bdacada-f9dd-4e03-937e-a1f2a0f54119","resolution":{"observed_at":"2026-08-06T16:47:07.460810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.450408Z","title":"Some results on relativized deterministic and nondeterministic time hierarchies","venue":null,"work_id":"6cc0b21f-2369-4cdf-8d99-f8dc5f7cd69d","year":1981},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.323859Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:36cc5af8e97536bc78f07cb8768ef85280410312779d27ac798d396c08204ccf","observation_id":"2a9905aa-3573-4e57-a114-073743548b91","resolution":{"observed_at":"2026-08-06T16:47:07.453162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.441918Z","title":"Computational limitations on learning from examples","venue":null,"work_id":"82e0bf5a-8681-439b-8895-a91f6830ae40","year":1988},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.326833Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:93ddd6f289104cc4e84d8efb911676d4048b2da4199ff7620528eef268afd083","observation_id":"3c1a4234-e914-45c0-9648-70716c7cf2dc","resolution":{"observed_at":"2026-08-06T16:47:07.444770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.434243Z","title":"The strength of weak learnability","venue":null,"work_id":"a123541d-8e74-480b-a104-0669d7be073a","year":1990},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.329541Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:5c29c22b6f7f6d4c660d9f8a0b128240c23f66549f9f88173e7362e44b98c943","observation_id":"0246b9ee-5012-4382-abe1-a2497797a008","resolution":{"observed_at":"2026-08-06T16:47:07.436803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.426515Z","title":"Computational sample complexity and attribute-efficient learning","venue":null,"work_id":"2186ce4c-bb1a-403b-9be6-94575cf39b07","year":1999},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.332304Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:f9c7975fd8a6ec1ff7e69c44edacb9db855516bc7d9b01173a5f5bccccb4cc91","observation_id":"c57cab21-8e1e-4007-a7bf-4622075d1d98","resolution":{"observed_at":"2026-08-06T16:47:07.429264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.418691Z","title":"https://simons.berkeley.edu/programs/computational-complexity-statistical-inference , 2021","venue":null,"work_id":"34b1a8b3-ff56-433f-bb3d-219b0076896d","year":2021},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.335353Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:e609d393089064f4028bddb5fb742156a4adc36d09fda0f8e4081e5112b128ba","observation_id":"1d003f71-d516-468f-9108-8d49c6773872","resolution":{"observed_at":"2026-08-06T16:47:07.421466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.410905Z","title":"Expander codes","venue":null,"work_id":"de76b656-bd18-4a0b-8daf-c0f2c65d0110","year":1996},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.337978Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:c8e61b7b10109b427263557683a3d080e5fa49af155e205f8f40f2e02883b39f","observation_id":"4c8f7ad7-237e-44bc-8fe9-bd600566575f","resolution":{"observed_at":"2026-08-06T16:47:07.413690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T16:47:07.340219Z","title":"Understanding Machine Learning: From Theory to Algorithms","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.340219Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:e19e4ce914d9836fd16f5c586cad7c9685442f21ae214fdf205fa17337ff55c4","observation_id":"2ffd9f98-b8b4-41d3-922e-d8911348c384","resolution":{"observed_at":"2026-08-06T16:47:07.340219Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.397890Z","title":"Using more data to speed-up training time","venue":null,"work_id":"c35b327f-61df-4ea3-953d-29f3f77b6bb3","year":2012},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.342565Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:303657d343049e0745e218607bb8ce325b9dd632d2ec327e71d44fdca53994db","observation_id":"c7ab6309-7989-40c5-8287-f3ef262ae7d1","resolution":{"observed_at":"2026-08-06T16:47:07.400471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.389695Z","title":"A theory of the learnable","venue":null,"work_id":"edbb1c41-cea6-4af2-86a5-eac173313fa0","year":1984},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.345090Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:fc54afaf35b1c2b6054873235b862bc23d7fc7ea6a171ace7990ef218ce586d1","observation_id":"79e66f5d-041d-441f-b944-a4009f9f654f","resolution":{"observed_at":"2026-08-06T16:47:07.392093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.381707Z","title":"On the uniform convergence of relative frequencies of events to their probabilities","venue":null,"work_id":"f65fe9ea-22f1-4aeb-812e-3e758a5b1ea5","year":1971},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.347369Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:eecdfef3a2c919301801d5256a21d1e02c0e03af4f6bf1eaca6c8ad7d070cb76","observation_id":"e57d0ee4-67e2-48be-9182-21f3ca4de536","resolution":{"observed_at":"2026-08-06T16:47:07.384358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:07.371376Z","title":"New perspectives on the complexity of computational learning, and other problems in theoretical computer science","venue":null,"work_id":"643e5a24-7084-4ad0-9199-8aaf74240145","year":2009},"citing_paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T16:47:07.349753Z"},"links":{"citing_paper":"/paper/2507.13222"},"observation_digest":"sha256:be6e61c4d490a5383436799fa6315ffa1d8e58ec9b7196f5612c3efa9a7f7bd8","observation_id":"21817c3e-2598-45ff-afe9-f6e318d73644","resolution":{"observed_at":"2026-08-06T16:47:07.376303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.13222","last_updated":"2025-07-17T15:35:36Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-06T16:24:55.802171Z","submitted_at":"2025-07-17T15:35:36Z","title":"Computational-Statistical Tradeoffs from NP-hardness"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":36},"total_outbound_references":39},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2507.13222."}