{"as_of":"2026-08-17T16:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7b67ca9462c654c3d105fab2eca97fa139cd26cff7888b4a32031d5c391a553e","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-17T06:30:58.91139+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-15T23:07:40.105333Z","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-15T20:35:27.941855Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.17737","last_updated":"2025-06-11T14:56:28Z","snapshot_observed_at":"2026-08-16T18:15:30.953428Z","submitted_at":"2025-01-29T16:21:54Z","title":"Sparser, Better, Faster, Stronger: Sparsity Detection for Efficient Automatic Differentiation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.17737","snapshot_observed_at":"2026-08-15T23:07:40.105333Z","title":"org/abs/2501.17737","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.05542","last_updated":"2025-05-08T16:55:14Z","snapshot_observed_at":"2026-08-16T13:33:38.943077Z","submitted_at":"2025-05-08T16:55:14Z","title":"A Common Interface for Automatic Differentiation","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-15T23:07:40.105333Z"},"links":{"cited_paper":"/paper/2501.17737","citing_paper":"/paper/2505.05542"},"observation_digest":"sha256:f32c71004b07e4a8cb1106f009bc0fc2fe837550921bc55aa59ebacde743ba8e","observation_id":"407b154f-08e6-4923-b115-104527358615","resolution":{"observed_at":"2026-08-15T23:07:40.105333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.17737","last_updated":"2025-06-11T14:56:28Z","snapshot_observed_at":"2026-08-16T18:15:30.953428Z","submitted_at":"2025-01-29T16:21:54Z","title":"Sparser, Better, Faster, Stronger: Sparsity Detection for Efficient Automatic Differentiation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.17737","snapshot_observed_at":"2026-08-15T22:25:36.542725Z","title":"Hill and G","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.07308","last_updated":"2025-05-12T07:54:06Z","snapshot_observed_at":"2026-08-16T06:31:30.969931Z","submitted_at":"2025-05-12T07:54:06Z","title":"Revisiting Sparse Matrix Coloring and Bicoloring","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T22:25:36.542725Z"},"links":{"cited_paper":"/paper/2501.17737","citing_paper":"/paper/2505.07308"},"observation_digest":"sha256:88534f11ccd31991980e7c94e0692fbc45f42dc1fd128c9dbc61074616139301","observation_id":"9b6862db-b468-4871-9d1f-64a6362b3db4","resolution":{"observed_at":"2026-08-15T22:25:36.542725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.17737","last_updated":"2025-06-11T14:56:28Z","snapshot_observed_at":"2026-08-16T18:15:30.953428Z","submitted_at":"2025-01-29T16:21:54Z","title":"Sparser, Better, Faster, Stronger: Sparsity Detection for Efficient Automatic Differentiation","version":2},"cited_work":{"arxiv_id":"2501.17737","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.17737","snapshot_observed_at":"2026-08-15T20:35:27.941855Z","title":"Sparser, Better, Faster, Stronger: Sparsity Detection for Efficient Automatic Differentiation","venue":"cs.LG","work_id":"6c067f0d-05fa-48e9-91d8-ea1398aaf34e","year":2025},"citing_paper":{"arxiv_id":"2505.12646","last_updated":"2025-05-19T02:59:26Z","snapshot_observed_at":"2026-08-17T08:51:43.598301Z","submitted_at":"2025-05-19T02:59:26Z","title":"Implicit differentiation with second-order derivatives and benchmarks in finite-element-based differentiable physics","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T20:35:27.891375Z"},"links":{"cited_paper":"/paper/2501.17737","citing_paper":"/paper/2505.12646"},"observation_digest":"sha256:1c18fabb26130d848429cc2ab6a73514bfa1275b00792e4d7a444b23c39547a5","observation_id":"d13d8175-8617-4da2-b972-b48c7c5726c5","resolution":{"observed_at":"2026-08-15T20:35:27.947673Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.17737/citation-record","integrity":"/paper/2501.17737/integrity","json":"/paper/2501.17737/citation-record.json","paper":"/paper/2501.17737"},"outbound":[],"paper":{"arxiv_id":"2501.17737","last_updated":"2025-06-11T14:56:28Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T18:15:30.953428Z","submitted_at":"2025-01-29T16:21:54Z","title":"Sparser, Better, Faster, Stronger: Sparsity Detection for Efficient Automatic Differentiation"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2501.17737."}