{"as_of":"2026-08-08T18:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64e45779258f0147dfe166d88b9274346f0d1ad0a77a48e8e32edee4a91a7c2d","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-08T06:32:00.761636+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-08T17:08:17.108161Z","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":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-08T17:08:17.108161Z","title":"and Rofin, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06038","last_updated":"2025-05-25T19:34:27Z","snapshot_observed_at":"2026-08-08T16:55:15.122672Z","submitted_at":"2025-02-09T21:21:57Z","title":"Provably Overwhelming Transformer Models with Designed Inputs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T17:08:17.108161Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2502.06038"},"observation_digest":"sha256:cee608db208728072d66e137f14494e7f10349bdd686d04ed2e037eb17d2bda7","observation_id":"10aac83a-5a64-451a-8f48-d3530d40951b","resolution":{"observed_at":"2026-08-08T17:08:17.108161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-07T14:21:01.050664Z","title":"Why are sensitive functions hard for transformers? arXiv preprint arXiv:2402.09963,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19531","last_updated":"2025-05-26T05:33:26Z","snapshot_observed_at":"2026-08-08T07:05:10.715675Z","submitted_at":"2025-05-26T05:33:26Z","title":"Minimalist Softmax Attention Provably Learns Constrained Boolean Functions","version":1},"reference_index":1963,"source":"pdf_text","source_observed_at":"2026-08-07T14:21:01.050664Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2505.19531"},"observation_digest":"sha256:8a9fca3bcfdd067f7a65d760eb8be15babe26df87ce700eb88ec717833aa05aa","observation_id":"206e2655-941d-4e3c-a85b-05d3558c2bba","resolution":{"observed_at":"2026-08-07T14:21:01.050664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-06T15:54:33.958427Z","title":"Why are sensitive functions hard for transformers? arXiv preprint arXiv:2402.09963, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.14777","last_updated":"2025-07-20T00:33:19Z","snapshot_observed_at":"2026-08-06T15:45:37.558605Z","submitted_at":"2025-07-20T00:33:19Z","title":"Rethinking Memorization Measures and their Implications in Large Language Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T15:54:33.958427Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2507.14777"},"observation_digest":"sha256:c0a95fd77a080ab28dd1664b481daf5f6fc4a929be54652c4315f8285a7c385c","observation_id":"9213f9c7-cd0f-4d46-b13c-3943507de087","resolution":{"observed_at":"2026-08-06T15:54:33.958427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-05T22:16:08.033402Z","title":"and Rofin, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07395","last_updated":"2025-08-10T15:49:44Z","snapshot_observed_at":"2026-08-08T03:22:00.070908Z","submitted_at":"2025-08-10T15:49:44Z","title":"Parity Requires Unified Input Dependence and Negative Eigenvalues in SSMs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T22:16:08.033402Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2508.07395"},"observation_digest":"sha256:110c4c8e03a433f98215fbff777bbfbe5c145e5cb1700561bc75f58aae895954","observation_id":"a0143d74-35b4-480d-b1a4-8816abcc7a9f","resolution":{"observed_at":"2026-08-05T22:16:08.033402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-03T20:57:10.449801Z","title":"Why are sensitive functions hard for transformers?, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.17852","last_updated":"2026-08-06T09:30:47Z","snapshot_observed_at":"2026-08-08T18:14:58.949942Z","submitted_at":"2025-11-22T00:38:43Z","title":"Transformers with RL or SFT Provably Learn Sparse Boolean Functions, But Differently","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-03T20:57:10.449801Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2511.17852"},"observation_digest":"sha256:88671e2e7b3aff1206e59cbf45f66efc2314830b928630a8afe51b085728dba6","observation_id":"26f08f07-4f28-4dbc-a335-14808e6b6ea5","resolution":{"observed_at":"2026-08-03T20:57:10.449801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":"2402.09963","doi":"10.48550/arxiv.2402.09963","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Why Are Sensitive Functions Hard for Transformers?","venue":"arXiv (Cornell University)","work_id":"c92a1d0f-df05-44f7-8e67-f27d9c7c1761","year":2024},"citing_paper":{"arxiv_id":"2602.01651","last_updated":"2026-04-21T07:48:12Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T05:11:48Z","title":"On the Spatiotemporal Dynamics of Generalization in Neural Networks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-16T08:59:44.016444Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2602.01651"},"observation_digest":"sha256:54fd0b2b4de1f6040f4563c25518cb69c7d85c45e7363e6a66e933183be9af82","observation_id":"c8469ea8-0a52-42c9-a083-b0609de949c6","resolution":{"observed_at":"2026-05-16T09:00:46.760016Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":"2402.09963","doi":"10.48550/arxiv.2402.09963","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Why Are Sensitive Functions Hard for Transformers?","venue":"arXiv (Cornell University)","work_id":"c92a1d0f-df05-44f7-8e67-f27d9c7c1761","year":2024},"citing_paper":{"arxiv_id":"2603.29069","last_updated":"2026-04-05T18:40:06Z","snapshot_observed_at":"2026-08-07T17:56:32.986328Z","submitted_at":"2026-03-30T23:15:21Z","title":"On the Mirage of Long-Range Dependency, with an Application to Integer Multiplication","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-14T21:07:37.032208Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2603.29069"},"observation_digest":"sha256:28f0c041a53fd8d3120b7fdb3e44826e959af69fa0b5bedefb588959c032d7a4","observation_id":"0b00372b-7f7e-4e1e-a327-8ca3ee50b862","resolution":{"observed_at":"2026-05-14T21:07:57.635708Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":"2402.09963","doi":"10.48550/arxiv.2402.09963","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Why Are Sensitive Functions Hard for Transformers?","venue":"arXiv (Cornell University)","work_id":"c92a1d0f-df05-44f7-8e67-f27d9c7c1761","year":2024},"citing_paper":{"arxiv_id":"2605.01381","last_updated":"2026-05-02T11:08:10Z","snapshot_observed_at":"2026-07-06T23:14:38.379875Z","submitted_at":"2026-05-02T11:08:10Z","title":"A framework for analyzing concept representations in neural models","version":1},"reference_index":242,"source":"arxiv_source","source_observed_at":"2026-05-09T14:49:22.776209Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2605.01381"},"observation_digest":"sha256:c21000bea30791c0cc216a81b8c51d60122f1bb50345087b792d75692b81d2ba","observation_id":"de99a489-cdad-4841-b6b2-735a41683e37","resolution":{"observed_at":"2026-05-09T22:18:59.236359Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":"2402.09963","doi":"10.48550/arxiv.2402.09963","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Why Are Sensitive Functions Hard for Transformers?","venue":"arXiv (Cornell University)","work_id":"c92a1d0f-df05-44f7-8e67-f27d9c7c1761","year":2024},"citing_paper":{"arxiv_id":"2605.10237","last_updated":"2026-05-11T09:11:20Z","snapshot_observed_at":"2026-07-06T23:22:13.774652Z","submitted_at":"2026-05-11T09:11:20Z","title":"The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently","version":1},"reference_index":128,"source":"arxiv_source","source_observed_at":"2026-05-12T05:27:11.761971Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2605.10237"},"observation_digest":"sha256:39c1a9942cc830c4ebdfbc5aadedca0710ede82599ca8b9a7e95d0447b6f68c3","observation_id":"5f3bf837-6fd9-4802-aed5-da8e946d2c70","resolution":{"observed_at":"2026-05-12T05:31:24.361198Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":"2402.09963","doi":"10.48550/arxiv.2402.09963","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Why Are Sensitive Functions Hard for Transformers?","venue":"arXiv (Cornell University)","work_id":"c92a1d0f-df05-44f7-8e67-f27d9c7c1761","year":2024},"citing_paper":{"arxiv_id":"2606.00183","last_updated":"2026-05-29T14:58:03Z","snapshot_observed_at":"2026-07-06T23:40:56.510371Z","submitted_at":"2026-05-29T14:58:03Z","title":"Agentic Transformers Provably Learn to Search via Reinforcement Learning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-28T23:26:28.158991Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2606.00183"},"observation_digest":"sha256:599f787af503ddacab0a3e4fc48a090f9a0e0ab5f824cc011e4edba1dd42f101","observation_id":"73e62de4-01ae-4aa0-952d-e7d2277d1c28","resolution":{"observed_at":"2026-06-28T23:42:49.979338Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"arXiv preprint arXiv:2402.09963 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:d8f366c99bc061dbb4024c28560916cdc3f4c822fc229652553f1a299384cb6a","observation_id":"c958545a-b265-4aa5-840a-fd489240a1bd","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-01T17:31:46.982657Z","title":"Why are sensitive functions hard for transformers? arXiv:2402.09963,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17624","last_updated":"2026-07-20T07:26:17Z","snapshot_observed_at":"2026-08-07T13:43:21.717264Z","submitted_at":"2026-07-20T07:26:17Z","title":"Can Transformers Really Do It All? On the Compatibility of Inductive Biases Across Tasks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T17:31:46.982657Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2607.17624"},"observation_digest":"sha256:0d959a7840b9a7f0fe2eed10656294d0ae62efdb2a0153bc02314a5e1dbc5bba","observation_id":"199a613a-a6b5-4214-a5c4-e1cfda8ad1a8","resolution":{"observed_at":"2026-08-01T17:31:46.982657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-01T10:14:11.203822Z","title":"Peter Hase, Mohit Bansal, Been Kim, and Asma Ghandeharioun","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20594","last_updated":"2026-07-22T16:04:31Z","snapshot_observed_at":"2026-08-07T01:30:36.940347Z","submitted_at":"2026-07-22T16:04:31Z","title":"When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:11.203822Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:1dd42cbbc0cfc91ddf06a5a3f45eeb966671448ccaf098f2233ef85aa326c23e","observation_id":"666d89c3-8a28-41cc-9e99-fb96b37bac7e","resolution":{"observed_at":"2026-08-01T10:14:11.203822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.09963/citation-record","integrity":"/paper/2402.09963/integrity","json":"/paper/2402.09963/citation-record.json","paper":"/paper/2402.09963"},"outbound":[],"paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2402.09963."}