{"as_of":"2026-08-14T01:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bf1c30b89e45bf9c7f53f679faba824888d990226a778cbd266ceb2588a44601","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:26:26.235193Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.13980/citation-record","integrity":"/paper/2501.13980/integrity","json":"/paper/2501.13980/citation-record.json","paper":"/paper/2501.13980"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:26:26.389991Z","title":"Asratian, Every 3-connected, locally connected, claw-fre e graph is Hamilton- connected, J","venue":null,"work_id":"0c09a755-662d-4e0a-a764-c8012351f12f","year":1996},"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":1,"source":"pdf_text","source_observed_at":"2026-08-10T16:26:26.200737Z"},"links":{"citing_paper":"/paper/2501.13980"},"observation_digest":"sha256:b35d3b3e8dec2be81e7ab8d9a28eb4a2863d271613a949d15e25cc4de609b156","observation_id":"2503c9b4-811a-4953-896c-8251fc9f3e44","resolution":{"observed_at":"2026-08-10T16:26:26.394587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:26:26.375349Z","title":"Bondy and U.S.R","venue":null,"work_id":"5fde9854-b8d6-4197-b44f-cfa03b24f7cf","year":null},"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":2,"source":"pdf_text","source_observed_at":"2026-08-10T16:26:26.205099Z"},"links":{"citing_paper":"/paper/2501.13980"},"observation_digest":"sha256:b35ccb45809ede1491b598484115d56e061fb1ef4aedbf6de95d74c784a50cab","observation_id":"7026bcd1-ad7a-44b0-ada8-6caa7ce26cf2","resolution":{"observed_at":"2026-08-10T16:26:26.380008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:26:26.360147Z","title":"Chartrand, R.J","venue":null,"work_id":"e76a1ebb-8dab-42dc-866d-b4fbf092b16a","year":1979},"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":3,"source":"pdf_text","source_observed_at":"2026-08-10T16:26:26.209268Z"},"links":{"citing_paper":"/paper/2501.13980"},"observation_digest":"sha256:955764e703dd8c56f6ed8a88985baed5754105e8ab7868ee94fefc48a7b2f2c4","observation_id":"849f1244-70a0-4f8a-b03d-a0a8d5a9846a","resolution":{"observed_at":"2026-08-10T16:26:26.364841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:26:26.344999Z","title":"Davies and C","venue":null,"work_id":"e3b3fdaa-4a5d-48d7-9e34-179a3cc18cb4","year":2020},"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":5,"source":"pdf_text","source_observed_at":"2026-08-10T16:26:26.217562Z"},"links":{"citing_paper":"/paper/2501.13980"},"observation_digest":"sha256:4503111663c17a7f4371e8caf465f6e80b5015a5ee3883d988bbf5a496e787f3","observation_id":"c3ac5f0e-ebca-4875-b46d-1e9bad404274","resolution":{"observed_at":"2026-08-10T16:26:26.349865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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":"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:694beebfa82885eb069dd1f4a743c00911fe30a0fae898f1a310eda38be2fcf3","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:26:26.329854Z","title":"Oberly and D.P","venue":null,"work_id":"4bf0f192-aa6c-4fac-abd3-eb541a966287","year":1979},"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":7,"source":"pdf_text","source_observed_at":"2026-08-10T16:26:26.226481Z"},"links":{"citing_paper":"/paper/2501.13980"},"observation_digest":"sha256:84eaf424be0085c542df2f1c55d1b1fd9712d257c01901c06539e1a4600efc80","observation_id":"1e05e464-f10e-46a6-aab7-b8fd700e81d3","resolution":{"observed_at":"2026-08-10T16:26:26.334598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:26:26.315608Z","title":"West, Research problems, Discrete Math., 272(2003), 301 -306","venue":null,"work_id":"d75b6d0b-5b68-4881-8f40-7e885e42c895","year":2003},"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":8,"source":"pdf_text","source_observed_at":"2026-08-10T16:26:26.231317Z"},"links":{"citing_paper":"/paper/2501.13980"},"observation_digest":"sha256:cfd472f44c6f89c56f853877e7f4d79ab6f9792728c4406dbd488824e1904c38","observation_id":"247c1118-6fed-4384-8528-5eb868c9a163","resolution":{"observed_at":"2026-08-10T16:26:26.320128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:26:26.301138Z","title":"West, Introduction to Graph Theory, Prentice Hall, Inc., 19 96","venue":null,"work_id":"699e82f2-8432-4822-a840-1c6d9f533cf0","year":null},"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":9,"source":"pdf_text","source_observed_at":"2026-08-10T16:26:26.235193Z"},"links":{"citing_paper":"/paper/2501.13980"},"observation_digest":"sha256:0b4bbe549c8cfdc906343cba447434ad1ca6e076dce0948f51c5dcac3c90b8d6","observation_id":"922049d3-e343-4f56-8320-326d32d4fb25","resolution":{"observed_at":"2026-08-10T16:26:26.306089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.13980","last_updated":"2025-01-23T02:40:55Z","latest_version":1,"primary_category":"math.CO","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"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":7},"total_outbound_references":9},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2501.13980."}