{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DVM2L6BF4HBE6YGRFU5CLY5VAF","short_pith_number":"pith:DVM2L6BF","schema_version":"1.0","canonical_sha256":"1d59a5f825e1c24f60d12d3a25e3b501548593f89a284194ef13c2ca52c5b682","source":{"kind":"arxiv","id":"1502.05912","version":1},"attestation_state":"computed","paper":{"title":"Limitations of Algebraic Approaches to Graph Isomorphism Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Christoph Berkholz, Martin Grohe","submitted_at":"2015-02-20T15:50:43Z","abstract_excerpt":"We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\\\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and only if if the graphs are isomorphic, and then to (try to) decide satisfiability of the system using, for example, the Gr\\\"obner basis algorithm. In some cases this can be done in polynomial time, in particular, if the equations admit a bounded degree refutation in an algebraic proof systems such as Nullstellensatz or polynomial calculus. We prove linear lowe"},"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":"1502.05912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-20T15:50:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9b9b94744e76aec4a94eac86be06c2c3d7159469ab8a337fd1a9ca8944033365","abstract_canon_sha256":"47d3961b85c7b0dd505cee9524c26079e3ecbad5349e415f578b9789a8d60413"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:44.513455Z","signature_b64":"VzSY50nOR0qrYK4ltGJ/MSSfEiGqmKWFOlG7IBKAhM9gZ6yOx+UHe0i3ffYJcwq2ly9HW53sSwYHGljRp+zxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d59a5f825e1c24f60d12d3a25e3b501548593f89a284194ef13c2ca52c5b682","last_reissued_at":"2026-05-18T02:26:44.513067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:44.513067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limitations of Algebraic Approaches to Graph Isomorphism Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Christoph Berkholz, Martin Grohe","submitted_at":"2015-02-20T15:50:43Z","abstract_excerpt":"We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\\\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and only if if the graphs are isomorphic, and then to (try to) decide satisfiability of the system using, for example, the Gr\\\"obner basis algorithm. In some cases this can be done in polynomial time, in particular, if the equations admit a bounded degree refutation in an algebraic proof systems such as Nullstellensatz or polynomial calculus. We prove linear lowe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05912","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":"1502.05912","created_at":"2026-05-18T02:26:44.513125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05912v1","created_at":"2026-05-18T02:26:44.513125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05912","created_at":"2026-05-18T02:26:44.513125+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVM2L6BF4HBE","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVM2L6BF4HBE6YGR","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVM2L6BF","created_at":"2026-05-18T12:29:17.054201+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/DVM2L6BF4HBE6YGRFU5CLY5VAF","json":"https://pith.science/pith/DVM2L6BF4HBE6YGRFU5CLY5VAF.json","graph_json":"https://pith.science/api/pith-number/DVM2L6BF4HBE6YGRFU5CLY5VAF/graph.json","events_json":"https://pith.science/api/pith-number/DVM2L6BF4HBE6YGRFU5CLY5VAF/events.json","paper":"https://pith.science/paper/DVM2L6BF"},"agent_actions":{"view_html":"https://pith.science/pith/DVM2L6BF4HBE6YGRFU5CLY5VAF","download_json":"https://pith.science/pith/DVM2L6BF4HBE6YGRFU5CLY5VAF.json","view_paper":"https://pith.science/paper/DVM2L6BF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05912&json=true","fetch_graph":"https://pith.science/api/pith-number/DVM2L6BF4HBE6YGRFU5CLY5VAF/graph.json","fetch_events":"https://pith.science/api/pith-number/DVM2L6BF4HBE6YGRFU5CLY5VAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVM2L6BF4HBE6YGRFU5CLY5VAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVM2L6BF4HBE6YGRFU5CLY5VAF/action/storage_attestation","attest_author":"https://pith.science/pith/DVM2L6BF4HBE6YGRFU5CLY5VAF/action/author_attestation","sign_citation":"https://pith.science/pith/DVM2L6BF4HBE6YGRFU5CLY5VAF/action/citation_signature","submit_replication":"https://pith.science/pith/DVM2L6BF4HBE6YGRFU5CLY5VAF/action/replication_record"}},"created_at":"2026-05-18T02:26:44.513125+00:00","updated_at":"2026-05-18T02:26:44.513125+00:00"}