{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IQHS25YHEZAGPASMHUZHFJYGMC","short_pith_number":"pith:IQHS25YH","schema_version":"1.0","canonical_sha256":"440f2d7707264067824c3d3272a70660a1b45467eb0fb934a4a69f7560d0bf95","source":{"kind":"arxiv","id":"1412.0514","version":4},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.0514","created_at":"2026-05-18T00:41:02.509570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0514v4","created_at":"2026-05-18T00:41:02.509570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0514","created_at":"2026-05-18T00:41:02.509570+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQHS25YHEZAG","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQHS25YHEZAGPASM","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQHS25YH","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC","json":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC.json","graph_json":"https://pith.science/api/pith-number/IQHS25YHEZAGPASMHUZHFJYGMC/graph.json","events_json":"https://pith.science/api/pith-number/IQHS25YHEZAGPASMHUZHFJYGMC/events.json","paper":"https://pith.science/paper/IQHS25YH"},"agent_actions":{"view_html":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC","download_json":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC.json","view_paper":"https://pith.science/paper/IQHS25YH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0514&json=true","fetch_graph":"https://pith.science/api/pith-number/IQHS25YHEZAGPASMHUZHFJYGMC/graph.json","fetch_events":"https://pith.science/api/pith-number/IQHS25YHEZAGPASMHUZHFJYGMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC/action/storage_attestation","attest_author":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC/action/author_attestation","sign_citation":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC/action/citation_signature","submit_replication":"https://pith.science/pith/IQHS25YHEZAGPASMHUZHFJYGMC/action/replication_record"}},"created_at":"2026-05-18T00:41:02.509570+00:00","updated_at":"2026-05-18T00:41:02.509570+00:00"}