{"as_of":"2026-08-07T18:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4fae2eda87f4159720a458770e5b70ad437044be7cbe5dd3656608985486aaf7","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:00:37.510921Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":"2410.20290","doi":"10.48550/arxiv.2410.20290","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast best-of-n decoding via speculative rejection","venue":"arXiv (Cornell University)","work_id":"f8b77436-db75-4273-b115-99604b0b00b5","year":2024},"citing_paper":{"arxiv_id":"2412.05579","last_updated":"2024-12-10T05:49:12Z","snapshot_observed_at":"2026-07-31T01:42:39.468673Z","submitted_at":"2024-12-07T08:07:24Z","title":"LLMs-as-Judges: A Comprehensive Survey on LLM-based Evaluation Methods","version":2},"reference_index":216,"source":"pdf_text","source_observed_at":"2026-05-11T23:08:34.312466Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2412.05579"},"observation_digest":"sha256:a7dae73813d94eef5981138193873cd5e8261b239dbfa916d9b27d1178225afd","observation_id":"7d779b26-1b6e-43ff-b882-8e840eb78c7c","resolution":{"observed_at":"2026-05-11T23:08:34.854197Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":"2410.20290","doi":"10.48550/arxiv.2410.20290","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast best-of-n decoding via speculative rejection","venue":"arXiv (Cornell University)","work_id":"f8b77436-db75-4273-b115-99604b0b00b5","year":2024},"citing_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-07T04:27:23.738927Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"reference_index":165,"source":"pdf_text","source_observed_at":"2026-05-14T01:29:56.480020Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2503.16419"},"observation_digest":"sha256:027daa0227156955ed70b9c8b2ff053b227ebe7cb207d7991c2d2c8e3cded76c","observation_id":"b8a4074d-ef7c-44d2-8e5e-067738b54ad3","resolution":{"observed_at":"2026-05-14T01:29:56.853711Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-07T15:00:37.510921Z","title":"Fast best-of-n decoding via speculative rejection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17155","last_updated":"2025-05-31T13:54:42Z","snapshot_observed_at":"2026-08-07T14:56:03.984757Z","submitted_at":"2025-05-22T12:23:30Z","title":"TrimR: Verifier-based Training-Free Thinking Compression for Efficient Test-Time Scaling","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:00:37.510921Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2505.17155"},"observation_digest":"sha256:5c32a90f344b3ccf3b8df94390f7ef1b6d2d6ddf5b410ce3e144bbfcf05ea7d2","observation_id":"f591add5-f2d5-4d99-9324-20b01f2c4579","resolution":{"observed_at":"2026-08-07T15:00:37.510921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-07T14:42:14.265644Z","title":"Fast best-of-n decoding via speculative rejection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17941","last_updated":"2025-05-23T14:17:56Z","snapshot_observed_at":"2026-08-07T14:35:29.974086Z","submitted_at":"2025-05-23T14:17:56Z","title":"VeriThinker: Learning to Verify Makes Reasoning Model Efficient","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T14:42:14.265644Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2505.17941"},"observation_digest":"sha256:5a9a9057e605cb81c6b1733936131cf29ccd1f42c3f40c45af7cc7339da4cf21","observation_id":"ce7dd93a-84e4-44b7-9b8f-ded6105ba26a","resolution":{"observed_at":"2026-08-07T14:42:14.265644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-07T14:21:22.385057Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19250","last_updated":"2025-05-25T17:58:50Z","snapshot_observed_at":"2026-08-07T14:15:52.155471Z","submitted_at":"2025-05-25T17:58:50Z","title":"PATS: Process-Level Adaptive Thinking Mode Switching","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T14:21:22.385057Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2505.19250"},"observation_digest":"sha256:a83e384c3c991fcef53faedec6faf74c10add7464e43708621617c9fbab01b14","observation_id":"c0b29bd2-b9e8-4c12-ab72-a505fcb2136c","resolution":{"observed_at":"2026-08-07T14:21:22.385057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-07T13:53:58.149803Z","title":"Fast best-of-n decoding via speculative rejection.arXiv preprint arXiv:2410.20290,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20643","last_updated":"2025-05-27T02:44:00Z","snapshot_observed_at":"2026-08-07T13:47:39.109858Z","submitted_at":"2025-05-27T02:44:00Z","title":"Can Past Experience Accelerate LLM Reasoning?","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:53:58.149803Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2505.20643"},"observation_digest":"sha256:3ff88d80a1956986cd4fa7b035eafcbc1525a1a25dccf6337917fb30e8f91f4d","observation_id":"f3eff320-a979-4fb8-88dc-f7affa2d6392","resolution":{"observed_at":"2026-08-07T13:53:58.149803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-07T05:52:18.612719Z","title":"Fast best-of-n decoding via speculative rejection.arXiv preprint arXiv:2410.20290, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06998","last_updated":"2025-06-08T05:08:32Z","snapshot_observed_at":"2026-08-07T14:49:41.287025Z","submitted_at":"2025-06-08T05:08:32Z","title":"What makes Reasoning Models Different? Follow the Reasoning Leader for Efficient Decoding","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T05:52:18.612719Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2506.06998"},"observation_digest":"sha256:255828e4622fc7f61d7d93977acac848deb0d17ff1939df35e5aaac02cafd90d","observation_id":"e64643e9-308e-44e5-84dd-f1302b09ac92","resolution":{"observed_at":"2026-08-07T05:52:18.612719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-07T05:49:38.967912Z","title":"Fast best-of-n decoding via speculative rejection.arXiv preprint arXiv:2410.20290, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.967912Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:5d8c605dc38b0e338d3ca4bb928d8f14dec4917614060cb6571433cf70df717f","observation_id":"33a60b7a-8803-4660-9fd1-0d1350d14818","resolution":{"observed_at":"2026-08-07T05:49:38.967912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-07T05:19:18.565583Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.08343","last_updated":"2025-06-18T14:43:36Z","snapshot_observed_at":"2026-08-07T08:58:45.702180Z","submitted_at":"2025-06-10T01:54:04Z","title":"Wait, We Don't Need to \"Wait\"! Removing Thinking Tokens Improves Reasoning Efficiency","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:18.565583Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2506.08343"},"observation_digest":"sha256:41d6d77db4e4806e853aaba173e04feede7be64aa979aab69e74464d18daab8d","observation_id":"2196d717-b075-4fc7-bc92-3c7053f82795","resolution":{"observed_at":"2026-08-07T05:19:18.565583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-07T04:26:29.877898Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.877898Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:40943b7bb33b065c90785a2b89bd2559c8ac35fb2c6eafecbab4ab2eed98f442","observation_id":"5234b3e7-42b4-4f5c-a954-1b31b1d23a88","resolution":{"observed_at":"2026-08-07T04:26:29.877898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-06T19:28:58.356008Z","title":"Fast best-of-n decoding via speculative rejection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.05913","last_updated":"2025-07-08T11:59:48Z","snapshot_observed_at":"2026-08-06T19:12:50.807722Z","submitted_at":"2025-07-08T11:59:48Z","title":"Best-of-N through the Smoothing Lens: KL Divergence and Regret Analysis","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-06T19:28:58.356008Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2507.05913"},"observation_digest":"sha256:4b65adf32723eafda6acf57d3d0895a8ec96ac6bd0dd229b2282403c35f16592","observation_id":"9c54f448-de15-4244-b20a-a49a0b647a27","resolution":{"observed_at":"2026-08-06T19:28:58.356008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":"2410.20290","doi":"10.48550/arxiv.2410.20290","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast best-of-n decoding via speculative rejection","venue":"arXiv (Cornell University)","work_id":"f8b77436-db75-4273-b115-99604b0b00b5","year":2024},"citing_paper":{"arxiv_id":"2604.21027","last_updated":"2026-08-02T16:15:42Z","snapshot_observed_at":"2026-08-06T23:24:26.820832Z","submitted_at":"2026-04-22T19:18:36Z","title":"HypEHR: Hyperbolic Modeling of Electronic Health Records for Efficient Question Answering","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-09T23:51:47.724033Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2604.21027"},"observation_digest":"sha256:a7f947259e0d44cc8b57ac340ce163e345b307242fb294afc0d9ee90dfe09142","observation_id":"6497f1fe-e20d-4c4d-b210-213f5281acae","resolution":{"observed_at":"2026-05-09T23:54:45.174886Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":"2410.20290","doi":"10.48550/arxiv.2410.20290","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast best-of-n decoding via speculative rejection","venue":"arXiv (Cornell University)","work_id":"f8b77436-db75-4273-b115-99604b0b00b5","year":2024},"citing_paper":{"arxiv_id":"2605.06165","last_updated":"2026-05-07T12:51:49Z","snapshot_observed_at":"2026-07-06T23:18:41.400741Z","submitted_at":"2026-05-07T12:51:49Z","title":"Post Reasoning: Improving the Performance of Non-Thinking Models at No Cost","version":1},"reference_index":133,"source":"arxiv_source","source_observed_at":"2026-05-08T10:19:08.451445Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2605.06165"},"observation_digest":"sha256:e3e4b69586cf2a95d3b5d228e8cc180d909383da2e318582bdc6528578f96798","observation_id":"d808fe79-7cef-4a32-ab8f-ac6fb7434655","resolution":{"observed_at":"2026-05-11T20:06:10.051239Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.20290/citation-record","integrity":"/paper/2410.20290/integrity","json":"/paper/2410.20290/citation-record.json","paper":"/paper/2410.20290"},"outbound":[],"paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2410.20290."}