{"as_of":"2026-08-12T20:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1156ba1abe27bd93be5a919aab28635dd7470de0d19f91ad49099c17d9bbb9fe","coverage":[{"denominator":3,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:24:50.462671Z","state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.08501/citation-record","integrity":"/paper/2507.08501/integrity","json":"/paper/2507.08501/citation-record.json","paper":"/paper/2507.08501"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.12588","last_updated":"2023-10-23T01:27:38Z","snapshot_observed_at":"2026-08-02T13:06:11.850456Z","submitted_at":"2022-11-22T21:06:00Z","title":"Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12588","snapshot_observed_at":"2026-08-06T18:24:27.375991Z","title":"Graph of thoughts: Solving elaborate problems with large language models","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2507.08501","last_updated":"2025-07-11T11:24:09Z","snapshot_observed_at":"2026-08-07T23:20:34.881688Z","submitted_at":"2025-07-11T11:24:09Z","title":"From Language to Logic: A Bi-Level Framework for Structured Reasoning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:27.375991Z"},"links":{"cited_paper":"/paper/2211.12588","citing_paper":"/paper/2507.08501"},"observation_digest":"sha256:5b2e971123784a6be148b6737850596b1219a467a756aa6e55da88032c34487f","observation_id":"7144192e-db70-490c-818e-2caaae5d87aa","resolution":{"observed_at":"2026-08-06T18:24:27.375991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.21187","last_updated":"2025-02-01T07:57:37Z","snapshot_observed_at":"2026-08-01T16:43:44.704797Z","submitted_at":"2024-12-30T18:55:12Z","title":"Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.21187","snapshot_observed_at":"2026-08-06T18:24:50.365471Z","title":"Do not think that much for 2+ 3=? on the overthinking of o1-like llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08501","last_updated":"2025-07-11T11:24:09Z","snapshot_observed_at":"2026-08-07T23:20:34.881688Z","submitted_at":"2025-07-11T11:24:09Z","title":"From Language to Logic: A Bi-Level Framework for Structured Reasoning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:50.365471Z"},"links":{"cited_paper":"/paper/2412.21187","citing_paper":"/paper/2507.08501"},"observation_digest":"sha256:6e6161199fa2fe17031febcf83134b2ae74a3563c06cc1460fa36e4429ac4b01","observation_id":"8d1469af-a2fe-4a67-a75d-659f936fe6d6","resolution":{"observed_at":"2026-08-06T18:24:50.365471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04519","last_updated":"2025-01-08T14:12:57Z","snapshot_observed_at":"2026-08-11T09:20:49.313562Z","submitted_at":"2025-01-08T14:12:57Z","title":"rStar-Math: Small LLMs Can Master Math Reasoning with Self-Evolved Deep Thinking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04519","snapshot_observed_at":"2026-08-06T18:24:50.462671Z","title":"Bilevel programming for hyperparameter optimization and meta-learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.08501","last_updated":"2025-07-11T11:24:09Z","snapshot_observed_at":"2026-08-07T23:20:34.881688Z","submitted_at":"2025-07-11T11:24:09Z","title":"From Language to Logic: A Bi-Level Framework for Structured Reasoning","version":1},"reference_index":906,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:50.462671Z"},"links":{"cited_paper":"/paper/2501.04519","citing_paper":"/paper/2507.08501"},"observation_digest":"sha256:36f4768e1b6ef7580a10fcdbaec4485d0bb758d5d59b11862e6c0d8274a636cf","observation_id":"3113f3ab-8d7c-4976-bfb2-2ace325cef0b","resolution":{"observed_at":"2026-08-06T18:24:50.462671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.08501","last_updated":"2025-07-11T11:24:09Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T23:20:34.881688Z","submitted_at":"2025-07-11T11:24:09Z","title":"From Language to Logic: A Bi-Level Framework for Structured Reasoning"},"reference_resolution":{"displayed":3,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":3},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 0 inbound Pith citation observations for arXiv:2507.08501."}