{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IYEF3SSIQZHJLS5JZBFBS5HGHT","short_pith_number":"pith:IYEF3SSI","canonical_record":{"source":{"id":"1710.06037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-17T00:27:14Z","cross_cats_sorted":[],"title_canon_sha256":"dccc4d833d2106813447b8e8df0cde9cfaf9d86bc696153d8e0c77250f97b526","abstract_canon_sha256":"f9b14cb8efb5c07072b078105209e8893648c26c004795e50da91118cf5a6539"},"schema_version":"1.0"},"canonical_sha256":"46085dca48864e95cba9c84a1974e63cffd9affb511d66eabd82c42b86b84f5a","source":{"kind":"arxiv","id":"1710.06037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06037","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06037v1","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06037","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"IYEF3SSIQZHJ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IYEF3SSIQZHJLS5J","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IYEF3SSI","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IYEF3SSIQZHJLS5JZBFBS5HGHT","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-17T00:27:14Z","cross_cats_sorted":[],"title_canon_sha256":"dccc4d833d2106813447b8e8df0cde9cfaf9d86bc696153d8e0c77250f97b526","abstract_canon_sha256":"f9b14cb8efb5c07072b078105209e8893648c26c004795e50da91118cf5a6539"},"schema_version":"1.0"},"canonical_sha256":"46085dca48864e95cba9c84a1974e63cffd9affb511d66eabd82c42b86b84f5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:37.992726Z","signature_b64":"I5BF+2UGRataj8nf1hj/6ER7YubWmK8uMA63R01RRF+RQrsGB1+cl5vGjMnDGbE5+74SwDns8odarIaI7kyMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46085dca48864e95cba9c84a1974e63cffd9affb511d66eabd82c42b86b84f5a","last_reissued_at":"2026-05-18T00:32:37.992011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:37.992011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06037","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-18T00:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j067l2FU0dt3gY7lLvDdDCsVKW0+YjuV3KrFJqXrLMcINz+8W0Y+d8sCzrnJ5bfaafSvjbBlOAgfiKg450gDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:53:37.247905Z"},"content_sha256":"ce7b6de7f52b3680f33a046366b763ad25c9ab425762d2e5f3f3822f38fb0506","schema_version":"1.0","event_id":"sha256:ce7b6de7f52b3680f33a046366b763ad25c9ab425762d2e5f3f3822f38fb0506"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IYEF3SSIQZHJLS5JZBFBS5HGHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barbara Maenhaut, Benjamin R. Smith, Darryn Bryant","submitted_at":"2017-10-17T00:27:14Z","abstract_excerpt":"In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph whose line graph has a Hamilton decomposition. We also answer a question of Jackson by showing that for each integer $k\\geq 3$ there exists a simple connected $k$-regular graph with no separating transitions whose line graph has no Hamilton decomposition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06037","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":""},"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-18T00:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqp68nbHKYGdTSvWR4fIH81+cw8UFnfMBRd4OB197tBOaGcbpnlAPwjNUComzGPj5qFNiqmXs5sxfHJiPi64CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:53:37.248654Z"},"content_sha256":"46bd2be6b36ddcfc4c313732b29b1cc320168996497766fef8e750e6c29da81b","schema_version":"1.0","event_id":"sha256:46bd2be6b36ddcfc4c313732b29b1cc320168996497766fef8e750e6c29da81b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYEF3SSIQZHJLS5JZBFBS5HGHT/bundle.json","state_url":"https://pith.science/pith/IYEF3SSIQZHJLS5JZBFBS5HGHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYEF3SSIQZHJLS5JZBFBS5HGHT/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-11T15:53:37Z","links":{"resolver":"https://pith.science/pith/IYEF3SSIQZHJLS5JZBFBS5HGHT","bundle":"https://pith.science/pith/IYEF3SSIQZHJLS5JZBFBS5HGHT/bundle.json","state":"https://pith.science/pith/IYEF3SSIQZHJLS5JZBFBS5HGHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYEF3SSIQZHJLS5JZBFBS5HGHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IYEF3SSIQZHJLS5JZBFBS5HGHT","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":"f9b14cb8efb5c07072b078105209e8893648c26c004795e50da91118cf5a6539","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-17T00:27:14Z","title_canon_sha256":"dccc4d833d2106813447b8e8df0cde9cfaf9d86bc696153d8e0c77250f97b526"},"schema_version":"1.0","source":{"id":"1710.06037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06037","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06037v1","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06037","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"IYEF3SSIQZHJ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IYEF3SSIQZHJLS5J","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IYEF3SSI","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:46bd2be6b36ddcfc4c313732b29b1cc320168996497766fef8e750e6c29da81b","target":"graph","created_at":"2026-05-18T00:32:37Z","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"},"paper":{"abstract_excerpt":"In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph whose line graph has a Hamilton decomposition. We also answer a question of Jackson by showing that for each integer $k\\geq 3$ there exists a simple connected $k$-regular graph with no separating transitions whose line graph has no Hamilton decomposition.","authors_text":"Barbara Maenhaut, Benjamin R. Smith, Darryn Bryant","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-17T00:27:14Z","title":"On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06037","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:ce7b6de7f52b3680f33a046366b763ad25c9ab425762d2e5f3f3822f38fb0506","target":"record","created_at":"2026-05-18T00:32:37Z","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":"f9b14cb8efb5c07072b078105209e8893648c26c004795e50da91118cf5a6539","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-17T00:27:14Z","title_canon_sha256":"dccc4d833d2106813447b8e8df0cde9cfaf9d86bc696153d8e0c77250f97b526"},"schema_version":"1.0","source":{"id":"1710.06037","kind":"arxiv","version":1}},"canonical_sha256":"46085dca48864e95cba9c84a1974e63cffd9affb511d66eabd82c42b86b84f5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46085dca48864e95cba9c84a1974e63cffd9affb511d66eabd82c42b86b84f5a","first_computed_at":"2026-05-18T00:32:37.992011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:37.992011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I5BF+2UGRataj8nf1hj/6ER7YubWmK8uMA63R01RRF+RQrsGB1+cl5vGjMnDGbE5+74SwDns8odarIaI7kyMBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:37.992726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce7b6de7f52b3680f33a046366b763ad25c9ab425762d2e5f3f3822f38fb0506","sha256:46bd2be6b36ddcfc4c313732b29b1cc320168996497766fef8e750e6c29da81b"],"state_sha256":"09b6d574ebe8da9fe54990c3caa817ef39f29fba37fdc4863271585ec3f4c4e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1sKX7JyIlGt9pb4IuZj5uap76OISw3c3dhFHNNPHjkpxrQGxOqjV0fscmEll4GniZgYVzNMdxFQeXB8hw3ziBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:53:37.252525Z","bundle_sha256":"56ae9357d2c1ffbee67e5eda3b183036bd433dbac920a0f48590590b2eea182f"}}