{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LDEWT56TV5CU5EQVLXYQBXQOC5","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":"f4151959ea9ebb762e3b6ae749cc614a306c882f2afaeec168165491c4dbb6df","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-09T11:41:16Z","title_canon_sha256":"277cdcb34418bf2df8b2261ac2c847b572ef0c802287628f9614dd2adf3e6b4b"},"schema_version":"1.0","source":{"id":"1705.03283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03283","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03283v1","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03283","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"LDEWT56TV5CU","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LDEWT56TV5CU5EQV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LDEWT56T","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:0232fdfa07fc1dd0b0f4efc7729ddcc83c3c182b08cbf92e5bf1086d6a94fc63","target":"graph","created_at":"2026-05-18T00:44:48Z","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 individualization-refinement paradigm provides a strong toolbox for testing isomorphism of two graphs and indeed, the currently fastest implementations of isomorphism solvers all follow this approach. While these solvers are fast in practice, from a theoretical point of view, no general lower bounds concerning the worst case complexity of these tools are known. In fact, it is an open question whether individualization-refinement algorithms can achieve upper bounds on the running time similar to the more theoretical techniques based on a group theoretic approach.\n  In this work we give a ne","authors_text":"Daniel Neuen, Pascal Schweitzer","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-09T11:41:16Z","title":"An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03283","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:d9a68319b5e1599f17f71bc9e48276e017680bda5aee8024b90db45050fb3d15","target":"record","created_at":"2026-05-18T00:44:48Z","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":"f4151959ea9ebb762e3b6ae749cc614a306c882f2afaeec168165491c4dbb6df","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-09T11:41:16Z","title_canon_sha256":"277cdcb34418bf2df8b2261ac2c847b572ef0c802287628f9614dd2adf3e6b4b"},"schema_version":"1.0","source":{"id":"1705.03283","kind":"arxiv","version":1}},"canonical_sha256":"58c969f7d3af454e92155df100de0e175276b875482dd68c8ef7c8c1e8a47f92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58c969f7d3af454e92155df100de0e175276b875482dd68c8ef7c8c1e8a47f92","first_computed_at":"2026-05-18T00:44:48.383371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:48.383371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XUlH8ecUln6bRsYuta8Brx0eY2ctljnt1x1SQcU3vyG6S1+k8KEW6Qi/Iv2MnbupfIpbUpvBtwyCc8VUttTpCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:48.383861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9a68319b5e1599f17f71bc9e48276e017680bda5aee8024b90db45050fb3d15","sha256:0232fdfa07fc1dd0b0f4efc7729ddcc83c3c182b08cbf92e5bf1086d6a94fc63"],"state_sha256":"00b0c25db81598eb0ba1f8a59d7a51e07d5adc8a8b48ce2da37ad3d34f518648"}