{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:XCJWLM4KV7XFXLEZBOL2B7XRIR","short_pith_number":"pith:XCJWLM4K","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"},"canonical_sha256":"b89365b38aafee5bac990b97a0fef14444c91dc3cd1a9d3bd5e49738224dcde8","source":{"kind":"arxiv","id":"2111.14771","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.14771","created_at":"2026-07-05T05:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"2111.14771v3","created_at":"2026-07-05T05:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14771","created_at":"2026-07-05T05:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"XCJWLM4KV7XF","created_at":"2026-07-05T05:06:53Z"},{"alias_kind":"pith_short_16","alias_value":"XCJWLM4KV7XFXLEZ","created_at":"2026-07-05T05:06:53Z"},{"alias_kind":"pith_short_8","alias_value":"XCJWLM4K","created_at":"2026-07-05T05:06:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:XCJWLM4KV7XFXLEZBOL2B7XRIR","target":"record","payload":{"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"},"canonical_sha256":"b89365b38aafee5bac990b97a0fef14444c91dc3cd1a9d3bd5e49738224dcde8","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"},"source_kind":"arxiv","source_id":"2111.14771","source_version":3,"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-07-05T05:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luYAW9vfbG+k+cyDcILKS6asw5LVvjP4/NKn/zySvDLd0d/JQ0SYi/wRIL6JH9V3LquAPenV3xdr3T+cLPCkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:18:55.477680Z"},"content_sha256":"d1fb50ba09330b995d2d949badbad1681993ec701b0c2097ff0cda59aaa2e45e","schema_version":"1.0","event_id":"sha256:d1fb50ba09330b995d2d949badbad1681993ec701b0c2097ff0cda59aaa2e45e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:XCJWLM4KV7XFXLEZBOL2B7XRIR","target":"graph","payload":{"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"},"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-07-05T05:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGyAdNtd7wwmHKKNcYyXgl3nauk160CKmhZyWZO7xvWdDYXheG9CjsvEe3wsrJkBVoWbT/xt7eFOb2V4uaFfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:18:55.478179Z"},"content_sha256":"6f0d4dbb3e3d2b28183d0e1f5d381aa08a620419957ac7b316e38d4b7a60ccac","schema_version":"1.0","event_id":"sha256:6f0d4dbb3e3d2b28183d0e1f5d381aa08a620419957ac7b316e38d4b7a60ccac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR/bundle.json","state_url":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR/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-08-11T10:18:55Z","links":{"resolver":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR","bundle":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR/bundle.json","state":"https://pith.science/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCJWLM4KV7XFXLEZBOL2B7XRIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XCJWLM4KV7XFXLEZBOL2B7XRIR","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":"b760a4e03486d529c5799390ef00970d8916155102cccc239b9712edc1e530d9","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-29T18:21:29Z","title_canon_sha256":"dbcf525fa2cea86821241ec87d0110c1a345d3e26d503ef8c2086c32416238a3"},"schema_version":"1.0","source":{"id":"2111.14771","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.14771","created_at":"2026-07-05T05:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"2111.14771v3","created_at":"2026-07-05T05:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14771","created_at":"2026-07-05T05:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"XCJWLM4KV7XF","created_at":"2026-07-05T05:06:53Z"},{"alias_kind":"pith_short_16","alias_value":"XCJWLM4KV7XFXLEZ","created_at":"2026-07-05T05:06:53Z"},{"alias_kind":"pith_short_8","alias_value":"XCJWLM4K","created_at":"2026-07-05T05:06:53Z"}],"graph_snapshots":[{"event_id":"sha256:6f0d4dbb3e3d2b28183d0e1f5d381aa08a620419957ac7b316e38d4b7a60ccac","target":"graph","created_at":"2026-07-05T05:06:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.14771/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Michael Anastos","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-29T18:21:29Z","title":"A fast algorithm on average for solving the Hamilton Cycle problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14771","kind":"arxiv","version":3},"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:d1fb50ba09330b995d2d949badbad1681993ec701b0c2097ff0cda59aaa2e45e","target":"record","created_at":"2026-07-05T05:06:53Z","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":"b760a4e03486d529c5799390ef00970d8916155102cccc239b9712edc1e530d9","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-29T18:21:29Z","title_canon_sha256":"dbcf525fa2cea86821241ec87d0110c1a345d3e26d503ef8c2086c32416238a3"},"schema_version":"1.0","source":{"id":"2111.14771","kind":"arxiv","version":3}},"canonical_sha256":"b89365b38aafee5bac990b97a0fef14444c91dc3cd1a9d3bd5e49738224dcde8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b89365b38aafee5bac990b97a0fef14444c91dc3cd1a9d3bd5e49738224dcde8","first_computed_at":"2026-07-05T05:06:53.387975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:06:53.387975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u0EouDTSQFgMNcTPGdzA4p8crJd9rn8ACtnRwTSE8yMxDEay0k0kQZUTbuNbbPnTt06oXqoLM6PeA8vtjiA4Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:06:53.388384Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.14771","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1fb50ba09330b995d2d949badbad1681993ec701b0c2097ff0cda59aaa2e45e","sha256:6f0d4dbb3e3d2b28183d0e1f5d381aa08a620419957ac7b316e38d4b7a60ccac"],"state_sha256":"3d2e5a2139fada8002607e1ae7096d7aa592ad08e3c31ee694f21366432c1e71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMhZepUy3sYimPyKto7uh0YhXKZ9yzU3XSqIxvDByKFjWHRZ3czPkjixCebNT0xi/NF9lu/sjHLf2oPILAkFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T10:18:55.482470Z","bundle_sha256":"dcc4e9b7a0bba5d19a3a79d76429f4adea057dfbd35cc5ed11f61eed42e23542"}}