{"as_of":"2026-08-11T05:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c100682bd344f6290cfbbac0bc0488d76d0a4f69339b5f8cb25c5d2d761516fd","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:22:14.048129Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-11T00:52:10.419984Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T09:56:03.927375Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision","version":1},"cited_work":{"arxiv_id":"2505.15927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.15927","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cot information: Improved sam- ple complexity under chain-of-thought supervision.arXiv preprint arXiv:2505.15927","venue":null,"work_id":"9069ba8a-e73b-46e4-b195-63067cbd53fc","year":null},"citing_paper":{"arxiv_id":"2604.12013","last_updated":"2026-04-18T18:57:54Z","snapshot_observed_at":"2026-07-06T23:00:17.634307Z","submitted_at":"2026-04-13T20:00:13Z","title":"Sample Complexity of Autoregressive Reasoning: Chain-of-Thought vs. End-to-End","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T15:44:19.703107Z"},"links":{"cited_paper":"/paper/2505.15927","citing_paper":"/paper/2604.12013"},"observation_digest":"sha256:e9ea535c0f28e38e4966436966ea41b4cad561e14f9cfb4fc0983421b380aeec","observation_id":"af5818ca-8e7c-4704-8081-27740ed2851b","resolution":{"observed_at":"2026-05-11T09:56:03.931152Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision","version":1},"cited_work":{"arxiv_id":"2505.15927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.15927","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cot information: Improved sam- ple complexity under chain-of-thought supervision.arXiv preprint arXiv:2505.15927","venue":null,"work_id":"9069ba8a-e73b-46e4-b195-63067cbd53fc","year":null},"citing_paper":{"arxiv_id":"2605.06819","last_updated":"2026-05-07T18:21:05Z","snapshot_observed_at":"2026-07-06T23:19:15.382283Z","submitted_at":"2026-05-07T18:21:05Z","title":"A Theory of Online Learning with Autoregressive Chain-of-Thought Reasoning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-11T00:52:10.419984Z"},"links":{"cited_paper":"/paper/2505.15927","citing_paper":"/paper/2605.06819"},"observation_digest":"sha256:4c7deef16dfb2f4a65e84fc6598e975843108f83322f4c1e8fce516704e4bf1a","observation_id":"b0b0856f-b89c-4357-886d-22c484c47fc7","resolution":{"observed_at":"2026-05-11T05:05:58.521336Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.15927/citation-record","integrity":"/paper/2505.15927/integrity","json":"/paper/2505.15927/citation-record.json","paper":"/paper/2505.15927"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"math/0405340","last_updated":"2004-05-18T01:36:26Z","snapshot_observed_at":"2026-08-02T10:07:34.391360Z","submitted_at":"2004-05-18T01:36:26Z","title":"Some Local Measures of Complexity of Convex Hulls and Generalization Bounds","version":1},"cited_work":{"arxiv_id":"math/0405340","doi":null,"metadata_source":"pith","pith_arxiv_id":"math/0405340","snapshot_observed_at":"2026-08-07T15:22:14.323519Z","title":"Some Local Measures of Complexity of Convex Hulls and Generalization Bounds","venue":"math.PR","work_id":"e4caf25b-8e6a-4cd7-85f2-ca9f3b53edb3","year":2004},"citing_paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:12.868940Z"},"links":{"cited_paper":"/paper/math/0405340","citing_paper":"/paper/2505.15927"},"observation_digest":"sha256:54a75e2bf87b60beb4962bce12d9728e4d4a087e6252d04c8ce874ab3f402c36","observation_id":"1509769d-d8dd-424d-8e84-8ad5dc75d37c","resolution":{"observed_at":"2026-08-07T15:22:14.432590Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:15.369827Z","title":null,"venue":null,"work_id":"d165ceb0-9d00-4776-9afb-e242eff15500","year":1981},"citing_paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:13.566601Z"},"links":{"citing_paper":"/paper/2505.15927"},"observation_digest":"sha256:3d4129a4052605678dc8680f9cc19188808d70c6407fe07b50419e1c63151b4f","observation_id":"5e07a8ed-1374-47fa-a5de-c6ccd6c5fad8","resolution":{"observed_at":"2026-08-07T15:22:15.484204Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:15.096395Z","title":"Letx1,...,x m∼D be an i.i.d sample fromD","venue":null,"work_id":"2699236d-3bf6-40d6-8bb4-4de383e4bcac","year":1973},"citing_paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:13.724252Z"},"links":{"citing_paper":"/paper/2505.15927"},"observation_digest":"sha256:8269bfdffa48007e286493dd0f0ffad4ba0c6be09f39379b472335c670ddfc54","observation_id":"1bae7c73-c56e-43a1-ba7b-ac9d9b5f681b","resolution":{"observed_at":"2026-08-07T15:22:15.244145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:14.841480Z","title":null,"venue":null,"work_id":"91b57a0e-760b-449a-bd71-1edfde3b42b4","year":2006},"citing_paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:13.896274Z"},"links":{"citing_paper":"/paper/2505.15927"},"observation_digest":"sha256:5b2143a51b6c91b9be83dd164d48aee183c7a9c28832c3f67b69cba8a4a79071","observation_id":"c0edff4f-0380-4f09-ad75-de3565ca3731","resolution":{"observed_at":"2026-08-07T15:22:14.981722Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:14.553390Z","title":"Fore = 1/100 and|Y×Z| = 1, 000, the capacity factor is approximatelyCQ≈ 11.39","venue":null,"work_id":"f7b13980-5f54-4c65-b790-fcbd0dff1726","year":1965},"citing_paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:14.048129Z"},"links":{"citing_paper":"/paper/2505.15927"},"observation_digest":"sha256:d9f6a999acc2a6b05ebc5e307ec1bd6dd64b30806b520077085db29875ff2c53","observation_id":"694214c1-efdf-4029-aa59-1a833a88dc91","resolution":{"observed_at":"2026-08-07T15:22:14.707650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:15.578505Z","title":"A formal theory of inductive inference. Part I","venue":null,"work_id":"d96885f1-c0e5-4f8d-8e93-d32beccef45d","year":1964},"citing_paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision","version":1},"reference_index":1975,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:13.385718Z"},"links":{"citing_paper":"/paper/2505.15927"},"observation_digest":"sha256:7b705af4d80a32ead961551001cb037729d73645ca38cf311fe0711648647011","observation_id":"bc64d7e4-0fc5-4a83-b3d8-f96a7b920134","resolution":{"observed_at":"2026-08-07T15:22:15.691435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:15.782297Z","title":"Piecewise testable events","venue":null,"work_id":"5aadd86a-6aab-409f-9091-3aa13ea6b6ad","year":1975},"citing_paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision","version":1},"reference_index":1987,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:13.230374Z"},"links":{"citing_paper":"/paper/2505.15927"},"observation_digest":"sha256:8649606468ec6ce9fb0daf49bd3f104f7e008cbeb430d8088ba4588ccbddb232","observation_id":"229e1359-1ea8-487a-bab8-957881507385","resolution":{"observed_at":"2026-08-07T15:22:15.857419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-07T15:22:12.962924Z","title":"Training Verifiers to Solve Math Word Problems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision","version":1},"reference_index":2210,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:12.962924Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2505.15927"},"observation_digest":"sha256:559524ddb10c2dee26864606efd68a81ac6d19951f2b97220e8d8768746dc05d","observation_id":"7a7cbb62-73f5-4297-b41a-4881dea0971d","resolution":{"observed_at":"2026-08-07T15:22:12.962924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14511","last_updated":"2024-08-28T14:13:41Z","snapshot_observed_at":"2026-08-10T18:20:53.238548Z","submitted_at":"2024-08-25T04:07:18Z","title":"Unveiling the Statistical Foundations of Chain-of-Thought Prompting Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.14511","snapshot_observed_at":"2026-08-07T15:22:13.111877Z","title":"Efficient Learning of Typical Finite Automata from Random Walks","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision","version":1},"reference_index":2305,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:13.111877Z"},"links":{"cited_paper":"/paper/2408.14511","citing_paper":"/paper/2505.15927"},"observation_digest":"sha256:52e804863fdbfcb72d2efacdffbee1c3df66cfbe32aa727ce616007293140660","observation_id":"991ff95d-50e5-4e9e-9e51-95dfff229baf","resolution":{"observed_at":"2026-08-07T15:22:13.111877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.15927","last_updated":"2025-05-21T18:28:54Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-07T15:08:15.075772Z","submitted_at":"2025-05-21T18:28:54Z","title":"CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":9},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 2 inbound Pith citation observations for arXiv:2505.15927."}