{"as_of":"2026-08-08T09:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4a8e780b58a3e9560911215c2ff64466eee6d6ac70b51adaf68eba9e5ba285f9","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T09:39:35.617171Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2012.14966","last_updated":"2021-01-05T07:29:16Z","snapshot_observed_at":"2026-07-06T10:28:37.759799Z","submitted_at":"2020-12-29T22:51:29Z","title":"Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.14966","snapshot_observed_at":"2026-08-04T09:39:35.617171Z","title":"Kaleidoscope: An efficient, learnable representation for all structured linear maps","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-07T06:33:28.742860Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:35.617171Z"},"links":{"cited_paper":"/paper/2012.14966","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:ebb87a5cd84cc8313714927650585198a62787fb65ee37e8e58fa5d946c4f655","observation_id":"81a4a234-8cab-403b-bb8e-b5e7b7eae5f0","resolution":{"observed_at":"2026-08-04T09:39:35.617171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2012.14966/citation-record","integrity":"/paper/2012.14966/integrity","json":"/paper/2012.14966/citation-record.json","paper":"/paper/2012.14966"},"outbound":[],"paper":{"arxiv_id":"2012.14966","last_updated":"2021-01-05T07:29:16Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:28:37.759799Z","submitted_at":"2020-12-29T22:51:29Z","title":"Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2012.14966."}