{"as_of":"2026-08-06T00:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee90c2f13a7bd3cd4d08f4106be44920c0bdd3b5ca84f589cdcc029af2e6acc6","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-05T06:32:48.257954+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-05-25T15:59:30.829000Z","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-05-25T16:01:02.357554Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1507.05910","last_updated":"2015-11-30T02:26:44Z","snapshot_observed_at":"2026-08-03T17:02:01.867502Z","submitted_at":"2015-07-21T16:53:12Z","title":"Clustering is Efficient for Approximate Maximum Inner Product Search","version":3},"cited_work":{"arxiv_id":"1507.05910","doi":null,"metadata_source":"pith","pith_arxiv_id":"1507.05910","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Clustering is Efficient for Approximate Maximum Inner Product Search","venue":"cs.LG","work_id":"78f5af88-a462-472a-8705-25c4bbb317e5","year":2015},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"cited_paper":"/paper/1507.05910","citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:d6635985ef30d2c6559b9f88dfb086fb8c0dbe0f579513b806ac3468abfcec26","observation_id":"f64cbd06-ba9a-4659-9c20-5eac66070469","resolution":{"observed_at":"2026-05-25T16:01:02.360178Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1507.05910/citation-record","integrity":"/paper/1507.05910/integrity","json":"/paper/1507.05910/citation-record.json","paper":"/paper/1507.05910"},"outbound":[],"paper":{"arxiv_id":"1507.05910","last_updated":"2015-11-30T02:26:44Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T17:02:01.867502Z","submitted_at":"2015-07-21T16:53:12Z","title":"Clustering is Efficient for Approximate Maximum Inner Product Search"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1507.05910."}