{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DPSKBCIPIYBW4PI5OK2QW2QWAK","short_pith_number":"pith:DPSKBCIP","schema_version":"1.0","canonical_sha256":"1be4a0890f46036e3d1d72b50b6a160296396db8e5e64004d77106fc58751a77","source":{"kind":"arxiv","id":"1305.4729","version":1},"attestation_state":"computed","paper":{"title":"A Linear-size Conversion of HCP to 3HCP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Michael Haythorpe, Serguei Rossomakhine, Vladimir Ejov","submitted_at":"2013-05-21T06:38:43Z","abstract_excerpt":"We provide an algorithm that converts any instance of the Hamiltonian cycle problem (HCP) into a cubic instance of HCP (3HCP), and prove that the input size of the new instance is only a linear function of that of the original instance. This is achieved by first considering various restrictions of HCP. Known conversions from directed HCP to undirected HCP, and sub-cubic HCP to cubic HCP are given. We introduce a subgraph called a 4-gate and show that it may be used to convert sub-quartic HCP into sub-cubic HCP. We further generalise this idea by first introducing the 5-gate, and then the s-gat"},"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":"1305.4729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-21T06:38:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"65f228d227c2eaf95b81407a8f4da15035694ed5c476d4bae5775ffb8348e80c","abstract_canon_sha256":"70386ce454970b6620a95d4c9a2aeb4f055dd42c387ed19b305d5396125c7b05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:15.368201Z","signature_b64":"iDUHsyLbxTWDYMOA4hTpGN4KEdRnoU3onN65iDWIkP0ZEACGVjm1SPtNrpK+qu5K/hxK6xWvJLcavfPG6aNtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1be4a0890f46036e3d1d72b50b6a160296396db8e5e64004d77106fc58751a77","last_reissued_at":"2026-05-18T03:25:15.367621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:15.367621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linear-size Conversion of HCP to 3HCP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Michael Haythorpe, Serguei Rossomakhine, Vladimir Ejov","submitted_at":"2013-05-21T06:38:43Z","abstract_excerpt":"We provide an algorithm that converts any instance of the Hamiltonian cycle problem (HCP) into a cubic instance of HCP (3HCP), and prove that the input size of the new instance is only a linear function of that of the original instance. This is achieved by first considering various restrictions of HCP. Known conversions from directed HCP to undirected HCP, and sub-cubic HCP to cubic HCP are given. We introduce a subgraph called a 4-gate and show that it may be used to convert sub-quartic HCP into sub-cubic HCP. We further generalise this idea by first introducing the 5-gate, and then the s-gat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4729","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.4729","created_at":"2026-05-18T03:25:15.367713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4729v1","created_at":"2026-05-18T03:25:15.367713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4729","created_at":"2026-05-18T03:25:15.367713+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPSKBCIPIYBW","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPSKBCIPIYBW4PI5","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPSKBCIP","created_at":"2026-05-18T12:27:43.054852+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/DPSKBCIPIYBW4PI5OK2QW2QWAK","json":"https://pith.science/pith/DPSKBCIPIYBW4PI5OK2QW2QWAK.json","graph_json":"https://pith.science/api/pith-number/DPSKBCIPIYBW4PI5OK2QW2QWAK/graph.json","events_json":"https://pith.science/api/pith-number/DPSKBCIPIYBW4PI5OK2QW2QWAK/events.json","paper":"https://pith.science/paper/DPSKBCIP"},"agent_actions":{"view_html":"https://pith.science/pith/DPSKBCIPIYBW4PI5OK2QW2QWAK","download_json":"https://pith.science/pith/DPSKBCIPIYBW4PI5OK2QW2QWAK.json","view_paper":"https://pith.science/paper/DPSKBCIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4729&json=true","fetch_graph":"https://pith.science/api/pith-number/DPSKBCIPIYBW4PI5OK2QW2QWAK/graph.json","fetch_events":"https://pith.science/api/pith-number/DPSKBCIPIYBW4PI5OK2QW2QWAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPSKBCIPIYBW4PI5OK2QW2QWAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPSKBCIPIYBW4PI5OK2QW2QWAK/action/storage_attestation","attest_author":"https://pith.science/pith/DPSKBCIPIYBW4PI5OK2QW2QWAK/action/author_attestation","sign_citation":"https://pith.science/pith/DPSKBCIPIYBW4PI5OK2QW2QWAK/action/citation_signature","submit_replication":"https://pith.science/pith/DPSKBCIPIYBW4PI5OK2QW2QWAK/action/replication_record"}},"created_at":"2026-05-18T03:25:15.367713+00:00","updated_at":"2026-05-18T03:25:15.367713+00:00"}