{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7BJYLSKJGTD3AX5THA26UWMZ53","short_pith_number":"pith:7BJYLSKJ","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"},"canonical_sha256":"f85385c94934c7b05fb33835ea5999eef7d613427610f1afd90d3b51ae06b956","source":{"kind":"arxiv","id":"2509.06345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.06345","created_at":"2026-07-05T12:06:34Z"},{"alias_kind":"arxiv_version","alias_value":"2509.06345v1","created_at":"2026-07-05T12:06:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06345","created_at":"2026-07-05T12:06:34Z"},{"alias_kind":"pith_short_12","alias_value":"7BJYLSKJGTD3","created_at":"2026-07-05T12:06:34Z"},{"alias_kind":"pith_short_16","alias_value":"7BJYLSKJGTD3AX5T","created_at":"2026-07-05T12:06:34Z"},{"alias_kind":"pith_short_8","alias_value":"7BJYLSKJ","created_at":"2026-07-05T12:06:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7BJYLSKJGTD3AX5THA26UWMZ53","target":"record","payload":{"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"},"canonical_sha256":"f85385c94934c7b05fb33835ea5999eef7d613427610f1afd90d3b51ae06b956","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"},"source_kind":"arxiv","source_id":"2509.06345","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:06:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DbR/EI2EM0DZnKy7LiwjXNc/nFe1ypwcEqfuDdIkHozVbACY6/0rc8tfqIbdV0javInzNO7BXnIc1kXoOag6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T10:55:35.407789Z"},"content_sha256":"04772eefad4bd8bba95df099fbf7a5dcb80b360db7ce02f7ee79155e9b79719e","schema_version":"1.0","event_id":"sha256:04772eefad4bd8bba95df099fbf7a5dcb80b360db7ce02f7ee79155e9b79719e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7BJYLSKJGTD3AX5THA26UWMZ53","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:06:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uk2gAugrGlVQqsUphYvQ6S5WMTNTPTt99Dwk3kPU0PtgeODCWc3AU68YW7STiiKwThM/mBMo0NV3PaXoR6NhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T10:55:35.408151Z"},"content_sha256":"cffc4193b980b3ca429c3b06759c8465954370f9adeb3be2b8491b4fb6d1fbbb","schema_version":"1.0","event_id":"sha256:cffc4193b980b3ca429c3b06759c8465954370f9adeb3be2b8491b4fb6d1fbbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53/bundle.json","state_url":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BJYLSKJGTD3AX5THA26UWMZ53/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-13T10:55:35Z","links":{"resolver":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53","bundle":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53/bundle.json","state":"https://pith.science/pith/7BJYLSKJGTD3AX5THA26UWMZ53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BJYLSKJGTD3AX5THA26UWMZ53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7BJYLSKJGTD3AX5THA26UWMZ53","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3571167f0dc3dd4573d3340a543c4d0790baa7ab2f95c2a1f9ab25ec196a361a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-08T05:34:53Z","title_canon_sha256":"d2c21d52305f2c691e1ef8d82eb328580c4bda7eecb54e327cef63da82e3b93f"},"schema_version":"1.0","source":{"id":"2509.06345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.06345","created_at":"2026-07-05T12:06:34Z"},{"alias_kind":"arxiv_version","alias_value":"2509.06345v1","created_at":"2026-07-05T12:06:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06345","created_at":"2026-07-05T12:06:34Z"},{"alias_kind":"pith_short_12","alias_value":"7BJYLSKJGTD3","created_at":"2026-07-05T12:06:34Z"},{"alias_kind":"pith_short_16","alias_value":"7BJYLSKJGTD3AX5T","created_at":"2026-07-05T12:06:34Z"},{"alias_kind":"pith_short_8","alias_value":"7BJYLSKJ","created_at":"2026-07-05T12:06:34Z"}],"graph_snapshots":[{"event_id":"sha256:cffc4193b980b3ca429c3b06759c8465954370f9adeb3be2b8491b4fb6d1fbbb","target":"graph","created_at":"2026-07-05T12:06:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.06345/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jie Ma, Rongxing Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-08T05:34:53Z","title":"Proof of a conjecture of Voss on bridges of longest cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06345","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:04772eefad4bd8bba95df099fbf7a5dcb80b360db7ce02f7ee79155e9b79719e","target":"record","created_at":"2026-07-05T12:06:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3571167f0dc3dd4573d3340a543c4d0790baa7ab2f95c2a1f9ab25ec196a361a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-08T05:34:53Z","title_canon_sha256":"d2c21d52305f2c691e1ef8d82eb328580c4bda7eecb54e327cef63da82e3b93f"},"schema_version":"1.0","source":{"id":"2509.06345","kind":"arxiv","version":1}},"canonical_sha256":"f85385c94934c7b05fb33835ea5999eef7d613427610f1afd90d3b51ae06b956","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f85385c94934c7b05fb33835ea5999eef7d613427610f1afd90d3b51ae06b956","first_computed_at":"2026-07-05T12:06:34.123764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:06:34.123764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FbOzP4hmXMEV6AGQAZCXFMdqnPH7J+TrlLMTizHQJR1XbDA2B49D6kShVjcKyy7G40RTkbrKv5NtWlrpJbhMDw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:06:34.124242Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.06345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04772eefad4bd8bba95df099fbf7a5dcb80b360db7ce02f7ee79155e9b79719e","sha256:cffc4193b980b3ca429c3b06759c8465954370f9adeb3be2b8491b4fb6d1fbbb"],"state_sha256":"5e88dd9d1be9f923f30b2d58c8a3cbd905641e7af49f85ef139d5c506defa145"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wdhd34iEogYakzPlM7KmmzwTBx+AtTWgMnpW9BqKo8OjwYxkh06XAkNdHszy5ZfD/HiR1J7GcfHpYe5lPdy/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T10:55:35.410072Z","bundle_sha256":"aca1869cd6d2c5029c7a50cdf1552a961f09e945f589910a388b79d222f86111"}}