{"as_of":"2026-08-09T07:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:149028104f78944f49d3757f8fee40d3cba0cee5b68c6daf318e30c44bfca497","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:23:22.073221Z","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-07-03T04:27:37.211749Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.10427","last_updated":"2023-03-23T14:21:02Z","snapshot_observed_at":"2026-08-06T16:01:15.515442Z","submitted_at":"2021-03-18T17:58:02Z","title":"The Low-Rank Simplicity Bias in Deep Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.10427","snapshot_observed_at":"2026-08-08T13:23:22.073221Z","title":"The low-rank simplicity bias in deep networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.07266","last_updated":"2025-05-27T02:56:52Z","snapshot_observed_at":"2026-08-08T13:14:58.702776Z","submitted_at":"2025-02-11T05:28:59Z","title":"When More is Less: Understanding Chain-of-Thought Length in LLMs","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T13:23:22.073221Z"},"links":{"cited_paper":"/paper/2103.10427","citing_paper":"/paper/2502.07266"},"observation_digest":"sha256:c9b82f7c11040b070aee71a4627cd736458dda4678aa9990505b535bc3a79162","observation_id":"0f52a86a-a4fe-4ec2-b6dc-1feb5b3ba2ab","resolution":{"observed_at":"2026-08-08T13:23:22.073221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.10427","last_updated":"2023-03-23T14:21:02Z","snapshot_observed_at":"2026-08-06T16:01:15.515442Z","submitted_at":"2021-03-18T17:58:02Z","title":"The Low-Rank Simplicity Bias in Deep Networks","version":4},"cited_work":{"arxiv_id":"2103.10427","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10427","snapshot_observed_at":"2026-07-03T04:27:37.211749Z","title":"The low-rank simplicity bias in deep networks","venue":null,"work_id":"312521ca-bde0-4624-820c-750b0d4ed6e1","year":2021},"citing_paper":{"arxiv_id":"2503.03206","last_updated":"2026-04-05T03:35:40Z","snapshot_observed_at":"2026-08-01T14:26:26.507861Z","submitted_at":"2025-03-05T05:50:38Z","title":"An Analytical Theory of Spectral Bias in the Learning Dynamics of Diffusion Models","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-23T01:41:55.632680Z"},"links":{"cited_paper":"/paper/2103.10427","citing_paper":"/paper/2503.03206"},"observation_digest":"sha256:5c478094812feda189bcfa78c56897bc52e0d7c74c8a85ab82f758538646ac4b","observation_id":"b29a38d8-e310-4a5b-8743-9c3f7010c5ca","resolution":{"observed_at":"2026-05-23T01:42:23.169188Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2103.10427","last_updated":"2023-03-23T14:21:02Z","snapshot_observed_at":"2026-08-06T16:01:15.515442Z","submitted_at":"2021-03-18T17:58:02Z","title":"The Low-Rank Simplicity Bias in Deep Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.10427","snapshot_observed_at":"2026-08-06T12:03:43.145109Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.22216","last_updated":"2025-08-13T03:31:21Z","snapshot_observed_at":"2026-08-06T12:03:41.812283Z","submitted_at":"2025-07-29T20:25:09Z","title":"Representation biases: will we achieve complete understanding by analyzing representations?","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T12:03:43.145109Z"},"links":{"cited_paper":"/paper/2103.10427","citing_paper":"/paper/2507.22216"},"observation_digest":"sha256:79877e06e3bf21a5526f018491de45abc9372fa5c49de39cdb9d4523ea660715","observation_id":"6c41aea2-83e8-4255-a54b-ffc2b07fe243","resolution":{"observed_at":"2026-08-06T12:03:43.145109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.10427","last_updated":"2023-03-23T14:21:02Z","snapshot_observed_at":"2026-08-06T16:01:15.515442Z","submitted_at":"2021-03-18T17:58:02Z","title":"The Low-Rank Simplicity Bias in Deep Networks","version":4},"cited_work":{"arxiv_id":"2103.10427","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10427","snapshot_observed_at":"2026-07-03T04:27:37.211749Z","title":"The low-rank simplicity bias in deep networks","venue":null,"work_id":"312521ca-bde0-4624-820c-750b0d4ed6e1","year":2021},"citing_paper":{"arxiv_id":"2508.04853","last_updated":"2026-04-09T18:24:08Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-08-06T20:00:40Z","title":"Provable Post-Training Quantization: Theoretical Analysis of OPTQ and Qronos","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T23:52:06.036879Z"},"links":{"cited_paper":"/paper/2103.10427","citing_paper":"/paper/2508.04853"},"observation_digest":"sha256:a18606fa0426523d70e73fd7ce95effa25a4622e886f64a6d04874f12fc71477","observation_id":"15349436-f3aa-442f-be73-27bb3247f620","resolution":{"observed_at":"2026-05-18T23:52:53.051557Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2103.10427","last_updated":"2023-03-23T14:21:02Z","snapshot_observed_at":"2026-08-06T16:01:15.515442Z","submitted_at":"2021-03-18T17:58:02Z","title":"The Low-Rank Simplicity Bias in Deep Networks","version":4},"cited_work":{"arxiv_id":"2103.10427","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10427","snapshot_observed_at":"2026-07-03T04:27:37.211749Z","title":"The low-rank simplicity bias in deep networks","venue":null,"work_id":"312521ca-bde0-4624-820c-750b0d4ed6e1","year":2021},"citing_paper":{"arxiv_id":"2509.18993","last_updated":"2026-05-13T13:30:21Z","snapshot_observed_at":"2026-08-02T18:52:22.902766Z","submitted_at":"2025-09-23T13:43:02Z","title":"CR-Net: Scaling Parameter-Efficient Training with Cross-Layer Low-Rank Structure","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-18T14:51:30.312509Z"},"links":{"cited_paper":"/paper/2103.10427","citing_paper":"/paper/2509.18993"},"observation_digest":"sha256:f909c7ca4501998c291ad2cba93ba6bfbf316fee3bb0c95f94a5d1023425695b","observation_id":"442d1cfb-61e8-4a0d-b77c-ea7745bc69fb","resolution":{"observed_at":"2026-05-18T14:52:41.162635Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2103.10427","last_updated":"2023-03-23T14:21:02Z","snapshot_observed_at":"2026-08-06T16:01:15.515442Z","submitted_at":"2021-03-18T17:58:02Z","title":"The Low-Rank Simplicity Bias in Deep Networks","version":4},"cited_work":{"arxiv_id":"2103.10427","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10427","snapshot_observed_at":"2026-07-03T04:27:37.211749Z","title":"The low-rank simplicity bias in deep networks","venue":null,"work_id":"312521ca-bde0-4624-820c-750b0d4ed6e1","year":2021},"citing_paper":{"arxiv_id":"2605.29885","last_updated":"2026-05-28T13:10:04Z","snapshot_observed_at":"2026-08-02T03:14:10.684958Z","submitted_at":"2026-05-28T13:10:04Z","title":"Open Problem: Separating Geometric and Algorithmic Compression via Cayley-Table Completion","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T08:59:24.358140Z"},"links":{"cited_paper":"/paper/2103.10427","citing_paper":"/paper/2605.29885"},"observation_digest":"sha256:81f94a66b62c7c145f874baf82ffb0d70b0033b5e1af1b3a3cbc1402af2188ed","observation_id":"cd48c23e-1954-4a05-83c8-471edaa8dd0f","resolution":{"observed_at":"2026-06-29T09:03:15.769267Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2103.10427","last_updated":"2023-03-23T14:21:02Z","snapshot_observed_at":"2026-08-06T16:01:15.515442Z","submitted_at":"2021-03-18T17:58:02Z","title":"The Low-Rank Simplicity Bias in Deep Networks","version":4},"cited_work":{"arxiv_id":"2103.10427","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10427","snapshot_observed_at":"2026-07-03T04:27:37.211749Z","title":"The low-rank simplicity bias in deep networks","venue":null,"work_id":"312521ca-bde0-4624-820c-750b0d4ed6e1","year":2021},"citing_paper":{"arxiv_id":"2606.01412","last_updated":"2026-05-31T19:17:39Z","snapshot_observed_at":"2026-08-05T23:04:35.966323Z","submitted_at":"2026-05-31T19:17:39Z","title":"GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T17:28:14.160341Z"},"links":{"cited_paper":"/paper/2103.10427","citing_paper":"/paper/2606.01412"},"observation_digest":"sha256:de981b63e07fcba2fad843f410eb33f33bfeac79b64b0decbf773eacd8b3c2cd","observation_id":"a258aa20-161a-40b9-b2fa-44bf289254e0","resolution":{"observed_at":"2026-07-01T21:06:14.489433Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2103.10427","last_updated":"2023-03-23T14:21:02Z","snapshot_observed_at":"2026-08-06T16:01:15.515442Z","submitted_at":"2021-03-18T17:58:02Z","title":"The Low-Rank Simplicity Bias in Deep Networks","version":4},"cited_work":{"arxiv_id":"2103.10427","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10427","snapshot_observed_at":"2026-07-03T04:27:37.211749Z","title":"The low-rank simplicity bias in deep networks","venue":null,"work_id":"312521ca-bde0-4624-820c-750b0d4ed6e1","year":2021},"citing_paper":{"arxiv_id":"2606.11123","last_updated":"2026-06-09T17:21:25Z","snapshot_observed_at":"2026-08-06T11:25:30.226674Z","submitted_at":"2026-06-09T17:21:25Z","title":"Overcoming Rank Collapse in Feedback Alignment","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T13:52:57.960921Z"},"links":{"cited_paper":"/paper/2103.10427","citing_paper":"/paper/2606.11123"},"observation_digest":"sha256:3a1b73193b5eec36910d81f120764408aa02fe4fd33795a845ae8dc19d2a90f6","observation_id":"3475acec-ad30-4d45-a3ff-e5c71a61e05b","resolution":{"observed_at":"2026-07-03T04:27:37.213327Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2103.10427","last_updated":"2023-03-23T14:21:02Z","snapshot_observed_at":"2026-08-06T16:01:15.515442Z","submitted_at":"2021-03-18T17:58:02Z","title":"The Low-Rank Simplicity Bias in Deep Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.10427","snapshot_observed_at":"2026-07-14T00:50:24.285797Z","title":"arXiv preprint arXiv:2103.10427 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10039","last_updated":"2026-07-10T23:45:28Z","snapshot_observed_at":"2026-08-06T18:39:14.493878Z","submitted_at":"2026-07-10T23:45:28Z","title":"Are We Ready for AI-Driven Discovery? AI Verification Before the Next Fundamental Physics Breakthrough","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-07-14T00:50:24.285797Z"},"links":{"cited_paper":"/paper/2103.10427","citing_paper":"/paper/2607.10039"},"observation_digest":"sha256:115040223d9ed52e072a8b9e26d205f1c850c328b6db0e0724faa9532a2ee032","observation_id":"f2aa1096-1346-47c5-891f-adc66869b43a","resolution":{"observed_at":"2026-07-14T00:50:24.285797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.10427","last_updated":"2023-03-23T14:21:02Z","snapshot_observed_at":"2026-08-06T16:01:15.515442Z","submitted_at":"2021-03-18T17:58:02Z","title":"The Low-Rank Simplicity Bias in Deep Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.10427","snapshot_observed_at":"2026-08-03T05:43:19.679970Z","title":"arXiv:2103.10427","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29503","last_updated":"2026-07-31T15:07:18Z","snapshot_observed_at":"2026-08-06T20:37:19.979155Z","submitted_at":"2026-07-31T15:07:18Z","title":"The Grokked Illusion: True Equilibrium Mitigates Catastrophic Forgetting","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T05:43:19.679970Z"},"links":{"cited_paper":"/paper/2103.10427","citing_paper":"/paper/2607.29503"},"observation_digest":"sha256:b82a9275c3ab4fe6352b745dec071dd962a44d08d7db1b3f35226b1dccb9742e","observation_id":"b605fdb8-56dc-4e94-984e-addb6569e203","resolution":{"observed_at":"2026-08-03T05:43:19.679970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2103.10427/citation-record","integrity":"/paper/2103.10427/integrity","json":"/paper/2103.10427/citation-record.json","paper":"/paper/2103.10427"},"outbound":[],"paper":{"arxiv_id":"2103.10427","last_updated":"2023-03-23T14:21:02Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T16:01:15.515442Z","submitted_at":"2021-03-18T17:58:02Z","title":"The Low-Rank Simplicity Bias in Deep Networks"},"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-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 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2103.10427."}