{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:HG6M75M64SJXOSVY2LOIDLQMJL","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":"a255e80530d5145c0fd25dc3a9d580f3c86934fc11d50ee3bf7fa7a4f2f69064","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2006-08-18T09:46:09Z","title_canon_sha256":"73f41ccdf79874d44e9715aa4798b897802850d210d532532899ca7b9673ddcf"},"schema_version":"1.0","source":{"id":"cs/0608074","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0608074","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0608074v4","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0608074","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"HG6M75M64SJX","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"HG6M75M64SJXOSVY","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"HG6M75M6","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:41954912f48bd9a9233d4ce11d3268d48ec5fa81449209dcb35bd15ae0d14841","target":"graph","created_at":"2026-05-18T04:08:54Z","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":"A function $f$ of a graph is called a complete graph invariant if the isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$. If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a canonical form for graphs. Gurevich proves that graphs have a polynomial-time computable canonical form exactly when they have a polynomial-time computable complete invariant. We extend this equivalence to the polylogarithmic-time model of parallel computation for classes of graphs with bounded rigidity index and for classes of graphs with small separators. In particular, our","authors_text":"Johannes Koebler, Oleg Verbitsky","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2006-08-18T09:46:09Z","title":"From Invariants to Canonization in Parallel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0608074","kind":"arxiv","version":4},"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:6feec4810184d9cc8516f4e1513166415fac25c650b634d42c2831e5555d7d1a","target":"record","created_at":"2026-05-18T04:08:54Z","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":"a255e80530d5145c0fd25dc3a9d580f3c86934fc11d50ee3bf7fa7a4f2f69064","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2006-08-18T09:46:09Z","title_canon_sha256":"73f41ccdf79874d44e9715aa4798b897802850d210d532532899ca7b9673ddcf"},"schema_version":"1.0","source":{"id":"cs/0608074","kind":"arxiv","version":4}},"canonical_sha256":"39bccff59ee493774ab8d2dc81ae0c4ad1415f1759f4d6a7ed28c351f649931c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39bccff59ee493774ab8d2dc81ae0c4ad1415f1759f4d6a7ed28c351f649931c","first_computed_at":"2026-05-18T04:08:54.038709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:54.038709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cg9uvd+QBmKANAH3Tg9pGT5fiYgar6YnzgfSBGcTdNLKtAwn5T5NWwrZctH5feu+f0FTDk8lBAQURbaYlnqSAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:54.039485Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0608074","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6feec4810184d9cc8516f4e1513166415fac25c650b634d42c2831e5555d7d1a","sha256:41954912f48bd9a9233d4ce11d3268d48ec5fa81449209dcb35bd15ae0d14841"],"state_sha256":"427e4a62dbc1475a2efc949c35de13efa2f5bde1f82cd43bc9ef296f998eab1e"}