{"as_of":"2026-08-14T00:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c62002bb4b667452be8bd6c0e4c7d224e3088840b1c4c7a59f34b5614f1d5c2","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-13T06:32:02.005865+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-08T05:58:50.571877Z","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-08T05:58:50.684560Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.04367","last_updated":"2024-04-26T04:55:52Z","snapshot_observed_at":"2026-08-13T11:22:41.844840Z","submitted_at":"2023-06-07T12:00:16Z","title":"Solving NP-hard Problems on \\textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets","version":2},"cited_work":{"arxiv_id":"2306.04367","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.04367","snapshot_observed_at":"2026-08-08T05:58:50.684560Z","title":"Solving NP-hard Problems on \\textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets","venue":"cs.DM","work_id":"2c19a150-0d0a-444f-8de7-7e5f6eab7724","year":2023},"citing_paper":{"arxiv_id":"2502.08251","last_updated":"2025-02-12T09:47:00Z","snapshot_observed_at":"2026-08-12T14:20:25.275287Z","submitted_at":"2025-02-12T09:47:00Z","title":"Representing distance-hereditary graphs with multi-rooted trees","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T05:58:50.571877Z"},"links":{"cited_paper":"/paper/2306.04367","citing_paper":"/paper/2502.08251"},"observation_digest":"sha256:5ebb33859d1698db06ec1d74fd43ba40c6fedf78fbd3ad2c5e31c7e5d099959c","observation_id":"5804b875-474b-4886-9b8a-cd879513220d","resolution":{"observed_at":"2026-08-08T05:58:50.688588Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.04367/citation-record","integrity":"/paper/2306.04367/integrity","json":"/paper/2306.04367/citation-record.json","paper":"/paper/2306.04367"},"outbound":[],"paper":{"arxiv_id":"2306.04367","last_updated":"2024-04-26T04:55:52Z","latest_version":2,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-13T11:22:41.844840Z","submitted_at":"2023-06-07T12:00:16Z","title":"Solving NP-hard Problems on \\textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2306.04367."}