{"as_of":"2026-08-10T20:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:08f3153c969f24012e7ff538f116a00c162585be23524d731831e1b4ca1fccd1","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T18:51:12.558692Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T14:36:28.975399Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.11261","last_updated":"2025-02-26T18:44:29Z","snapshot_observed_at":"2026-07-06T19:33:34.819837Z","submitted_at":"2024-10-15T04:35:56Z","title":"Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11261","snapshot_observed_at":"2026-08-09T18:51:12.558692Z","title":"Beyond linear approximations: A novel pruning approach for attention matrix","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00500","last_updated":"2025-02-04T15:19:12Z","snapshot_observed_at":"2026-08-10T02:49:33.781140Z","submitted_at":"2025-02-01T17:40:11Z","title":"Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolation","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T18:51:12.558692Z"},"links":{"cited_paper":"/paper/2410.11261","citing_paper":"/paper/2502.00500"},"observation_digest":"sha256:2fae7dd70f2d1ab25ff2682e51824cd5b47758f1d9f3a933346f5ca89e9a888f","observation_id":"6a8dba0f-26dc-47ee-81fe-0e856ea6a27b","resolution":{"observed_at":"2026-08-09T18:51:12.558692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11261","last_updated":"2025-02-26T18:44:29Z","snapshot_observed_at":"2026-07-06T19:33:34.819837Z","submitted_at":"2024-10-15T04:35:56Z","title":"Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11261","snapshot_observed_at":"2026-08-08T16:39:14.211419Z","title":"Beyond linear approximations: A novel pruning approach for attention matrix.arXiv preprint arXiv:2410.11261,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06167","last_updated":"2025-02-10T05:36:30Z","snapshot_observed_at":"2026-08-09T01:42:08.911908Z","submitted_at":"2025-02-10T05:36:30Z","title":"Universal Approximation of Visual Autoregressive Transformers","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T16:39:14.211419Z"},"links":{"cited_paper":"/paper/2410.11261","citing_paper":"/paper/2502.06167"},"observation_digest":"sha256:d4107f158cdb6edc9478e642045c9461eb0a61f1729aa95bd291aabb6fad14df","observation_id":"b202b886-7f38-4158-a517-0a9045b4ddff","resolution":{"observed_at":"2026-08-08T16:39:14.211419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11261","last_updated":"2025-02-26T18:44:29Z","snapshot_observed_at":"2026-07-06T19:33:34.819837Z","submitted_at":"2024-10-15T04:35:56Z","title":"Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix","version":2},"cited_work":{"arxiv_id":"2410.11261","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.11261","snapshot_observed_at":"2026-08-07T14:36:28.975399Z","title":"Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix","venue":"cs.LG","work_id":"9a5542a0-2124-4b0c-b285-f2794ef5a535","year":2024},"citing_paper":{"arxiv_id":"2505.18413","last_updated":"2025-05-23T22:39:54Z","snapshot_observed_at":"2026-08-09T17:24:03.281218Z","submitted_at":"2025-05-23T22:39:54Z","title":"LatentLLM: Attention-Aware Joint Tensor Compression","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:36:26.765346Z"},"links":{"cited_paper":"/paper/2410.11261","citing_paper":"/paper/2505.18413"},"observation_digest":"sha256:aaee8fe8cf95337c6aa4597975329570f5727bf542e3a85e0c3d806c7be7a1d6","observation_id":"a6740093-4468-4bfb-98e9-ea5c20b7031a","resolution":{"observed_at":"2026-08-07T14:36:29.038387Z","resolver_source":"local_arxiv","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/2410.11261/citation-record","integrity":"/paper/2410.11261/integrity","json":"/paper/2410.11261/citation-record.json","paper":"/paper/2410.11261"},"outbound":[],"paper":{"arxiv_id":"2410.11261","last_updated":"2025-02-26T18:44:29Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:33:34.819837Z","submitted_at":"2024-10-15T04:35:56Z","title":"Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix"},"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-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2410.11261."}