{"as_of":"2026-08-23T13:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1ec2bea20b52c1891059836d01d41857a5dad2c9c09045ab223579f965a1be99","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T00:30:41.233988Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.24124/citation-record","integrity":"/paper/2606.24124/integrity","json":"/paper/2606.24124/citation-record.json","paper":"/paper/2606.24124"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2023.acl-long.291","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Making Language Models Better Reasoners with Step-Aware Verifier","venue":null,"work_id":"82a21b59-770f-4512-b937-7e4d59eec565","year":2023},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:4ae4537e3ab0336aba82a36f4534fa6a3a7df8346120e5fbcf4e7ed86fa15c86","observation_id":"151b343b-e551-4267-afba-a120765fbf11","resolution":{"observed_at":"2026-06-26T00:38:43.258690Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12584","last_updated":"2019-04-26T06:50:54Z","snapshot_observed_at":"2026-08-14T16:41:07.492381Z","submitted_at":"2019-04-26T06:50:54Z","title":"The Neuro-Symbolic Concept Learner: Interpreting Scenes, Words, and Sentences From Natural Supervision","version":1},"cited_work":{"arxiv_id":"1904.12584","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.12584","snapshot_observed_at":"2026-07-04T16:29:57.717558Z","title":"The Neuro-Symbolic Concept Learner: Interpreting Scenes, Words, and Sentences From Natural Supervision","venue":"cs.CV","work_id":"d6397740-c5de-4292-9823-00d99a6d8398","year":2019},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"cited_paper":"/paper/1904.12584","citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:f297301908dd822d4f1d23b88347f1f1b873e7ca15bcf18cff4fbf330971f60c","observation_id":"02fac178-778f-4adc-a911-0a6fe88c2ec1","resolution":{"observed_at":"2026-07-04T16:29:57.719094Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"Betty starts with $50","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:c45dbbe2726eb6af16d4abf9b6baff775cb2bd0cd1b192e63c217073ec99e46c","observation_id":"6c62e65d-de1e-42c0-bcae-e1018dbdecfa","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"All apples are whole apples (no fractions)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:0fe7344781d0748767d984a608aa78c260dfce514d79ee03014a2aefa7a6eb3c","observation_id":"89ce2037-a678-4b15-8e6f-c41c89e515c2","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"description","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:d9d6426f38ddf23fa0b47a0aa0501c67327de83446a15d2aded97c53655202fb","observation_id":"f8f3de82-574d-4d2b-a678-6f5bb77207a5","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":") - Leave empty if cannot be expressed mathematically *","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:3a7f2275ff3d721e727a9a2a78e1cfa544ca4dc8b2181e589ea6d4a68c1f09fc","observation_id":"6a477922-e996-4adb-8305-99f21b8f33d9","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"position","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:92add1dbdfa19de0553317f74f3c97a415eba2ceec6036ae6778f0bfd64a8ae9","observation_id":"e4357c66-9e3e-4db9-bd64-5491dd469fbc","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"context\": {{","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:729035758d31d29c30f330b67ae7309343f0e4b0bc5b13238bfabd601eb82f29","observation_id":"9acb7ae1-b796-4483-9469-2e8b1faf47e2","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:dd57f2f8368fe05d9a575a951cca7ac3bea7c9c1d1754154b252b71371434215","observation_id":"2f3340fa-9864-4721-9fc3-b8ad0cf4474b","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"The COT typically doesn’t add new initial facts","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:3e64a3dc940211fe6b11bf6123fc28b9dfa348ec82198e327a5abb35dd5d5f33","observation_id":"7920aef2-7e53-4fce-ad86-8481e86fc004","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"fact_1\",","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:a5f96c4b872582affa7ff8cb1051494e3d72b8d57b21af62f3cb065a01217f01","observation_id":"747c3e10-7091-486e-8751-09726b0b00ad","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:6cc36ee8316e6da19cf2af908996844f01189d20be41567d22d35d50f49b4895","observation_id":"ea73be48-f5a8-4ff1-a9c2-0cc8881b68c2","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:06a4824f28b2d1ecd06024f648403b109d3379729f852271d393fb061cd5edea","observation_id":"7c025930-01a5-45f5-94e4-0e769a36b949","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"Calculate X and then use it to determine Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:b25f1f94ef48d1ace193d298479744fd30d3408a16faa55e25271331d57e4f87","observation_id":"6b642070-00b7-4fa2-887a-fe56f7a52850","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"c_N+1\" for additions * Give each constraint a scope:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:f43e919bcb2ec3e325c662322bbbee2335cee34fd9adf7760df1c51f15fd8fc7","observation_id":"b04f1a3c-2687-4d68-b3f2-f0917be43e27","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"id\": \"a_N+1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:cf441f4684f56a9dfce6bfaf781161718aac5a86c22368ffcbd1000b61e6f6ab","observation_id":"772ccaa4-5c99-41ff-bec0-6590797eda19","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"assume\" - Establishing a fact from context/premises *","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:89f56bd1b0e4c36ee06b31993daed1a731fa4cc0dd2141d55c0431aeedfcdedf","observation_id":"11b5bf37-2b70-4828-b682-6cc4082fc077","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T00:30:41.233988Z","title":"step_#\" to reference previous steps (e.g.,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T00:30:41.233988Z"},"links":{"citing_paper":"/paper/2606.24124"},"observation_digest":"sha256:dbe5e52e68c831943ee00bd7ebb4bba248ad510a3efcb5b620e838b4516b2b1d","observation_id":"de57be6f-fc75-4476-b7db-9318b4653e4a","resolution":{"observed_at":"2026-06-26T00:30:41.233988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.24124","last_updated":"2026-06-23T04:15:48Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-14T15:10:58.143994Z","submitted_at":"2026-06-23T04:15:48Z","title":"VeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":18},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2606.24124."}