{"as_of":"2026-08-08T21:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:88cb45ad40679ddce18ad962d26cc4a6f6202811f735ec041fbb8728b349a0b5","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T18:46:14.199894Z","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-07-02T06:56:43.791407Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.10506","last_updated":"2019-09-23T17:52:34Z","snapshot_observed_at":"2026-07-06T08:23:56.729786Z","submitted_at":"2019-09-23T17:52:34Z","title":"Learning Dense Representations for Entity Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.10506","snapshot_observed_at":"2026-08-07T18:46:14.199894Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.10284","last_updated":"2025-02-14T16:42:54Z","snapshot_observed_at":"2026-08-07T18:38:56.223947Z","submitted_at":"2025-02-14T16:42:54Z","title":"A Hybrid Cross-Stage Coordination Pre-ranking Model for Online Recommendation Systems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T18:46:14.199894Z"},"links":{"cited_paper":"/paper/1909.10506","citing_paper":"/paper/2502.10284"},"observation_digest":"sha256:2592350edb86ea5253a18ef6a9a08d5838f2a16bc51a34a0ae7174806448225b","observation_id":"fe1b8769-77a2-465b-9fe0-66ebf1457eaf","resolution":{"observed_at":"2026-08-07T18:46:14.199894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.10506","last_updated":"2019-09-23T17:52:34Z","snapshot_observed_at":"2026-07-06T08:23:56.729786Z","submitted_at":"2019-09-23T17:52:34Z","title":"Learning Dense Representations for Entity Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.10506","snapshot_observed_at":"2026-08-07T14:46:08.975727Z","title":"Learning dense representations for entity retrieval","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.975727Z"},"links":{"cited_paper":"/paper/1909.10506","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:b7ec63f3b3c21c451b5a26aa0020f201018b78236e8243ce3c197e437075ade0","observation_id":"56a68170-757c-47e3-a78b-d74320e1f6d3","resolution":{"observed_at":"2026-08-07T14:46:08.975727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.10506","last_updated":"2019-09-23T17:52:34Z","snapshot_observed_at":"2026-07-06T08:23:56.729786Z","submitted_at":"2019-09-23T17:52:34Z","title":"Learning Dense Representations for Entity Retrieval","version":1},"cited_work":{"arxiv_id":"1909.10506","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.10506","snapshot_observed_at":"2026-07-02T06:56:43.791407Z","title":"arXiv preprint arXiv:1909.10506 , year=","venue":null,"work_id":"2c18f5b2-5f1f-4acc-90cb-0ae5858d890a","year":1909},"citing_paper":{"arxiv_id":"2607.00448","last_updated":"2026-07-06T17:02:14Z","snapshot_observed_at":"2026-08-08T17:37:18.482781Z","submitted_at":"2026-07-01T05:07:32Z","title":"Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrieval","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-02T06:51:07.010077Z"},"links":{"cited_paper":"/paper/1909.10506","citing_paper":"/paper/2607.00448"},"observation_digest":"sha256:0d0258ddfd94d5def89170f71dd3b911ba0d5aca1eaf8086b72e8c633cd518a8","observation_id":"9d4d799c-77e6-40d3-a7b2-8c4d82a7e819","resolution":{"observed_at":"2026-07-02T06:56:43.793406Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1909.10506","last_updated":"2019-09-23T17:52:34Z","snapshot_observed_at":"2026-07-06T08:23:56.729786Z","submitted_at":"2019-09-23T17:52:34Z","title":"Learning Dense Representations for Entity Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.10506","snapshot_observed_at":"2026-07-12T09:31:52.012118Z","title":"arXiv preprint arXiv:1909.10506 , year=","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2607.00448","last_updated":"2026-07-06T17:02:14Z","snapshot_observed_at":"2026-08-08T17:37:18.482781Z","submitted_at":"2026-07-01T05:07:32Z","title":"Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrieval","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-12T09:31:52.012118Z"},"links":{"cited_paper":"/paper/1909.10506","citing_paper":"/paper/2607.00448"},"observation_digest":"sha256:8bcaf1fa6917eb44ef02d4887eea9e6fd256bcf52bbfbdda796ce59a63057807","observation_id":"f349af14-ea13-40d7-be5f-6eb5691684a3","resolution":{"observed_at":"2026-07-12T09:31:52.012118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1909.10506/citation-record","integrity":"/paper/1909.10506/integrity","json":"/paper/1909.10506/citation-record.json","paper":"/paper/1909.10506"},"outbound":[],"paper":{"arxiv_id":"1909.10506","last_updated":"2019-09-23T17:52:34Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T08:23:56.729786Z","submitted_at":"2019-09-23T17:52:34Z","title":"Learning Dense Representations for Entity Retrieval"},"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 4 inbound Pith citation observations for arXiv:1909.10506."}