{"as_of":"2026-08-18T20:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7fd4d41aebdb0eb6ff0d34ebcd758677ec240d02d3d9ceaf6461d025dc1ab235","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-18T06:34:40.430872+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-15T15:49:04.103854Z","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-15T15:49:04.294081Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.07861","last_updated":"2023-03-12T12:16:34Z","snapshot_observed_at":"2026-08-18T12:14:22.430172Z","submitted_at":"2022-02-16T05:04:38Z","title":"Practical Network Acceleration with Tiny Sets","version":2},"cited_work":{"arxiv_id":"2202.07861","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.07861","snapshot_observed_at":"2026-08-15T15:49:04.294081Z","title":"Practical Network Acceleration with Tiny Sets","venue":"cs.CV","work_id":"651a23d2-2fb8-43f4-9a49-dfd7f1bef564","year":2022},"citing_paper":{"arxiv_id":"2509.25136","last_updated":"2026-07-02T17:21:41Z","snapshot_observed_at":"2026-08-18T09:13:05.660267Z","submitted_at":"2025-09-29T17:50:29Z","title":"BALF: Budgeted Activation-Aware Low-Rank Factorization for Fine-Tuning-Free Model Compression","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:04.103854Z"},"links":{"cited_paper":"/paper/2202.07861","citing_paper":"/paper/2509.25136"},"observation_digest":"sha256:9863878eb049edf51661597e3541824199699e8f559b61b0cdf7c9b33ab98fc0","observation_id":"3736fbce-13c2-45da-9620-009cfd283fc2","resolution":{"observed_at":"2026-08-15T15:49:04.298797Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.07861/citation-record","integrity":"/paper/2202.07861/integrity","json":"/paper/2202.07861/citation-record.json","paper":"/paper/2202.07861"},"outbound":[],"paper":{"arxiv_id":"2202.07861","last_updated":"2023-03-12T12:16:34Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-18T12:14:22.430172Z","submitted_at":"2022-02-16T05:04:38Z","title":"Practical Network Acceleration with Tiny Sets"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2202.07861."}