{"as_of":"2026-08-14T17:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b1b2c6ba188bc4451f5c206d172a05c11c67185ecfccd89287bb7356eba10af","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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-12T19:50:38.586345Z","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-12T18:53:06.965527Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.08065","last_updated":"2020-11-16T22:13:31Z","snapshot_observed_at":"2026-07-06T09:56:22.631976Z","submitted_at":"2020-09-17T04:45:47Z","title":"Efficient Transformer-based Large Scale Language Representations using Hardware-friendly Block Structured Pruning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.08065","snapshot_observed_at":"2026-08-12T19:50:38.586345Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.10285","last_updated":"2025-05-12T12:15:01Z","snapshot_observed_at":"2026-08-12T19:44:31.046996Z","submitted_at":"2024-11-15T15:40:49Z","title":"Systolic Arrays and Structured Pruning Co-design for Efficient Transformers in Edge Systems","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T19:50:38.586345Z"},"links":{"cited_paper":"/paper/2009.08065","citing_paper":"/paper/2411.10285"},"observation_digest":"sha256:b432a9fd2c092888d8f6de8ef92385de0a99599af437c9dd5b20d948601ab72a","observation_id":"571e80a1-d9f5-4480-adf9-f42a99c4a38c","resolution":{"observed_at":"2026-08-12T19:50:38.586345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.08065","last_updated":"2020-11-16T22:13:31Z","snapshot_observed_at":"2026-07-06T09:56:22.631976Z","submitted_at":"2020-09-17T04:45:47Z","title":"Efficient Transformer-based Large Scale Language Representations using Hardware-friendly Block Structured Pruning","version":4},"cited_work":{"arxiv_id":"2009.08065","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.08065","snapshot_observed_at":"2026-08-12T18:53:06.965527Z","title":"Efficient Transformer-based Large Scale Language Representations using Hardware-friendly Block Structured Pruning","venue":"cs.CL","work_id":"e016c692-1ee0-4335-85fe-8a60393f5718","year":2020},"citing_paper":{"arxiv_id":"2411.11912","last_updated":"2025-03-30T10:30:03Z","snapshot_observed_at":"2026-08-12T18:47:12.448998Z","submitted_at":"2024-11-17T21:54:57Z","title":"F$^3$OCUS -- Federated Finetuning of Vision-Language Foundation Models with Optimal Client Layer Updating Strategy via Multi-objective Meta-Heuristics","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T18:53:06.492381Z"},"links":{"cited_paper":"/paper/2009.08065","citing_paper":"/paper/2411.11912"},"observation_digest":"sha256:bf27c040cecaeb07b9d2c576ba4e54e7772759c4ef9114f4823b44ca8b57f129","observation_id":"08e1e454-2ac5-434b-9754-b61813cecc27","resolution":{"observed_at":"2026-08-12T18:53:06.970056Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2009.08065/citation-record","integrity":"/paper/2009.08065/integrity","json":"/paper/2009.08065/citation-record.json","paper":"/paper/2009.08065"},"outbound":[],"paper":{"arxiv_id":"2009.08065","last_updated":"2020-11-16T22:13:31Z","latest_version":4,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T09:56:22.631976Z","submitted_at":"2020-09-17T04:45:47Z","title":"Efficient Transformer-based Large Scale Language Representations using Hardware-friendly Block Structured Pruning"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2009.08065."}