{"as_of":"2026-08-12T03:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c71088aad8aa32f7fc324f7d07f62330086f43c19f7c60e2e13cce25913093fe","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-11T06:34:44.6726+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-06T21:02:38.527362Z","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-06T21:02:39.018605Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.00279","last_updated":"2023-11-02T10:19:57Z","snapshot_observed_at":"2026-07-06T16:41:31.021679Z","submitted_at":"2023-11-01T04:05:01Z","title":"Accelerating Maximal Clique Enumeration via Graph Reduction","version":2},"cited_work":{"arxiv_id":"2311.00279","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.00279","snapshot_observed_at":"2026-08-06T21:02:39.018605Z","title":"Accelerating Maximal Clique Enumeration via Graph Reduction","venue":"cs.DB","work_id":"011c3048-10a3-4334-8261-207b97afb12f","year":2023},"citing_paper":{"arxiv_id":"2507.01439","last_updated":"2025-07-30T01:44:10Z","snapshot_observed_at":"2026-08-08T16:33:01.738393Z","submitted_at":"2025-07-02T07:50:24Z","title":"TurboReg: TurboClique for Robust and Efficient Point Cloud Registration","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T21:02:38.527362Z"},"links":{"cited_paper":"/paper/2311.00279","citing_paper":"/paper/2507.01439"},"observation_digest":"sha256:080e2d73ec38e40087eb3fd5d18393493b4ba54996d0d9d4e7824438eaef4621","observation_id":"84033f8e-de13-4eb3-ba05-0b19424ed655","resolution":{"observed_at":"2026-08-06T21:02:39.023800Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2311.00279/citation-record","integrity":"/paper/2311.00279/integrity","json":"/paper/2311.00279/citation-record.json","paper":"/paper/2311.00279"},"outbound":[],"paper":{"arxiv_id":"2311.00279","last_updated":"2023-11-02T10:19:57Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-07-06T16:41:31.021679Z","submitted_at":"2023-11-01T04:05:01Z","title":"Accelerating Maximal Clique Enumeration via Graph Reduction"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2311.00279."}