{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UOA64ABEEWJKUEF4KKK5WJ7SYT","short_pith_number":"pith:UOA64ABE","canonical_record":{"source":{"id":"2503.12860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-17T06:44:36Z","cross_cats_sorted":[],"title_canon_sha256":"2cb0fd4ce188e9f655cd5b29502694ea11374220d9467c6b1ed8e9fa05512ec7","abstract_canon_sha256":"0af2ff16e6f371a81d9050c2d9c7f9f8553b3ef71c09e805fb594d7209c96c6a"},"schema_version":"1.0"},"canonical_sha256":"a381ee00242592aa10bc5295db27f2c4d71ff212eb79511c4de5ec39930b435a","source":{"kind":"arxiv","id":"2503.12860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.12860","created_at":"2026-07-05T10:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"2503.12860v1","created_at":"2026-07-05T10:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.12860","created_at":"2026-07-05T10:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"UOA64ABEEWJK","created_at":"2026-07-05T10:32:47Z"},{"alias_kind":"pith_short_16","alias_value":"UOA64ABEEWJKUEF4","created_at":"2026-07-05T10:32:47Z"},{"alias_kind":"pith_short_8","alias_value":"UOA64ABE","created_at":"2026-07-05T10:32:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UOA64ABEEWJKUEF4KKK5WJ7SYT","target":"record","payload":{"canonical_record":{"source":{"id":"2503.12860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-17T06:44:36Z","cross_cats_sorted":[],"title_canon_sha256":"2cb0fd4ce188e9f655cd5b29502694ea11374220d9467c6b1ed8e9fa05512ec7","abstract_canon_sha256":"0af2ff16e6f371a81d9050c2d9c7f9f8553b3ef71c09e805fb594d7209c96c6a"},"schema_version":"1.0"},"canonical_sha256":"a381ee00242592aa10bc5295db27f2c4d71ff212eb79511c4de5ec39930b435a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:47.974539Z","signature_b64":"c3PRMj1/zDauEwHAtlGAQ6HngXJ8Is0gemO8cDX+er+tAbwqXif5b14Df1Hr0ffj7ki3GLNF62YP8U0vQgXfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a381ee00242592aa10bc5295db27f2c4d71ff212eb79511c4de5ec39930b435a","last_reissued_at":"2026-07-05T10:32:47.973312Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:47.973312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.12860","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-05T10:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MzAFwA4SgaW2n5OBdvTEgkN4xHpNmyKiD1zS7rKz2P7VS1mZWKN4VrK8RpdPIRENkBl1thJto4gBCQjaP3wcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:13:07.605478Z"},"content_sha256":"d658a42fbc2dcd00dff5b38c72717f573fb986b4a6ea312e1ca59d9d3d76a2ac","schema_version":"1.0","event_id":"sha256:d658a42fbc2dcd00dff5b38c72717f573fb986b4a6ea312e1ca59d9d3d76a2ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UOA64ABEEWJKUEF4KKK5WJ7SYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Every $2k$-connected $(P_2\\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Feng Liu","submitted_at":"2025-03-17T06:44:36Z","abstract_excerpt":"Given a graph $H$, a graph $G$ is $H$-free if $G$ does not contain $H$ as an induced subgraph. Shi and Shan conjectured that every $1$-tough $2k$-connected $(P_2 \\cup kP_1)$-free graph is hamiltonian for $k \\geq 4$. This conjecture has been independently confirmed by Xu, Li, and Zhou, as well as by Ota and Sanka. Inspired by this, we prove that every $2k$-connected $(P_2\\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.12860","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/2503.12860/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:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ico2jfBR30XVPcCjICVwMUAUD99VkA8WLNFjEm5AOqoha1EqIq9XKMZON3hG/jFjVIMPBIZxXQ3TjF7A0ihXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:13:07.605950Z"},"content_sha256":"180ac978b94c75c3f448199bbf180670fecb3762e477bc9adb463e7b12ffebbc","schema_version":"1.0","event_id":"sha256:180ac978b94c75c3f448199bbf180670fecb3762e477bc9adb463e7b12ffebbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UOA64ABEEWJKUEF4KKK5WJ7SYT/bundle.json","state_url":"https://pith.science/pith/UOA64ABEEWJKUEF4KKK5WJ7SYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UOA64ABEEWJKUEF4KKK5WJ7SYT/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-06T03:13:07Z","links":{"resolver":"https://pith.science/pith/UOA64ABEEWJKUEF4KKK5WJ7SYT","bundle":"https://pith.science/pith/UOA64ABEEWJKUEF4KKK5WJ7SYT/bundle.json","state":"https://pith.science/pith/UOA64ABEEWJKUEF4KKK5WJ7SYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UOA64ABEEWJKUEF4KKK5WJ7SYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UOA64ABEEWJKUEF4KKK5WJ7SYT","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":"0af2ff16e6f371a81d9050c2d9c7f9f8553b3ef71c09e805fb594d7209c96c6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-17T06:44:36Z","title_canon_sha256":"2cb0fd4ce188e9f655cd5b29502694ea11374220d9467c6b1ed8e9fa05512ec7"},"schema_version":"1.0","source":{"id":"2503.12860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.12860","created_at":"2026-07-05T10:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"2503.12860v1","created_at":"2026-07-05T10:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.12860","created_at":"2026-07-05T10:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"UOA64ABEEWJK","created_at":"2026-07-05T10:32:47Z"},{"alias_kind":"pith_short_16","alias_value":"UOA64ABEEWJKUEF4","created_at":"2026-07-05T10:32:47Z"},{"alias_kind":"pith_short_8","alias_value":"UOA64ABE","created_at":"2026-07-05T10:32:47Z"}],"graph_snapshots":[{"event_id":"sha256:180ac978b94c75c3f448199bbf180670fecb3762e477bc9adb463e7b12ffebbc","target":"graph","created_at":"2026-07-05T10:32:47Z","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/2503.12860/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $H$, a graph $G$ is $H$-free if $G$ does not contain $H$ as an induced subgraph. Shi and Shan conjectured that every $1$-tough $2k$-connected $(P_2 \\cup kP_1)$-free graph is hamiltonian for $k \\geq 4$. This conjecture has been independently confirmed by Xu, Li, and Zhou, as well as by Ota and Sanka. Inspired by this, we prove that every $2k$-connected $(P_2\\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected.","authors_text":"Feng Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-17T06:44:36Z","title":"Every $2k$-connected $(P_2\\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.12860","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:d658a42fbc2dcd00dff5b38c72717f573fb986b4a6ea312e1ca59d9d3d76a2ac","target":"record","created_at":"2026-07-05T10:32:47Z","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":"0af2ff16e6f371a81d9050c2d9c7f9f8553b3ef71c09e805fb594d7209c96c6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-17T06:44:36Z","title_canon_sha256":"2cb0fd4ce188e9f655cd5b29502694ea11374220d9467c6b1ed8e9fa05512ec7"},"schema_version":"1.0","source":{"id":"2503.12860","kind":"arxiv","version":1}},"canonical_sha256":"a381ee00242592aa10bc5295db27f2c4d71ff212eb79511c4de5ec39930b435a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a381ee00242592aa10bc5295db27f2c4d71ff212eb79511c4de5ec39930b435a","first_computed_at":"2026-07-05T10:32:47.973312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:32:47.973312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c3PRMj1/zDauEwHAtlGAQ6HngXJ8Is0gemO8cDX+er+tAbwqXif5b14Df1Hr0ffj7ki3GLNF62YP8U0vQgXfDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:32:47.974539Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.12860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d658a42fbc2dcd00dff5b38c72717f573fb986b4a6ea312e1ca59d9d3d76a2ac","sha256:180ac978b94c75c3f448199bbf180670fecb3762e477bc9adb463e7b12ffebbc"],"state_sha256":"27c34c04d60cf74ccd9fd469cdb4c93e7972bade91abbadcb370ad9d2a1c5e9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vqltZTeIeK3fnCBvX0UUI5L8v+dq31ZXpJoqLnQdrILQ0gcYyWqAXfd1MwAhdxnXZm6TUWZR427SXgbFXcMcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T03:13:07.610355Z","bundle_sha256":"02fb4b748b787f580ab512d5cc784fbef8b7047f76c3712430fe1d68fe6893ec"}}