{"as_of":"2026-08-14T13:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:77eb0bd8c839294a551fbe8f9ce3e8ba62a280a12bf1c6001c624cc9f057de9f","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-14T06:32:32.682623+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-12T11:49:58.292530Z","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-10T16:26:26.268380Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.23702","last_updated":"2024-10-31T07:48:35Z","snapshot_observed_at":"2026-08-12T22:11:04.859323Z","submitted_at":"2024-10-31T07:48:35Z","title":"The minimum size of a $3$-connected locally nonforesty graph","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.23702","snapshot_observed_at":"2026-08-12T11:49:58.292530Z","title":"The minimum siz e of a 3-connected locally nonforesty graph","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":3,"source":"pdf_text","source_observed_at":"2026-08-12T11:49:58.292530Z"},"links":{"cited_paper":"/paper/2410.23702","citing_paper":"/paper/2411.17885"},"observation_digest":"sha256:c6f2c243c6235861da8d239941566cd11b99f9cac9d72e9061edbf3ce22d2e62","observation_id":"0350d6b3-f51a-48db-bb2e-c50eb2a8a480","resolution":{"observed_at":"2026-08-12T11:49:58.292530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.23702","last_updated":"2024-10-31T07:48:35Z","snapshot_observed_at":"2026-08-12T22:11:04.859323Z","submitted_at":"2024-10-31T07:48:35Z","title":"The minimum size of a $3$-connected locally nonforesty graph","version":1},"cited_work":{"arxiv_id":"2410.23702","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.23702","snapshot_observed_at":"2026-08-10T16:26:26.268380Z","title":"The minimum size of a $3$-connected locally nonforesty graph","venue":"math.CO","work_id":"392e68e7-4f50-4fcb-a3e9-9599fd60dd2e","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":6,"source":"pdf_text","source_observed_at":"2026-08-10T16:26:26.222178Z"},"links":{"cited_paper":"/paper/2410.23702","citing_paper":"/paper/2501.13980"},"observation_digest":"sha256:28a26306eb2cde794aebcd6096e5b864b339ce30a5b5cfa4f8f8c2afef12cda5","observation_id":"b9d064f1-7b2d-4ff0-a514-eeca6d145edf","resolution":{"observed_at":"2026-08-10T16:26:26.275280Z","resolver_source":"local_arxiv","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":"2410.23702","last_updated":"2024-10-31T07:48:35Z","snapshot_observed_at":"2026-08-12T22:11:04.859323Z","submitted_at":"2024-10-31T07:48:35Z","title":"The minimum size of a $3$-connected locally nonforesty graph","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.23702","snapshot_observed_at":"2026-08-01T12:35:29.778397Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26606","last_updated":"2026-07-29T08:28:56Z","snapshot_observed_at":"2026-08-13T12:05:57.262915Z","submitted_at":"2026-07-29T08:28:56Z","title":"Cyclic Neighborhoods in Digraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T12:35:29.778397Z"},"links":{"cited_paper":"/paper/2410.23702","citing_paper":"/paper/2607.26606"},"observation_digest":"sha256:cd2e4f64209e47c2e34085e07516ae73584cc671b15f47639c4d1f7fb1f01bee","observation_id":"741738f2-a64e-49d4-afde-d216dde32568","resolution":{"observed_at":"2026-08-01T12:35:29.778397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.23702/citation-record","integrity":"/paper/2410.23702/integrity","json":"/paper/2410.23702/citation-record.json","paper":"/paper/2410.23702"},"outbound":[],"paper":{"arxiv_id":"2410.23702","last_updated":"2024-10-31T07:48:35Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-12T22:11:04.859323Z","submitted_at":"2024-10-31T07:48:35Z","title":"The minimum size of a $3$-connected locally nonforesty graph"},"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 3 inbound Pith citation observations for arXiv:2410.23702."}