{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C3S2RPII2LJ66CCNLSEDJXF6WN","short_pith_number":"pith:C3S2RPII","schema_version":"1.0","canonical_sha256":"16e5a8bd08d2d3ef084d5c8834dcbeb35f0c3109fd4f9b856c88b7b2b245eb91","source":{"kind":"arxiv","id":"1607.04287","version":1},"attestation_state":"computed","paper":{"title":"Linear Diophantine Equations, Group CSPs, and Graph Isomorphism","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":"2016-07-14T20:00:11Z","abstract_excerpt":"In recent years, we have seen several approaches to the graph isomorphism problem based on \"generic\" mathematical programming or algebraic (Gr\\\"obner basis) techniques. For most of these, lower bounds have been established. In fact, it has been shown that the pairs of nonisomorphic CFI-graphs (introduced by Cai, F\\\"urer, and Immerman in 1992 as hard examples for the combinatorial Weisfeiler-Leman algorithm) cannot be distinguished by these mathematical algorithms. A notable exception were the algebraic algorithms over the field GF(2), for which no lower bound was known. Another, in some way ev"},"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":"1607.04287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-14T20:00:11Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"c5bcbc088ed8676112138f4d9e9025a91dd529da900bfe0f802d825e4da31fd1","abstract_canon_sha256":"c0a960fae41ed315a45d3645e66fb74a8164e4370236eb4b799d324f3fbb6da1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:01.580906Z","signature_b64":"sDzWwoq09HMnvnYZDB4PLDFBVDTfEBdiDDsUakm36WvfDgckxUct0dni2IAfyrJpy6TtYqqVfPEy4lIp0S9lAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16e5a8bd08d2d3ef084d5c8834dcbeb35f0c3109fd4f9b856c88b7b2b245eb91","last_reissued_at":"2026-05-18T01:11:01.580449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:01.580449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Diophantine Equations, Group CSPs, and Graph Isomorphism","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":"2016-07-14T20:00:11Z","abstract_excerpt":"In recent years, we have seen several approaches to the graph isomorphism problem based on \"generic\" mathematical programming or algebraic (Gr\\\"obner basis) techniques. For most of these, lower bounds have been established. In fact, it has been shown that the pairs of nonisomorphic CFI-graphs (introduced by Cai, F\\\"urer, and Immerman in 1992 as hard examples for the combinatorial Weisfeiler-Leman algorithm) cannot be distinguished by these mathematical algorithms. A notable exception were the algebraic algorithms over the field GF(2), for which no lower bound was known. Another, in some way ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04287","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":"1607.04287","created_at":"2026-05-18T01:11:01.580524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04287v1","created_at":"2026-05-18T01:11:01.580524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04287","created_at":"2026-05-18T01:11:01.580524+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3S2RPII2LJ6","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3S2RPII2LJ66CCN","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3S2RPII","created_at":"2026-05-18T12:30:09.641336+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/C3S2RPII2LJ66CCNLSEDJXF6WN","json":"https://pith.science/pith/C3S2RPII2LJ66CCNLSEDJXF6WN.json","graph_json":"https://pith.science/api/pith-number/C3S2RPII2LJ66CCNLSEDJXF6WN/graph.json","events_json":"https://pith.science/api/pith-number/C3S2RPII2LJ66CCNLSEDJXF6WN/events.json","paper":"https://pith.science/paper/C3S2RPII"},"agent_actions":{"view_html":"https://pith.science/pith/C3S2RPII2LJ66CCNLSEDJXF6WN","download_json":"https://pith.science/pith/C3S2RPII2LJ66CCNLSEDJXF6WN.json","view_paper":"https://pith.science/paper/C3S2RPII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04287&json=true","fetch_graph":"https://pith.science/api/pith-number/C3S2RPII2LJ66CCNLSEDJXF6WN/graph.json","fetch_events":"https://pith.science/api/pith-number/C3S2RPII2LJ66CCNLSEDJXF6WN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3S2RPII2LJ66CCNLSEDJXF6WN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3S2RPII2LJ66CCNLSEDJXF6WN/action/storage_attestation","attest_author":"https://pith.science/pith/C3S2RPII2LJ66CCNLSEDJXF6WN/action/author_attestation","sign_citation":"https://pith.science/pith/C3S2RPII2LJ66CCNLSEDJXF6WN/action/citation_signature","submit_replication":"https://pith.science/pith/C3S2RPII2LJ66CCNLSEDJXF6WN/action/replication_record"}},"created_at":"2026-05-18T01:11:01.580524+00:00","updated_at":"2026-05-18T01:11:01.580524+00:00"}