{"as_of":"2026-08-19T22:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:66c33819084f76341c6ecc8f608d1d3347b693f13ee0c1db978badf6e9561872","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-19T06:32:44.657259+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-15T22:59:42.466286Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T09:51:27.286072Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.10416","last_updated":"2024-07-15T03:44:33Z","snapshot_observed_at":"2026-08-19T17:04:41.271483Z","submitted_at":"2024-07-15T03:44:33Z","title":"SOFA: A Compute-Memory Optimized Sparsity Accelerator via Cross-Stage Coordinated Tiling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10416","snapshot_observed_at":"2026-08-15T22:59:42.466286Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.05893","last_updated":"2025-05-09T09:01:10Z","snapshot_observed_at":"2026-08-17T01:16:31.068711Z","submitted_at":"2025-05-09T09:01:10Z","title":"LightNobel: Improving Sequence Length Limitation in Protein Structure Prediction Model via Adaptive Activation Quantization","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T22:59:42.466286Z"},"links":{"cited_paper":"/paper/2407.10416","citing_paper":"/paper/2505.05893"},"observation_digest":"sha256:de6fd3b43edd059e1e8e5a51bfaae0813eb2b1630abfa0e43702d75fde0ed7e9","observation_id":"f097ee80-6fa1-438e-89e0-349055ec93af","resolution":{"observed_at":"2026-08-15T22:59:42.466286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10416","last_updated":"2024-07-15T03:44:33Z","snapshot_observed_at":"2026-08-19T17:04:41.271483Z","submitted_at":"2024-07-15T03:44:33Z","title":"SOFA: A Compute-Memory Optimized Sparsity Accelerator via Cross-Stage Coordinated Tiling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10416","snapshot_observed_at":"2026-08-04T18:00:23.108339Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.108339Z"},"links":{"cited_paper":"/paper/2407.10416","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:df21d903187262213a4a0a5fafd0c3483ab629bcad73bb0bfa9946b088f857c7","observation_id":"3e17a2d6-08e1-445e-b27f-68c4c169fc46","resolution":{"observed_at":"2026-08-04T18:00:23.108339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10416","last_updated":"2024-07-15T03:44:33Z","snapshot_observed_at":"2026-08-19T17:04:41.271483Z","submitted_at":"2024-07-15T03:44:33Z","title":"SOFA: A Compute-Memory Optimized Sparsity Accelerator via Cross-Stage Coordinated Tiling","version":1},"cited_work":{"arxiv_id":"2407.10416","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.10416","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SOFA: A compute-memory optimized sparsity accelerator via cross-stage coordinated tiling","venue":null,"work_id":"2e548866-f0aa-45fe-be36-bc3eb93ddfc6","year":2024},"citing_paper":{"arxiv_id":"2604.27396","last_updated":"2026-04-30T04:07:21Z","snapshot_observed_at":"2026-08-14T23:31:51.746694Z","submitted_at":"2026-04-30T04:07:21Z","title":"VitaLLM: A Versatile, Ultra-Compact Ternary LLM Accelerator with Dependency-Aware Scheduling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-07T09:05:12.937377Z"},"links":{"cited_paper":"/paper/2407.10416","citing_paper":"/paper/2604.27396"},"observation_digest":"sha256:3345340b45b873ebe016554537774f37d1c09610ab189d359297c6b195e4784f","observation_id":"ead040b0-7eec-43be-b2b8-d493fe5aeb94","resolution":{"observed_at":"2026-05-12T09:51:27.289342Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.10416/citation-record","integrity":"/paper/2407.10416/integrity","json":"/paper/2407.10416/citation-record.json","paper":"/paper/2407.10416"},"outbound":[],"paper":{"arxiv_id":"2407.10416","last_updated":"2024-07-15T03:44:33Z","latest_version":1,"primary_category":"cs.AR","snapshot_observed_at":"2026-08-19T17:04:41.271483Z","submitted_at":"2024-07-15T03:44:33Z","title":"SOFA: A Compute-Memory Optimized Sparsity Accelerator via Cross-Stage Coordinated Tiling"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2407.10416."}