{"as_of":"2026-08-09T22:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c1bfffb7edd50ce35809c7bfa923a6cd60447946bf24a24beea18a60e5f6f5f","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T00:21:15.638897Z","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-07-08T00:24:22.432166Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0710.3901","last_updated":"2024-07-11T20:42:26Z","snapshot_observed_at":"2026-08-09T14:31:06.382385Z","submitted_at":"2007-10-21T03:30:05Z","title":"A recursive linear time modular decomposition algorithm via LexBFS","version":4},"cited_work":{"arxiv_id":"0710.3901","doi":null,"metadata_source":"pith","pith_arxiv_id":"0710.3901","snapshot_observed_at":"2026-07-08T00:24:22.432166Z","title":"A recursive linear time modular decomposition algorithm via LexBFS","venue":"cs.DM","work_id":"4200ad03-bb71-460f-972d-6d45138299cd","year":2007},"citing_paper":{"arxiv_id":"2606.11757","last_updated":"2026-06-11T09:53:14Z","snapshot_observed_at":"2026-08-08T09:07:13.587079Z","submitted_at":"2026-06-10T07:31:54Z","title":"Vertex-critical co-gem-free graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T09:30:16.575531Z"},"links":{"cited_paper":"/paper/0710.3901","citing_paper":"/paper/2606.11757"},"observation_digest":"sha256:c525e8290c25ce1f09cfe0c5ed37728c34c9c7145cfea4c61fb887f16b9199cf","observation_id":"3554e65b-f07c-4403-b080-b853dc569d04","resolution":{"observed_at":"2026-07-03T11:38:04.625477Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0710.3901","last_updated":"2024-07-11T20:42:26Z","snapshot_observed_at":"2026-08-09T14:31:06.382385Z","submitted_at":"2007-10-21T03:30:05Z","title":"A recursive linear time modular decomposition algorithm via LexBFS","version":4},"cited_work":{"arxiv_id":"0710.3901","doi":null,"metadata_source":"pith","pith_arxiv_id":"0710.3901","snapshot_observed_at":"2026-07-08T00:24:22.432166Z","title":"A recursive linear time modular decomposition algorithm via LexBFS","venue":"cs.DM","work_id":"4200ad03-bb71-460f-972d-6d45138299cd","year":2007},"citing_paper":{"arxiv_id":"2607.05191","last_updated":"2026-07-06T15:09:55Z","snapshot_observed_at":"2026-08-02T11:15:29.389406Z","submitted_at":"2026-07-06T15:09:55Z","title":"Towards the Recognition of Oriented Interval Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-08T00:21:15.638897Z"},"links":{"cited_paper":"/paper/0710.3901","citing_paper":"/paper/2607.05191"},"observation_digest":"sha256:efcc519c62e99e680adc203ee6e63f66d90f311ce9755cb650f5a3113d04d104","observation_id":"367f55fd-0261-460c-9c5e-4174a93ccc23","resolution":{"observed_at":"2026-07-08T00:24:22.433934Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/0710.3901/citation-record","integrity":"/paper/0710.3901/integrity","json":"/paper/0710.3901/citation-record.json","paper":"/paper/0710.3901"},"outbound":[],"paper":{"arxiv_id":"0710.3901","last_updated":"2024-07-11T20:42:26Z","latest_version":4,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-09T14:31:06.382385Z","submitted_at":"2007-10-21T03:30:05Z","title":"A recursive linear time modular decomposition algorithm via LexBFS"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:0710.3901."}