{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Y4D2HPT4CAY36IVTDGCJD4QRDV","short_pith_number":"pith:Y4D2HPT4","schema_version":"1.0","canonical_sha256":"c707a3be7c1031bf22b3198491f2111d695c95e6a26ae24d9ff9e9f07802a347","source":{"kind":"arxiv","id":"1309.7683","version":2},"attestation_state":"computed","paper":{"title":"Circumference and Pathwidth of Highly Connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Emily A. Marshall","submitted_at":"2013-09-30T00:27:46Z","abstract_excerpt":"Birmele [J. Graph Theory, 2003] proved that every graph with circumference t has treewidth at most t-1. Under the additional assumption of 2-connectivity, such graphs have bounded pathwidth, which is a qualitatively stronger result. Birmele's theorem was extended by Birmele, Bondy and Reed [Combinatorica, 2007] who showed that every graph without k disjoint cycles of length at least t has bounded treewidth (as a function of k and t). Our main result states that, under the additional assumption of (k + 1)- connectivity, such graphs have bounded pathwidth. In fact, they have pathwidth O(t^3 + tk"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1309.7683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-30T00:27:46Z","cross_cats_sorted":[],"title_canon_sha256":"902b928bf17524a5e021776009ffa980e38bbeff7b78da5361088325dcc29644","abstract_canon_sha256":"bd7f5874e26a604c15a0a03ff18564200621525922364e05f1ba2597465cae25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:56:00.081723Z","signature_b64":"w2kSIGdSESoOb7nnboVzfbdgZCzrerAcY1XW4bqxgzgwsip28Jc9UZT3AmeXAh2qZNOAPRR0CUpQWLmYR8DjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c707a3be7c1031bf22b3198491f2111d695c95e6a26ae24d9ff9e9f07802a347","last_reissued_at":"2026-05-18T01:56:00.081176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:56:00.081176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circumference and Pathwidth of Highly Connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Emily A. Marshall","submitted_at":"2013-09-30T00:27:46Z","abstract_excerpt":"Birmele [J. Graph Theory, 2003] proved that every graph with circumference t has treewidth at most t-1. Under the additional assumption of 2-connectivity, such graphs have bounded pathwidth, which is a qualitatively stronger result. Birmele's theorem was extended by Birmele, Bondy and Reed [Combinatorica, 2007] who showed that every graph without k disjoint cycles of length at least t has bounded treewidth (as a function of k and t). Our main result states that, under the additional assumption of (k + 1)- connectivity, such graphs have bounded pathwidth. In fact, they have pathwidth O(t^3 + tk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7683","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.7683","created_at":"2026-05-18T01:56:00.081254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7683v2","created_at":"2026-05-18T01:56:00.081254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7683","created_at":"2026-05-18T01:56:00.081254+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4D2HPT4CAY3","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4D2HPT4CAY36IVT","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4D2HPT4","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y4D2HPT4CAY36IVTDGCJD4QRDV","json":"https://pith.science/pith/Y4D2HPT4CAY36IVTDGCJD4QRDV.json","graph_json":"https://pith.science/api/pith-number/Y4D2HPT4CAY36IVTDGCJD4QRDV/graph.json","events_json":"https://pith.science/api/pith-number/Y4D2HPT4CAY36IVTDGCJD4QRDV/events.json","paper":"https://pith.science/paper/Y4D2HPT4"},"agent_actions":{"view_html":"https://pith.science/pith/Y4D2HPT4CAY36IVTDGCJD4QRDV","download_json":"https://pith.science/pith/Y4D2HPT4CAY36IVTDGCJD4QRDV.json","view_paper":"https://pith.science/paper/Y4D2HPT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7683&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4D2HPT4CAY36IVTDGCJD4QRDV/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4D2HPT4CAY36IVTDGCJD4QRDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4D2HPT4CAY36IVTDGCJD4QRDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4D2HPT4CAY36IVTDGCJD4QRDV/action/storage_attestation","attest_author":"https://pith.science/pith/Y4D2HPT4CAY36IVTDGCJD4QRDV/action/author_attestation","sign_citation":"https://pith.science/pith/Y4D2HPT4CAY36IVTDGCJD4QRDV/action/citation_signature","submit_replication":"https://pith.science/pith/Y4D2HPT4CAY36IVTDGCJD4QRDV/action/replication_record"}},"created_at":"2026-05-18T01:56:00.081254+00:00","updated_at":"2026-05-18T01:56:00.081254+00:00"}