{"as_of":"2026-08-07T15:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00b547bf0359dc66ea97bb5eb6aa1b1c145308647eba60d34334a94bec7d8cfa","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T05:01:02.359502Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2602.03970/citation-record","integrity":"/paper/2602.03970/integrity","json":"/paper/2602.03970/citation-record.json","paper":"/paper/2602.03970"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-03T05:00:54.730434Z","title":"Gpt-4 technical report.arXiv preprint arXiv:2303.08774, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:54.730434Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:6c0721ae05e38e799f8e6b501f588c0910caba9928cd1c67124e9d1c7d7902fa","observation_id":"1b6ad20a-543d-4b97-a2b7-6ab9004bcbb8","resolution":{"observed_at":"2026-08-03T05:00:54.730434Z","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-03T05:00:54.824321Z","title":"The statistical analysis of compositional data.Journal of the Royal Statistical Society: Series B (Methodological), 44(2):139–160, 1982","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:54.824321Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:6eb90207b8ff5b1218741754daad054726eda1e3d0fa8aa7b2e1bfc9bdf32ae1","observation_id":"a3ae3b96-3888-4d31-8953-ca14d1e5f950","resolution":{"observed_at":"2026-08-03T05:00:54.824321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1610.01644","last_updated":"2018-11-22T23:40:00Z","snapshot_observed_at":"2026-07-06T05:13:30.860932Z","submitted_at":"2016-10-05T20:59:01Z","title":"Understanding intermediate layers using linear classifier probes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1610.01644","snapshot_observed_at":"2026-08-03T05:00:54.907724Z","title":"Understanding intermediate layers using linear classifier probes.arXiv preprint arXiv:1610.01644, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:54.907724Z"},"links":{"cited_paper":"/paper/1610.01644","citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:ce6a3f0101ecd089a820ef340cd2cfe99c6132e09e2ad7ddf66d64d31cf9c9c7","observation_id":"0af79a6e-3b15-499c-8465-28e4b7c6cabf","resolution":{"observed_at":"2026-08-03T05:00:54.907724Z","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-03T05:00:54.992823Z","title":"Self-RAG: Learning to retrieve, generate, and critique through self-reflection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:54.992823Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:e475257e08340ed6233ba2733d789cffeeca8ff617d5e106baf71d91a00e68c1","observation_id":"f7319d65-375a-4f5c-8246-96dbfd9f1725","resolution":{"observed_at":"2026-08-03T05:00:54.992823Z","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-03T05:00:55.057880Z","title":"Plongements Lipschitziens dansR n.Bulletin de la Soci´ et´ e Math´ ematique de France, 111:429– 448, 1983","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:55.057880Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:2dcd5ebe459f581b383824256537bb41c2eb04b7067e38b1acd21936f00f1330","observation_id":"db883630-d526-4241-b091-2f36bdfecc30","resolution":{"observed_at":"2026-08-03T05:00:55.057880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15118","last_updated":"2025-02-21T00:40:22Z","snapshot_observed_at":"2026-07-06T20:40:10.731339Z","submitted_at":"2025-02-21T00:40:22Z","title":"Do we really need the Rademacher complexities?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15118","snapshot_observed_at":"2026-08-03T05:00:55.259789Z","title":"Do we really need the Rademacher complexities?arXiv preprint arXiv:2502.15118, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:55.259789Z"},"links":{"cited_paper":"/paper/2502.15118","citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:8efeba9ee83afd75b08e06f2449a575501a9719a72ce2381587e0be8cc6d4d4b","observation_id":"e41442ad-2089-4fe2-8d1a-5211f4c68f3d","resolution":{"observed_at":"2026-08-03T05:00:55.259789Z","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-03T05:00:55.443747Z","title":"Uniform mean estimation via generic chaining.arXiv preprint arXiv:2502.15116, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:55.443747Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:091dc83e9f9e679aad2a8efe08e507a18d3446af3fa7d2bad011b6550e5c234d","observation_id":"3fc4fb83-e97f-4d10-9e70-2620f1c8efe0","resolution":{"observed_at":"2026-08-03T05:00:55.443747Z","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-03T05:00:55.618562Z","title":"Local rademacher complexities.The Annals of Statistics, 33(4):1497–1537, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:55.618562Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:19cce62b944278996e09ae7ec4ead1ef344764983614fbf96a82548ea7d86017","observation_id":"3d07bbcc-118d-42f0-8141-d53b11543ac2","resolution":{"observed_at":"2026-08-03T05:00:55.618562Z","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-03T05:00:55.770759Z","title":"Rademacher and gaussian complexities: Risk bounds and structural results.Journal of machine learning research, 3(Nov):463–482, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:55.770759Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:28dc0ed0ef53c4bad17da1eb3a42e986762c89d6e1d5390a23150bb6da6fd366","observation_id":"95d8249c-64e4-418f-a180-f73077074015","resolution":{"observed_at":"2026-08-03T05:00:55.770759Z","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-03T05:00:55.872023Z","title":"Network dissection: Quantifying interpretability of deep visual representations","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:55.872023Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:b17886778e9bb5d273d720c9416dd5c9ed38bad543398eaddc3fc24368e40d95","observation_id":"8730b3ed-4e0a-4b3d-b0d1-45fac8c54e83","resolution":{"observed_at":"2026-08-03T05:00:55.872023Z","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-03T05:00:55.993856Z","title":"Minimalstellen von funktionen und extremalpunkte.Archiv der Mathematik, 9(4):389–393, 1958","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:55.993856Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:e4ca19bc740ff9874387cffa4df60b1424e5938a11c150ae74a827a1435ac6e0","observation_id":"13324ef2-a2c3-429c-9b33-8028b38c8e8f","resolution":{"observed_at":"2026-08-03T05:00:55.993856Z","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-03T05:00:56.097027Z","title":"Square-root lasso: pivotal recovery of sparse signals via conic programming.Biometrika, 98(4):791–806, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:56.097027Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:54e3906cdd0a77e3deaef45097da0744bad2035a7d2a5f60c8335d586e12300b","observation_id":"dca76bf2-b502-4ac6-8f85-fb13a7b97d7f","resolution":{"observed_at":"2026-08-03T05:00:56.097027Z","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-03T05:00:56.199217Z","title":"Managing extreme AI risks amid rapid progress.Science, 384(6698):842–845, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:56.199217Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:94c96e0e784686b0592588004af0f45ce254b0fd3ab7af0e3299a2ea309d7a90","observation_id":"ef47b9e0-b512-4289-8a5a-9e3957b255d9","resolution":{"observed_at":"2026-08-03T05:00:56.199217Z","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-03T05:00:56.291513Z","title":"Neural algorithmic reasoning with causal regularisation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:56.291513Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:2556abc627e22d2ec33fabd20c0ce01949eb96ca6ab668add39dab887487c2c7","observation_id":"aa5c0a48-1a97-4846-b1c3-fd09bad1792a","resolution":{"observed_at":"2026-08-03T05:00:56.291513Z","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-03T05:00:56.361809Z","title":"Learnability and the Vapnik- Chervonenkis dimension.Journal of the ACM (JACM), 36(4):929–965, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:56.361809Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:d8fa4c31f46131bb1b77f26219f5fbe4929a0b26bd9930c3d741142e4266ed20","observation_id":"03865343-e669-46a8-bdd1-8ebeaa083de0","resolution":{"observed_at":"2026-08-03T05:00:56.361809Z","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-03T05:00:56.435407Z","title":"Oxford University Press, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:56.435407Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:b777d02c60d90cfb84840931a62afb8b93e45ce9df5c8262beec7c02a3884aed","observation_id":"37139608-cf7c-4adf-ba4c-e506adb76b1b","resolution":{"observed_at":"2026-08-03T05:00:56.435407Z","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-03T05:00:56.625575Z","title":"A universal uniform approximation theorem for neural networks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:56.625575Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:0787d8171f68e287ccd6d1542b3609084a7b6b218a783449bdf8ca68311e058b","observation_id":"28204388-d3d0-4d7d-b7f2-1b86147cf1bd","resolution":{"observed_at":"2026-08-03T05:00:56.625575Z","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-03T05:00:56.785882Z","title":"A metric on directed graphs and markov chains based on hitting probabilities.SIAM Journal on Mathematics of Data Science, 3(2):467–493, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:56.785882Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:160b0dce8426b4e652be12c1fc1af3f79eb93f4d9d019343f21fc2ed97436687","observation_id":"9abbd162-85ab-4dc4-90fd-3adda95c40b3","resolution":{"observed_at":"2026-08-03T05:00:56.785882Z","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-03T05:00:56.871675Z","title":"Pek¨ oz, and Sheldon M","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:56.871675Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:748feb135507b294cea27663fdb1b32e1b0eb78456635a42090e1fc747cb677a","observation_id":"24328d07-e36f-44df-9183-61e0ec9e5eb1","resolution":{"observed_at":"2026-08-03T05:00:56.871675Z","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-03T05:00:57.032099Z","title":"Language models are few-shot learners","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:57.032099Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:26015e3ccaf2f320ea4ce3e80c4fad1fe82d867148476b3b3d7a07b7f30f7afa","observation_id":"eb27cd05-9757-4603-ab1f-ff02cf1c9575","resolution":{"observed_at":"2026-08-03T05:00:57.032099Z","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-03T05:00:57.178113Z","title":"Magicore: Multi-agent, iterative, coarse-to-fine refinement for reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:57.178113Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:e4967fe5b0973831f008b0c2b9cba545c1e38138b4447b07fd1e4c058ef63d46","observation_id":"ad5f6a60-38ef-438c-ada4-88adda52ce06","resolution":{"observed_at":"2026-08-03T05:00:57.178113Z","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-03T05:00:57.380783Z","title":"Transformers in uniform TC 0.arxiv, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:57.380783Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:decf589f897d192c0b9cf8cfe2c520d807a410bcbbcb911bb3e8d1d08a3ce091","observation_id":"73525e9d-e502-4e5f-a81e-71c36f8638b5","resolution":{"observed_at":"2026-08-03T05:00:57.380783Z","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-03T05:00:57.478457Z","title":"Laplacians and the cheeger inequality for directed graphs.Annals of Combinatorics, 9(1):1–19, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:57.478457Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:30d846083476be94e985178c44b4e1560b154324ce98b163c1549ff0acd9d1f5","observation_id":"ca05d65f-91a7-40be-a424-ad3465101614","resolution":{"observed_at":"2026-08-03T05:00:57.478457Z","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-03T05:00:57.646930Z","title":"Turing completeness of bounded-precision recurrent neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:57.646930Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:7bb169525fd06dc577acd123ba33724e3b97dd303fe3c497d7992d4aa9fc9abf","observation_id":"6e7da321-4049-43a7-ba0c-d2259349c801","resolution":{"observed_at":"2026-08-03T05:00:57.646930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.01070","last_updated":"2018-07-08T21:42:31Z","snapshot_observed_at":"2026-07-06T06:37:07.054351Z","submitted_at":"2018-05-03T00:46:56Z","title":"What you can cram into a single vector: Probing sentence embeddings for linguistic properties","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.01070","snapshot_observed_at":"2026-08-03T05:00:57.769264Z","title":"What you can cram into a single vector: Probing sentence embeddings for linguistic properties.CoRR, abs/1805.01070, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:57.769264Z"},"links":{"cited_paper":"/paper/1805.01070","citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:4528fb2878bbbcf93b3f1d16e95779e85cabecf88b15854b1b8bcbcae5b7c68d","observation_id":"11117bbe-f36e-4d7a-bfed-136244714d81","resolution":{"observed_at":"2026-08-03T05:00:57.769264Z","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-03T05:00:57.834946Z","title":"A dexire for extracting propositional rules from neural networks via binarization.Electronics, 11(24), 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:57.834946Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:6ee8513f130c66e7aa3f364dd8d66eddc6a4c026ca18c3009b32bc270586f044","observation_id":"eea5d4db-dcba-4523-9ca0-40e34d223d0c","resolution":{"observed_at":"2026-08-03T05:00:57.834946Z","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-03T05:00:57.904970Z","title":"Extracting tree-structured representations of trained networks","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:57.904970Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:6fa94cab43178964592bfcdb03a7de74408c451a6ad9d066671bcc7443e0c138","observation_id":"48c86f34-2ea4-44b6-8128-baba0209157e","resolution":{"observed_at":"2026-08-03T05:00:57.904970Z","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-03T05:00:58.011784Z","title":"Knowledge neurons in pretrained transformers","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.011784Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:c4f1b21d6c8c91bfe6851d8251873553195918ccb6e15968946cc2f68ebaafa0","observation_id":"fa4976fc-d24f-4350-8650-5ce46d39715c","resolution":{"observed_at":"2026-08-03T05:00:58.011784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-03T05:00:58.112756Z","title":"Gemini: A family of highly capable multimodal models.arXiv preprint arXiv:2312.11805, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.112756Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:d6c7fd0cce535c04bbb7656bb8d87413ae3c78ce5a6a7e2583ef885269dfc8ea","observation_id":"42da378f-00f5-46a9-baf2-dd0981607e04","resolution":{"observed_at":"2026-08-03T05:00:58.112756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-06T09:40:33.591625Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.06894","snapshot_observed_at":"2026-08-03T05:00:58.184360Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds.arXiv preprint arXiv:2509.06894, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.184360Z"},"links":{"cited_paper":"/paper/2509.06894","citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:ee8ec731b4134bce89c5e470703b0ebaec67d715816b2c39b0600fbb03109c2b","observation_id":"b955126c-5e27-48ca-8741-b846807567f3","resolution":{"observed_at":"2026-08-03T05:00:58.184360Z","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-03T05:00:58.255828Z","title":"The information-geometric perspective of compositional data analysis","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.255828Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:fefbdb945a7d00622f87769bcda806adeabb421068f856a3c384a9aac5eda27c","observation_id":"58502942-2723-4b22-a794-6d0a54d7c4d3","resolution":{"observed_at":"2026-08-03T05:00:58.255828Z","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-03T05:00:58.311961Z","title":"Birthday paradox, coupon collectors, caching algorithms and self-organizing search.Discrete Applied Mathematics, 39(3):207–229, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.311961Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:94a086d45b19f092cd96c131a75cf0f5c825f62cc8da8f2114651e928886a0ea","observation_id":"be0a08b0-da6c-4ce7-925e-30e69b7c9375","resolution":{"observed_at":"2026-08-03T05:00:58.311961Z","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-03T05:00:58.387116Z","title":"Neural algorithmic reasoning for combinatorial optimisation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.387116Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:89781e10d4d410ac9575ad5e76f6b89a328d00460f24ab7821b05bd41eb86d9a","observation_id":"e646ac74-fd9d-41bf-93cf-eea42a0394a4","resolution":{"observed_at":"2026-08-03T05:00:58.387116Z","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-03T05:00:58.452260Z","title":"Compositional data analysis.Annual Review of Statistics and its Application, 8(1):271–299, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.452260Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:a5fb7cc5e763b65552987c986b48de0599cd5fd81562ad06aca2f80593718cc6","observation_id":"179f9b9e-a653-456d-83f6-0f49a5c40ca9","resolution":{"observed_at":"2026-08-03T05:00:58.452260Z","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-03T05:00:58.528495Z","title":"Fast construction of nets in low-dimensional metrics and their applications","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.528495Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:29cc454ad4e45e1cc7642b00daaa17d83724ec764577bffc0f1ef3d2cb7fc229","observation_id":"e300a56e-497c-40b3-bc07-2e564dd1eae6","resolution":{"observed_at":"2026-08-03T05:00:58.528495Z","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-03T05:00:58.604284Z","title":"Instance-dependent generalization bounds via optimal transport.Journal of Machine Learning Research, 24(349):1–51, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.604284Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:703a397f12bb9a2b9eb28733464825cb5dbb414aea5c3676c4ddb182713e8feb","observation_id":"1907de4f-2753-444e-9f18-0cea89dd06e1","resolution":{"observed_at":"2026-08-03T05:00:58.604284Z","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-03T05:00:58.671301Z","title":"Polynomial bounds for vc dimension of sigmoidal and general pfaffian neural networks.Journal of Computer and System Sciences, 54(1):169–176, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.671301Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:31aee559da81f9d2c9155a1db180d51f128eb26c6987e3ef3029664a10c0ced6","observation_id":"0002751d-87f9-4dff-9e4b-d65a99354f22","resolution":{"observed_at":"2026-08-03T05:00:58.671301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11916","last_updated":"2023-01-29T05:14:17Z","snapshot_observed_at":"2026-08-07T04:02:08.445660Z","submitted_at":"2022-05-24T09:22:26Z","title":"Large Language Models are Zero-Shot Reasoners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11916","snapshot_observed_at":"2026-08-03T05:00:58.774544Z","title":"Large language models are zero-shot reasoners.arXiv preprint arXiv:2205.11916, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.774544Z"},"links":{"cited_paper":"/paper/2205.11916","citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:bb1899fb6420089a205a65b4fef96645f7155dfbb6458a71ca53981676e2adc3","observation_id":"5bbb1835-f471-4ddd-a8d2-832a986df502","resolution":{"observed_at":"2026-08-03T05:00:58.774544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05576","last_updated":"2026-05-13T08:37:33Z","snapshot_observed_at":"2026-07-06T17:27:20.784234Z","submitted_at":"2024-02-08T11:23:11Z","title":"Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spaces","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05576","snapshot_observed_at":"2026-08-03T05:00:58.854006Z","title":"Tighter generalization bounds on digital computers via discrete optimal transport.arXiv preprint arXiv:2402.05576, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.854006Z"},"links":{"cited_paper":"/paper/2402.05576","citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:3ecaceb3839ca46d3d21668c5403dd175615bbe6bbfdf4d80c6e6384f59f61b1","observation_id":"61bc983d-3304-4e6d-a4b8-731dc2b7fbd3","resolution":{"observed_at":"2026-08-03T05:00:58.854006Z","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-03T05:00:58.902318Z","title":"Retrieval-augmented generation for knowledge- intensive nlp tasks.Advances in neural information processing systems, 33:9459–9474, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.902318Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:7cec557b1336b3fc30625e2b5f2742dad5090090cf2ae95b18af3852c3070d08","observation_id":"07b07c18-4ad3-4ee8-b34c-dce5606934f9","resolution":{"observed_at":"2026-08-03T05:00:58.902318Z","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-03T05:00:58.974221Z","title":"Certifiable reasoning is universal: A differentiable reasoning AI.arXiv preprint, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.974221Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:31d6f6e8f46160a03f847f8a39005ed1aa8a91621ee591a0ae82f3348a720cb0","observation_id":"d8e18ce0-6f56-409e-baff-695797e1ba71","resolution":{"observed_at":"2026-08-03T05:00:58.974221Z","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-03T05:00:59.066029Z","title":"Learning arithmetic circuits","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:59.066029Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:8579deeea1e6f1a25e167feccbbdf5352a5b5269cb72696bb6f9bec3065e221c","observation_id":"d4b67680-7f3c-4f9b-b4e0-53007054e048","resolution":{"observed_at":"2026-08-03T05:00:59.066029Z","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-03T05:00:59.215669Z","title":"Is homophily a necessity for graph neural networks? In International Conference on Learning Representations, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:59.215669Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:135c4d771ec769deff65010edd598caa460049b70927e01198609662ba0d74db","observation_id":"28d62d3f-dbee-4260-a88c-8f7445a56151","resolution":{"observed_at":"2026-08-03T05:00:59.215669Z","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-03T05:00:59.390564Z","title":"Cambridge University Press, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:59.390564Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:b495fe368c643334a0f60d89e19659139d4ca61c0c401006facd37dd41e4a719","observation_id":"e595ef43-add7-4adb-a799-cfa7b1be5296","resolution":{"observed_at":"2026-08-03T05:00:59.390564Z","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-03T05:00:59.551467Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:59.551467Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:c88efcc95eab639cc84e278cf2122f9fc99ef3be5147922aafd4e691f2d1ec14","observation_id":"b78a3cf8-7b0a-4fcd-bace-060cc009499d","resolution":{"observed_at":"2026-08-03T05:00:59.551467Z","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-03T05:00:59.667176Z","title":"Self-refine: Iterative refinement with self-feedback.Advances in Neural Information Processing Systems, 36:46534–46594, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:59.667176Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:de3385aee557ced2485634e45fb879e85ac30dfa6b7c11fef4ac5d8a549d2eee","observation_id":"5aaa9b53-bd65-4c4c-b87b-3ed6cd449fd2","resolution":{"observed_at":"2026-08-03T05:00:59.667176Z","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-03T05:00:59.716710Z","title":"A neural state pushdown automata.IEEE Transactions on Artificial Intelligence, 1(3):193–205, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:59.716710Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:4e5dc34325f0b3ccbbe1ed90ac7e5fecb6fff3929abd46625771a069818ed82e","observation_id":"c637d764-4920-4b50-a82e-2b00f5ebae71","resolution":{"observed_at":"2026-08-03T05:00:59.716710Z","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-03T05:00:59.838172Z","title":"John Wiley & Sons, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:59.838172Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:6b26df5f3c16261e452ede4a6658a9cffff5fb7da24a51d441eed29d7f3d52b0","observation_id":"434ab135-3cd3-4e79-9540-3f8be669d6f6","resolution":{"observed_at":"2026-08-03T05:00:59.838172Z","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-03T05:00:59.901943Z","title":"Polynomial-time solvable# csp problems via algebraic models and pfaffian circuits.Journal of Symbolic Computation, 74:152–180, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:59.901943Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:42ec8b1c0c59c6b492f39964e9dbf28e0e8a7f73889f2d34da89de57e5bcdad2","observation_id":"d129d319-101b-4b4b-81c6-a3ea572e5ddb","resolution":{"observed_at":"2026-08-03T05:00:59.901943Z","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-03T05:01:00.063302Z","title":"The parallelism tradeoff: Limitations of log-precision transformers","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:00.063302Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:409b9ffdc623dfd083e34b15f3fb4668ec4f95bac7ed122d359540d7795f5e18","observation_id":"c00e605e-c141-4977-b1a7-c3591423252b","resolution":{"observed_at":"2026-08-03T05:01:00.063302Z","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-03T05:01:00.198625Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:00.198625Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:06dc47adf15637df4d4f738fdacd2bc7c50f0c8e395825bf3bc919637dad4aab","observation_id":"590a77f4-710c-4323-8858-0c0c0b21a27f","resolution":{"observed_at":"2026-08-03T05:01:00.198625Z","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-03T05:01:00.260698Z","title":"Assouad’s theorem with dimension independent of the snowflaking.Revista Matematica Iberoamericana, 28(4):1123–1142, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:00.260698Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:f81a3b9214e908b18c69cd5c2722aedae9c24e918d18df4f79158c21acb4214c","observation_id":"64968a5e-978f-4894-9b8d-8a193efb416d","resolution":{"observed_at":"2026-08-03T05:01:00.260698Z","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-03T05:01:00.385989Z","title":"Low dimensional embeddings of doubling metrics.Theory Comput","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:00.385989Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:27562c5b93498ed1a881417f45c1db0959745dc3fe5bab8bea91fd303cb4cddd","observation_id":"f3a111a9-6ec9-465e-95bd-f6c6dcfbfb42","resolution":{"observed_at":"2026-08-03T05:01:00.385989Z","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-03T05:01:00.464577Z","title":"Zoom in: An introduction to circuits.Distill, 5(3):e00024.001, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:00.464577Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:90c8195b1b484e29d818fea8b05745b26893d63c62d5a4c0bad27492d058dd5e","observation_id":"49b11f47-cf28-4218-aedb-dedcfba35c4e","resolution":{"observed_at":"2026-08-03T05:01:00.464577Z","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-03T05:01:00.549792Z","title":"The building blocks of interpretability.Distill, 3(3):e10, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:00.549792Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:8a24ada814c53f0ec2be1c682c7acd14a236d55626e23b0c28e767414cafb740","observation_id":"3d6527de-9393-42a7-bd89-7ff94dabd6b1","resolution":{"observed_at":"2026-08-03T05:01:00.549792Z","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-03T05:01:00.668077Z","title":"Multiplicative schr¨ odinger problem and the dirichlet transport","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:00.668077Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:5495098676431ac4f7de8a21f4fbb05ecba7f6b27aa8eea3e30018983275457b","observation_id":"fe92cc9f-f416-4bc8-b35d-40de6e34880f","resolution":{"observed_at":"2026-08-03T05:01:00.668077Z","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-03T05:01:00.767186Z","title":"Compositional data and their analysis: an introduction","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:00.767186Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:8d23be90dcce751a615d8f3188bae260c5ebfe09442c294edbef250c98c05666","observation_id":"1c93f692-6f42-4c2f-9366-9d0f09908f1e","resolution":{"observed_at":"2026-08-03T05:01:00.767186Z","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-03T05:01:00.825249Z","title":"On the turing completeness of modern neural network architectures","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:00.825249Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:4504f4827f5937fbefd337675d69b9bdb64723dc56410a46540bcc62c8bcba93","observation_id":"6743a0cb-6e22-4eb2-af01-8aa386e41fe4","resolution":{"observed_at":"2026-08-03T05:01:00.825249Z","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-03T05:01:00.939345Z","title":"On a classical problem of probability theory.Magyar Tudom´ anyos Akad´ emia Matematikai Kutat´ o Int´ ezet´ enek K¨ ozlem´ enyei, 6:215–220, 1958","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:00.939345Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:ccd55c04f37640c2165665b67469998c1c9865e7574cb0942359c80cb489140e","observation_id":"12fff4ee-96dd-4ddb-8948-a7c3945702ed","resolution":{"observed_at":"2026-08-03T05:01:00.939345Z","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-03T05:01:01.092520Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:01.092520Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:5cd87710b601845781b83ac2d7dcfe7e2217e49c5ce4f14698881c65c2b10643","observation_id":"dcae6ed4-ad2a-4ec1-b476-9b84ac4079cd","resolution":{"observed_at":"2026-08-03T05:01:01.092520Z","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-03T05:01:01.214506Z","title":"Narasimhan","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:01.214506Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:e87473fe2b4e4a726f1c4f80f3d541df738718814bf52125c6e916d3944734b7","observation_id":"6e83d478-7fc2-4901-b95f-471ef264cdd1","resolution":{"observed_at":"2026-08-03T05:01:01.214506Z","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-03T05:01:01.264415Z","title":"Springer Science & Business Media, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:01.264415Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:0e0c9405f58827dc62365e8ba54ce8c19b08591a524f1c3beeaf5c4d04d9ef82","observation_id":"793966da-2328-49a1-a4d2-3073e13dcc28","resolution":{"observed_at":"2026-08-03T05:01:01.264415Z","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-03T05:01:01.348555Z","title":"Depth efficient neural networks for division and related problems.IEEE Transactions on Information Theory, 39(3):946–956, 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:01.348555Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:084dcb83711f243bb443e2b4a9383ba01f43a19983aa63f38109b0fd4905834a","observation_id":"8b0fb987-7184-4c3a-98f4-ada404ed4d8f","resolution":{"observed_at":"2026-08-03T05:01:01.348555Z","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-03T05:01:01.514788Z","title":"Inference for empirical wasserstein distances on finite spaces.Journal of the Royal Statistical Society Series B: Statistical Methodology, 80(1):219–238, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:01.514788Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:d3a8b1a57f102171bc0c540840370b22a87b94134d844959bf91388a5620299f","observation_id":"6a03402b-3130-43a5-a170-cee30900a1b7","resolution":{"observed_at":"2026-08-03T05:01:01.514788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.17699","last_updated":"2025-07-23T17:04:20Z","snapshot_observed_at":"2026-08-06T14:37:18.932362Z","submitted_at":"2025-07-23T17:04:20Z","title":"Thinking Isn't an Illusion: Overcoming the Limitations of Reasoning Models via Tool Augmentations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.17699","snapshot_observed_at":"2026-08-03T05:01:01.592201Z","title":"Thinking isn’t an illusion: Overcoming the limitations of reasoning models via tool augmentations.arXiv preprint arXiv:2507.17699, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:01.592201Z"},"links":{"cited_paper":"/paper/2507.17699","citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:9c82d2a32b6a3c8e2f10ffaeb0355423300f0d77019af5f0eeee8f5b95a5c0c5","observation_id":"c44a978b-2587-4261-ade9-ccc2d20d6ca9","resolution":{"observed_at":"2026-08-03T05:01:01.592201Z","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-03T05:01:01.735031Z","title":"Sharp oracle inequalities for square root regularization.Journal of Machine Learning Research, 18(67):1–29, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:01.735031Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:73123770ed8a71ae1e89cd7da1b734ad81b9663207cc1596f041bbe83e01dcae","observation_id":"acd03784-03f9-45ad-9392-db4966de302f","resolution":{"observed_at":"2026-08-03T05:01:01.735031Z","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-03T05:01:01.837158Z","title":"Springer, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:01.837158Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:017160a2d4db1b672f399a960934cbb98b04b47f0ab54c073e633cc5063153c0","observation_id":"267bf64d-71bd-4ca3-9731-5fc99192685e","resolution":{"observed_at":"2026-08-03T05:01:01.837158Z","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-03T05:01:01.971088Z","title":"Voyager: An open-ended embodied agent with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:01.971088Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:08b143c3db9b71fdc9a877f849658c9f79bfb5a9d1bbb8dd334ccb9f5e8cb544","observation_id":"86ab0901-571f-48f0-b20f-c737de33ecb9","resolution":{"observed_at":"2026-08-03T05:01:01.971088Z","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-03T05:01:02.075321Z","title":"Le, Ed H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:02.075321Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:d243efd696dadf253738dcc6f2deff42d5864c92a10380ce644a706342b9e5de","observation_id":"561017b8-81d6-47a7-a11a-94583069e2bb","resolution":{"observed_at":"2026-08-03T05:01:02.075321Z","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-03T05:01:02.220686Z","title":"Le, Denny Zhou, et al","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:02.220686Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:6a67610f44b99ae16532cd13ee84a29964f6e8ccfdff9c20f5e30ab24a3aad52","observation_id":"c6363615-3ea8-4676-8ff1-9d93985f0aaa","resolution":{"observed_at":"2026-08-03T05:01:02.220686Z","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-03T05:01:02.359502Z","title":"Star: Self-taught reasoner","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-03T05:01:02.359502Z"},"links":{"citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:15050d30ac8d8ddeb56215c8ad5eace0654c818dd5c03930aebe50e53aee1591","observation_id":"1c496b6f-0987-4d94-ad69-57835056fd27","resolution":{"observed_at":"2026-08-03T05:01:02.359502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","latest_version":3,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-06T18:49:48.541052Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":71,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":71},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2602.03970."}