{"as_of":"2026-08-16T20:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d1b799ebbf0d381a876391894f6578e38fddf37a91b783b79b174b8bb6c20f42","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-16T06:30:59.297886+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-01T18:57:41.545869Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.07811","last_updated":"2021-10-15T02:23:35Z","snapshot_observed_at":"2026-08-16T17:49:09.213092Z","submitted_at":"2021-10-15T02:23:35Z","title":"Cascaded Fast and Slow Models for Efficient Semantic Code Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.07811","snapshot_observed_at":"2026-08-01T18:57:41.545869Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17139","last_updated":"2026-07-19T08:52:36Z","snapshot_observed_at":"2026-08-09T15:09:40.821099Z","submitted_at":"2026-07-19T08:52:36Z","title":"SynH-Rank: Quality-Aware Code Search via Diverse Data Synthesis and Hierarchical Ranking Training","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T18:57:41.545869Z"},"links":{"cited_paper":"/paper/2110.07811","citing_paper":"/paper/2607.17139"},"observation_digest":"sha256:fdb039283306733663ac6959a1aef9a9dd78bc02a1cca42a3209ca43617334b7","observation_id":"a947233f-ce93-46ed-9caf-9a7a5675a852","resolution":{"observed_at":"2026-08-01T18:57:41.545869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2110.07811/citation-record","integrity":"/paper/2110.07811/integrity","json":"/paper/2110.07811/citation-record.json","paper":"/paper/2110.07811"},"outbound":[],"paper":{"arxiv_id":"2110.07811","last_updated":"2021-10-15T02:23:35Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T17:49:09.213092Z","submitted_at":"2021-10-15T02:23:35Z","title":"Cascaded Fast and Slow Models for Efficient Semantic Code 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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2110.07811."}