{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S5F5JH2JDRN36NX7JAFZGDTIC6","short_pith_number":"pith:S5F5JH2J","schema_version":"1.0","canonical_sha256":"974bd49f491c5bbf36ff480b930e6817a4551b8610047c1c4b6a0b558c2bb48e","source":{"kind":"arxiv","id":"1809.08154","version":2},"attestation_state":"computed","paper":{"title":"Constructing Hard Examples for Graph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Anuj Dawar, Kashif Khan","submitted_at":"2018-09-21T14:47:54Z","abstract_excerpt":"We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can have a family of graphs without any non-trivial automorphisms which also have high Weisfeiler-Leman dimension. The construction is based on properties of random 3XOR-formulas. We describe how to convert such a formula into a graph which has the desired properties with high probability. We validate the method by an experimental implementation. We construct random formulas and validate them with a SAT solver to filter "},"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":"1809.08154","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-21T14:47:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f2c63c5c647322707d3d08cc0872895911ffc89e698fde49b8b17f10c53154b3","abstract_canon_sha256":"442d0b367113e694c30282359a87f8553052a58962c95eea3318d436f4943814"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:05.477202Z","signature_b64":"BJn+f9SRJbuP3DXJDmdo3zPAqdDmK/WdDGbJASwOSzla+h/COlXGkaAuZp8lV5VX2q6yEuRRkW5DSwCScnIzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"974bd49f491c5bbf36ff480b930e6817a4551b8610047c1c4b6a0b558c2bb48e","last_reissued_at":"2026-05-17T23:51:05.476647Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:05.476647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing Hard Examples for Graph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Anuj Dawar, Kashif Khan","submitted_at":"2018-09-21T14:47:54Z","abstract_excerpt":"We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can have a family of graphs without any non-trivial automorphisms which also have high Weisfeiler-Leman dimension. The construction is based on properties of random 3XOR-formulas. We describe how to convert such a formula into a graph which has the desired properties with high probability. We validate the method by an experimental implementation. We construct random formulas and validate them with a SAT solver to filter "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08154","kind":"arxiv","version":2},"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":"1809.08154","created_at":"2026-05-17T23:51:05.476727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08154v2","created_at":"2026-05-17T23:51:05.476727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08154","created_at":"2026-05-17T23:51:05.476727+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5F5JH2JDRN3","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5F5JH2JDRN36NX7","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5F5JH2J","created_at":"2026-05-18T12:32:50.500415+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/S5F5JH2JDRN36NX7JAFZGDTIC6","json":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6.json","graph_json":"https://pith.science/api/pith-number/S5F5JH2JDRN36NX7JAFZGDTIC6/graph.json","events_json":"https://pith.science/api/pith-number/S5F5JH2JDRN36NX7JAFZGDTIC6/events.json","paper":"https://pith.science/paper/S5F5JH2J"},"agent_actions":{"view_html":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6","download_json":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6.json","view_paper":"https://pith.science/paper/S5F5JH2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08154&json=true","fetch_graph":"https://pith.science/api/pith-number/S5F5JH2JDRN36NX7JAFZGDTIC6/graph.json","fetch_events":"https://pith.science/api/pith-number/S5F5JH2JDRN36NX7JAFZGDTIC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6/action/storage_attestation","attest_author":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6/action/author_attestation","sign_citation":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6/action/citation_signature","submit_replication":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6/action/replication_record"}},"created_at":"2026-05-17T23:51:05.476727+00:00","updated_at":"2026-05-17T23:51:05.476727+00:00"}