{"as_of":"2026-08-12T10:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:24d386b41f1196459ffe72190a06f7fc91ae60b40db1bcc82ea970f881edcb0b","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-12T06:34:41.77262+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-11T11:40:41.518983Z","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-11T11:40:42.020779Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.00859","last_updated":"2019-05-07T02:32:25Z","snapshot_observed_at":"2026-07-06T07:05:24.565760Z","submitted_at":"2018-10-01T17:55:43Z","title":"Dynamic Sparse Graph for Efficient Deep Learning","version":2},"cited_work":{"arxiv_id":"1810.00859","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.00859","snapshot_observed_at":"2026-08-11T11:40:42.020779Z","title":"Dynamic Sparse Graph for Efficient Deep Learning","venue":"cs.LG","work_id":"da232acc-3b49-4840-bfc3-d9f93df9aa4a","year":2018},"citing_paper":{"arxiv_id":"2412.15127","last_updated":"2024-12-19T18:08:04Z","snapshot_observed_at":"2026-08-12T03:28:46.550103Z","submitted_at":"2024-12-19T18:08:04Z","title":"Adaptive Pruning for Large Language Models with Structural Importance Awareness","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T11:40:41.518983Z"},"links":{"cited_paper":"/paper/1810.00859","citing_paper":"/paper/2412.15127"},"observation_digest":"sha256:69614f4383aa548f3186ffe913c7ffff800394ad0222f8b33512e88f5ea8c670","observation_id":"4f3bd275-67b9-443a-8fae-6d9b95763df9","resolution":{"observed_at":"2026-08-11T11:40:42.025553Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1810.00859/citation-record","integrity":"/paper/1810.00859/integrity","json":"/paper/1810.00859/citation-record.json","paper":"/paper/1810.00859"},"outbound":[],"paper":{"arxiv_id":"1810.00859","last_updated":"2019-05-07T02:32:25Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:05:24.565760Z","submitted_at":"2018-10-01T17:55:43Z","title":"Dynamic Sparse Graph for Efficient Deep Learning"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1810.00859."}