{"as_of":"2026-08-14T02:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97bc4ee1602101371d0e0811565f8036e6d160f986b1478d8af389e6d3bd3c79","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-13T06:32:02.005865+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-10T21:16:55.476734Z","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-10T21:16:55.680959Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1512.00066","last_updated":"2015-11-30T22:08:23Z","snapshot_observed_at":"2026-07-06T04:38:15.789202Z","submitted_at":"2015-11-30T22:08:23Z","title":"Sparse Tensor Algebra as a Parallel Programming Model","version":1},"cited_work":{"arxiv_id":"1512.00066","doi":null,"metadata_source":"pith","pith_arxiv_id":"1512.00066","snapshot_observed_at":"2026-08-10T21:16:55.680959Z","title":"Sparse Tensor Algebra as a Parallel Programming Model","venue":"cs.MS","work_id":"c73ab744-7ec0-4197-b122-268882a5b063","year":2015},"citing_paper":{"arxiv_id":"2501.05587","last_updated":"2025-01-09T21:43:16Z","snapshot_observed_at":"2026-08-10T21:10:34.729702Z","submitted_at":"2025-01-09T21:43:16Z","title":"Popcorn: Accelerating Kernel K-means on GPUs through Sparse Linear Algebra","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T21:16:55.476734Z"},"links":{"cited_paper":"/paper/1512.00066","citing_paper":"/paper/2501.05587"},"observation_digest":"sha256:5a2596c7bc50a7141472b92795cac5222358ff4b73fda52a32d74f22f35bfc74","observation_id":"a67465c8-ffe7-4a6d-9fe6-0f158dc6b3f0","resolution":{"observed_at":"2026-08-10T21:16:55.685514Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1512.00066/citation-record","integrity":"/paper/1512.00066/integrity","json":"/paper/1512.00066/citation-record.json","paper":"/paper/1512.00066"},"outbound":[],"paper":{"arxiv_id":"1512.00066","last_updated":"2015-11-30T22:08:23Z","latest_version":1,"primary_category":"cs.MS","snapshot_observed_at":"2026-07-06T04:38:15.789202Z","submitted_at":"2015-11-30T22:08:23Z","title":"Sparse Tensor Algebra as a Parallel Programming Model"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1512.00066."}