{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LDEWT56TV5CU5EQVLXYQBXQOC5","short_pith_number":"pith:LDEWT56T","schema_version":"1.0","canonical_sha256":"58c969f7d3af454e92155df100de0e175276b875482dd68c8ef7c8c1e8a47f92","source":{"kind":"arxiv","id":"1705.03283","version":1},"attestation_state":"computed","paper":{"title":"An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Daniel Neuen, Pascal Schweitzer","submitted_at":"2017-05-09T11:41:16Z","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"},"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":"1705.03283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-09T11:41:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"277cdcb34418bf2df8b2261ac2c847b572ef0c802287628f9614dd2adf3e6b4b","abstract_canon_sha256":"f4151959ea9ebb762e3b6ae749cc614a306c882f2afaeec168165491c4dbb6df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:48.383861Z","signature_b64":"XUlH8ecUln6bRsYuta8Brx0eY2ctljnt1x1SQcU3vyG6S1+k8KEW6Qi/Iv2MnbupfIpbUpvBtwyCc8VUttTpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c969f7d3af454e92155df100de0e175276b875482dd68c8ef7c8c1e8a47f92","last_reissued_at":"2026-05-18T00:44:48.383371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:48.383371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Daniel Neuen, Pascal Schweitzer","submitted_at":"2017-05-09T11:41:16Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03283","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":"1705.03283","created_at":"2026-05-18T00:44:48.383450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03283v1","created_at":"2026-05-18T00:44:48.383450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03283","created_at":"2026-05-18T00:44:48.383450+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDEWT56TV5CU","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDEWT56TV5CU5EQV","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDEWT56T","created_at":"2026-05-18T12:31:28.150371+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/LDEWT56TV5CU5EQVLXYQBXQOC5","json":"https://pith.science/pith/LDEWT56TV5CU5EQVLXYQBXQOC5.json","graph_json":"https://pith.science/api/pith-number/LDEWT56TV5CU5EQVLXYQBXQOC5/graph.json","events_json":"https://pith.science/api/pith-number/LDEWT56TV5CU5EQVLXYQBXQOC5/events.json","paper":"https://pith.science/paper/LDEWT56T"},"agent_actions":{"view_html":"https://pith.science/pith/LDEWT56TV5CU5EQVLXYQBXQOC5","download_json":"https://pith.science/pith/LDEWT56TV5CU5EQVLXYQBXQOC5.json","view_paper":"https://pith.science/paper/LDEWT56T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03283&json=true","fetch_graph":"https://pith.science/api/pith-number/LDEWT56TV5CU5EQVLXYQBXQOC5/graph.json","fetch_events":"https://pith.science/api/pith-number/LDEWT56TV5CU5EQVLXYQBXQOC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDEWT56TV5CU5EQVLXYQBXQOC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDEWT56TV5CU5EQVLXYQBXQOC5/action/storage_attestation","attest_author":"https://pith.science/pith/LDEWT56TV5CU5EQVLXYQBXQOC5/action/author_attestation","sign_citation":"https://pith.science/pith/LDEWT56TV5CU5EQVLXYQBXQOC5/action/citation_signature","submit_replication":"https://pith.science/pith/LDEWT56TV5CU5EQVLXYQBXQOC5/action/replication_record"}},"created_at":"2026-05-18T00:44:48.383450+00:00","updated_at":"2026-05-18T00:44:48.383450+00:00"}