{"as_of":"2026-08-13T16:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58c9fe64d26cea2428f26bec8fd48924b8b10e40d2b67715ca090216a4b79b96","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-13T06:32:02.005865+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-12T14:05:43.405803Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":9,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.10173","last_updated":"2023-11-28T08:00:15Z","snapshot_observed_at":"2026-08-13T14:02:27.831748Z","submitted_at":"2022-10-18T21:32:35Z","title":"Faster Matrix Multiplication via Asymmetric Hashing","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10173","snapshot_observed_at":"2026-08-12T14:05:43.405803Z","title":"Faster matrix multiplication via asymmetric hashing, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.15789","last_updated":"2026-06-07T19:57:04Z","snapshot_observed_at":"2026-08-12T13:51:40.791868Z","submitted_at":"2024-11-24T11:35:38Z","title":"Asymptotic tensor rank is characterized by polynomials","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T14:05:43.405803Z"},"links":{"cited_paper":"/paper/2210.10173","citing_paper":"/paper/2411.15789"},"observation_digest":"sha256:9a86bea71a88321db8e1399dd1648ae9d3aaf703c7155182cd81a7133a8e7b0f","observation_id":"098b1fa6-dec4-4145-9497-3d9e4c474bea","resolution":{"observed_at":"2026-08-12T14:05:43.405803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10173","last_updated":"2023-11-28T08:00:15Z","snapshot_observed_at":"2026-08-13T14:02:27.831748Z","submitted_at":"2022-10-18T21:32:35Z","title":"Faster Matrix Multiplication via Asymmetric Hashing","version":5},"cited_work":{"arxiv_id":"2210.10173","doi":"10.48550/arxiv.2210.10173","metadata_source":"arxiv_reference","pith_arxiv_id":"2210.10173","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"CoRR , volume =","venue":"arXiv (Cornell University)","work_id":"5f3fa13a-1d8e-403e-9d3e-a07041e98031","year":2022},"citing_paper":{"arxiv_id":"2605.10778","last_updated":"2026-05-11T16:11:49Z","snapshot_observed_at":"2026-08-13T11:07:15.462016Z","submitted_at":"2026-05-11T16:11:49Z","title":"When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-12T04:43:41.697992Z"},"links":{"cited_paper":"/paper/2210.10173","citing_paper":"/paper/2605.10778"},"observation_digest":"sha256:14fa6d904d3a0bfcc26c0481b2864a591d1a9f96659807e8475c871bdee42161","observation_id":"6a91a73d-9640-4b05-a469-6131883932c2","resolution":{"observed_at":"2026-05-12T05:16:22.920482Z","resolver_source":"arxiv_id","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/2210.10173/citation-record","integrity":"/paper/2210.10173/integrity","json":"/paper/2210.10173/citation-record.json","paper":"/paper/2210.10173"},"outbound":[],"paper":{"arxiv_id":"2210.10173","last_updated":"2023-11-28T08:00:15Z","latest_version":5,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T14:02:27.831748Z","submitted_at":"2022-10-18T21:32:35Z","title":"Faster Matrix Multiplication via Asymmetric Hashing"},"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 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2210.10173."}