{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LPOFT7TYKWXJXON7SP4P2GVBFK","short_pith_number":"pith:LPOFT7TY","canonical_record":{"source":{"id":"2605.19508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T08:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"f55a2b40609410af3cb625ac5b8a99855a0c7968c3a8d7956291ed06d83952cd","abstract_canon_sha256":"48d0f81b4da9b9b3a8420a473958439a8917006045b5860392f027afa3e3da34"},"schema_version":"1.0"},"canonical_sha256":"5bdc59fe7855ae9bb9bf93f8fd1aa12ab22190670c611b34f15b2142f7a93164","source":{"kind":"arxiv","id":"2605.19508","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19508","created_at":"2026-05-20T01:05:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19508v1","created_at":"2026-05-20T01:05:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19508","created_at":"2026-05-20T01:05:49Z"},{"alias_kind":"pith_short_12","alias_value":"LPOFT7TYKWXJ","created_at":"2026-05-20T01:05:49Z"},{"alias_kind":"pith_short_16","alias_value":"LPOFT7TYKWXJXON7","created_at":"2026-05-20T01:05:49Z"},{"alias_kind":"pith_short_8","alias_value":"LPOFT7TY","created_at":"2026-05-20T01:05:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LPOFT7TYKWXJXON7SP4P2GVBFK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.19508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T08:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"f55a2b40609410af3cb625ac5b8a99855a0c7968c3a8d7956291ed06d83952cd","abstract_canon_sha256":"48d0f81b4da9b9b3a8420a473958439a8917006045b5860392f027afa3e3da34"},"schema_version":"1.0"},"canonical_sha256":"5bdc59fe7855ae9bb9bf93f8fd1aa12ab22190670c611b34f15b2142f7a93164","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:49.136405Z","signature_b64":"ucPPWF0BiQ1rsLwKrdxv2OI2OyvnA89hQCx0pOzd1M4JTXsm1gLicpsx3TCdJJRKmxKvfBO1gsZHrfh6Un8CBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bdc59fe7855ae9bb9bf93f8fd1aa12ab22190670c611b34f15b2142f7a93164","last_reissued_at":"2026-05-20T01:05:49.135646Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:49.135646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.19508","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-05-20T01:05:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HylwS3/ME2sUjv3JiCY+hMnrMp2+QjpxyCGTSrqtSx5BglRJnsjwU2y/bUJbuzPmslMeUl29UqoqKJiNPew5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:40:19.380501Z"},"content_sha256":"aebc814715f7ecd76ba566fe0afc8b580e40872efe4a9b37e10d20249a365c82","schema_version":"1.0","event_id":"sha256:aebc814715f7ecd76ba566fe0afc8b580e40872efe4a9b37e10d20249a365c82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LPOFT7TYKWXJXON7SP4P2GVBFK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On hamiltonian cycles of 1-tough $(P_{2} \\cup kP_{1})$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Masahiro Sanka","submitted_at":"2026-05-19T08:06:58Z","abstract_excerpt":"Let $k$ be a positive integer. A graph is said to be $(P_2 \\cup kP_1)$-free if it does not contain $P_2 \\cup kP_1$ as an induced subgraph. Recently, Ota and the author asked whether every 1-tough and $k$-connected $(P_2 \\cup kP_1)$-free graph is hamiltonian or the Petersen graph. Note that this problem is affirmative for $k \\in \\{1,2,3\\}$ by the known results. In this paper, we show that for each integer $k \\geq 4$, if $G$ is a $1$-tough and $(k-1)$-connected $(P_2 \\cup kP_1)$-free graph with $|V(G)| \\ge k^2+k+1$ and $\\delta(G) \\ge k$, then $G$ is hamiltonian. This result implies that the abov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19508","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/2605.19508/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-05-20T01:05:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+Sw3DPRg0+OVZA5Bi3w25eLbrHi1iKmiig+zQ1HroD/cbJC4L95CJBhSMrvgs0ThPi5tLDmaEissVAywp+uCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:40:19.380877Z"},"content_sha256":"f1ee2988976700a9bcfaab4825c440d910fd5fc1743a826fde90188a7019556c","schema_version":"1.0","event_id":"sha256:f1ee2988976700a9bcfaab4825c440d910fd5fc1743a826fde90188a7019556c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPOFT7TYKWXJXON7SP4P2GVBFK/bundle.json","state_url":"https://pith.science/pith/LPOFT7TYKWXJXON7SP4P2GVBFK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPOFT7TYKWXJXON7SP4P2GVBFK/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-02T15:40:19Z","links":{"resolver":"https://pith.science/pith/LPOFT7TYKWXJXON7SP4P2GVBFK","bundle":"https://pith.science/pith/LPOFT7TYKWXJXON7SP4P2GVBFK/bundle.json","state":"https://pith.science/pith/LPOFT7TYKWXJXON7SP4P2GVBFK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPOFT7TYKWXJXON7SP4P2GVBFK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LPOFT7TYKWXJXON7SP4P2GVBFK","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":"48d0f81b4da9b9b3a8420a473958439a8917006045b5860392f027afa3e3da34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T08:06:58Z","title_canon_sha256":"f55a2b40609410af3cb625ac5b8a99855a0c7968c3a8d7956291ed06d83952cd"},"schema_version":"1.0","source":{"id":"2605.19508","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19508","created_at":"2026-05-20T01:05:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19508v1","created_at":"2026-05-20T01:05:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19508","created_at":"2026-05-20T01:05:49Z"},{"alias_kind":"pith_short_12","alias_value":"LPOFT7TYKWXJ","created_at":"2026-05-20T01:05:49Z"},{"alias_kind":"pith_short_16","alias_value":"LPOFT7TYKWXJXON7","created_at":"2026-05-20T01:05:49Z"},{"alias_kind":"pith_short_8","alias_value":"LPOFT7TY","created_at":"2026-05-20T01:05:49Z"}],"graph_snapshots":[{"event_id":"sha256:f1ee2988976700a9bcfaab4825c440d910fd5fc1743a826fde90188a7019556c","target":"graph","created_at":"2026-05-20T01:05:49Z","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/2605.19508/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $k$ be a positive integer. A graph is said to be $(P_2 \\cup kP_1)$-free if it does not contain $P_2 \\cup kP_1$ as an induced subgraph. Recently, Ota and the author asked whether every 1-tough and $k$-connected $(P_2 \\cup kP_1)$-free graph is hamiltonian or the Petersen graph. Note that this problem is affirmative for $k \\in \\{1,2,3\\}$ by the known results. In this paper, we show that for each integer $k \\geq 4$, if $G$ is a $1$-tough and $(k-1)$-connected $(P_2 \\cup kP_1)$-free graph with $|V(G)| \\ge k^2+k+1$ and $\\delta(G) \\ge k$, then $G$ is hamiltonian. This result implies that the abov","authors_text":"Masahiro Sanka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T08:06:58Z","title":"On hamiltonian cycles 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":"2605.19508","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:aebc814715f7ecd76ba566fe0afc8b580e40872efe4a9b37e10d20249a365c82","target":"record","created_at":"2026-05-20T01:05:49Z","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":"48d0f81b4da9b9b3a8420a473958439a8917006045b5860392f027afa3e3da34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T08:06:58Z","title_canon_sha256":"f55a2b40609410af3cb625ac5b8a99855a0c7968c3a8d7956291ed06d83952cd"},"schema_version":"1.0","source":{"id":"2605.19508","kind":"arxiv","version":1}},"canonical_sha256":"5bdc59fe7855ae9bb9bf93f8fd1aa12ab22190670c611b34f15b2142f7a93164","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bdc59fe7855ae9bb9bf93f8fd1aa12ab22190670c611b34f15b2142f7a93164","first_computed_at":"2026-05-20T01:05:49.135646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:49.135646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ucPPWF0BiQ1rsLwKrdxv2OI2OyvnA89hQCx0pOzd1M4JTXsm1gLicpsx3TCdJJRKmxKvfBO1gsZHrfh6Un8CBg==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:49.136405Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19508","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aebc814715f7ecd76ba566fe0afc8b580e40872efe4a9b37e10d20249a365c82","sha256:f1ee2988976700a9bcfaab4825c440d910fd5fc1743a826fde90188a7019556c"],"state_sha256":"3a6c5c3163ea37ac96ef8f9c7c70c95347d4ebc8c4d02f139686119e8403e743"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+CijWc5ubaM/o5SfsdbdcIWcSLGnvCnWArEHFFMYuAnWYrrk3kKVwDdGRffAm5ZWBHg63hitsl2xC5h1570Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:40:19.382901Z","bundle_sha256":"5518dc1f83f2522ef23663cf7dc8c8e02f65497133ae95c38e911303fc79740e"}}