{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GCUOHWEMF3QTJW5P22LZ76BZGF","short_pith_number":"pith:GCUOHWEM","canonical_record":{"source":{"id":"1401.3863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:04:57Z","cross_cats_sorted":[],"title_canon_sha256":"ffc5950b562d155eda81c5e381a69b4f27da86057dc481911815a2c878305f32","abstract_canon_sha256":"da6e76238c8f555043e2a43055443ba10c50665e98073effd2bee8d934dc78b8"},"schema_version":"1.0"},"canonical_sha256":"30a8e3d88c2ee134dbafd6979ff83931408ab25e633a671187cb5aa26772a72c","source":{"kind":"arxiv","id":"1401.3863","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3863","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3863v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3863","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"GCUOHWEMF3QT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GCUOHWEMF3QTJW5P","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GCUOHWEM","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GCUOHWEMF3QTJW5P22LZ76BZGF","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:04:57Z","cross_cats_sorted":[],"title_canon_sha256":"ffc5950b562d155eda81c5e381a69b4f27da86057dc481911815a2c878305f32","abstract_canon_sha256":"da6e76238c8f555043e2a43055443ba10c50665e98073effd2bee8d934dc78b8"},"schema_version":"1.0"},"canonical_sha256":"30a8e3d88c2ee134dbafd6979ff83931408ab25e633a671187cb5aa26772a72c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.459352Z","signature_b64":"4h3Bwe4iH2mEUzLRg5WM+NzbWzrZrz0HKTBeNvMDks3Vnpymqt0+gM6456lbahyasXB0Jagen41aciRk3j0zAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30a8e3d88c2ee134dbafd6979ff83931408ab25e633a671187cb5aa26772a72c","last_reissued_at":"2026-05-18T03:02:06.458637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.458637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3863","source_version":1,"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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IWSiA69hzohE8UJKAbTjK2iZOHIvHlQT3NWdGtjLQ2iNh6qOogBnE3xb32U/7Mu2UYpBuZGmgEPt4gFamzo2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:24:38.797978Z"},"content_sha256":"2588bf0054ce1dfcb2905ad8ea2542301546b3a2afda053364a86f5ffe2206c3","schema_version":"1.0","event_id":"sha256:2588bf0054ce1dfcb2905ad8ea2542301546b3a2afda053364a86f5ffe2206c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GCUOHWEMF3QTJW5P22LZ76BZGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gerold J\\\"ager, Weixiong Zhang","submitted_at":"2014-01-16T05:04:57Z","abstract_excerpt":"The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first  problems used for studying intrinsic properties, including phase transitions,  of combinatorial problems. While thorough theoretical and experimental analyses have been made on the HCP in undirected graphs, a limited  amount of work has been done for the HCP in directed graphs (DHCP). \nThe main contribution of this work is an effective algorithm for the DHCP. Our algorithm explores and exploits the close relationship between the DHCP and the  Assignment Problem (AP)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3863","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"},"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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uWFDZikyGu8s2H2HN364SnQCAngckNpitof2DGUmA/ABZCprHDrnUhY5SgeViviB/1j6KujojmCMaj3AWBfcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:24:38.798632Z"},"content_sha256":"6af3ece08021ac671d3b7776f0f404468529a9e5a3807e262f709bcc9aa837d4","schema_version":"1.0","event_id":"sha256:6af3ece08021ac671d3b7776f0f404468529a9e5a3807e262f709bcc9aa837d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCUOHWEMF3QTJW5P22LZ76BZGF/bundle.json","state_url":"https://pith.science/pith/GCUOHWEMF3QTJW5P22LZ76BZGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCUOHWEMF3QTJW5P22LZ76BZGF/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-05-25T19:24:38Z","links":{"resolver":"https://pith.science/pith/GCUOHWEMF3QTJW5P22LZ76BZGF","bundle":"https://pith.science/pith/GCUOHWEMF3QTJW5P22LZ76BZGF/bundle.json","state":"https://pith.science/pith/GCUOHWEMF3QTJW5P22LZ76BZGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCUOHWEMF3QTJW5P22LZ76BZGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GCUOHWEMF3QTJW5P22LZ76BZGF","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":"da6e76238c8f555043e2a43055443ba10c50665e98073effd2bee8d934dc78b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:04:57Z","title_canon_sha256":"ffc5950b562d155eda81c5e381a69b4f27da86057dc481911815a2c878305f32"},"schema_version":"1.0","source":{"id":"1401.3863","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3863","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3863v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3863","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"GCUOHWEMF3QT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GCUOHWEMF3QTJW5P","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GCUOHWEM","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:6af3ece08021ac671d3b7776f0f404468529a9e5a3807e262f709bcc9aa837d4","target":"graph","created_at":"2026-05-18T03:02:06Z","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":"The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first  problems used for studying intrinsic properties, including phase transitions,  of combinatorial problems. While thorough theoretical and experimental analyses have been made on the HCP in undirected graphs, a limited  amount of work has been done for the HCP in directed graphs (DHCP). \nThe main contribution of this work is an effective algorithm for the DHCP. Our algorithm explores and exploits the close relationship between the DHCP and the  Assignment Problem (AP)","authors_text":"Gerold J\\\"ager, Weixiong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:04:57Z","title":"An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3863","kind":"arxiv","version":1},"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:2588bf0054ce1dfcb2905ad8ea2542301546b3a2afda053364a86f5ffe2206c3","target":"record","created_at":"2026-05-18T03:02:06Z","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":"da6e76238c8f555043e2a43055443ba10c50665e98073effd2bee8d934dc78b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:04:57Z","title_canon_sha256":"ffc5950b562d155eda81c5e381a69b4f27da86057dc481911815a2c878305f32"},"schema_version":"1.0","source":{"id":"1401.3863","kind":"arxiv","version":1}},"canonical_sha256":"30a8e3d88c2ee134dbafd6979ff83931408ab25e633a671187cb5aa26772a72c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30a8e3d88c2ee134dbafd6979ff83931408ab25e633a671187cb5aa26772a72c","first_computed_at":"2026-05-18T03:02:06.458637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:06.458637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4h3Bwe4iH2mEUzLRg5WM+NzbWzrZrz0HKTBeNvMDks3Vnpymqt0+gM6456lbahyasXB0Jagen41aciRk3j0zAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.459352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3863","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2588bf0054ce1dfcb2905ad8ea2542301546b3a2afda053364a86f5ffe2206c3","sha256:6af3ece08021ac671d3b7776f0f404468529a9e5a3807e262f709bcc9aa837d4"],"state_sha256":"5f8eb45dab4fa889ff217f582208a848eac0d1f14e4efde370faab5be69672b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y7Q1rcCcOjspt9621utqmKc9inNEvYojNMWmnbO76WhjTHrocdrRxQDTAdTC274ddId8xF4QsJOA28Qs9JhmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:24:38.802024Z","bundle_sha256":"fb222418605f71141581b313cbd33bf0f530fd70fb6948453b703581f600980b"}}