{"as_of":"2026-08-10T10:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:153471a6e555ff89c653fa512e88b54b92b5d90939c5d27ffb4bd2764d338d81","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:44:10.870776Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T10:37:45.355872Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-10T10:39:38.100944Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"cited_work":{"arxiv_id":"2502.08794","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.08794","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Spectral journey: How trans- formers predict the shortest path.arXiv preprint arXiv:2502.08794","venue":null,"work_id":"9e1d15d6-5ace-4b3f-9145-aac139299811","year":2026},"citing_paper":{"arxiv_id":"2604.15306","last_updated":"2026-04-16T17:59:43Z","snapshot_observed_at":"2026-07-06T23:02:53.677687Z","submitted_at":"2026-04-16T17:59:43Z","title":"Generalization in LLM Problem Solving: The Case of the Shortest Path","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T10:37:45.355872Z"},"links":{"cited_paper":"/paper/2502.08794","citing_paper":"/paper/2604.15306"},"observation_digest":"sha256:1b9784dc90be861d50c76ab5e5853d2e6612953a2f3c31db0a193beb88520ad9","observation_id":"b915e5a3-b5ea-4e27-8a5b-c70f9021a198","resolution":{"observed_at":"2026-05-10T10:39:38.104026Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.08794/citation-record","integrity":"/paper/2502.08794/integrity","json":"/paper/2502.08794/citation-record.json","paper":"/paper/2502.08794"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T23:44:10.785688Z","title":"L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.785688Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:5487dfcfd7561e5afee770ca79a8843dc184dca1fa77f343d48d3ad20b77170b","observation_id":"39b818a4-8f9d-403d-9f94-d21265c933b7","resolution":{"observed_at":"2026-08-07T23:44:10.785688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.02679","last_updated":"2023-01-06T19:00:01Z","snapshot_observed_at":"2026-08-06T08:20:11.326697Z","submitted_at":"2023-01-06T19:00:01Z","title":"Grokking modular arithmetic","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.02679","snapshot_observed_at":"2026-08-07T23:44:10.807361Z","title":"Grokking modular arithmetic","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.807361Z"},"links":{"cited_paper":"/paper/2301.02679","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:eb895ffaf268b89fd72705ec58c9f9c14c77d15ec9bb3eb614da8ab8e293e8fb","observation_id":"2b653afd-8e78-47c6-b0bd-70e36d2dc4a6","resolution":{"observed_at":"2026-08-07T23:44:10.807361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04105","last_updated":"2025-06-19T20:14:18Z","snapshot_observed_at":"2026-08-10T07:25:03.369496Z","submitted_at":"2024-11-06T18:35:32Z","title":"A Implies B: Circuit Analysis in LLMs for Propositional Logical Reasoning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.04105","snapshot_observed_at":"2026-08-07T23:44:10.815820Z","title":"Z., Dikkala, N., Luo, E., Rashtchian, C., Wang, X., and Panigrahy, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.815820Z"},"links":{"cited_paper":"/paper/2411.04105","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:0e47a0bdaa71cc518208765eae655c367718d6106eba132bc382d4826e63d1c5","observation_id":"c01f578c-b47d-4325-b64f-6cacf7e90fd0","resolution":{"observed_at":"2026-08-07T23:44:10.815820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01817","last_updated":"2024-06-12T01:13:11Z","snapshot_observed_at":"2026-08-09T23:22:57.992966Z","submitted_at":"2024-02-02T14:43:18Z","title":"LLMs Can't Plan, But Can Help Planning in LLM-Modulo Frameworks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01817","snapshot_observed_at":"2026-08-07T23:44:10.819742Z","title":"Po- sition: Llms can’t plan, but can help planning in llm- modulo frameworks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.819742Z"},"links":{"cited_paper":"/paper/2402.01817","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:0b7d8a844cd8bf1bad7d68ab3bf0c6e4b1e34274a5438f9a8964f9b0c6a6b9fc","observation_id":"38d1109d-318d-4081-9145-4ad08567a585","resolution":{"observed_at":"2026-08-07T23:44:10.819742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07757","last_updated":"2024-02-12T16:25:47Z","snapshot_observed_at":"2026-08-10T05:23:34.289264Z","submitted_at":"2024-02-12T16:25:47Z","title":"Towards an Understanding of Stepwise Inference in Transformers: A Synthetic Graph Navigation Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07757","snapshot_observed_at":"2026-08-07T23:44:10.823420Z","title":"S., and Tanaka, H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.823420Z"},"links":{"cited_paper":"/paper/2402.07757","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:4aa5fd46ed47b204d97cadec5fca396e9bc119b4b0bb8c1b83107fd045384de8","observation_id":"1f0c4c2f-e15f-4ad8-9d4f-1d0d810c951d","resolution":{"observed_at":"2026-08-07T23:44:10.823420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04229","last_updated":"2024-06-06T16:29:25Z","snapshot_observed_at":"2026-08-10T06:23:47.214592Z","submitted_at":"2024-06-06T16:29:25Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04229","snapshot_observed_at":"2026-08-07T23:44:10.827066Z","title":"S., Michaud, E., Tegmark, M., and Williams, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.827066Z"},"links":{"cited_paper":"/paper/2406.04229","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:456b20173380b66992e2623bfadf15ea1c613d31ba3b0b1eeb17bab3731da611","observation_id":"61c7f312-da73-4548-b590-670f85b75f4f","resolution":{"observed_at":"2026-08-07T23:44:10.827066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17623","last_updated":"2023-11-24T01:45:16Z","snapshot_observed_at":"2026-07-06T16:39:08.850847Z","submitted_at":"2023-10-26T17:43:13Z","title":"Proving Test Set Contamination in Black Box Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.17623","snapshot_observed_at":"2026-08-07T23:44:10.838810Z","title":"Proving test set contamination in black box language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.838810Z"},"links":{"cited_paper":"/paper/2310.17623","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:0dd99bab42165220b78aeb861e54e3d479be1a02077692973778546bc91f15f2","observation_id":"5c32f891-3e89-45c4-b64b-937f3bcb1067","resolution":{"observed_at":"2026-08-07T23:44:10.838810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05862","last_updated":"2024-02-08T17:51:44Z","snapshot_observed_at":"2026-08-09T00:17:11.027770Z","submitted_at":"2024-02-08T17:51:44Z","title":"Let Your Graph Do the Talking: Encoding Structured Data for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05862","snapshot_observed_at":"2026-08-07T23:44:10.842813Z","title":"Power, A., Burda, Y ., Edwards, H., Babuschkin, I., and Misra, V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.842813Z"},"links":{"cited_paper":"/paper/2402.05862","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:c13edd845b4f52a4a5f6cfa6584c5744b2bdd49143d7cb69197ccb5a61c6d535","observation_id":"90a431ae-31c9-4481-9eea-6ea3fe575b05","resolution":{"observed_at":"2026-08-07T23:44:10.842813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09864","last_updated":"2023-11-08T13:36:32Z","snapshot_observed_at":"2026-07-06T11:01:58.137141Z","submitted_at":"2021-04-20T09:54:06Z","title":"RoFormer: Enhanced Transformer with Rotary Position Embedding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09864","snapshot_observed_at":"2026-08-07T23:44:10.850763Z","title":"Roformer: Enhanced transformer with rotary po- sition embedding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.850763Z"},"links":{"cited_paper":"/paper/2104.09864","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:6b6388adcc369274c89dd075223e2f04feb7db07f7caac822af1c9beece05a5c","observation_id":"11426ca4-a69a-4e81-a4de-c65aa9cba6a6","resolution":{"observed_at":"2026-08-07T23:44:10.850763Z","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-08-07T23:44:10.854904Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.854904Z"},"links":{"citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:a74bc30ecbe5b736a4818e23da6fead6b9c1ed9228458e7a0bddfa6fb1bc9e2d","observation_id":"16a9aa5e-87c9-49b9-85b6-01fb81643e67","resolution":{"observed_at":"2026-08-07T23:44:10.854904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-07T23:44:10.858844Z","title":"Llama 2: Open foundation and fine- tuned chat models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.858844Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:f608f4b361b4bb04c357b49263dfc064f6ac44d3bd91fb00ff5426246cbb168d","observation_id":"6f2a7915-6025-4754-a895-f664a103f902","resolution":{"observed_at":"2026-08-07T23:44:10.858844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.20311","last_updated":"2024-07-29T17:52:40Z","snapshot_observed_at":"2026-07-06T18:53:35.627045Z","submitted_at":"2024-07-29T17:52:40Z","title":"Physics of Language Models: Part 2.1, Grade-School Math and the Hidden Reasoning Process","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.20311","snapshot_observed_at":"2026-08-07T23:44:10.867138Z","title":"org/abs/2407.20311","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.867138Z"},"links":{"cited_paper":"/paper/2407.20311","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:af19e039a9e79c37ee088d508fed8a36c053db9cebdc986902001a460099ed7b","observation_id":"bf5d09d6-6006-4a19-8c48-5ca51cf6d0ae","resolution":{"observed_at":"2026-08-07T23:44:10.867138Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:44:11.241303Z","title":"cc/paper_files/paper/2021/file/ f1c1592588411002af340cbaedd6fc33-Paper","venue":null,"work_id":"ffe24a90-fb38-4d0b-b26c-49f7c2b47737","year":2021},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.870776Z"},"links":{"citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:d149395ddfd987ca68ed5f637c8b99ee95214d136717ca888a939264f11ca678","observation_id":"cd0f5260-1c3a-4b45-90c3-a0ec2bbeca35","resolution":{"observed_at":"2026-08-07T23:44:11.245194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T23:44:10.799132Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":1959,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.799132Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:fffba0fe5ac7efd5206ecad4073340ed0c89eb3d386dd0393325a7d0a4e1af1e","observation_id":"71d2985c-cba5-47f7-be01-7bf1f8428974","resolution":{"observed_at":"2026-08-07T23:44:10.799132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02550","last_updated":"2024-11-04T16:04:27Z","snapshot_observed_at":"2026-08-10T03:40:59.982529Z","submitted_at":"2024-06-04T17:59:36Z","title":"Learning to grok: Emergence of in-context learning and skill composition in modular arithmetic tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02550","snapshot_observed_at":"2026-08-07T23:44:10.811457Z","title":"Learning to grok: Emergence of in-context learning and skill com- position in modular arithmetic tasks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":1960,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.811457Z"},"links":{"cited_paper":"/paper/2406.02550","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:535a661d240a0235c685d4597df76bc069b2b94f8188458e737773e7fc39db6d","observation_id":"77658386-79e0-4a4b-81c7-bc44823357f1","resolution":{"observed_at":"2026-08-07T23:44:10.811457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.05229","last_updated":"2025-08-27T16:24:39Z","snapshot_observed_at":"2026-07-06T19:29:09.714725Z","submitted_at":"2024-10-07T17:36:37Z","title":"GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.05229","snapshot_observed_at":"2026-08-07T23:44:10.830928Z","title":"Gsm-symbolic: Understanding the limitations of mathemetical reasoning in large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":1983,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.830928Z"},"links":{"cited_paper":"/paper/2410.05229","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:160d871ff2327ec86882a0303919c29653d95f49124d9182eafe4d9fd69bab35","observation_id":"674e7acd-01ab-4158-b8a2-64d1d8ef5712","resolution":{"observed_at":"2026-08-07T23:44:10.830928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-07T23:44:10.790628Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.790628Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:1d9d0809886805a84f67d262835c19730f37422563d73b44277da505d293972d","observation_id":"0004aee8-2574-4ec1-8848-41a6aa707a18","resolution":{"observed_at":"2026-08-07T23:44:10.790628Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:44:11.251937Z","title":"Fatemi, B., Halcrow, J., and Perozzi, B","venue":null,"work_id":"c5972856-e060-4941-9a67-3fa813bb3295","year":2021},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.803388Z"},"links":{"citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:e774554644b4a2bb026fc935baff0fd8f2786138732c1c044d207a7021388e0d","observation_id":"35c981e8-e7d4-4d2b-87f2-e3819692bd87","resolution":{"observed_at":"2026-08-07T23:44:11.255601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14735","last_updated":"2024-08-13T15:45:37Z","snapshot_observed_at":"2026-07-06T17:34:07.737296Z","submitted_at":"2024-02-22T17:47:03Z","title":"How Transformers Learn Causal Structure with Gradient Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14735","snapshot_observed_at":"2026-08-07T23:44:10.834946Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.834946Z"},"links":{"cited_paper":"/paper/2402.14735","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:ec984b37b89231171823cdebe8d3fb698312fb8b42d7c654a919809e8554564a","observation_id":"096930cc-88e8-41d1-8ee2-b3f090ea8a2c","resolution":{"observed_at":"2026-08-07T23:44:10.834946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01107","last_updated":"2024-10-01T20:30:37Z","snapshot_observed_at":"2026-07-06T17:24:03.237617Z","submitted_at":"2024-02-02T02:48:03Z","title":"Simulation of Graph Algorithms with Looped Transformers","version":3},"cited_work":{"arxiv_id":"2402.01107","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.01107","snapshot_observed_at":"2026-08-07T23:44:11.207728Z","title":"Simulation of Graph Algorithms with Looped Transformers","venue":"cs.LG","work_id":"66256b81-7820-456f-810d-b1279417f1a6","year":2024},"citing_paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T23:44:10.794922Z"},"links":{"cited_paper":"/paper/2402.01107","citing_paper":"/paper/2502.08794"},"observation_digest":"sha256:b4b14cac5811eb8a4c4e9a663c5b8030271215a5166b748fc2e627f358dd3680","observation_id":"2f69633d-e71d-44bb-8ca2-09bc0aa8d7af","resolution":{"observed_at":"2026-08-07T23:44:11.214651Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.08794","last_updated":"2025-02-12T21:17:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T03:51:48.258660Z","submitted_at":"2025-02-12T21:17:30Z","title":"Spectral Journey: How Transformers Predict the Shortest Path"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":1,"verified_fuzzy":2},"total_outbound_references":20},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 1 inbound Pith citation observation for arXiv:2502.08794."}