{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IQR6H5K6M5KDBAXYGCNCKNHMQL","short_pith_number":"pith:IQR6H5K6","canonical_record":{"source":{"id":"2606.03696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-02T14:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"365323c232d1da16589f74f09c6b428a55705ebf51a79be8167e9b3c700183e4","abstract_canon_sha256":"93aae30e2c86165c2507c4a55b4661aa8b5d93660d8633a471ea4ec4b8d82a91"},"schema_version":"1.0"},"canonical_sha256":"4423e3f55e67543082f8309a2534ec82d6f68868e91f19b945a78783deafd439","source":{"kind":"arxiv","id":"2606.03696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03696","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03696v1","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03696","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"IQR6H5K6M5KD","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_16","alias_value":"IQR6H5K6M5KDBAXY","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_8","alias_value":"IQR6H5K6","created_at":"2026-06-03T01:06:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IQR6H5K6M5KDBAXYGCNCKNHMQL","target":"record","payload":{"canonical_record":{"source":{"id":"2606.03696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-02T14:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"365323c232d1da16589f74f09c6b428a55705ebf51a79be8167e9b3c700183e4","abstract_canon_sha256":"93aae30e2c86165c2507c4a55b4661aa8b5d93660d8633a471ea4ec4b8d82a91"},"schema_version":"1.0"},"canonical_sha256":"4423e3f55e67543082f8309a2534ec82d6f68868e91f19b945a78783deafd439","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:06:04.778594Z","signature_b64":"u7a7jNavL8frAyAaTdy4SYVgLds4+DxbG0lErGZNMnhQ3IcpbORchE5CuJrznjna3J80vy1KikBCHsVj9KgpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4423e3f55e67543082f8309a2534ec82d6f68868e91f19b945a78783deafd439","last_reissued_at":"2026-06-03T01:06:04.778170Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:06:04.778170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.03696","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-06-03T01:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5eM0RSfmx4gU9vcclhEG/s9E41xbLNH52dwBnIimaXF/cbuzYtgj7F8yeIwe3JacnA37DgcLJ4+73EiJA4wAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:34:00.182485Z"},"content_sha256":"cdab00750eaad276f2f9453696b6ea73c09c41198d5168f410db50569944cc27","schema_version":"1.0","event_id":"sha256:cdab00750eaad276f2f9453696b6ea73c09c41198d5168f410db50569944cc27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IQR6H5K6M5KDBAXYGCNCKNHMQL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Longest cycles and Dirac-type results in highly connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Jie Ma, Ziyuan Zhao","submitted_at":"2026-06-02T14:17:06Z","abstract_excerpt":"A classical theorem of Nash-Williams states that if $G$ is a $2$-connected graph on $n$ vertices with minimum degree at least $(n+2)/3$, then for every longest cycle $C$ of $G$, the graph $G-V(C)$ is edgeless. Motivated by a higher-connectivity analogue, Bondy conjectured in 1980 that if $G$ is a $k$-connected graph on $n$ vertices with minimum degree at least $(n+k(k-1))/(k+1)$, then for every longest cycle $C$ of $G$, every path in $G-V(C)$ has at most $k-1$ vertices. This conjecture is known for $k\\le 3$ and remains open for all $k\\ge 4$.\n  In this paper, we prove Bondy's conjecture for all"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03696","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/2606.03696/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-06-03T01:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JIC4WT7zP2Y60PkjRKo9ZJZxSww9eceG6G1bQr67ZbB1glykajyRduQ54uFj6dUJ+ltSxr9Ah/7jcfos3S40Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:34:00.182870Z"},"content_sha256":"beb2dfe788786581cd549c1ab7143339f57bfaacc7e19adddc1f36b93d7267f7","schema_version":"1.0","event_id":"sha256:beb2dfe788786581cd549c1ab7143339f57bfaacc7e19adddc1f36b93d7267f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQR6H5K6M5KDBAXYGCNCKNHMQL/bundle.json","state_url":"https://pith.science/pith/IQR6H5K6M5KDBAXYGCNCKNHMQL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQR6H5K6M5KDBAXYGCNCKNHMQL/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-06-04T12:34:00Z","links":{"resolver":"https://pith.science/pith/IQR6H5K6M5KDBAXYGCNCKNHMQL","bundle":"https://pith.science/pith/IQR6H5K6M5KDBAXYGCNCKNHMQL/bundle.json","state":"https://pith.science/pith/IQR6H5K6M5KDBAXYGCNCKNHMQL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQR6H5K6M5KDBAXYGCNCKNHMQL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IQR6H5K6M5KDBAXYGCNCKNHMQL","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":"93aae30e2c86165c2507c4a55b4661aa8b5d93660d8633a471ea4ec4b8d82a91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-02T14:17:06Z","title_canon_sha256":"365323c232d1da16589f74f09c6b428a55705ebf51a79be8167e9b3c700183e4"},"schema_version":"1.0","source":{"id":"2606.03696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03696","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03696v1","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03696","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"IQR6H5K6M5KD","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_16","alias_value":"IQR6H5K6M5KDBAXY","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_8","alias_value":"IQR6H5K6","created_at":"2026-06-03T01:06:04Z"}],"graph_snapshots":[{"event_id":"sha256:beb2dfe788786581cd549c1ab7143339f57bfaacc7e19adddc1f36b93d7267f7","target":"graph","created_at":"2026-06-03T01:06:04Z","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/2606.03696/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A classical theorem of Nash-Williams states that if $G$ is a $2$-connected graph on $n$ vertices with minimum degree at least $(n+2)/3$, then for every longest cycle $C$ of $G$, the graph $G-V(C)$ is edgeless. Motivated by a higher-connectivity analogue, Bondy conjectured in 1980 that if $G$ is a $k$-connected graph on $n$ vertices with minimum degree at least $(n+k(k-1))/(k+1)$, then for every longest cycle $C$ of $G$, every path in $G-V(C)$ has at most $k-1$ vertices. This conjecture is known for $k\\le 3$ and remains open for all $k\\ge 4$.\n  In this paper, we prove Bondy's conjecture for all","authors_text":"Bo Ning, Jie Ma, Ziyuan Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-02T14:17:06Z","title":"Longest cycles and Dirac-type results in highly connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03696","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:cdab00750eaad276f2f9453696b6ea73c09c41198d5168f410db50569944cc27","target":"record","created_at":"2026-06-03T01:06:04Z","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":"93aae30e2c86165c2507c4a55b4661aa8b5d93660d8633a471ea4ec4b8d82a91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-02T14:17:06Z","title_canon_sha256":"365323c232d1da16589f74f09c6b428a55705ebf51a79be8167e9b3c700183e4"},"schema_version":"1.0","source":{"id":"2606.03696","kind":"arxiv","version":1}},"canonical_sha256":"4423e3f55e67543082f8309a2534ec82d6f68868e91f19b945a78783deafd439","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4423e3f55e67543082f8309a2534ec82d6f68868e91f19b945a78783deafd439","first_computed_at":"2026-06-03T01:06:04.778170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:06:04.778170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u7a7jNavL8frAyAaTdy4SYVgLds4+DxbG0lErGZNMnhQ3IcpbORchE5CuJrznjna3J80vy1KikBCHsVj9KgpCw==","signature_status":"signed_v1","signed_at":"2026-06-03T01:06:04.778594Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.03696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdab00750eaad276f2f9453696b6ea73c09c41198d5168f410db50569944cc27","sha256:beb2dfe788786581cd549c1ab7143339f57bfaacc7e19adddc1f36b93d7267f7"],"state_sha256":"3c5cac81d03c05ec9867453f0fd1ed59236656663f93e5c54787d874cc9fd86f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5kecAmfYAgxcJWExL/bb+uEIBB9tcDKcWXrpK9edkDLF6OFtw7wai8Zcs0hVrWxjVAZ7PVQMTu3AO66H+tCBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:34:00.184958Z","bundle_sha256":"396f0cc57b0736c8e0411f76c8f5e0a449c8e1803fde52581012e5a3429bc199"}}