{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IQHS25YHEZAGPASMHUZHFJYGMC","short_pith_number":"pith:IQHS25YH","canonical_record":{"source":{"id":"1412.0514","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-01T15:43:24Z","cross_cats_sorted":[],"title_canon_sha256":"cdc0ddc2d0292c61e64bac92e0dcaba6f8e1c0d01bf9633248c36d60e1b7c8d7","abstract_canon_sha256":"88563749c0d4aa14c21bf26a196204e8a56ee7d8f6e0515b59e2d209cdab294f"},"schema_version":"1.0"},"canonical_sha256":"440f2d7707264067824c3d3272a70660a1b45467eb0fb934a4a69f7560d0bf95","source":{"kind":"arxiv","id":"1412.0514","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0514","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0514v4","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0514","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"IQHS25YHEZAG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IQHS25YHEZAGPASM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IQHS25YH","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IQHS25YHEZAGPASMHUZHFJYGMC","target":"record","payload":{"canonical_record":{"source":{"id":"1412.0514","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-01T15:43:24Z","cross_cats_sorted":[],"title_canon_sha256":"cdc0ddc2d0292c61e64bac92e0dcaba6f8e1c0d01bf9633248c36d60e1b7c8d7","abstract_canon_sha256":"88563749c0d4aa14c21bf26a196204e8a56ee7d8f6e0515b59e2d209cdab294f"},"schema_version":"1.0"},"canonical_sha256":"440f2d7707264067824c3d3272a70660a1b45467eb0fb934a4a69f7560d0bf95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:02.510131Z","signature_b64":"bWjx725G777ZPq2m8ODFHX9fNaiUhcfSv/9/XymaU3RrvrnXoq0fcTfT9mWmzQrR9ZlSmPVg+O+F6omqU7MBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"440f2d7707264067824c3d3272a70660a1b45467eb0fb934a4a69f7560d0bf95","last_reissued_at":"2026-05-18T00:41:02.509472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:02.509472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.0514","source_version":4,"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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"freQStM2UKd1PBCs1CSoe0mYt54CSrCkVlp0uzLjcLbyF+xjTACeEU75B9TMCbpxIEZwhky2ErO4L/bk0UIpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:14:49.688202Z"},"content_sha256":"658bd753701fdca12cdc20c3e213893a8f209105acd514335fa530a228742744","schema_version":"1.0","event_id":"sha256:658bd753701fdca12cdc20c3e213893a8f209105acd514335fa530a228742744"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IQHS25YHEZAGPASMHUZHFJYGMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge-dominating cycles, k-walks and Hamilton prisms in $2K_2$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dmitrii Pasechnik, Gao Mou","submitted_at":"2014-12-01T15:43:24Z","abstract_excerpt":"We show that an edge-dominating cycle in a $2K_2$-free graph can be found in polynomial time; this implies that every 1/(k-1)-tough $2K_2$-free graph admits a k-walk, and it can be found in polynomial time. For this class of graphs, this proves a long-standing conjecture due to Jackson and Wormald (1990). Furthermore, we prove that for any \\epsilon>0 every (1+\\epsilon)-tough $2K_2$-free graph is prism-Hamiltonian and give an effective construction of a Hamiltonian cycle in the corresponding prism, along with few other similar results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0514","kind":"arxiv","version":4},"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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDTCEqxm9xNYgQo2WVi8J5RQhQ62+GXV6QtQRr+QvkcIfH4lkiIAzin0j0asw74WuJdlAWk38n95aHLDBMHFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:14:49.688613Z"},"content_sha256":"8cc79538b0476e04347a3a2705090b8c8b1f613d6c5e30405057390efa607563","schema_version":"1.0","event_id":"sha256:8cc79538b0476e04347a3a2705090b8c8b1f613d6c5e30405057390efa607563"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC/bundle.json","state_url":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQHS25YHEZAGPASMHUZHFJYGMC/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-02T07:14:49Z","links":{"resolver":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC","bundle":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC/bundle.json","state":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQHS25YHEZAGPASMHUZHFJYGMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IQHS25YHEZAGPASMHUZHFJYGMC","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":"88563749c0d4aa14c21bf26a196204e8a56ee7d8f6e0515b59e2d209cdab294f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-01T15:43:24Z","title_canon_sha256":"cdc0ddc2d0292c61e64bac92e0dcaba6f8e1c0d01bf9633248c36d60e1b7c8d7"},"schema_version":"1.0","source":{"id":"1412.0514","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0514","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0514v4","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0514","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"IQHS25YHEZAG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IQHS25YHEZAGPASM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IQHS25YH","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:8cc79538b0476e04347a3a2705090b8c8b1f613d6c5e30405057390efa607563","target":"graph","created_at":"2026-05-18T00:41:02Z","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":"We show that an edge-dominating cycle in a $2K_2$-free graph can be found in polynomial time; this implies that every 1/(k-1)-tough $2K_2$-free graph admits a k-walk, and it can be found in polynomial time. For this class of graphs, this proves a long-standing conjecture due to Jackson and Wormald (1990). Furthermore, we prove that for any \\epsilon>0 every (1+\\epsilon)-tough $2K_2$-free graph is prism-Hamiltonian and give an effective construction of a Hamiltonian cycle in the corresponding prism, along with few other similar results.","authors_text":"Dmitrii Pasechnik, Gao Mou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-01T15:43:24Z","title":"Edge-dominating cycles, k-walks and Hamilton prisms in $2K_2$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0514","kind":"arxiv","version":4},"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:658bd753701fdca12cdc20c3e213893a8f209105acd514335fa530a228742744","target":"record","created_at":"2026-05-18T00:41:02Z","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":"88563749c0d4aa14c21bf26a196204e8a56ee7d8f6e0515b59e2d209cdab294f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-01T15:43:24Z","title_canon_sha256":"cdc0ddc2d0292c61e64bac92e0dcaba6f8e1c0d01bf9633248c36d60e1b7c8d7"},"schema_version":"1.0","source":{"id":"1412.0514","kind":"arxiv","version":4}},"canonical_sha256":"440f2d7707264067824c3d3272a70660a1b45467eb0fb934a4a69f7560d0bf95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"440f2d7707264067824c3d3272a70660a1b45467eb0fb934a4a69f7560d0bf95","first_computed_at":"2026-05-18T00:41:02.509472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:02.509472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bWjx725G777ZPq2m8ODFHX9fNaiUhcfSv/9/XymaU3RrvrnXoq0fcTfT9mWmzQrR9ZlSmPVg+O+F6omqU7MBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:02.510131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0514","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:658bd753701fdca12cdc20c3e213893a8f209105acd514335fa530a228742744","sha256:8cc79538b0476e04347a3a2705090b8c8b1f613d6c5e30405057390efa607563"],"state_sha256":"32f27f5bdcc5a320a75feb8eaa8e8e1d298e82b5c4ec3e678f53a24c5d08622b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkIBwu1yyfvHvYH+M4cZHgLUSSGGYomr8unhHrdH8zXRTFrpvptPObKUnhTt6lXgI3y0zqbpJJ8JUpdoapR0Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:14:49.690752Z","bundle_sha256":"f16e1e48dba04d14f9eef7b211148796eda8f314a60f262c3bec63363b0a66d7"}}