{"as_of":"2026-08-11T18:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a967682c8ed39074ce5172297cd176e0e999f9b7cbe38d178f9395fd2e7b2f55","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-11T06:34:44.6726+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-07-14T11:42:51.239967Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":2,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.04855","last_updated":"2025-06-30T14:19:34Z","snapshot_observed_at":"2026-08-11T02:15:12.159362Z","submitted_at":"2022-07-11T13:30:55Z","title":"Canonical graph decompositions via coverings","version":8},"cited_work":{"arxiv_id":"2207.04855","doi":"10.48550/arxiv.2207.04855","metadata_source":"arxiv_reference","pith_arxiv_id":"2207.04855","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Vertex cuts","venue":"arXiv (Cornell University)","work_id":"1e73fb11-a46e-4d52-9a0a-d1ada2c99536","year":2012},"citing_paper":{"arxiv_id":"2512.18480","last_updated":"2026-05-04T13:59:39Z","snapshot_observed_at":"2026-07-06T22:39:38.760525Z","submitted_at":"2025-12-20T19:42:16Z","title":"Canonical tree-decompositions of chordal graphs","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-16T20:17:57.742706Z"},"links":{"cited_paper":"/paper/2207.04855","citing_paper":"/paper/2512.18480"},"observation_digest":"sha256:ef1d09fe68891b01d31cef069abfe4785cf10c080950b91eb3e9f5ff3c972bf8","observation_id":"279bd048-7384-411c-b890-9e85e63c2b2b","resolution":{"observed_at":"2026-05-16T20:18:23.419502Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.04855","last_updated":"2025-06-30T14:19:34Z","snapshot_observed_at":"2026-08-11T02:15:12.159362Z","submitted_at":"2022-07-11T13:30:55Z","title":"Canonical graph decompositions via coverings","version":8},"cited_work":{"arxiv_id":"2207.04855","doi":"10.48550/arxiv.2207.04855","metadata_source":"arxiv_reference","pith_arxiv_id":"2207.04855","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Vertex cuts","venue":"arXiv (Cornell University)","work_id":"1e73fb11-a46e-4d52-9a0a-d1ada2c99536","year":2012},"citing_paper":{"arxiv_id":"2605.14902","last_updated":"2026-05-14T14:40:16Z","snapshot_observed_at":"2026-07-06T23:26:18.733776Z","submitted_at":"2026-05-14T14:40:16Z","title":"Optimal Bounds for the k-Disjoint Paths Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-30T20:22:31.649691Z"},"links":{"cited_paper":"/paper/2207.04855","citing_paper":"/paper/2605.14902"},"observation_digest":"sha256:d1c6ce0e99a1f1730cec2b93a6549302e55d9577b4ee5feeb17d013155c364a2","observation_id":"d71b183b-5ef8-4b94-bd91-5ed97e1d3a59","resolution":{"observed_at":"2026-06-30T20:25:01.458839Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.04855","last_updated":"2025-06-30T14:19:34Z","snapshot_observed_at":"2026-08-11T02:15:12.159362Z","submitted_at":"2022-07-11T13:30:55Z","title":"Canonical graph decompositions via coverings","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.04855","snapshot_observed_at":"2026-07-14T11:42:51.239967Z","title":"Jacobs, Paul Knappe, and Jan Kurkofka.Canonical graph decompositions via coverings","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10442","last_updated":"2026-07-11T18:58:45Z","snapshot_observed_at":"2026-08-08T11:02:50.214899Z","submitted_at":"2026-07-11T18:58:45Z","title":"Decomposing time-varying data into simple pieces: structured decompositions of narratives","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T11:42:51.239967Z"},"links":{"cited_paper":"/paper/2207.04855","citing_paper":"/paper/2607.10442"},"observation_digest":"sha256:3b3627672bf5010e42dc1550e58c02495bb31f594d21cdf4ac8432a7a67e547b","observation_id":"169e1eee-5edc-4cdd-9b1c-ebc081195435","resolution":{"observed_at":"2026-07-14T11:42:51.239967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2207.04855/citation-record","integrity":"/paper/2207.04855/integrity","json":"/paper/2207.04855/citation-record.json","paper":"/paper/2207.04855"},"outbound":[],"paper":{"arxiv_id":"2207.04855","last_updated":"2025-06-30T14:19:34Z","latest_version":8,"primary_category":"math.CO","snapshot_observed_at":"2026-08-11T02:15:12.159362Z","submitted_at":"2022-07-11T13:30:55Z","title":"Canonical graph decompositions via coverings"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2207.04855."}