{"as_of":"2026-08-14T08:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e4af5439dda55c169655f33c38ade0891297938618fada291229d6b13be9eee1","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:49:58.287185Z","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":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.17724","last_updated":"2024-09-26T10:54:06Z","snapshot_observed_at":"2026-08-12T22:37:03.232837Z","submitted_at":"2024-09-26T10:54:06Z","title":"Forest Cuts in Sparse Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17724","snapshot_observed_at":"2026-08-12T11:49:58.287185Z","title":"Forest cuts in sparse graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.17885","last_updated":"2025-05-26T14:33:08Z","snapshot_observed_at":"2026-08-14T06:06:53.353970Z","submitted_at":"2024-11-26T21:12:34Z","title":"Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T11:49:58.287185Z"},"links":{"cited_paper":"/paper/2409.17724","citing_paper":"/paper/2411.17885"},"observation_digest":"sha256:7a122b282ddf31c231ef57993cbaf3ac2c8ffb170c012e3df71088c3e20030cc","observation_id":"2e41318d-85b6-42c5-ab94-bcc4d894e270","resolution":{"observed_at":"2026-08-12T11:49:58.287185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17724","last_updated":"2024-09-26T10:54:06Z","snapshot_observed_at":"2026-08-12T22:37:03.232837Z","submitted_at":"2024-09-26T10:54:06Z","title":"Forest Cuts in Sparse Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17724","snapshot_observed_at":"2026-08-11T22:11:49.578764Z","title":"Chernyshev, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.03869","last_updated":"2024-12-05T04:39:48Z","snapshot_observed_at":"2026-08-13T03:59:48.388229Z","submitted_at":"2024-12-05T04:39:48Z","title":"Sparse graphs with an independent or foresty minimum vertex cut","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T22:11:49.578764Z"},"links":{"cited_paper":"/paper/2409.17724","citing_paper":"/paper/2412.03869"},"observation_digest":"sha256:0fc09eb2afd8f3fae7791007f35dc4f603fb56f83cc5222e8451f25f5e34da8d","observation_id":"32084b7b-57db-46dc-93e0-fd7fcd8d69a9","resolution":{"observed_at":"2026-08-11T22:11:49.578764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17724","last_updated":"2024-09-26T10:54:06Z","snapshot_observed_at":"2026-08-12T22:37:03.232837Z","submitted_at":"2024-09-26T10:54:06Z","title":"Forest Cuts in Sparse Graphs","version":1},"cited_work":{"arxiv_id":"2409.17724","doi":"10.48550/arxiv.2409.17724","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.17724","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Chernyshev, J","venue":"arXiv (Cornell University)","work_id":"7a3d2da4-ffa8-4cc6-a0c6-7f5d2f0e323a","year":2024},"citing_paper":{"arxiv_id":"2412.16018","last_updated":"2026-05-05T12:53:16Z","snapshot_observed_at":"2026-08-07T07:29:48.174215Z","submitted_at":"2024-12-20T16:08:59Z","title":"Stable cuts, NAC-colourings and flexible realisations of graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-23T06:54:02.066278Z"},"links":{"cited_paper":"/paper/2409.17724","citing_paper":"/paper/2412.16018"},"observation_digest":"sha256:e2c82fa0ab95e38bfb5785398e27b13c004afbd99bbff4610d8edb7cf8f55553","observation_id":"ec78f4ba-bfa1-4843-9ac0-3faea3b40163","resolution":{"observed_at":"2026-05-23T06:55:27.993696Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17724","last_updated":"2024-09-26T10:54:06Z","snapshot_observed_at":"2026-08-12T22:37:03.232837Z","submitted_at":"2024-09-26T10:54:06Z","title":"Forest Cuts in Sparse Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17724","snapshot_observed_at":"2026-08-10T16:26:26.213199Z","title":"Chernyshev, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13980","last_updated":"2025-01-23T02:40:55Z","snapshot_observed_at":"2026-08-13T01:08:59.438430Z","submitted_at":"2025-01-23T02:40:55Z","title":"The minimum size of a $k$-connected locally nonforesty graph","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T16:26:26.213199Z"},"links":{"cited_paper":"/paper/2409.17724","citing_paper":"/paper/2501.13980"},"observation_digest":"sha256:1b0a94e0fb1faf57e62bcef22ceb2faa21cb2c01823e0d5467fbe8a18f9f0893","observation_id":"a9566051-c9d2-4571-ba2a-58f1c45aa2ee","resolution":{"observed_at":"2026-08-10T16:26:26.213199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2409.17724/citation-record","integrity":"/paper/2409.17724/integrity","json":"/paper/2409.17724/citation-record.json","paper":"/paper/2409.17724"},"outbound":[],"paper":{"arxiv_id":"2409.17724","last_updated":"2024-09-26T10:54:06Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-12T22:37:03.232837Z","submitted_at":"2024-09-26T10:54:06Z","title":"Forest Cuts in Sparse 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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2409.17724."}