{"as_of":"2026-08-05T14:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6810c152953c40fe234d0605b0a691bff81243156606355282c660c34680fb95","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":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-05T06:32:48.257954+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T17:31:45.867744Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.12316","last_updated":"2023-07-10T17:15:23Z","snapshot_observed_at":"2026-08-03T17:40:24.585237Z","submitted_at":"2022-11-22T15:10:48Z","title":"Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions","version":2},"cited_work":{"arxiv_id":"2211.12316","doi":"10.48550/arxiv.2211.12316","metadata_source":"arxiv_reference","pith_arxiv_id":"2211.12316","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Simplicity bias in transformers and their ability to learn sparse boolean functions.arXiv preprint arXiv:2211.12316","venue":"arXiv (Cornell University)","work_id":"a67c0fbc-35d2-4c53-bac2-1cefbef871ff","year":null},"citing_paper":{"arxiv_id":"2601.03162","last_updated":"2026-05-07T04:15:05Z","snapshot_observed_at":"2026-07-06T22:40:51.136169Z","submitted_at":"2026-01-06T16:35:07Z","title":"On the Convergence Behavior of Preconditioned Gradient Descent Toward the Rich Learning Regime","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T17:21:48.237907Z"},"links":{"cited_paper":"/paper/2211.12316","citing_paper":"/paper/2601.03162"},"observation_digest":"sha256:2f4929bb3a7822d3a919352fbe51f83500002c5b793453dc4a66652294b10323","observation_id":"e4523a6c-32ba-4b04-84e2-4824b425a212","resolution":{"observed_at":"2026-05-16T17:23:09.981113Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12316","last_updated":"2023-07-10T17:15:23Z","snapshot_observed_at":"2026-08-03T17:40:24.585237Z","submitted_at":"2022-11-22T15:10:48Z","title":"Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions","version":2},"cited_work":{"arxiv_id":"2211.12316","doi":"10.48550/arxiv.2211.12316","metadata_source":"arxiv_reference","pith_arxiv_id":"2211.12316","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Simplicity bias in transformers and their ability to learn sparse boolean functions.arXiv preprint arXiv:2211.12316","venue":"arXiv (Cornell University)","work_id":"a67c0fbc-35d2-4c53-bac2-1cefbef871ff","year":null},"citing_paper":{"arxiv_id":"2605.10019","last_updated":"2026-05-11T05:44:18Z","snapshot_observed_at":"2026-07-06T23:22:03.830881Z","submitted_at":"2026-05-11T05:44:18Z","title":"The two clocks and the innovation window: When and how generative models learn rules","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-12T03:15:45.257213Z"},"links":{"cited_paper":"/paper/2211.12316","citing_paper":"/paper/2605.10019"},"observation_digest":"sha256:74cedd9c17dc169bbe2edc2938588b0829670df1864e80e19bcc3ceb48be4a8e","observation_id":"303ec49c-3c8d-4385-b4fd-977844d79869","resolution":{"observed_at":"2026-05-12T03:16:18.027875Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12316","last_updated":"2023-07-10T17:15:23Z","snapshot_observed_at":"2026-08-03T17:40:24.585237Z","submitted_at":"2022-11-22T15:10:48Z","title":"Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions","version":2},"cited_work":{"arxiv_id":"2211.12316","doi":"10.48550/arxiv.2211.12316","metadata_source":"arxiv_reference","pith_arxiv_id":"2211.12316","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Simplicity bias in transformers and their ability to learn sparse boolean functions.arXiv preprint arXiv:2211.12316","venue":"arXiv (Cornell University)","work_id":"a67c0fbc-35d2-4c53-bac2-1cefbef871ff","year":null},"citing_paper":{"arxiv_id":"2606.00605","last_updated":"2026-05-30T08:05:27Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T08:05:27Z","title":"Looped Transformers with Layer Normalization Provably Learn the Power Method","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-06-28T19:03:51.212121Z"},"links":{"cited_paper":"/paper/2211.12316","citing_paper":"/paper/2606.00605"},"observation_digest":"sha256:f0dc91759495de813afadca42eb45f7ef36c93b398285309b18842817fe152e1","observation_id":"c6b6a374-4273-4960-83d6-64b97cb5b4ac","resolution":{"observed_at":"2026-06-28T19:22:35.270714Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12316","last_updated":"2023-07-10T17:15:23Z","snapshot_observed_at":"2026-08-03T17:40:24.585237Z","submitted_at":"2022-11-22T15:10:48Z","title":"Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12316","snapshot_observed_at":"2026-08-01T17:31:45.867744Z","title":"Simplicity bias in transformers and their ability to learn sparse boolean functions.arXiv:2211.12316,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17624","last_updated":"2026-07-20T07:26:17Z","snapshot_observed_at":"2026-08-05T12:21:27.591563Z","submitted_at":"2026-07-20T07:26:17Z","title":"Can Transformers Really Do It All? On the Compatibility of Inductive Biases Across Tasks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T17:31:45.867744Z"},"links":{"cited_paper":"/paper/2211.12316","citing_paper":"/paper/2607.17624"},"observation_digest":"sha256:3e8f39d7eae9b7226ae745616383d6e62b3f755d03aced249227bcbbe82f81a2","observation_id":"bde0fb00-7a27-480e-a501-819d8dd0ca91","resolution":{"observed_at":"2026-08-01T17:31:45.867744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2211.12316/citation-record","integrity":"/paper/2211.12316/integrity","json":"/paper/2211.12316/citation-record.json","paper":"/paper/2211.12316"},"outbound":[],"paper":{"arxiv_id":"2211.12316","last_updated":"2023-07-10T17:15:23Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T17:40:24.585237Z","submitted_at":"2022-11-22T15:10:48Z","title":"Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2211.12316."}