{"as_of":"2026-08-15T08:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5abd06674985d44828672b0d1a6719437f564ab3c6aabf1b14913d197c3d1ed4","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-15T06:32:42.880941+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-08-07T01:10:35.607683Z","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-06T19:49:34.607857Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.18352","last_updated":"2024-02-28T14:20:29Z","snapshot_observed_at":"2026-08-13T04:08:13.453342Z","submitted_at":"2024-02-28T14:20:29Z","title":"Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18352","snapshot_observed_at":"2026-08-07T01:10:35.607683Z","title":"Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs.CoRR, abs/2402.18352, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12424","last_updated":"2025-06-14T09:50:44Z","snapshot_observed_at":"2026-08-13T20:44:43.801932Z","submitted_at":"2025-06-14T09:50:44Z","title":"Layered tree-independence number and clique-based separators","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T01:10:35.607683Z"},"links":{"cited_paper":"/paper/2402.18352","citing_paper":"/paper/2506.12424"},"observation_digest":"sha256:4d54849e2c930ec2f7fcdd58cf9fde3f770f7191553b4c07c1503ac883d5d66e","observation_id":"ffb21350-756c-49a5-a6b7-f3d51d37f9b0","resolution":{"observed_at":"2026-08-07T01:10:35.607683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18352","last_updated":"2024-02-28T14:20:29Z","snapshot_observed_at":"2026-08-13T04:08:13.453342Z","submitted_at":"2024-02-28T14:20:29Z","title":"Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs","version":1},"cited_work":{"arxiv_id":"2402.18352","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.18352","snapshot_observed_at":"2026-08-06T19:49:34.607857Z","title":"Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs","venue":"cs.DS","work_id":"b71fafe1-9aa3-4d3b-ba79-39a18d5caac2","year":2024},"citing_paper":{"arxiv_id":"2608.04659","last_updated":"2026-08-05T10:14:20Z","snapshot_observed_at":"2026-08-15T03:18:25.224302Z","submitted_at":"2026-08-05T10:14:20Z","title":"Subdivided expanders and counterexamples to the Tree Product Conjecture","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:49:33.126314Z"},"links":{"cited_paper":"/paper/2402.18352","citing_paper":"/paper/2608.04659"},"observation_digest":"sha256:62d4e7d6fa6a265f93d1377927719b5de17f42a9ef4d36a06f87c2ebcce97984","observation_id":"1599fc66-ee2f-4c61-b1c2-c412e070539d","resolution":{"observed_at":"2026-08-06T19:49:34.734063Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.18352/citation-record","integrity":"/paper/2402.18352/integrity","json":"/paper/2402.18352/citation-record.json","paper":"/paper/2402.18352"},"outbound":[],"paper":{"arxiv_id":"2402.18352","last_updated":"2024-02-28T14:20:29Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T04:08:13.453342Z","submitted_at":"2024-02-28T14:20:29Z","title":"Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.18352."}