{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YHC2UREB47GDXIHJXWQ5NPDULV","short_pith_number":"pith:YHC2UREB","canonical_record":{"source":{"id":"1705.03686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-10T10:28:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"37ac5eb10adf72b6ccc73cd8425924b6f042a0fc55230f6c4dbeddcc9526a559","abstract_canon_sha256":"6e883f14693763692e3b3f36c143b54b152b205ff7c3418489404a71a8ca4b8b"},"schema_version":"1.0"},"canonical_sha256":"c1c5aa4481e7cc3ba0e9bda1d6bc745d7d15cb484a5eaa536cbd26da3cec8530","source":{"kind":"arxiv","id":"1705.03686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03686","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03686v1","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03686","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"YHC2UREB47GD","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YHC2UREB47GDXIHJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YHC2UREB","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YHC2UREB47GDXIHJXWQ5NPDULV","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-10T10:28:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"37ac5eb10adf72b6ccc73cd8425924b6f042a0fc55230f6c4dbeddcc9526a559","abstract_canon_sha256":"6e883f14693763692e3b3f36c143b54b152b205ff7c3418489404a71a8ca4b8b"},"schema_version":"1.0"},"canonical_sha256":"c1c5aa4481e7cc3ba0e9bda1d6bc745d7d15cb484a5eaa536cbd26da3cec8530","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:43.232563Z","signature_b64":"nlEHFUUXFXnMVeUkp7sRDgWzRaWa3DWyVwXJZLc7HVIickz618WesC7syJKzsrOLb7wGw5of/NZjSy6EIC/7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1c5aa4481e7cc3ba0e9bda1d6bc745d7d15cb484a5eaa536cbd26da3cec8530","last_reissued_at":"2026-05-18T00:44:43.231942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:43.231942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03686","source_version":1,"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-18T00:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dERInh7U0NiK7RcEbtWraP1GPv0WvEVkjEjVZUSDSW0FGNPmbLXrOcCMKy9rAvjrYXgoVpdwh1TUdX8Cbr66Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:50:30.789377Z"},"content_sha256":"e5c990c89eb35ff44d2097839e1b40ad32e8f6a0d966919634ca2a0e4e06bdc9","schema_version":"1.0","event_id":"sha256:e5c990c89eb35ff44d2097839e1b40ad32e8f6a0d966919634ca2a0e4e06bdc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YHC2UREB47GDXIHJXWQ5NPDULV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Benchmark Graphs for Practical Graph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Neuen, Pascal Schweitzer","submitted_at":"2017-05-10T10:28:17Z","abstract_excerpt":"The state-of-the-art solvers for the graph isomorphism problem can readily solve generic instances with tens of thousands of vertices. Indeed, experiments show that on inputs without particular combinatorial structure the algorithms scale almost linearly. In fact, it is non-trivial to create challenging instances for such solvers and the number of difficult benchmark graphs available is quite limited. We describe a construction to efficiently generate small instances for the graph isomorphism problem that are difficult or even infeasible for said solvers. Up to this point the only other availa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03686","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"},"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-18T00:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LRuUyvat/kN3kiW/FEkciI/syNb3Z3ysH+aCKYXP47TXO0agP9Bn+j4lshstpildka1I22Sv9ce5/I46+IxrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:50:30.790013Z"},"content_sha256":"aee4519df2c0dc0e4684519e6eae662adb5d3f5dd8bfa87ff43a29825905e89d","schema_version":"1.0","event_id":"sha256:aee4519df2c0dc0e4684519e6eae662adb5d3f5dd8bfa87ff43a29825905e89d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV/bundle.json","state_url":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHC2UREB47GDXIHJXWQ5NPDULV/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-05-26T06:50:30Z","links":{"resolver":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV","bundle":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV/bundle.json","state":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHC2UREB47GDXIHJXWQ5NPDULV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YHC2UREB47GDXIHJXWQ5NPDULV","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":"6e883f14693763692e3b3f36c143b54b152b205ff7c3418489404a71a8ca4b8b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-10T10:28:17Z","title_canon_sha256":"37ac5eb10adf72b6ccc73cd8425924b6f042a0fc55230f6c4dbeddcc9526a559"},"schema_version":"1.0","source":{"id":"1705.03686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03686","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03686v1","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03686","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"YHC2UREB47GD","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YHC2UREB47GDXIHJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YHC2UREB","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:aee4519df2c0dc0e4684519e6eae662adb5d3f5dd8bfa87ff43a29825905e89d","target":"graph","created_at":"2026-05-18T00:44:43Z","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":"The state-of-the-art solvers for the graph isomorphism problem can readily solve generic instances with tens of thousands of vertices. Indeed, experiments show that on inputs without particular combinatorial structure the algorithms scale almost linearly. In fact, it is non-trivial to create challenging instances for such solvers and the number of difficult benchmark graphs available is quite limited. We describe a construction to efficiently generate small instances for the graph isomorphism problem that are difficult or even infeasible for said solvers. Up to this point the only other availa","authors_text":"Daniel Neuen, Pascal Schweitzer","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-10T10:28:17Z","title":"Benchmark Graphs for Practical Graph Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03686","kind":"arxiv","version":1},"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:e5c990c89eb35ff44d2097839e1b40ad32e8f6a0d966919634ca2a0e4e06bdc9","target":"record","created_at":"2026-05-18T00:44:43Z","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":"6e883f14693763692e3b3f36c143b54b152b205ff7c3418489404a71a8ca4b8b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-10T10:28:17Z","title_canon_sha256":"37ac5eb10adf72b6ccc73cd8425924b6f042a0fc55230f6c4dbeddcc9526a559"},"schema_version":"1.0","source":{"id":"1705.03686","kind":"arxiv","version":1}},"canonical_sha256":"c1c5aa4481e7cc3ba0e9bda1d6bc745d7d15cb484a5eaa536cbd26da3cec8530","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1c5aa4481e7cc3ba0e9bda1d6bc745d7d15cb484a5eaa536cbd26da3cec8530","first_computed_at":"2026-05-18T00:44:43.231942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:43.231942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nlEHFUUXFXnMVeUkp7sRDgWzRaWa3DWyVwXJZLc7HVIickz618WesC7syJKzsrOLb7wGw5of/NZjSy6EIC/7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:43.232563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5c990c89eb35ff44d2097839e1b40ad32e8f6a0d966919634ca2a0e4e06bdc9","sha256:aee4519df2c0dc0e4684519e6eae662adb5d3f5dd8bfa87ff43a29825905e89d"],"state_sha256":"347e2547ff6ee1f32efa0e952d8a7089ca8f032c1007f14810dc18cca92df267"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jSH+8SCVJjKFeOk/Lu+MJHpse29zEUsaRMfzfLjNEB05KdLRlS+ib/mpN+3NbRRC1wiO+y0yrfJWYQtor039BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:50:30.793255Z","bundle_sha256":"c06100ad4f8f76e253521aa27c72bfd0521dee7fb6c412f0851a30608675cec7"}}