{"as_of":"2026-08-06T01:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2820394893196eb72cc6fcd789b79801706998aa515627f754c0706fcee34077","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-08-01T14:11:56.546388Z","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":"2310.08069","last_updated":"2023-10-12T06:32:42Z","snapshot_observed_at":"2026-08-01T14:51:26.184261Z","submitted_at":"2023-10-12T06:32:42Z","title":"Rethinking Negative Pairs in Code Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08069","snapshot_observed_at":"2026-08-01T14:11:56.546388Z","title":"Rethinking negative pairs in code search,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18859","last_updated":"2026-07-21T08:49:30Z","snapshot_observed_at":"2026-08-01T14:11:52.259913Z","submitted_at":"2026-07-21T08:49:30Z","title":"PhoenixRepair: Rethinking Repair Strategy Exploration in Software Agents","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T14:11:56.546388Z"},"links":{"cited_paper":"/paper/2310.08069","citing_paper":"/paper/2607.18859"},"observation_digest":"sha256:a48f5788d03a07b3b017b7d47a0c190d11d7d55bfb83c0f34e13d1fde0e128e7","observation_id":"8d5b5c2f-745e-4595-ab8c-3399380b39f1","resolution":{"observed_at":"2026-08-01T14:11:56.546388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.08069/citation-record","integrity":"/paper/2310.08069/integrity","json":"/paper/2310.08069/citation-record.json","paper":"/paper/2310.08069"},"outbound":[],"paper":{"arxiv_id":"2310.08069","last_updated":"2023-10-12T06:32:42Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-01T14:51:26.184261Z","submitted_at":"2023-10-12T06:32:42Z","title":"Rethinking Negative Pairs in 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-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:2310.08069."}