{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:P2GKIWDZ6DUZCMAHDTVZLSZ756","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":"425125ee67d7c7e6df5c419c127fe0f9a410369988ce55d5b5b01d6191ce83cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-04T12:16:27Z","title_canon_sha256":"4effc740ea5edf5c473e656c41c6f99787b609ba6ecdce93874d5164ad23d67d"},"schema_version":"1.0","source":{"id":"1108.1060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1060","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1060v1","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1060","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"pith_short_12","alias_value":"P2GKIWDZ6DUZ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P2GKIWDZ6DUZCMAH","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P2GKIWDZ","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:e8fb25ed56b83a534658e3d3d913a87196a22acd9b45c5ea92b860d405919b87","target":"graph","created_at":"2026-05-18T04:16:12Z","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":"In this paper we present an algorithm, called conauto-2.0, that can efficiently compute a set of generators of the automorphism group of a graph, and test whether two graphs are isomorphic, finding an isomorphism if they are. This algorithm uses the basic individualization/refinement technique, and is an improved version of the algorithm conauto, which has been shown to be very fast for random graphs and several families of hard graphs. In this paper, it is proved that, under some circumstances, it is not only possible to prune the search space (using already found generators of the automorphi","authors_text":"Antonio Fern\\'andez Anta, Jos\\'e Luis L\\'opez-Presa, Luis N\\'u\\~nez Chiroque","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-04T12:16:27Z","title":"Conauto-2.0: Fast Isomorphism Testing and Automorphism Group Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1060","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:9243bbc577ea4fff405867aed4d302b83420bfa7971149ef728d048eea836db1","target":"record","created_at":"2026-05-18T04:16:12Z","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":"425125ee67d7c7e6df5c419c127fe0f9a410369988ce55d5b5b01d6191ce83cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-04T12:16:27Z","title_canon_sha256":"4effc740ea5edf5c473e656c41c6f99787b609ba6ecdce93874d5164ad23d67d"},"schema_version":"1.0","source":{"id":"1108.1060","kind":"arxiv","version":1}},"canonical_sha256":"7e8ca45879f0e99130071ceb95cb3fefa7437ce3178cf5494fc08d94e2a8e9aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e8ca45879f0e99130071ceb95cb3fefa7437ce3178cf5494fc08d94e2a8e9aa","first_computed_at":"2026-05-18T04:16:12.749841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:12.749841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YrIPQIfqlt1rMlGIYku5If9XtUN8x/aM+L1ppFK8kyXiCyPMR9igWd2qpplonRt0wBUhRnCzTBY+zZ50OyGUDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:12.750417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9243bbc577ea4fff405867aed4d302b83420bfa7971149ef728d048eea836db1","sha256:e8fb25ed56b83a534658e3d3d913a87196a22acd9b45c5ea92b860d405919b87"],"state_sha256":"3f789e74d61c6c41e1a4639ae8b04f17ed2e2537724990167677166420d38b36"}