{"as_of":"2026-08-09T06:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c23267e4b3d478ecec80b5bfcbcb9535196698580cf6734c8bdb99b5eba5fcd","coverage":[{"denominator":176,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:11:47.619341Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2602.08857/citation-record","integrity":"/paper/2602.08857/integrity","json":"/paper/2602.08857/citation-record.json","paper":"/paper/2602.08857"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:11:44.265225Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:44.265225Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:a77c815697f3bd32ab94230b1ecd21fb34ac0579ff29fbd36c708399a5e2a9f8","observation_id":"d852f7a2-06a8-4992-bc71-c5b8370fd8fd","resolution":{"observed_at":"2026-08-03T03:11:44.265225Z","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-03T03:11:44.315474Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:44.315474Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:79cfdcd5d8058af2385616938ac9be7a79f944da33115558d1f845b426679720","observation_id":"54b0fe09-6a72-4c92-b3d3-b2eaad6d272b","resolution":{"observed_at":"2026-08-03T03:11:44.315474Z","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-03T03:11:43.440275Z","title":"Haklay, T., Orgad, H., Bau, D., Mueller, A., and Belinkov, Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:43.440275Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:66d99de0673287fe6188eb6b5c34aaf0f7eb2828d4f1aee17f9da4888c838fc9","observation_id":"a8f312f7-6716-4bc1-b2a9-8cb4cc018d69","resolution":{"observed_at":"2026-08-03T03:11:43.440275Z","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-03T03:11:43.547590Z","title":"URL https: //aclanthology.org/2025.acl-long.141/","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:43.547590Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:decd06158913531cda9f1da5c0c33b3f6d9932c641bc3af9a2123e20ef2f08ad","observation_id":"bb8fd90e-2c21-4dcf-9980-7ea7ca6c6d08","resolution":{"observed_at":"2026-08-03T03:11:43.547590Z","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-03T03:11:43.690470Z","title":"Huang, X., Yang, A., Bhattamishra, S., Sarrof, Y ., Krebs, A., Zhou, H., Nakkiran, P., and Hahn, M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:43.690470Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:f7b59be5f6f656410350fb603b4b682172c56726b11a5ab9a738578c3b313b89","observation_id":"7da1383e-978f-4634-b8e4-1efb211392bd","resolution":{"observed_at":"2026-08-03T03:11:43.690470Z","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-03T03:11:43.818176Z","title":"Langosco, L., Baker, W., Alex, N., Bradley, H., Quarel, D., and Krueger, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:43.818176Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:90c2197cfbe70a08c249fbf910f7b92d4274b2cce0345d5cdcb699cae58ed1d0","observation_id":"87614b2b-2148-46eb-b4e1-adeb9862f848","resolution":{"observed_at":"2026-08-03T03:11:43.818176Z","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-03T03:11:43.857495Z","title":"Liu, B., Ash, J., Goel, S., Krishnamurthy, A., and Zhang, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:43.857495Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:f2ddc11da94d37fe2e241a857e6cbf48be09b9bdde2f3d7eba23196e5098b26d","observation_id":"9612c02a-8ce2-40f6-9797-0074bc06c710","resolution":{"observed_at":"2026-08-03T03:11:43.857495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11895","last_updated":"2022-09-24T00:43:19Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-09-24T00:43:19Z","title":"In-context Learning and Induction Heads","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11895","snapshot_observed_at":"2026-08-03T03:11:43.905966Z","title":"nostalgebraist","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:43.905966Z"},"links":{"cited_paper":"/paper/2209.11895","citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:32157f9a89c52a685c7964ea3afa2376a4adedcaec622898468c58029e223deb","observation_id":"de56bc6f-dd01-411a-8473-95482967aec4","resolution":{"observed_at":"2026-08-03T03:11:43.905966Z","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":"10.1007/978-3-031-71602-7_3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"tacl-1.9/","venue":"Lecture notes in computer science","work_id":"e37f608f-a281-4a45-87eb-cbaa910fe4f7","year":2025},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:43.957036Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:f514aabe4344073460e938ea4aa0ddc8d845b71ae7778f57b7f6c9199e842f95","observation_id":"c14f0fd0-f781-42f7-ba2d-712f551eb986","resolution":{"observed_at":"2026-08-03T03:13:33.697955Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-03T03:11:44.004837Z","title":"Weiss, G., Goldberg, Y ., and Yahav, E","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:44.004837Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:e41e8b616221ea59c13cd3050ab590327dc2b4e2e0e9cd4bba9f8571bbad7f3a","observation_id":"bebeec8a-b524-4b31-9b8b-430ec3f33c6a","resolution":{"observed_at":"2026-08-03T03:11:44.004837Z","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-03T03:11:44.044332Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:44.044332Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:a1235902646daf83d3706962de0b86fa6bba647c13b30734b3af1663cdaf57ad","observation_id":"cb61a7b5-7c9c-4eab-8145-c5db57f04a60","resolution":{"observed_at":"2026-08-03T03:11:44.044332Z","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-03T03:11:44.084424Z","title":"Yang, A., Chiang, D., and Angluin, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:44.084424Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:1dc26885d7c604f09f75da5e4f4922c75107b236d4429e0dd96d46c049ca81b9","observation_id":"1bc1cc08-764a-4c2e-b48f-a9aaa905c545","resolution":{"observed_at":"2026-08-03T03:11:44.084424Z","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-03T03:11:47.465016Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.465016Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:5496cbaedb5d727ee4ce115377a218e3d7029fc0728238f09af9d207642df2c0","observation_id":"ba2b2c88-8eed-4101-816e-1901b61c30ae","resolution":{"observed_at":"2026-08-03T03:11:47.465016Z","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-03T03:11:44.201799Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:44.201799Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:1488aa8caeab5da5482842b5e174e3ee110dfa7684460abe63c22797a7e8b630","observation_id":"c3b4f1ed-35c0-41bb-bffa-5ffe9e608c32","resolution":{"observed_at":"2026-08-03T03:11:44.201799Z","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-03T03:11:47.470643Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.470643Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:8d5a229cfcf94f919fb053ad5719071ddb21c211a89777dd29ce756899062ef3","observation_id":"69252b36-53a3-4d09-aa92-01b85c224cd8","resolution":{"observed_at":"2026-08-03T03:11:47.470643Z","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-03T03:11:47.473468Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.473468Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:9a4a6c2a7fbe934959f8af8f43e7b4cfa6586c727be64f5574c5e78b26a793cc","observation_id":"88e43359-7376-4dff-b028-29d4616a441f","resolution":{"observed_at":"2026-08-03T03:11:47.473468Z","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-03T03:11:44.601621Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:44.601621Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:7013c87e949d45f87caa11b06eec0557241b0d0bfa2e6b62785cd00006053341","observation_id":"deaf28d7-c8c4-4d76-81da-14875da6eb5d","resolution":{"observed_at":"2026-08-03T03:11:44.601621Z","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-03T03:11:44.645880Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:44.645880Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:0d4fadc27e3d45058115e1b3dcd5b8ee09a4b4cb4db409330939955414b729cb","observation_id":"b3588e3f-ae49-4f88-a3ca-4dc9bca68d17","resolution":{"observed_at":"2026-08-03T03:11:44.645880Z","resolver_source":null,"status":"malformed_identifier"},"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-03T03:11:44.980645Z","title":"Line defining a selector","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:44.980645Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:608503e17817bd787a1d67f6f4f2fb4a997c2327ec814c486ef46af7cd82f62d","observation_id":"98ca0f33-11a8-432f-b086-051952cb2212","resolution":{"observed_at":"2026-08-03T03:11:44.980645Z","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-03T03:11:45.258339Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:45.258339Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:74ec538310918009a869b592bd1122ed98bc4ca7dd4d30ae8fbade613a4f466b","observation_id":"115f1d06-b441-4dfb-ad55-2f434a510971","resolution":{"observed_at":"2026-08-03T03:11:45.258339Z","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-03T03:11:45.724223Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:45.724223Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:92cd44e01ea2afac0aeda79dc68087ac371159855f3c79ac3d9c6df25f4d5cdf","observation_id":"d9c84387-79d6-4794-92ed-b725d50e2eef","resolution":{"observed_at":"2026-08-03T03:11:45.724223Z","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-03T03:11:45.809678Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:45.809678Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:5f08d67297b9e67c3ca3b1544c612c6756d3467a5f01b4f02d97acbc4b9fdb9f","observation_id":"bd08bba1-4ed1-4101-a76d-30fae9ed3bfb","resolution":{"observed_at":"2026-08-03T03:11:45.809678Z","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-03T03:11:45.890355Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:45.890355Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:717cfa369f7289ba2879ae51b745cc801faeea8c2935321a5573bdb243fdbb3f","observation_id":"28a7b6dd-4485-4bce-8e74-0fdabd1f6e06","resolution":{"observed_at":"2026-08-03T03:11:45.890355Z","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-03T03:11:45.952437Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:45.952437Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:5728708d40f78e3439368791d1adc774dbdb9979704d73087655ead5008f8019","observation_id":"073fb75d-dcb4-4f03-a5a0-413c6814d255","resolution":{"observed_at":"2026-08-03T03:11:45.952437Z","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-03T03:11:46.024543Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.024543Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:7b2b22bca0127b8b556a0c5b180a2994175edd4387a9e0e9b50718a6e278e3a8","observation_id":"3e2f12ad-ea35-4d72-bb4f-2622182cd61e","resolution":{"observed_at":"2026-08-03T03:11:46.024543Z","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-03T03:11:46.090416Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.090416Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:aeaacbc4f10d0ae60d54f56c40fa311ca45b6b285a740ed8d993e7e25e2386d2","observation_id":"adad52b6-d4b3-4940-b548-ef0f26340b4f","resolution":{"observed_at":"2026-08-03T03:11:46.090416Z","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-03T03:11:46.154967Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.154967Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:5e23a9d567bf92e8d083e4ed101eee278c58fff63f5aa80e8febabb6d88e15a6","observation_id":"6cc3747a-2d4f-4ae9-a56d-203c3a5634de","resolution":{"observed_at":"2026-08-03T03:11:46.154967Z","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-03T03:11:46.195289Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.195289Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:3df667061a109c18a17a556649f6589470660e220b8f7158f70e0a34d84a1d8a","observation_id":"6536bcee-77fd-4320-a6df-173a85902d16","resolution":{"observed_at":"2026-08-03T03:11:46.195289Z","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-03T03:11:46.285436Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.285436Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:6c6eeb59eef5938622304804786eeb75b495ebd3b409c437aac80f318ee6b17d","observation_id":"37613aa8-4f1f-41be-967b-b5eecfda80c7","resolution":{"observed_at":"2026-08-03T03:11:46.285436Z","resolver_source":null,"status":"parse_uncertain"},"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-03T03:11:46.350525Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.350525Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:968ae57341e63b80af19aa21d7325d91fb0235e627870f9b977d42d0a8a3cdce","observation_id":"dc52b17c-a7ca-41e1-a2b9-147cb3d996f6","resolution":{"observed_at":"2026-08-03T03:11:46.350525Z","resolver_source":null,"status":"parse_uncertain"},"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-03T03:11:46.396127Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.396127Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:e4ea58db82d503d772f6d102d1b2613f3de320336aa760d3c5f0cfea4c1939d4","observation_id":"9f76c8b0-06b6-4b75-b8c0-698e320ed62b","resolution":{"observed_at":"2026-08-03T03:11:46.396127Z","resolver_source":null,"status":"parse_uncertain"},"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-03T03:11:46.464725Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.464725Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:2909f336c9e01249d47ec10f92d27702fa2831a98869e15a7e27cf17566947e4","observation_id":"3d010b47-66ad-41e4-b763-d22c934a612b","resolution":{"observed_at":"2026-08-03T03:11:46.464725Z","resolver_source":null,"status":"parse_uncertain"},"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-03T03:11:46.517253Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.517253Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:e5fb967b60efc7990b660e768794367ead6dffc794de18376ddbd0e04729c2ad","observation_id":"5bab5cc1-c44e-44e9-a2f6-ef089030c30a","resolution":{"observed_at":"2026-08-03T03:11:46.517253Z","resolver_source":null,"status":"parse_uncertain"},"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-03T03:11:46.580751Z","title":"define the same functions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.580751Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:bd04101579b22c8fe70bd1e563e228c20e0a99c0fec4fcb134acf63354280ca8","observation_id":"3aca1329-2cf2-4dcc-8bc7-d6fba47e822e","resolution":{"observed_at":"2026-08-03T03:11:46.580751Z","resolver_source":null,"status":"malformed_identifier"},"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-03T03:11:46.649219Z","title":"We can see that very different architectures can all be decompilable (e.g., two green lines in Figure 10(a) correspond to 4 layer vs","venue":null,"work_id":null,"year":1900},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.649219Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:14f1558ccc79d578e917964373c285ce80ce083e6987b32ec1b737795df3d1be","observation_id":"88d53f67-5a9c-458e-8dce-65f93abdf2c8","resolution":{"observed_at":"2026-08-03T03:11:46.649219Z","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-03T03:11:46.720932Z","title":"Columns of v is the result of per-column operation of x, i.e., v(i) only depends on x(i)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.720932Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:34cad227f6618653cf49414d94f0958662f42e0f22dd29b3b62546c4e9c43eb0","observation_id":"967422e5-142f-46eb-9c6d-a914ae1eed5c","resolution":{"observed_at":"2026-08-03T03:11:46.720932Z","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-03T03:11:46.768176Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.768176Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:60c026d2c28045698e5a625d281b13b3eac9e6b424a083dee3c3ae203cca84ec","observation_id":"4e092af1-3731-49ef-9458-44f71db89f10","resolution":{"observed_at":"2026-08-03T03:11:46.768176Z","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-03T03:11:46.834312Z","title":"Importantly, to simplify the generated program, we favor replacing MLP with linear operation, i.e., fno−op","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.834312Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:77740d23d3455244268ce42bcec8ba93fda848eb4f39bb4973b1e9d6dba559d7","observation_id":"80b63d35-6817-4ee7-a6fa-65c22fe2b0d1","resolution":{"observed_at":"2026-08-03T03:11:46.834312Z","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-03T03:11:46.895562Z","title":"In this case, we store the variables and visualize them so that one can still interpret the MLP manually (Section G.4)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.895562Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:c545042d2262dbe87cd160c730c330c86bfc7317f7408f063ef60a9f1fa14aa8","observation_id":"b5fabd68-4cb0-4c85-80e2-6a5f7bddf1b7","resolution":{"observed_at":"2026-08-03T03:11:46.895562Z","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-03T03:11:46.957338Z","title":", xs, we collect them all","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:46.957338Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:8879f67e2c7d9db6badbc334ae2f011be083ee3ac6c8586b2f5a941f7a544077","observation_id":"fe4ec2ad-d493-41a1-9f2e-9c962d8ffba2","resolution":{"observed_at":"2026-08-03T03:11:46.957338Z","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-03T03:11:47.043224Z","title":", xs,func=f i), and is from a different list (see below)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.043224Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:f30ad411f3f6709c3c812ee8ef609c347179b4b8eda4ccfa11daa9b75ceda780","observation_id":"ddd7f74b-3eee-49b8-a75f-6215c824cb48","resolution":{"observed_at":"2026-08-03T03:11:47.043224Z","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-03T03:11:47.112908Z","title":"Collect its input activation variable samples vinp and corresponding output of this MLP vout","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.112908Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:9bd6751fc4f1ca8370cc82d63d89cce218ae5673076b2ab1e0aaa2660af12ab2","observation_id":"47dc7404-c041-4c14-bed1-17d1888088f8","resolution":{"observed_at":"2026-08-03T03:11:47.112908Z","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-03T03:11:47.171623Z","title":"Formally, we iterate over downstream components afterwards on the path","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.171623Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:03a901d51d900566d16b1a3196579bc9913f8e0904e474e77bcdc3d8f4e7f6b0","observation_id":"c6df8eec-c637-4910-ac74-0a3797d58c2d","resolution":{"observed_at":"2026-08-03T03:11:47.171623Z","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-03T03:11:47.251167Z","title":"We replace the original project operation by project(vout, I|Σ|×|Σ|), that is, the project operation uses the identity matrix","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.251167Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:6a2d5c93d4183cc8aeda407375ed29e1140cd5f1503b41c070688827f0d71c70","observation_id":"fb725e44-0ceb-42fb-88e8-be9bfdfbb3b8","resolution":{"observed_at":"2026-08-03T03:11:47.251167Z","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-03T03:11:47.305038Z","title":"We emphasize the token promoted most","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.305038Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:18076dbdccb6bdebbc1f48a068f157c53057ae4f20052340dab4cec9f95f9d57","observation_id":"3f9e9995-40c9-4ee6-8ee1-2dec72b2465f","resolution":{"observed_at":"2026-08-03T03:11:47.305038Z","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-03T03:11:47.364229Z","title":"Collect its input activation variable samplesv (q) inp and corresponding output of this MLPv (q) out","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.364229Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:93f85a931e7353181ba22012c4c287f66b0f03e2693c7354c77a04621a4d99e3","observation_id":"0c728e23-deeb-4dd2-a71f-2a7c7555beaf","resolution":{"observed_at":"2026-08-03T03:11:47.364229Z","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-03T03:11:47.400256Z","title":"When only one of query and key contains unexplained MLP, we apply the method in Appendix G.1 for the other to get these two variables easily","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.400256Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:a57b09120869cc2c211bb57ebfc389bbdef029603d38ada1422386a4cd9a529d","observation_id":"f278124b-34f2-493e-86f9-48d0ea61d494","resolution":{"observed_at":"2026-08-03T03:11:47.400256Z","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-03T03:11:47.403577Z","title":"Each entry in this matrix describes how each pair of columns in v(k) inp and v(q) inp is associated","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.403577Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:a87e86a3cdb98ad9ff34b24b7cb9dbefac1e1beaf32ce482e1a49b6eb8223678","observation_id":"9d035a02-2eee-45ea-9965-d32fc604236d","resolution":{"observed_at":"2026-08-03T03:11:47.403577Z","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-03T03:11:47.407025Z","title":"36 Interpretable Algorithms by Decompiling Transformers","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.407025Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:f05565b55e0bcfc38b8423a277eb01398101efbe05e0633cc6233cd7cf500375","observation_id":"1aa6f6ba-b253-409a-b941-8cae3a1c08dd","resolution":{"observed_at":"2026-08-03T03:11:47.407025Z","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-03T03:11:47.410293Z","title":"side-effect","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.410293Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:06991792b047eb170e3ead6626dd6c2d91a0c7a42a6cdfe4bc49e640657bca54","observation_id":"d8484378-03c2-4a26-bec4-7c4949ca180d","resolution":{"observed_at":"2026-08-03T03:11:47.410293Z","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-03T03:11:47.419602Z","title":"a1 holds counts of the relative frequencies of 0, 1, BOS, SEP (Figure 17a)","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.419602Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:5d9975c2b8676af78ee7fd0195cf97c2ae4c52361b69073416b2dda67dd1d87a","observation_id":"c83d4778-157d-49cf-a4c5-8c1fd6ef3c75","resolution":{"observed_at":"2026-08-03T03:11:47.419602Z","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-03T03:11:47.431125Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.431125Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:5d1e7c28dc81651206b1a4eb748eea88dfebcaaac027878ab9dad2f1f603fa5d","observation_id":"9f0a31ca-1b5b-46c5-aa87-91db1b6b945b","resolution":{"observed_at":"2026-08-03T03:11:47.431125Z","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-03T03:11:47.434222Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.434222Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:a1c4866916257cb1dbe64afe472bcbefb7825d329222e48451fff8b3d6a1f717","observation_id":"48461345-21ac-4132-bc24-c86853f439f6","resolution":{"observed_at":"2026-08-03T03:11:47.434222Z","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-03T03:11:47.437136Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.437136Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:8cda05fa88ec03cbc97d2e21e7c2496ad37f2de89b4304d1ad3799bed707d953","observation_id":"c99ce249-7a9e-4c82-a2fd-d8e4bdc2a740","resolution":{"observed_at":"2026-08-03T03:11:47.437136Z","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-03T03:11:47.440177Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.440177Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:781d45b3ff3dcb5accacec9cde2619297288e40594b8986a433a5a528005aef2","observation_id":"de052b0a-2dd0-4501-b678-14dd8673aa03","resolution":{"observed_at":"2026-08-03T03:11:47.440177Z","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-03T03:11:47.442946Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.442946Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:f53bf6e10931392624a8ee8bc56b544bf8df5a547c18e137e97012d8cd8009dd","observation_id":"14749e99-d799-4bc2-ad95-63dff8025552","resolution":{"observed_at":"2026-08-03T03:11:47.442946Z","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-03T03:11:47.445689Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.445689Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:0a408fd87554dfa74ee516df6ef3e99256c7c903912a9306e6e114c0a2fdde63","observation_id":"38c98b16-dc39-4289-b13c-5f0992f48cf8","resolution":{"observed_at":"2026-08-03T03:11:47.445689Z","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-03T03:11:47.448462Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.448462Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:87c6048d34aab578523cd47f41ede0e0a1008872b16c93fa9ac7026bc9112969","observation_id":"29f319b9-e638-4dba-8ced-0b17b5bd1d86","resolution":{"observed_at":"2026-08-03T03:11:47.448462Z","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-03T03:11:47.451147Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.451147Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:9f6121d6ed025f043410816aa31f4281603251e132e793b78cce0684aa0c6b19","observation_id":"db6b9b2f-da1a-4e42-9311-b58fc780ba80","resolution":{"observed_at":"2026-08-03T03:11:47.451147Z","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-03T03:11:47.453792Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.453792Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:e872e21cf69fdb51bc165a986606857f69eac18256e51062992e1599d1a91538","observation_id":"11915485-6bb2-450c-a1cc-8c1a40cc771c","resolution":{"observed_at":"2026-08-03T03:11:47.453792Z","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-03T03:11:47.456772Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.456772Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:6b19cfef6716e02c80507850bca3285fc58b3ef144d2cb7cd32aa7aae81d6ec8","observation_id":"d0f2c865-f206-4445-90ba-95e9a21ec8c5","resolution":{"observed_at":"2026-08-03T03:11:47.456772Z","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-03T03:11:47.459656Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.459656Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:b9652c99cc2719206f6ebd9645b810a6aaa5ef4c7d3c6c05f49aab881126b9ee","observation_id":"592ad641-6cc2-4811-8ce6-bb29bf4fab88","resolution":{"observed_at":"2026-08-03T03:11:47.459656Z","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-03T03:11:47.462347Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.462347Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:b4bc41e1ac0c86dde23d2b6856ce8b6ec9ce117b9e4aa710de749952838ce5b8","observation_id":"dc69ca38-2efc-4087-8a43-10d0fbf2bb0c","resolution":{"observed_at":"2026-08-03T03:11:47.462347Z","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-03T03:11:47.467889Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.467889Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:8f763787463e9a6fdd7a292a389e45fb0dc1326e0ae8a8e225b1b9b1ef9c8728","observation_id":"bd701237-c0ea-4585-84f0-197647e4781a","resolution":{"observed_at":"2026-08-03T03:11:47.467889Z","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-03T03:11:47.478760Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.478760Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:ffd3664ad71a15c9f58be1345a669228f01e6c21a8b5223e2aa80cd56263439e","observation_id":"a3e0c74a-78d1-4add-b51b-7ca4b6eba2fe","resolution":{"observed_at":"2026-08-03T03:11:47.478760Z","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-03T03:11:47.484853Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.484853Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:d6c480755ff8fb4fe1b3ba5a418cd9b90ebb8d669a6fe92eb910693689709843","observation_id":"0f4a870c-c64d-4573-958e-410869a94c33","resolution":{"observed_at":"2026-08-03T03:11:47.484853Z","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-03T03:11:47.499406Z","title":"Line 1 defines a selector ensuring that, at SEP, attention specifically goes to the non-special tokens (Figure 21a)","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":104,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.499406Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:ccd13ac7b1de4bf8e9dc7140be68eb4d844ec0b51ebc5fbc19c2647102e4ca3d","observation_id":"1c3984b2-029d-4943-b178-537f91e3f8f7","resolution":{"observed_at":"2026-08-03T03:11:47.499406Z","resolver_source":null,"status":"malformed_identifier"},"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-03T03:11:47.508446Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":107,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.508446Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:68372705ba658a1c4e4293e85674e5049011a8ac1c12851cdc1fba4730433acc","observation_id":"9b3bf969-dee5-4171-bad5-d6695a94a451","resolution":{"observed_at":"2026-08-03T03:11:47.508446Z","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-03T03:11:47.510944Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":108,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.510944Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:5d5a7a031b6f1ba4447c93ae3dcd4ad6e53fa23c3db731e192229a389b6c64a8","observation_id":"e4e2093f-1d9f-4029-9827-ac9e74f18d17","resolution":{"observed_at":"2026-08-03T03:11:47.510944Z","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-03T03:11:47.513480Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":109,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.513480Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:1d74b16a859d2ff1a11c10d797345a766bf7c6a21c77a3e2ee5f97ca2e354616","observation_id":"77e7d90f-1040-4ace-a70a-0fc003bcc5c8","resolution":{"observed_at":"2026-08-03T03:11:47.513480Z","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-03T03:11:47.516053Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":110,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.516053Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:40a26380a2166bc210787e7aab0f36a3633e20c9341a6233f6d0cb62045fe38a","observation_id":"31f54844-d145-4362-b12e-2e0dadad4778","resolution":{"observed_at":"2026-08-03T03:11:47.516053Z","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-03T03:11:47.518903Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":111,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.518903Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:80aaa627370078126f87a47114a3f2f6d8f190e161e672347e12bf09fcaa68e9","observation_id":"6648cd6c-bdbc-4d0f-9d0e-269262d39f3f","resolution":{"observed_at":"2026-08-03T03:11:47.518903Z","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-03T03:11:47.521410Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":112,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.521410Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:43bda5cf2b748c63706cb81fdf62bdf1b29a82b2026323ae03ab0e0d526fa609","observation_id":"6bd1debe-b54b-4519-a372-ef5df0815719","resolution":{"observed_at":"2026-08-03T03:11:47.521410Z","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-03T03:11:47.524099Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":113,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.524099Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:d28ac40260a7df2beab4669ed459d2e4985a6a1f07913269edec552347953619","observation_id":"96021ed0-3d27-4fca-a870-18fff62525df","resolution":{"observed_at":"2026-08-03T03:11:47.524099Z","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-03T03:11:47.527520Z","title":"So each number would attend to the previous largest number, which the terminating number","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":114,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.527520Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:56d8ced3f0b1130898616708faa312037629d2b0567a7b86b3f2ff4c81db9724","observation_id":"722ad027-ce12-4632-b9a0-162a5718cf15","resolution":{"observed_at":"2026-08-03T03:11:47.527520Z","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-03T03:11:47.530561Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":115,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.530561Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:369726642d4b43963a950253d6bbd88416b723bd1cd0d5465e50319cfe80bdba","observation_id":"34c04069-9820-4f47-b777-de1770070e05","resolution":{"observed_at":"2026-08-03T03:11:47.530561Z","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-03T03:11:47.533041Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":116,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.533041Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:b5c73e3bf6a5b14dc1121e65d7be4198bfa4ede2f57976dafda90f4b75bedb5a","observation_id":"8ebc2088-29d4-49b2-be34-24bfba20f24c","resolution":{"observed_at":"2026-08-03T03:11:47.533041Z","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-03T03:11:47.538370Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":118,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.538370Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:fec69e87501c4dfbd2196fdc1b82f9851c9af97909fc433e5ab40b89db395676","observation_id":"8cde6c24-42b6-47b6-bc22-1a124c3d94c4","resolution":{"observed_at":"2026-08-03T03:11:47.538370Z","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-03T03:11:47.541028Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":119,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.541028Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:9cc0ac994ab9ce196776f1e96867720b51d053ff94221ba6d4263a87ed88183b","observation_id":"4f34a0cb-f6a6-453b-8b05-c7b022dc9240","resolution":{"observed_at":"2026-08-03T03:11:47.541028Z","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-03T03:11:47.543841Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":120,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.543841Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:c13e34bdf4763af8a26c56a13b792b57bc32b3c9c77c7b578a6cd9d4270d7b20","observation_id":"0733c028-d310-4ebb-88b4-01b9c471b810","resolution":{"observed_at":"2026-08-03T03:11:47.543841Z","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-03T03:11:47.546724Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":121,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.546724Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:198b85e3ec45edfa3a6b7d44a11d58b85962b677265a45c37114b44363b457e6","observation_id":"715a995a-0379-49ec-b4fc-eb54ea1cb012","resolution":{"observed_at":"2026-08-03T03:11:47.546724Z","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-03T03:11:47.549628Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":122,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.549628Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:dd8708aedc2eaac1123e90e8aee0e65b6d0e5d8986dc1beeadf4dcaee9702946","observation_id":"6af251d1-d3ec-45b6-999c-d836b7b3dff0","resolution":{"observed_at":"2026-08-03T03:11:47.549628Z","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-03T03:11:47.552523Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":123,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.552523Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:23da946ae859dfbf1d4dcf3a38e629a3bae9e7da52a4aea053f6b3a3494244d2","observation_id":"7a529e66-c12c-4a2c-b037-39d4a463c965","resolution":{"observed_at":"2026-08-03T03:11:47.552523Z","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-03T03:11:47.555140Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":124,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.555140Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:6c850f8aafa75e1edc03b569a708a284798ad557c281e9b302c3b26a7b5a8428","observation_id":"631ba381-122d-42ff-ab83-67bf71eacb16","resolution":{"observed_at":"2026-08-03T03:11:47.555140Z","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-03T03:11:47.557810Z","title":"In line 1, SEP attends to the smallest number, which is the starting number","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":125,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.557810Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:e753288aab81027cbf36ab385451e0c82b8b06e32609683c3b39a5630bc16f45","observation_id":"d3c1782b-1508-41d7-91e1-b191f67de327","resolution":{"observed_at":"2026-08-03T03:11:47.557810Z","resolver_source":null,"status":"malformed_identifier"},"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-03T03:11:47.561010Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":126,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.561010Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:8a0121e01696a21808c7c1a2db2ac650f6db8789a1b9a605fee6239129d0abf9","observation_id":"15872b7a-e458-4cde-a4e0-69c231fed3e7","resolution":{"observed_at":"2026-08-03T03:11:47.561010Z","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-03T03:11:47.566326Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":128,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.566326Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:0c54109f32860e76eef3fd54e73180f8d184a1e7f6b10277fcd350faf529122f","observation_id":"b0ebd75a-1bc7-4c7d-ae38-6e231b4123d1","resolution":{"observed_at":"2026-08-03T03:11:47.566326Z","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-03T03:11:47.571743Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":130,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.571743Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:be9cb52e885de78fd9b51a83b0ccd456404b322d80e42d07b9bc3f99e1219fc9","observation_id":"f9bb34cd-a11c-4dda-b7b6-9cbd1c6109dc","resolution":{"observed_at":"2026-08-03T03:11:47.571743Z","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-03T03:11:47.574247Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":131,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.574247Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:30800a63597cc3f34a3cc8e86bcd828c1329cb61ffc17315f6a82a498bb1ec9a","observation_id":"9fd2b652-de9b-452b-924c-6718b63ac637","resolution":{"observed_at":"2026-08-03T03:11:47.574247Z","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-03T03:11:47.579464Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":133,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.579464Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:c5be6bc51fb578f8d6879d10b87246eb92ba43c007d5985825f2b1f239a78db9","observation_id":"d40111eb-fca7-48ae-aa39-138d6614eadb","resolution":{"observed_at":"2026-08-03T03:11:47.579464Z","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-03T03:11:47.586919Z","title":"Line 1 assigns weight to input numbers that are a little larger than the current token","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":136,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.586919Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:bbf68a4c841ba3e20331bee802128138bc0a9aeb06cdcc514823385bc711615d","observation_id":"ce7a356f-104e-4a4a-84de-b1ce5526fe1b","resolution":{"observed_at":"2026-08-03T03:11:47.586919Z","resolver_source":null,"status":"malformed_identifier"},"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-03T03:11:47.592760Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":138,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.592760Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:019a8dbd2209cab99dd79d9efae5f357f2b520e565ae654e7c327b4329060175","observation_id":"2038576d-9853-4481-88fc-7feda454102f","resolution":{"observed_at":"2026-08-03T03:11:47.592760Z","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-03T03:11:47.600854Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":141,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.600854Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:6536bec78bf9a651be1cfc26aef4acea600b11034c76281101d34a46ff0da2ba","observation_id":"809ef6d1-78d3-4f41-8268-0a91217a0b0e","resolution":{"observed_at":"2026-08-03T03:11:47.600854Z","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-03T03:11:47.603448Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":142,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.603448Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:8aa3054aede4ac07d15db51a3ed283fbd4e8241c3c2c6a33a88a057e409d6783","observation_id":"a51feed6-1d27-487d-83fa-dddef2bd1a60","resolution":{"observed_at":"2026-08-03T03:11:47.603448Z","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-03T03:11:47.606002Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":143,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.606002Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:c9f4ed15e1a2deee6b9bbd1e685e909633285c23b479e55a571eaad9b46cc92b","observation_id":"b2f082ca-5dc2-4739-bc2c-313fe480fb4d","resolution":{"observed_at":"2026-08-03T03:11:47.606002Z","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-03T03:11:47.608465Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":144,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.608465Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:498fbaaac7287c1b623e788be6f1304bbf88277584d9aa0c1a9b2db2bdc66749","observation_id":"e7d7963e-007a-4eda-b621-3e5376144661","resolution":{"observed_at":"2026-08-03T03:11:47.608465Z","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-03T03:11:47.610920Z","title":"Lines 1–4 retrieve the two preceding symbols; Line 5 creates a joint (nonlinear) representation of the trigram ending with the current symbol","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":145,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.610920Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:fb7cb8fc7f75c0b99d19d0be15f3eadd3c30121316b97b609ff3e7a074324189","observation_id":"95a1be10-4b14-45da-88b4-0e40b4001198","resolution":{"observed_at":"2026-08-03T03:11:47.610920Z","resolver_source":null,"status":"malformed_identifier"},"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-03T03:11:47.614102Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":146,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.614102Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:9a54b3a3d0a9527e00ddf99aa7626393a30166a7a2e20d9e26655f591468f2b8","observation_id":"bd08e501-c8a3-4e73-a2b5-9eff433e9b35","resolution":{"observed_at":"2026-08-03T03:11:47.614102Z","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-03T03:11:47.616891Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":147,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.616891Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:153ad7703473b584c37691a2b42be81b8fbe20dde4ce70553bfdc4fb7ea2dd16","observation_id":"637fd32c-3fad-41ac-9b4c-181f25e6a520","resolution":{"observed_at":"2026-08-03T03:11:47.616891Z","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-03T03:11:47.619341Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":148,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:47.619341Z"},"links":{"citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:cd76bd5b35d0d5583b2a42244441dadd0e2f43974e5180fc55e1e3c82e240ecd","observation_id":"bebb025e-1f37-43bc-8db9-5f090a7e63ed","resolution":{"observed_at":"2026-08-03T03:11:47.619341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.08857","last_updated":"2026-06-05T13:59:44Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T16:49:20.566067Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":6,"metadata_mismatch":0,"parse_uncertain":5,"unresolved":88,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":176},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 100 of 176 outbound references and 0 inbound Pith citation observations for arXiv:2602.08857."}