{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:UH6ISSTVAUIJM2JKG24COXSHAC","short_pith_number":"pith:UH6ISSTV","schema_version":"1.0","canonical_sha256":"a1fc894a75051096692a36b8275e4700bd039a078d00a3954fdc085e693edd47","source":{"kind":"arxiv","id":"cs/0106041","version":1},"attestation_state":"computed","paper":{"title":"Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andr\\'e Grosse, Gerd Wechsung, Joerg Rothe","submitted_at":"2001-06-19T16:10:55Z","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."},"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":"cs/0106041","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2001-06-19T16:10:55Z","cross_cats_sorted":[],"title_canon_sha256":"fce1c4e0baa77114afc64595b626d89af0cb97e4d967baac42fab1fe0d9a38f1","abstract_canon_sha256":"be6c483f0046ff51d4264d3bdf3877f649c39ea65cfcd92c152e852587c3b06b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:08.435368Z","signature_b64":"qGsUpRzQ4D1kVS3ASRGqVBvpjG1QJiYdHZjFg5fy4auIelKqcIaVZgVHXUBRURPTWd9PuIYpdQkQ4udcq6aLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1fc894a75051096692a36b8275e4700bd039a078d00a3954fdc085e693edd47","last_reissued_at":"2026-05-18T01:09:08.434997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:08.434997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andr\\'e Grosse, Gerd Wechsung, Joerg Rothe","submitted_at":"2001-06-19T16:10:55Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0106041","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":"cs/0106041","created_at":"2026-05-18T01:09:08.435056+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0106041v1","created_at":"2026-05-18T01:09:08.435056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0106041","created_at":"2026-05-18T01:09:08.435056+00:00"},{"alias_kind":"pith_short_12","alias_value":"UH6ISSTVAUIJ","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"UH6ISSTVAUIJM2JK","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"UH6ISSTV","created_at":"2026-05-18T12:25:50.845339+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/UH6ISSTVAUIJM2JKG24COXSHAC","json":"https://pith.science/pith/UH6ISSTVAUIJM2JKG24COXSHAC.json","graph_json":"https://pith.science/api/pith-number/UH6ISSTVAUIJM2JKG24COXSHAC/graph.json","events_json":"https://pith.science/api/pith-number/UH6ISSTVAUIJM2JKG24COXSHAC/events.json","paper":"https://pith.science/paper/UH6ISSTV"},"agent_actions":{"view_html":"https://pith.science/pith/UH6ISSTVAUIJM2JKG24COXSHAC","download_json":"https://pith.science/pith/UH6ISSTVAUIJM2JKG24COXSHAC.json","view_paper":"https://pith.science/paper/UH6ISSTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0106041&json=true","fetch_graph":"https://pith.science/api/pith-number/UH6ISSTVAUIJM2JKG24COXSHAC/graph.json","fetch_events":"https://pith.science/api/pith-number/UH6ISSTVAUIJM2JKG24COXSHAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UH6ISSTVAUIJM2JKG24COXSHAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UH6ISSTVAUIJM2JKG24COXSHAC/action/storage_attestation","attest_author":"https://pith.science/pith/UH6ISSTVAUIJM2JKG24COXSHAC/action/author_attestation","sign_citation":"https://pith.science/pith/UH6ISSTVAUIJM2JKG24COXSHAC/action/citation_signature","submit_replication":"https://pith.science/pith/UH6ISSTVAUIJM2JKG24COXSHAC/action/replication_record"}},"created_at":"2026-05-18T01:09:08.435056+00:00","updated_at":"2026-05-18T01:09:08.435056+00:00"}