{"as_of":"2026-08-16T17:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a17bd72532aaa5afe8d6fc02fb65639d8c28a7bd019f3e2c168ca0630f87ec6","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-16T06:30:59.297886+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-12T13:34:13.527408Z","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-10T20:04:29.732941Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.11839","last_updated":"2021-09-23T07:47:56Z","snapshot_observed_at":"2026-08-13T21:30:55.037811Z","submitted_at":"2020-09-24T17:37:32Z","title":"A Gradient Flow Framework For Analyzing Network Pruning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11839","snapshot_observed_at":"2026-08-12T13:34:13.527408Z","title":"A gradient flow framework for analyzing network pruning","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.16139","last_updated":"2024-11-25T06:59:16Z","snapshot_observed_at":"2026-08-12T20:16:32.856463Z","submitted_at":"2024-11-25T06:59:16Z","title":"Beyond Task Vectors: Selective Task Arithmetic Based on Importance Metrics","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T13:34:13.527408Z"},"links":{"cited_paper":"/paper/2009.11839","citing_paper":"/paper/2411.16139"},"observation_digest":"sha256:cd01a63f2e0277c0696838c19313587cf080fb6f3d905885e3d9346396c73355","observation_id":"0f2e5ba7-10e1-41e3-bd5a-ae681b9eb466","resolution":{"observed_at":"2026-08-12T13:34:13.527408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11839","last_updated":"2021-09-23T07:47:56Z","snapshot_observed_at":"2026-08-13T21:30:55.037811Z","submitted_at":"2020-09-24T17:37:32Z","title":"A Gradient Flow Framework For Analyzing Network Pruning","version":4},"cited_work":{"arxiv_id":"2009.11839","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.11839","snapshot_observed_at":"2026-08-10T20:04:29.732941Z","title":"A Gradient Flow Framework For Analyzing Network Pruning","venue":"cs.LG","work_id":"0ec77924-c7a8-434c-a0d1-927ba12bc190","year":2020},"citing_paper":{"arxiv_id":"2501.09464","last_updated":"2025-01-16T10:55:05Z","snapshot_observed_at":"2026-08-15T13:30:26.693527Z","submitted_at":"2025-01-16T10:55:05Z","title":"Pruning for Sparse Diffusion Models based on Gradient Flow","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T20:04:29.563678Z"},"links":{"cited_paper":"/paper/2009.11839","citing_paper":"/paper/2501.09464"},"observation_digest":"sha256:0e2b0eeb6303b536dd9e0077b37ef680a72c4523e6f955ddb5936e81cc1d581f","observation_id":"40ddcdab-37fe-4c51-a869-c7f4b44989a4","resolution":{"observed_at":"2026-08-10T20:04:29.740579Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2009.11839/citation-record","integrity":"/paper/2009.11839/integrity","json":"/paper/2009.11839/citation-record.json","paper":"/paper/2009.11839"},"outbound":[],"paper":{"arxiv_id":"2009.11839","last_updated":"2021-09-23T07:47:56Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T21:30:55.037811Z","submitted_at":"2020-09-24T17:37:32Z","title":"A Gradient Flow Framework For Analyzing Network 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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2009.11839."}