{"as_of":"2026-08-07T01:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e087a0311ad5da1803aea5cfe7429617b100dd4981b57fc96ae8c2b7cb72885d","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-06-29T07:47:37.088510Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2605.29319/citation-record","integrity":"/paper/2605.29319/integrity","json":"/paper/2605.29319/citation-record.json","paper":"/paper/2605.29319"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T07:47:37.088510Z","title":"InProceedings of the 58th annual meet- ing of the association for computational linguistics, pages 4320–4333","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.29319","last_updated":"2026-05-28T03:49:10Z","snapshot_observed_at":"2026-07-06T23:38:46.361360Z","submitted_at":"2026-05-28T03:49:10Z","title":"Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T07:47:37.088510Z"},"links":{"citing_paper":"/paper/2605.29319"},"observation_digest":"sha256:041fa97c48f6bed606a103dab9164662f84e14d3a11352a7310be9ee37eab6c7","observation_id":"c85d935a-097a-40da-81fa-e42e93d7749b","resolution":{"observed_at":"2026-06-29T07:47:37.088510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.06137","last_updated":"2025-06-06T14:52:19Z","snapshot_observed_at":"2026-07-06T21:38:01.195004Z","submitted_at":"2025-06-06T14:52:19Z","title":"Table-r1: Self-supervised and Reinforcement Learning for Program-based Table Reasoning in Small Language Models","version":1},"cited_work":{"arxiv_id":"2506.06137","doi":"10.48550/arxiv.2506.06137","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.06137","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rihui Jin, Zheyu Xin, Xing Xie, Zuoyi Li, Guilin Qi, Yongrui Chen, Xinbang Dai, Tongtong Wu, and Gho- lamreza Haffari","venue":"ArXiv.org","work_id":"d59c2aee-e680-4fd0-af32-b0037f19cf2e","year":2025},"citing_paper":{"arxiv_id":"2605.29319","last_updated":"2026-05-28T03:49:10Z","snapshot_observed_at":"2026-07-06T23:38:46.361360Z","submitted_at":"2026-05-28T03:49:10Z","title":"Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T07:47:37.088510Z"},"links":{"cited_paper":"/paper/2506.06137","citing_paper":"/paper/2605.29319"},"observation_digest":"sha256:891dfbf98ec34e17bd6aa84791a4b354c58b9b27f8e77c69bb596936e863f900","observation_id":"df9ed758-9b5f-4c84-810e-a77e13107559","resolution":{"observed_at":"2026-06-29T07:53:13.778824Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2512.00947","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T07:53:13.782981Z","title":"Root2Leaf","venue":null,"work_id":"ba799ce2-0cce-4162-8cf8-441def4f1a98","year":2025},"citing_paper":{"arxiv_id":"2605.29319","last_updated":"2026-05-28T03:49:10Z","snapshot_observed_at":"2026-07-06T23:38:46.361360Z","submitted_at":"2026-05-28T03:49:10Z","title":"Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T07:47:37.088510Z"},"links":{"citing_paper":"/paper/2605.29319"},"observation_digest":"sha256:32335c22a51d5ec071d1b450761ec501d155107022db74c5c45be9a5b4d5afe5","observation_id":"43ad9d24-9a9c-4fe4-8eca-5c08b2ee5b2f","resolution":{"observed_at":"2026-06-29T07:53:13.784446Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.20050","last_updated":"2023-05-31T17:24:00Z","snapshot_observed_at":"2026-08-05T13:11:04.104454Z","submitted_at":"2023-05-31T17:24:00Z","title":"Let's Verify Step by Step","version":1},"cited_work":{"arxiv_id":"2305.20050","doi":"10.1007/bf00262952","metadata_source":"pith","pith_arxiv_id":"2305.20050","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Let's Verify Step by Step","venue":"cs.LG","work_id":"6d05b790-04c5-4fd2-91b2-ba1dfdd5770f","year":2023},"citing_paper":{"arxiv_id":"2605.29319","last_updated":"2026-05-28T03:49:10Z","snapshot_observed_at":"2026-07-06T23:38:46.361360Z","submitted_at":"2026-05-28T03:49:10Z","title":"Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T07:47:37.088510Z"},"links":{"cited_paper":"/paper/2305.20050","citing_paper":"/paper/2605.29319"},"observation_digest":"sha256:1d77eadbfd762c6dc0b8aed72f5ebd2718dc656633f3d90b678b0e3ae5ed2895","observation_id":"da57e714-d897-414b-8171-cd6de239cfee","resolution":{"observed_at":"2026-06-29T07:53:13.776559Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.17680","last_updated":"2026-05-18T16:40:56Z","snapshot_observed_at":"2026-08-03T10:47:37.519453Z","submitted_at":"2025-09-22T12:25:57Z","title":"When TableQA Meets Noise: A Dual Denoising Framework for Complex Questions and Large-scale Tables","version":2},"cited_work":{"arxiv_id":"2509.17680","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.17680","snapshot_observed_at":"2026-06-29T07:53:13.781101Z","title":"differentiation","venue":"cs.CL","work_id":"b19016df-d7f6-416c-a59e-752f468c29b4","year":2025},"citing_paper":{"arxiv_id":"2605.29319","last_updated":"2026-05-28T03:49:10Z","snapshot_observed_at":"2026-07-06T23:38:46.361360Z","submitted_at":"2026-05-28T03:49:10Z","title":"Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T07:47:37.088510Z"},"links":{"cited_paper":"/paper/2509.17680","citing_paper":"/paper/2605.29319"},"observation_digest":"sha256:778b7b6088eeacd11a465a8d9746a3035968d69e851602eee19facd0b25fcbce","observation_id":"c4421c82-ee3a-45dc-badc-11bfe0516957","resolution":{"observed_at":"2026-06-29T07:53:13.782555Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-29T07:47:37.088510Z","title":"1,200” and “1200","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.29319","last_updated":"2026-05-28T03:49:10Z","snapshot_observed_at":"2026-07-06T23:38:46.361360Z","submitted_at":"2026-05-28T03:49:10Z","title":"Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T07:47:37.088510Z"},"links":{"citing_paper":"/paper/2605.29319"},"observation_digest":"sha256:ee94e58c66b5ec3d3661b659e349e97b4dd6bf86cf6fb6ac527e8455613fb549","observation_id":"b30dcfcd-4996-4eee-8c27-92a26ea5a5d8","resolution":{"observed_at":"2026-06-29T07:47:37.088510Z","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-29T07:47:37.088510Z","title":"Then 20 Nov 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.29319","last_updated":"2026-05-28T03:49:10Z","snapshot_observed_at":"2026-07-06T23:38:46.361360Z","submitted_at":"2026-05-28T03:49:10Z","title":"Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T07:47:37.088510Z"},"links":{"citing_paper":"/paper/2605.29319"},"observation_digest":"sha256:c34fef48fd0d0885cdf46414814a01dbf6afb4a6d1099df3be626eb8fe340904","observation_id":"b9ab98d7-68b7-4598-a577-19da727aa304","resolution":{"observed_at":"2026-06-29T07:47:37.088510Z","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-29T07:47:37.088510Z","title":"Then 17 Sep 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.29319","last_updated":"2026-05-28T03:49:10Z","snapshot_observed_at":"2026-07-06T23:38:46.361360Z","submitted_at":"2026-05-28T03:49:10Z","title":"Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T07:47:37.088510Z"},"links":{"citing_paper":"/paper/2605.29319"},"observation_digest":"sha256:ed6b3de5447ff79adc0cea5e52fce43bc842b5e55b2daa4c0e3e89dff038f1b4","observation_id":"b2bc44bb-6108-4aeb-8677-d272140d82fe","resolution":{"observed_at":"2026-06-29T07:47:37.088510Z","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-29T07:47:37.088510Z","title":"[Step 5] Question: are the dates set in a consecutive order? Table: {table content} Answer: yes [Step 4] Wait, but between 20 Nov 2011 and 23 Jan 2012, there's a gap","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.29319","last_updated":"2026-05-28T03:49:10Z","snapshot_observed_at":"2026-07-06T23:38:46.361360Z","submitted_at":"2026-05-28T03:49:10Z","title":"Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T07:47:37.088510Z"},"links":{"citing_paper":"/paper/2605.29319"},"observation_digest":"sha256:d170a27f94c5d414608a95c789a2bc03362a92deb2b816f15c05602be54c54cd","observation_id":"e13bdb2c-3d89-47f9-82df-1a43f9f24dab","resolution":{"observed_at":"2026-06-29T07:47:37.088510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.29319","last_updated":"2026-05-28T03:49:10Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T23:38:46.361360Z","submitted_at":"2026-05-28T03:49:10Z","title":"Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":0},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2605.29319."}