{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:CG7BB726LNIC7QCUIVIXJKHBR7","short_pith_number":"pith:CG7BB726","canonical_record":{"source":{"id":"2406.07942","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-12T07:03:51Z","cross_cats_sorted":[],"title_canon_sha256":"bbfac4e7b2b6061295ed0f1595ec3d57233f7bbbb7abfc08c30427f5dd1f0b58","abstract_canon_sha256":"9c78aeea993b1801b52e4de18e26cf7bfc6045d993d71bc5da8e4a7358946dc3"},"schema_version":"1.0"},"canonical_sha256":"11be10ff5e5b502fc054455174a8e18ff6354a4a4a78925a71f0315432088e58","source":{"kind":"arxiv","id":"2406.07942","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.07942","created_at":"2026-07-05T10:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"2406.07942v2","created_at":"2026-07-05T10:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07942","created_at":"2026-07-05T10:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"CG7BB726LNIC","created_at":"2026-07-05T10:49:44Z"},{"alias_kind":"pith_short_16","alias_value":"CG7BB726LNIC7QCU","created_at":"2026-07-05T10:49:44Z"},{"alias_kind":"pith_short_8","alias_value":"CG7BB726","created_at":"2026-07-05T10:49:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:CG7BB726LNIC7QCUIVIXJKHBR7","target":"record","payload":{"canonical_record":{"source":{"id":"2406.07942","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-12T07:03:51Z","cross_cats_sorted":[],"title_canon_sha256":"bbfac4e7b2b6061295ed0f1595ec3d57233f7bbbb7abfc08c30427f5dd1f0b58","abstract_canon_sha256":"9c78aeea993b1801b52e4de18e26cf7bfc6045d993d71bc5da8e4a7358946dc3"},"schema_version":"1.0"},"canonical_sha256":"11be10ff5e5b502fc054455174a8e18ff6354a4a4a78925a71f0315432088e58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:44.902272Z","signature_b64":"rjzWgbXpfD8/rdw/vNGUTMGsCfJfdagqiSW705Nk5/DEdQUJW/lPziO17VDj8su5csgXP23YVhajuuCr9zOlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11be10ff5e5b502fc054455174a8e18ff6354a4a4a78925a71f0315432088e58","last_reissued_at":"2026-07-05T10:49:44.901808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:44.901808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.07942","source_version":2,"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-05T10:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SiuGeUOoy5IhfQsufXgOfFrBOLBkWIsxT7d5Prk0D/M/PesrSZk3JTCOtl0GgMSPAOXt/BKEJHOauFVLZE8/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:03:44.693850Z"},"content_sha256":"dea71b9c870182fe503b30d3e09c2458c1bf11f9689ab5314d6c3179287125e3","schema_version":"1.0","event_id":"sha256:dea71b9c870182fe503b30d3e09c2458c1bf11f9689ab5314d6c3179287125e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:CG7BB726LNIC7QCUIVIXJKHBR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bound vertices of longest paths between two vertices in cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chengli Li, Feng Liu","submitted_at":"2024-06-12T07:03:51Z","abstract_excerpt":"Thomassen's chord conjecture from 1976 states that every longest cycle in a $3$-connected graph has a chord. This is one of the most important unsolved problems in graph theory. Let $H$ be a subgraph of a graph $G$. A vertex $v$ of $H$ is said to be $H$-bound if all the neighbors of $v$ in $G$ lie in $H$. Recently, Zhan has made the more general conjecture that in a $k$-connected graph, every longest path $P$ between two vertices contains at least $k-1$ internal $P$-bound vertices. In this paper, we prove that Zhan's conjecture holds for $2$-connected cubic graphs. This conclusion generalizes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07942","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.07942/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-05T10:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X/PdVkQEX1Gzz/PwLHk5Gqm8iRLWaqWWXTvJrCOcO3dr8lwpTTvMYAdlB026JH4MCepGCeOjlWhQSb9KqkwQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:03:44.694748Z"},"content_sha256":"eee0d708b3924aa3e4c357774935cff6eb6b74fa1f88d8080e23c5ea29b75a1e","schema_version":"1.0","event_id":"sha256:eee0d708b3924aa3e4c357774935cff6eb6b74fa1f88d8080e23c5ea29b75a1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7/bundle.json","state_url":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CG7BB726LNIC7QCUIVIXJKHBR7/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-08-06T01:03:44Z","links":{"resolver":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7","bundle":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7/bundle.json","state":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CG7BB726LNIC7QCUIVIXJKHBR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CG7BB726LNIC7QCUIVIXJKHBR7","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":"9c78aeea993b1801b52e4de18e26cf7bfc6045d993d71bc5da8e4a7358946dc3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-12T07:03:51Z","title_canon_sha256":"bbfac4e7b2b6061295ed0f1595ec3d57233f7bbbb7abfc08c30427f5dd1f0b58"},"schema_version":"1.0","source":{"id":"2406.07942","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.07942","created_at":"2026-07-05T10:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"2406.07942v2","created_at":"2026-07-05T10:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07942","created_at":"2026-07-05T10:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"CG7BB726LNIC","created_at":"2026-07-05T10:49:44Z"},{"alias_kind":"pith_short_16","alias_value":"CG7BB726LNIC7QCU","created_at":"2026-07-05T10:49:44Z"},{"alias_kind":"pith_short_8","alias_value":"CG7BB726","created_at":"2026-07-05T10:49:44Z"}],"graph_snapshots":[{"event_id":"sha256:eee0d708b3924aa3e4c357774935cff6eb6b74fa1f88d8080e23c5ea29b75a1e","target":"graph","created_at":"2026-07-05T10:49:44Z","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/2406.07942/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Thomassen's chord conjecture from 1976 states that every longest cycle in a $3$-connected graph has a chord. This is one of the most important unsolved problems in graph theory. Let $H$ be a subgraph of a graph $G$. A vertex $v$ of $H$ is said to be $H$-bound if all the neighbors of $v$ in $G$ lie in $H$. Recently, Zhan has made the more general conjecture that in a $k$-connected graph, every longest path $P$ between two vertices contains at least $k-1$ internal $P$-bound vertices. In this paper, we prove that Zhan's conjecture holds for $2$-connected cubic graphs. This conclusion generalizes ","authors_text":"Chengli Li, Feng Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-12T07:03:51Z","title":"Bound vertices of longest paths between two vertices in cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07942","kind":"arxiv","version":2},"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:dea71b9c870182fe503b30d3e09c2458c1bf11f9689ab5314d6c3179287125e3","target":"record","created_at":"2026-07-05T10:49:44Z","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":"9c78aeea993b1801b52e4de18e26cf7bfc6045d993d71bc5da8e4a7358946dc3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-12T07:03:51Z","title_canon_sha256":"bbfac4e7b2b6061295ed0f1595ec3d57233f7bbbb7abfc08c30427f5dd1f0b58"},"schema_version":"1.0","source":{"id":"2406.07942","kind":"arxiv","version":2}},"canonical_sha256":"11be10ff5e5b502fc054455174a8e18ff6354a4a4a78925a71f0315432088e58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11be10ff5e5b502fc054455174a8e18ff6354a4a4a78925a71f0315432088e58","first_computed_at":"2026-07-05T10:49:44.901808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:49:44.901808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rjzWgbXpfD8/rdw/vNGUTMGsCfJfdagqiSW705Nk5/DEdQUJW/lPziO17VDj8su5csgXP23YVhajuuCr9zOlDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:49:44.902272Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.07942","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dea71b9c870182fe503b30d3e09c2458c1bf11f9689ab5314d6c3179287125e3","sha256:eee0d708b3924aa3e4c357774935cff6eb6b74fa1f88d8080e23c5ea29b75a1e"],"state_sha256":"3f8ce0d5e1a27e91b5850cc5200d7aaae0f2b162884e0ad5278d8388a93e9a11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+r2p8Soti9nZUdf9GJ+xmrrq7KSuuXoa/2LGPcIcP3Wa8QZSoTfCca41V2j/2ODe85An91ni3Vm2lJIUdpE2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T01:03:44.703741Z","bundle_sha256":"dd5ad09ad44aa41fffa2b2b956f67cda8cf6a2d9298f6b083f11a3278f2f1a5b"}}