{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2001:UH6ISSTVAUIJM2JKG24COXSHAC","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":"be6c483f0046ff51d4264d3bdf3877f649c39ea65cfcd92c152e852587c3b06b","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2001-06-19T16:10:55Z","title_canon_sha256":"fce1c4e0baa77114afc64595b626d89af0cb97e4d967baac42fab1fe0d9a38f1"},"schema_version":"1.0","source":{"id":"cs/0106041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0106041","created_at":"2026-05-18T01:09:08Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0106041v1","created_at":"2026-05-18T01:09:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0106041","created_at":"2026-05-18T01:09:08Z"},{"alias_kind":"pith_short_12","alias_value":"UH6ISSTVAUIJ","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"UH6ISSTVAUIJM2JK","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"UH6ISSTV","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:7088b5f281af143447bcbf158ad56a264ca647f379f726e59362b4844bbe0d0f","target":"graph","created_at":"2026-05-18T01:09:08Z","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":"We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism $\\phi$ between two isomorphic graphs is as hard as computing $\\phi$ itself. This result optimally improves upon a result of G\\'{a}l et al. We establish a similar, albeit slightly weaker, result about computing complete Hamiltonian cycles of a graph from partial Hamiltonian cycles.","authors_text":"Andr\\'e Grosse, Gerd Wechsung, Joerg Rothe","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2001-06-19T16:10:55Z","title":"Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0106041","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:7bc0f353c9396c8bedfdbc0a456fd8e15846bb5007219949bff19d9b6cc2e9f5","target":"record","created_at":"2026-05-18T01:09:08Z","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":"be6c483f0046ff51d4264d3bdf3877f649c39ea65cfcd92c152e852587c3b06b","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2001-06-19T16:10:55Z","title_canon_sha256":"fce1c4e0baa77114afc64595b626d89af0cb97e4d967baac42fab1fe0d9a38f1"},"schema_version":"1.0","source":{"id":"cs/0106041","kind":"arxiv","version":1}},"canonical_sha256":"a1fc894a75051096692a36b8275e4700bd039a078d00a3954fdc085e693edd47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1fc894a75051096692a36b8275e4700bd039a078d00a3954fdc085e693edd47","first_computed_at":"2026-05-18T01:09:08.434997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:08.434997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qGsUpRzQ4D1kVS3ASRGqVBvpjG1QJiYdHZjFg5fy4auIelKqcIaVZgVHXUBRURPTWd9PuIYpdQkQ4udcq6aLCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:08.435368Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0106041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bc0f353c9396c8bedfdbc0a456fd8e15846bb5007219949bff19d9b6cc2e9f5","sha256:7088b5f281af143447bcbf158ad56a264ca647f379f726e59362b4844bbe0d0f"],"state_sha256":"5dfeec6c3d479c2e527827f2c26c83cf485f257967e804984e208bac022cbe56"}