{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XCJWLM4KV7XFXLEZBOL2B7XRIR","short_pith_number":"pith:XCJWLM4K","schema_version":"1.0","canonical_sha256":"b89365b38aafee5bac990b97a0fef14444c91dc3cd1a9d3bd5e49738224dcde8","source":{"kind":"arxiv","id":"2111.14771","version":3},"attestation_state":"computed","paper":{"title":"A fast algorithm on average for solving the Hamilton Cycle problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Michael Anastos","submitted_at":"2021-11-29T18:21:29Z","abstract_excerpt":"We present CertifyHAM, an algorithm which takes as input a graph G and either finds a Hamilton cycle of G or it outputs that such a cycle does not exists. If G=G(n, p) and p >2000/n then the expected running time of CertifyHAM is O(n/p). This improves upon previous results due to Gurevich and Shelah, Thomason and Alon and Krivelevich."},"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":"2111.14771","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-29T18:21:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"dbcf525fa2cea86821241ec87d0110c1a345d3e26d503ef8c2086c32416238a3","abstract_canon_sha256":"b760a4e03486d529c5799390ef00970d8916155102cccc239b9712edc1e530d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:53.388384Z","signature_b64":"u0EouDTSQFgMNcTPGdzA4p8crJd9rn8ACtnRwTSE8yMxDEay0k0kQZUTbuNbbPnTt06oXqoLM6PeA8vtjiA4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89365b38aafee5bac990b97a0fef14444c91dc3cd1a9d3bd5e49738224dcde8","last_reissued_at":"2026-07-05T05:06:53.387975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:53.387975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast algorithm on average for solving the Hamilton Cycle problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Michael Anastos","submitted_at":"2021-11-29T18:21:29Z","abstract_excerpt":"We present CertifyHAM, an algorithm which takes as input a graph G and either finds a Hamilton cycle of G or it outputs that such a cycle does not exists. If G=G(n, p) and p >2000/n then the expected running time of CertifyHAM is O(n/p). This improves upon previous results due to Gurevich and Shelah, Thomason and Alon and Krivelevich."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14771","kind":"arxiv","version":3},"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/2111.14771/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.14771","created_at":"2026-07-05T05:06:53.388042+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.14771v3","created_at":"2026-07-05T05:06:53.388042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14771","created_at":"2026-07-05T05:06:53.388042+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCJWLM4KV7XF","created_at":"2026-07-05T05:06:53.388042+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCJWLM4KV7XFXLEZ","created_at":"2026-07-05T05:06:53.388042+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCJWLM4K","created_at":"2026-07-05T05:06:53.388042+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/XCJWLM4KV7XFXLEZBOL2B7XRIR","json":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR.json","graph_json":"https://pith.science/api/pith-number/XCJWLM4KV7XFXLEZBOL2B7XRIR/graph.json","events_json":"https://pith.science/api/pith-number/XCJWLM4KV7XFXLEZBOL2B7XRIR/events.json","paper":"https://pith.science/paper/XCJWLM4K"},"agent_actions":{"view_html":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR","download_json":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR.json","view_paper":"https://pith.science/paper/XCJWLM4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.14771&json=true","fetch_graph":"https://pith.science/api/pith-number/XCJWLM4KV7XFXLEZBOL2B7XRIR/graph.json","fetch_events":"https://pith.science/api/pith-number/XCJWLM4KV7XFXLEZBOL2B7XRIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR/action/storage_attestation","attest_author":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR/action/author_attestation","sign_citation":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR/action/citation_signature","submit_replication":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR/action/replication_record"}},"created_at":"2026-07-05T05:06:53.388042+00:00","updated_at":"2026-07-05T05:06:53.388042+00:00"}