{"as_of":"2026-08-21T03:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:829e932683b6b5fb146eb0a0a17a2072a0f9e1c033d925cda34ce0978ec31ce5","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:19:01.838238Z","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-09T06:06:01.432630Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.04585","last_updated":"2023-11-14T14:24:06Z","snapshot_observed_at":"2026-08-14T16:07:11.075342Z","submitted_at":"2019-07-10T09:21:33Z","title":"Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs","version":4},"cited_work":{"arxiv_id":"1907.04585","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.04585","snapshot_observed_at":"2026-07-09T06:06:01.432630Z","title":"Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs","venue":"cs.DS","work_id":"dbb8ec78-782b-4a9f-b7ac-b77e265d1be3","year":2019},"citing_paper":{"arxiv_id":"2607.07595","last_updated":"2026-07-31T08:06:19Z","snapshot_observed_at":"2026-08-20T11:11:00.748243Z","submitted_at":"2026-07-08T16:13:54Z","title":"Induced packing treewidth","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/1907.04585","citing_paper":"/paper/2607.07595"},"observation_digest":"sha256:817f78ec8482e00fa6ee0dc541f2ae0084e318e3e489236c1492973944fe7f9d","observation_id":"64531688-dda5-4676-9486-50b5de0eae6e","resolution":{"observed_at":"2026-07-09T06:06:01.436331Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04585","last_updated":"2023-11-14T14:24:06Z","snapshot_observed_at":"2026-08-14T16:07:11.075342Z","submitted_at":"2019-07-10T09:21:33Z","title":"Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04585","snapshot_observed_at":"2026-08-03T02:08:23.554754Z","title":"Chudnovsky, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.07595","last_updated":"2026-07-31T08:06:19Z","snapshot_observed_at":"2026-08-20T11:11:00.748243Z","submitted_at":"2026-07-08T16:13:54Z","title":"Induced packing treewidth","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T02:08:23.554754Z"},"links":{"cited_paper":"/paper/1907.04585","citing_paper":"/paper/2607.07595"},"observation_digest":"sha256:fc1fe9aa97044530064b90e4d46248fc3235b7fef27601ac42351c940d25a7be","observation_id":"bce11cc2-fee8-4c32-b9bb-073f3c9716a4","resolution":{"observed_at":"2026-08-03T02:08:23.554754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04585","last_updated":"2023-11-14T14:24:06Z","snapshot_observed_at":"2026-08-14T16:07:11.075342Z","submitted_at":"2019-07-10T09:21:33Z","title":"Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04585","snapshot_observed_at":"2026-08-14T04:19:01.838238Z","title":"Maria Chudnovsky, Marcin Pilipczuk, Michał Pilipczuk, Stéphan Thomassé.https://arxiv.org/abs/1907.04585","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-19T01:22:14.174611Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":2},"reference_index":190,"source":"pdf_text","source_observed_at":"2026-08-14T04:19:01.838238Z"},"links":{"cited_paper":"/paper/1907.04585","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:f88987eef3f738fd091effbf287258d699933d8442a38baa9232d5f2bc36ef24","observation_id":"d6b27a2c-9e5a-45b3-bab2-235bef437c2a","resolution":{"observed_at":"2026-08-14T04:19:01.838238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1907.04585/citation-record","integrity":"/paper/1907.04585/integrity","json":"/paper/1907.04585/citation-record.json","paper":"/paper/1907.04585"},"outbound":[],"paper":{"arxiv_id":"1907.04585","last_updated":"2023-11-14T14:24:06Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T16:07:11.075342Z","submitted_at":"2019-07-10T09:21:33Z","title":"Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1907.04585."}