{"as_of":"2026-08-17T07:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:488737cdc7f44bb3d1e9f287eea801705e542b962f4e94b2d54c0d459dc6f777","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:29:08.024798Z","state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/1908.01223/citation-record","integrity":"/paper/1908.01223/integrity","json":"/paper/1908.01223/citation-record.json","paper":"/paper/1908.01223"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:29:08.139784Z","title":null,"venue":null,"work_id":"5c642b31-4b09-414b-a7b2-d073c408e47a","year":1996},"citing_paper":{"arxiv_id":"1908.01223","last_updated":"2019-12-30T16:57:18Z","snapshot_observed_at":"2026-08-16T22:20:55.669864Z","submitted_at":"2019-08-03T19:42:32Z","title":"Faster algorithms for cograph edge modification problems","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:08.001437Z"},"links":{"citing_paper":"/paper/1908.01223"},"observation_digest":"sha256:bbba076646cf314c178a575c6c6825815ba6fa909adea0ed75ea83876008caff","observation_id":"7d5ed8fc-f5e9-442f-9181-52894993567b","resolution":{"observed_at":"2026-08-14T15:29:08.145620Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:29:08.121628Z","title":"Cygan, F","venue":null,"work_id":"e56b11e0-93ef-4d28-9d96-3945e7acf247","year":2015},"citing_paper":{"arxiv_id":"1908.01223","last_updated":"2019-12-30T16:57:18Z","snapshot_observed_at":"2026-08-16T22:20:55.669864Z","submitted_at":"2019-08-03T19:42:32Z","title":"Faster algorithms for cograph edge modification problems","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:08.007600Z"},"links":{"citing_paper":"/paper/1908.01223"},"observation_digest":"sha256:a77ac598276e3ff7e1f4f07493611d29254ec5f5d9bcb59a91aaae26b745bc1e","observation_id":"93fc06f6-c9f0-4a51-adab-18953dceae43","resolution":{"observed_at":"2026-08-14T15:29:08.127767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:29:08.102986Z","title":"Jamison and S","venue":null,"work_id":"f5655ce8-b13b-440c-9482-00cefe278077","year":1992},"citing_paper":{"arxiv_id":"1908.01223","last_updated":"2019-12-30T16:57:18Z","snapshot_observed_at":"2026-08-16T22:20:55.669864Z","submitted_at":"2019-08-03T19:42:32Z","title":"Faster algorithms for cograph edge modification problems","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:08.013405Z"},"links":{"citing_paper":"/paper/1908.01223"},"observation_digest":"sha256:d3b20729e5655f664ee043edcd62c48a8aa1f5b09c4c0a57e52200d52b5f6981","observation_id":"50269d97-b861-4c33-a365-5791f1f75540","resolution":{"observed_at":"2026-08-14T15:29:08.108668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:29:08.081219Z","title":null,"venue":null,"work_id":"39531a3f-922c-4f63-a0f9-b4e536e3a39f","year":2012},"citing_paper":{"arxiv_id":"1908.01223","last_updated":"2019-12-30T16:57:18Z","snapshot_observed_at":"2026-08-16T22:20:55.669864Z","submitted_at":"2019-08-03T19:42:32Z","title":"Faster algorithms for cograph edge modification problems","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:08.019601Z"},"links":{"citing_paper":"/paper/1908.01223"},"observation_digest":"sha256:63ddb8a457dfb7a81012f2af73a11ab596680fca35a984a9e97dab94a8ccce84","observation_id":"d1209f02-0ff5-4140-9130-49161c1558d8","resolution":{"observed_at":"2026-08-14T15:29:08.087677Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:29:08.060283Z","title":"Nastos and Y","venue":null,"work_id":"f6989c41-1353-4ca4-8121-e1d127ade227","year":2012},"citing_paper":{"arxiv_id":"1908.01223","last_updated":"2019-12-30T16:57:18Z","snapshot_observed_at":"2026-08-16T22:20:55.669864Z","submitted_at":"2019-08-03T19:42:32Z","title":"Faster algorithms for cograph edge modification problems","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:08.024798Z"},"links":{"citing_paper":"/paper/1908.01223"},"observation_digest":"sha256:4a60a4033b300dad1dfa9ffaa806ad605134b6d8c489ce86985407c8cca41ca8","observation_id":"de56abc4-11e2-4041-84b9-506ea73d406c","resolution":{"observed_at":"2026-08-14T15:29:08.066508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01223","last_updated":"2019-12-30T16:57:18Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T22:20:55.669864Z","submitted_at":"2019-08-03T19:42:32Z","title":"Faster algorithms for cograph edge modification problems"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":5},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 0 inbound Pith citation observations for arXiv:1908.01223."}