{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:QALXD6JD5ORCAWGGUYVB4QTHB2","short_pith_number":"pith:QALXD6JD","canonical_record":{"source":{"id":"2303.09741","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-17T02:42:32Z","cross_cats_sorted":[],"title_canon_sha256":"22da36f1e233191a4b918bfaf9881157387c8dcd848838bcb87412f062b7e231","abstract_canon_sha256":"3517e9ba8989c5742ddc36ae272ad3dee5cc21dcebd6e9b342bb7d40cec16731"},"schema_version":"1.0"},"canonical_sha256":"801771f923eba22058c6a62a1e42670ea9acee57146c66d1a42cd36e68b8f4e8","source":{"kind":"arxiv","id":"2303.09741","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.09741","created_at":"2026-07-05T05:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"2303.09741v2","created_at":"2026-07-05T05:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.09741","created_at":"2026-07-05T05:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"QALXD6JD5ORC","created_at":"2026-07-05T05:52:28Z"},{"alias_kind":"pith_short_16","alias_value":"QALXD6JD5ORCAWGG","created_at":"2026-07-05T05:52:28Z"},{"alias_kind":"pith_short_8","alias_value":"QALXD6JD","created_at":"2026-07-05T05:52:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:QALXD6JD5ORCAWGGUYVB4QTHB2","target":"record","payload":{"canonical_record":{"source":{"id":"2303.09741","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-17T02:42:32Z","cross_cats_sorted":[],"title_canon_sha256":"22da36f1e233191a4b918bfaf9881157387c8dcd848838bcb87412f062b7e231","abstract_canon_sha256":"3517e9ba8989c5742ddc36ae272ad3dee5cc21dcebd6e9b342bb7d40cec16731"},"schema_version":"1.0"},"canonical_sha256":"801771f923eba22058c6a62a1e42670ea9acee57146c66d1a42cd36e68b8f4e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:52:28.951757Z","signature_b64":"4ARvfyqR1yRG6GsY4D+ro6dSWKME8HPBUKto04iDM06pvV6xugbCwIZ8Ajoz2SjYy+v+zEPOPDrIUsAgBOJTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"801771f923eba22058c6a62a1e42670ea9acee57146c66d1a42cd36e68b8f4e8","last_reissued_at":"2026-07-05T05:52:28.951332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:52:28.951332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.09741","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-05T05:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMOQ4UIEY5Vrcd0r157vA71OdigBnPLiRtCfYUX4s28mV381lQFxhunw/DnlcVGyH/1DQIPUPzBB9ziDJ6KpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T21:56:28.875832Z"},"content_sha256":"ac66c0f2b333054b0fbb3fb271d6fab1948676216e3bf5870673c7009dedeb77","schema_version":"1.0","event_id":"sha256:ac66c0f2b333054b0fbb3fb271d6fab1948676216e3bf5870673c7009dedeb77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:QALXD6JD5ORCAWGGUYVB4QTHB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamiltonicity of $1$-tough $(P_2\\cup kP_1)$-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Chengli Li, Leyou Xu","submitted_at":"2023-03-17T02:42:32Z","abstract_excerpt":"Given a graph $H$, a graph $G$ is $H$-free if $G$ does not contain $H$ as an induced subgraph. For a positive real number $t$, a non-complete graph $G$ is said to be $t$-tough if for every vertex cut $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. A complete graph is said to be $t$-tough for any $t>0$. Chv\\'{a}tal's toughness conjecture, stating that there exists a constant $t_0$ such that every $t_0$-tough graph with at least three vertices is Hamiltonian, is still open in general. Chv\\'{a}tal and Erd\\\"{o}s \\cite{CE} proved that, for any integer $k\\ge 1$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.09741","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/2303.09741/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-05T05:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"syItipdrM99GSUI9X9FnstCjdg+EX9IFC1VmVop48GMyBNu8YoPs7suBVDnmTQCEi9VQ5ymUFYdQdwCgxIthCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T21:56:28.876216Z"},"content_sha256":"e52b896afb96516459b97db1d77e6dc160c5784476a68173f852480be218ab12","schema_version":"1.0","event_id":"sha256:e52b896afb96516459b97db1d77e6dc160c5784476a68173f852480be218ab12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QALXD6JD5ORCAWGGUYVB4QTHB2/bundle.json","state_url":"https://pith.science/pith/QALXD6JD5ORCAWGGUYVB4QTHB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QALXD6JD5ORCAWGGUYVB4QTHB2/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-21T21:56:28Z","links":{"resolver":"https://pith.science/pith/QALXD6JD5ORCAWGGUYVB4QTHB2","bundle":"https://pith.science/pith/QALXD6JD5ORCAWGGUYVB4QTHB2/bundle.json","state":"https://pith.science/pith/QALXD6JD5ORCAWGGUYVB4QTHB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QALXD6JD5ORCAWGGUYVB4QTHB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:QALXD6JD5ORCAWGGUYVB4QTHB2","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":"3517e9ba8989c5742ddc36ae272ad3dee5cc21dcebd6e9b342bb7d40cec16731","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-17T02:42:32Z","title_canon_sha256":"22da36f1e233191a4b918bfaf9881157387c8dcd848838bcb87412f062b7e231"},"schema_version":"1.0","source":{"id":"2303.09741","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.09741","created_at":"2026-07-05T05:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"2303.09741v2","created_at":"2026-07-05T05:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.09741","created_at":"2026-07-05T05:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"QALXD6JD5ORC","created_at":"2026-07-05T05:52:28Z"},{"alias_kind":"pith_short_16","alias_value":"QALXD6JD5ORCAWGG","created_at":"2026-07-05T05:52:28Z"},{"alias_kind":"pith_short_8","alias_value":"QALXD6JD","created_at":"2026-07-05T05:52:28Z"}],"graph_snapshots":[{"event_id":"sha256:e52b896afb96516459b97db1d77e6dc160c5784476a68173f852480be218ab12","target":"graph","created_at":"2026-07-05T05:52:28Z","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/2303.09741/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. For a positive real number $t$, a non-complete graph $G$ is said to be $t$-tough if for every vertex cut $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. A complete graph is said to be $t$-tough for any $t>0$. Chv\\'{a}tal's toughness conjecture, stating that there exists a constant $t_0$ such that every $t_0$-tough graph with at least three vertices is Hamiltonian, is still open in general. Chv\\'{a}tal and Erd\\\"{o}s \\cite{CE} proved that, for any integer $k\\ge 1$, ","authors_text":"Bo Zhou, Chengli Li, Leyou Xu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-17T02:42:32Z","title":"Hamiltonicity of $1$-tough $(P_2\\cup kP_1)$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.09741","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:ac66c0f2b333054b0fbb3fb271d6fab1948676216e3bf5870673c7009dedeb77","target":"record","created_at":"2026-07-05T05:52:28Z","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":"3517e9ba8989c5742ddc36ae272ad3dee5cc21dcebd6e9b342bb7d40cec16731","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-17T02:42:32Z","title_canon_sha256":"22da36f1e233191a4b918bfaf9881157387c8dcd848838bcb87412f062b7e231"},"schema_version":"1.0","source":{"id":"2303.09741","kind":"arxiv","version":2}},"canonical_sha256":"801771f923eba22058c6a62a1e42670ea9acee57146c66d1a42cd36e68b8f4e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"801771f923eba22058c6a62a1e42670ea9acee57146c66d1a42cd36e68b8f4e8","first_computed_at":"2026-07-05T05:52:28.951332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:52:28.951332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ARvfyqR1yRG6GsY4D+ro6dSWKME8HPBUKto04iDM06pvV6xugbCwIZ8Ajoz2SjYy+v+zEPOPDrIUsAgBOJTAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:52:28.951757Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.09741","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac66c0f2b333054b0fbb3fb271d6fab1948676216e3bf5870673c7009dedeb77","sha256:e52b896afb96516459b97db1d77e6dc160c5784476a68173f852480be218ab12"],"state_sha256":"5d0846308e4bffe928852f11d928df755ac77ebe00b135e0d0416a01f50d8cb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OyLW7f7ykZ/oneFez/N0xOp3+KciZt2kf6GuIZ1V3Kx9cQ5HDGej3TsHsRkEnpgIElum9uU3DL4fZ21iC6M7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T21:56:28.878842Z","bundle_sha256":"67f33f17013371a3ab60c9473f3398ae3530efc05e5b7e77a8bba96e768dd720"}}