{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CG7BB726LNIC7QCUIVIXJKHBR7","short_pith_number":"pith:CG7BB726","schema_version":"1.0","canonical_sha256":"11be10ff5e5b502fc054455174a8e18ff6354a4a4a78925a71f0315432088e58","source":{"kind":"arxiv","id":"2406.07942","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.07942","created_at":"2026-07-05T10:49:44.901862+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.07942v2","created_at":"2026-07-05T10:49:44.901862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07942","created_at":"2026-07-05T10:49:44.901862+00:00"},{"alias_kind":"pith_short_12","alias_value":"CG7BB726LNIC","created_at":"2026-07-05T10:49:44.901862+00:00"},{"alias_kind":"pith_short_16","alias_value":"CG7BB726LNIC7QCU","created_at":"2026-07-05T10:49:44.901862+00:00"},{"alias_kind":"pith_short_8","alias_value":"CG7BB726","created_at":"2026-07-05T10:49:44.901862+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/CG7BB726LNIC7QCUIVIXJKHBR7","json":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7.json","graph_json":"https://pith.science/api/pith-number/CG7BB726LNIC7QCUIVIXJKHBR7/graph.json","events_json":"https://pith.science/api/pith-number/CG7BB726LNIC7QCUIVIXJKHBR7/events.json","paper":"https://pith.science/paper/CG7BB726"},"agent_actions":{"view_html":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7","download_json":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7.json","view_paper":"https://pith.science/paper/CG7BB726","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.07942&json=true","fetch_graph":"https://pith.science/api/pith-number/CG7BB726LNIC7QCUIVIXJKHBR7/graph.json","fetch_events":"https://pith.science/api/pith-number/CG7BB726LNIC7QCUIVIXJKHBR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7/action/storage_attestation","attest_author":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7/action/author_attestation","sign_citation":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7/action/citation_signature","submit_replication":"https://pith.science/pith/CG7BB726LNIC7QCUIVIXJKHBR7/action/replication_record"}},"created_at":"2026-07-05T10:49:44.901862+00:00","updated_at":"2026-07-05T10:49:44.901862+00:00"}