{"as_of":"2026-08-08T09:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8a6636215b76a62a601a2d6398471b2c9ea0fbc9e75a88efc4e0e6ed8370ed0","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-08T06:32:00.761636+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-07T11:00:07.524724Z","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-04T22:24:23.109986Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.00712","last_updated":"2021-03-10T01:30:22Z","snapshot_observed_at":"2026-07-06T10:00:42.122451Z","submitted_at":"2020-10-01T22:41:41Z","title":"Faster Binary Embeddings for Preserving Euclidean Distances","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.00712","snapshot_observed_at":"2026-08-07T11:00:07.524724Z","title":"arXiv preprint arXiv:2010.00712 (2020) 31","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.524724Z"},"links":{"cited_paper":"/paper/2010.00712","citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:5f85315eaf3a21b852e5fba7f0b52ddc83baf686d1378d2b049c907c659acdc5","observation_id":"2c3433e2-c8a8-43ef-84ff-33782e420412","resolution":{"observed_at":"2026-08-07T11:00:07.524724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.00712","last_updated":"2021-03-10T01:30:22Z","snapshot_observed_at":"2026-07-06T10:00:42.122451Z","submitted_at":"2020-10-01T22:41:41Z","title":"Faster Binary Embeddings for Preserving Euclidean Distances","version":2},"cited_work":{"arxiv_id":"2010.00712","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.00712","snapshot_observed_at":"2026-08-04T22:24:23.109986Z","title":"Faster Binary Embeddings for Preserving Euclidean Distances","venue":"cs.IT","work_id":"c912a107-8b05-479c-a638-0e412a8def8a","year":2020},"citing_paper":{"arxiv_id":"2509.07361","last_updated":"2025-09-09T03:15:22Z","snapshot_observed_at":"2026-08-07T12:20:23.665860Z","submitted_at":"2025-09-09T03:15:22Z","title":"Word2Spike: Poisson Rate Coding for Associative Memories and Neuromorphic Algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T22:24:23.034655Z"},"links":{"cited_paper":"/paper/2010.00712","citing_paper":"/paper/2509.07361"},"observation_digest":"sha256:1cea949bd324d7db7d3aa452fe6cdcf69e050593c30bbeeeb8727fa4c4f1e084","observation_id":"319a978e-5b1f-47e9-a0c8-d4f2bf029ece","resolution":{"observed_at":"2026-08-04T22:24:23.114464Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2010.00712/citation-record","integrity":"/paper/2010.00712/integrity","json":"/paper/2010.00712/citation-record.json","paper":"/paper/2010.00712"},"outbound":[],"paper":{"arxiv_id":"2010.00712","last_updated":"2021-03-10T01:30:22Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-06T10:00:42.122451Z","submitted_at":"2020-10-01T22:41:41Z","title":"Faster Binary Embeddings for Preserving Euclidean Distances"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2010.00712."}