{"as_of":"2026-08-08T12:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:23f689989701664695bbbc453ee69649f48e6a56f676ca8a535bb7f687fb6db2","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-08T06:32:00.761636+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-07T13:20:14.866648Z","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-07T13:20:21.320765Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.05062","last_updated":"2021-05-11T14:12:43Z","snapshot_observed_at":"2026-08-06T11:25:21.409024Z","submitted_at":"2021-05-11T14:12:43Z","title":"Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal","version":1},"cited_work":{"arxiv_id":"2105.05062","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.05062","snapshot_observed_at":"2026-08-07T13:20:21.320765Z","title":"Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal","venue":"cs.DS","work_id":"b4ed25c5-3aea-4db8-9a18-c1313898510e","year":2021},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:14.866648Z"},"links":{"cited_paper":"/paper/2105.05062","citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:6309959bf2c0726b51b583c1acaf82459f9d28ec0d267a465a870b56ca7d9928","observation_id":"02423850-564a-46ad-8013-4095301811f4","resolution":{"observed_at":"2026-08-07T13:20:21.425187Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2105.05062/citation-record","integrity":"/paper/2105.05062/integrity","json":"/paper/2105.05062/citation-record.json","paper":"/paper/2105.05062"},"outbound":[],"paper":{"arxiv_id":"2105.05062","last_updated":"2021-05-11T14:12:43Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T11:25:21.409024Z","submitted_at":"2021-05-11T14:12:43Z","title":"Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal"},"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 1 inbound Pith citation observation for arXiv:2105.05062."}