{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S5F5JH2JDRN36NX7JAFZGDTIC6","short_pith_number":"pith:S5F5JH2J","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"},"canonical_sha256":"974bd49f491c5bbf36ff480b930e6817a4551b8610047c1c4b6a0b558c2bb48e","source":{"kind":"arxiv","id":"1809.08154","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08154","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08154v2","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08154","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"S5F5JH2JDRN3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S5F5JH2JDRN36NX7","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S5F5JH2J","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S5F5JH2JDRN36NX7JAFZGDTIC6","target":"record","payload":{"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"},"canonical_sha256":"974bd49f491c5bbf36ff480b930e6817a4551b8610047c1c4b6a0b558c2bb48e","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"},"source_kind":"arxiv","source_id":"1809.08154","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QqIvdmW19h574PNtzlzVgqRiADhcx3H78v29DIykW2swXJ9TD13bDTkl/EBAdfRCRuid/5Q/4Q58ewAjfRmkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:55:16.200950Z"},"content_sha256":"8895126394676f20c7b624940a01d8b4f016ec442f78a102a82b8e74df1edfd6","schema_version":"1.0","event_id":"sha256:8895126394676f20c7b624940a01d8b4f016ec442f78a102a82b8e74df1edfd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S5F5JH2JDRN36NX7JAFZGDTIC6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1yeP6U3RDMYOzgFb1ZZyFxd0mCsxNk6ZM7RfjXMMc1SkY0odcZ0Qw3U667QPXtoBIiIcQfJyDqx0JlGfscRtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:55:16.201296Z"},"content_sha256":"49cb4961a3d03ec6598c8bc97d582cfed38370114749221dcfe69775df250d48","schema_version":"1.0","event_id":"sha256:49cb4961a3d03ec6598c8bc97d582cfed38370114749221dcfe69775df250d48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6/bundle.json","state_url":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5F5JH2JDRN36NX7JAFZGDTIC6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T12:55:16Z","links":{"resolver":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6","bundle":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6/bundle.json","state":"https://pith.science/pith/S5F5JH2JDRN36NX7JAFZGDTIC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5F5JH2JDRN36NX7JAFZGDTIC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S5F5JH2JDRN36NX7JAFZGDTIC6","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":"442d0b367113e694c30282359a87f8553052a58962c95eea3318d436f4943814","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-21T14:47:54Z","title_canon_sha256":"f2c63c5c647322707d3d08cc0872895911ffc89e698fde49b8b17f10c53154b3"},"schema_version":"1.0","source":{"id":"1809.08154","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08154","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08154v2","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08154","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"S5F5JH2JDRN3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S5F5JH2JDRN36NX7","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S5F5JH2J","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:49cb4961a3d03ec6598c8bc97d582cfed38370114749221dcfe69775df250d48","target":"graph","created_at":"2026-05-17T23:51:05Z","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":"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 ","authors_text":"Anuj Dawar, Kashif Khan","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-21T14:47:54Z","title":"Constructing Hard Examples for Graph Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08154","kind":"arxiv","version":2},"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:8895126394676f20c7b624940a01d8b4f016ec442f78a102a82b8e74df1edfd6","target":"record","created_at":"2026-05-17T23:51:05Z","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":"442d0b367113e694c30282359a87f8553052a58962c95eea3318d436f4943814","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-21T14:47:54Z","title_canon_sha256":"f2c63c5c647322707d3d08cc0872895911ffc89e698fde49b8b17f10c53154b3"},"schema_version":"1.0","source":{"id":"1809.08154","kind":"arxiv","version":2}},"canonical_sha256":"974bd49f491c5bbf36ff480b930e6817a4551b8610047c1c4b6a0b558c2bb48e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"974bd49f491c5bbf36ff480b930e6817a4551b8610047c1c4b6a0b558c2bb48e","first_computed_at":"2026-05-17T23:51:05.476647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:05.476647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BJn+f9SRJbuP3DXJDmdo3zPAqdDmK/WdDGbJASwOSzla+h/COlXGkaAuZp8lV5VX2q6yEuRRkW5DSwCScnIzAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:05.477202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08154","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8895126394676f20c7b624940a01d8b4f016ec442f78a102a82b8e74df1edfd6","sha256:49cb4961a3d03ec6598c8bc97d582cfed38370114749221dcfe69775df250d48"],"state_sha256":"f7298895ac16812686842a3920a644973ee75926a8dadc713ab02e4ecbfa4ef8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m2mU1BrCHsjksCIs4SkU/Qu9SvM5v325Vmoblg8reF20REJTIup8hgSY3Wd9MO8KohjpPk9nNfBT3HOD9hszAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:55:16.203488Z","bundle_sha256":"7353c33715a5555f4a908b073f5874e49922a355daf869aedc6ffe528dfa613d"}}