{"as_of":"2026-08-10T22:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5821aff7f1b8c179374d8f3c28defe9ccc5b6859f05a941ff78c23ebf5184a92","coverage":[{"denominator":2,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T11:40:57.051447Z","state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:11:44.144774Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T07:41:01.336775Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2601.05770","last_updated":"2026-05-29T09:26:26Z","snapshot_observed_at":"2026-08-04T19:41:09.074836Z","submitted_at":"2026-01-09T12:49:41Z","title":"Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformer","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.05770","snapshot_observed_at":"2026-08-03T03:11:44.144774Z","title":"Most Frequent","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-10T13:19:36.104316Z","submitted_at":"2026-02-09T16:22:29Z","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T03:11:44.144774Z"},"links":{"cited_paper":"/paper/2601.05770","citing_paper":"/paper/2602.08857"},"observation_digest":"sha256:9aa86ba476cff24ebb55f08b6534053e933e14e015b78f71ab814d6cac552e40","observation_id":"d075bcaa-bdbe-4b24-81ec-005fc870d0ad","resolution":{"observed_at":"2026-08-03T03:11:44.144774Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.05770","last_updated":"2026-05-29T09:26:26Z","snapshot_observed_at":"2026-08-04T19:41:09.074836Z","submitted_at":"2026-01-09T12:49:41Z","title":"Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformer","version":3},"cited_work":{"arxiv_id":"2601.05770","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2601.05770","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Weights to code: Extracting interpretable algorithms from the discrete transformer","venue":null,"work_id":"677da7a5-59fd-4aed-a38d-159ec4cbeaa6","year":2026},"citing_paper":{"arxiv_id":"2604.08816","last_updated":"2026-04-09T23:11:28Z","snapshot_observed_at":"2026-07-06T22:57:50.266735Z","submitted_at":"2026-04-09T23:11:28Z","title":"Loom: A Scalable Analytical Neural Computer Architecture","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T17:01:33.381684Z"},"links":{"cited_paper":"/paper/2601.05770","citing_paper":"/paper/2604.08816"},"observation_digest":"sha256:62ebef89038c89ef78ed9857ca2ae2fdd822784c13680dcbb5eca5352b2cf9ec","observation_id":"a06b7928-5b83-4160-bcf8-c658176e5fa0","resolution":{"observed_at":"2026-06-01T02:02:24.249343Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2601.05770/citation-record","integrity":"/paper/2601.05770/integrity","json":"/paper/2601.05770/citation-record.json","paper":"/paper/2601.05770"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.08600","last_updated":"2023-10-04T13:17:38Z","snapshot_observed_at":"2026-07-06T16:19:05.495349Z","submitted_at":"2023-09-15T17:56:55Z","title":"Sparse Autoencoders Find Highly Interpretable Features in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.08600","snapshot_observed_at":"2026-08-03T11:40:56.983907Z","title":"Cunningham, H., Ewart, A., Riggs, L., Huben, R., and Sharkey, L","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2601.05770","last_updated":"2026-05-29T09:26:26Z","snapshot_observed_at":"2026-08-04T19:41:09.074836Z","submitted_at":"2026-01-09T12:49:41Z","title":"Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformer","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-03T11:40:56.983907Z"},"links":{"cited_paper":"/paper/2309.08600","citing_paper":"/paper/2601.05770"},"observation_digest":"sha256:2388a223b6bb6ea8c538eb7cc6f4cde218812d47f1fca0ee2a5baa1069b60420","observation_id":"2c7189ce-a1a8-446a-98f1-aa1a35d85558","resolution":{"observed_at":"2026-08-03T11:40:56.983907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01144","last_updated":"2017-08-05T22:45:19Z","snapshot_observed_at":"2026-08-01T18:34:23.156273Z","submitted_at":"2016-11-03T19:48:08Z","title":"Categorical Reparameterization with Gumbel-Softmax","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01144","snapshot_observed_at":"2026-08-03T11:40:57.051447Z","title":"unmatched heads","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.05770","last_updated":"2026-05-29T09:26:26Z","snapshot_observed_at":"2026-08-04T19:41:09.074836Z","submitted_at":"2026-01-09T12:49:41Z","title":"Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformer","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T11:40:57.051447Z"},"links":{"cited_paper":"/paper/1611.01144","citing_paper":"/paper/2601.05770"},"observation_digest":"sha256:16e805a1d77cbd2b1d347c7f6639c24b72f81165ca4df706de78adc66bf68ba4","observation_id":"30153c6f-a137-4310-8203-75031589ee17","resolution":{"observed_at":"2026-08-03T11:40:57.051447Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.05770","last_updated":"2026-05-29T09:26:26Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T19:41:09.074836Z","submitted_at":"2026-01-09T12:49:41Z","title":"Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformer"},"reference_resolution":{"displayed":2,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":2},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 2 of 2 outbound references and 2 inbound Pith citation observations for arXiv:2601.05770."}