{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7BJYLSKJGTD3AX5THA26UWMZ53","short_pith_number":"pith:7BJYLSKJ","schema_version":"1.0","canonical_sha256":"f85385c94934c7b05fb33835ea5999eef7d613427610f1afd90d3b51ae06b956","source":{"kind":"arxiv","id":"2509.06345","version":1},"attestation_state":"computed","paper":{"title":"Proof of a conjecture of Voss on bridges of longest cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Rongxing Xu","submitted_at":"2025-09-08T05:34:53Z","abstract_excerpt":"Bridges are a classical concept in structural graph theory and play a fundamental role in the study of cycles. A conjecture of Voss from 1991 asserts that if disjoint bridges $B_1, B_2, \\ldots, B_k$ of a longest cycle $L$ in a $2$-connected graph overlap in a tree-like manner (i.e., induce a tree in the {\\it overlap graph} of $L$), then the total {\\it length} of these bridges is at most half the length of $L$. Voss established this for $k \\leq 3$ and used it as a key tool in his 1991 monograph on cycles and bridges. In this paper, we confirm the conjecture in full via a reduction to a cycle co"},"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":"2509.06345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-08T05:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"d2c21d52305f2c691e1ef8d82eb328580c4bda7eecb54e327cef63da82e3b93f","abstract_canon_sha256":"3571167f0dc3dd4573d3340a543c4d0790baa7ab2f95c2a1f9ab25ec196a361a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:34.124242Z","signature_b64":"FbOzP4hmXMEV6AGQAZCXFMdqnPH7J+TrlLMTizHQJR1XbDA2B49D6kShVjcKyy7G40RTkbrKv5NtWlrpJbhMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f85385c94934c7b05fb33835ea5999eef7d613427610f1afd90d3b51ae06b956","last_reissued_at":"2026-07-05T12:06:34.123764Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:34.123764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proof of a conjecture of Voss on bridges of longest cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Rongxing Xu","submitted_at":"2025-09-08T05:34:53Z","abstract_excerpt":"Bridges are a classical concept in structural graph theory and play a fundamental role in the study of cycles. A conjecture of Voss from 1991 asserts that if disjoint bridges $B_1, B_2, \\ldots, B_k$ of a longest cycle $L$ in a $2$-connected graph overlap in a tree-like manner (i.e., induce a tree in the {\\it overlap graph} of $L$), then the total {\\it length} of these bridges is at most half the length of $L$. Voss established this for $k \\leq 3$ and used it as a key tool in his 1991 monograph on cycles and bridges. In this paper, we confirm the conjecture in full via a reduction to a cycle co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06345","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.06345/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2509.06345","created_at":"2026-07-05T12:06:34.123818+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.06345v1","created_at":"2026-07-05T12:06:34.123818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06345","created_at":"2026-07-05T12:06:34.123818+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BJYLSKJGTD3","created_at":"2026-07-05T12:06:34.123818+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BJYLSKJGTD3AX5T","created_at":"2026-07-05T12:06:34.123818+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BJYLSKJ","created_at":"2026-07-05T12:06:34.123818+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/7BJYLSKJGTD3AX5THA26UWMZ53","json":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53.json","graph_json":"https://pith.science/api/pith-number/7BJYLSKJGTD3AX5THA26UWMZ53/graph.json","events_json":"https://pith.science/api/pith-number/7BJYLSKJGTD3AX5THA26UWMZ53/events.json","paper":"https://pith.science/paper/7BJYLSKJ"},"agent_actions":{"view_html":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53","download_json":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53.json","view_paper":"https://pith.science/paper/7BJYLSKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.06345&json=true","fetch_graph":"https://pith.science/api/pith-number/7BJYLSKJGTD3AX5THA26UWMZ53/graph.json","fetch_events":"https://pith.science/api/pith-number/7BJYLSKJGTD3AX5THA26UWMZ53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53/action/storage_attestation","attest_author":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53/action/author_attestation","sign_citation":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53/action/citation_signature","submit_replication":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53/action/replication_record"}},"created_at":"2026-07-05T12:06:34.123818+00:00","updated_at":"2026-07-05T12:06:34.123818+00:00"}