{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YHC2UREB47GDXIHJXWQ5NPDULV","short_pith_number":"pith:YHC2UREB","schema_version":"1.0","canonical_sha256":"c1c5aa4481e7cc3ba0e9bda1d6bc745d7d15cb484a5eaa536cbd26da3cec8530","source":{"kind":"arxiv","id":"1705.03686","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.03686","created_at":"2026-05-18T00:44:43.232040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03686v1","created_at":"2026-05-18T00:44:43.232040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03686","created_at":"2026-05-18T00:44:43.232040+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHC2UREB47GD","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHC2UREB47GDXIHJ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHC2UREB","created_at":"2026-05-18T12:31:56.362134+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/YHC2UREB47GDXIHJXWQ5NPDULV","json":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV.json","graph_json":"https://pith.science/api/pith-number/YHC2UREB47GDXIHJXWQ5NPDULV/graph.json","events_json":"https://pith.science/api/pith-number/YHC2UREB47GDXIHJXWQ5NPDULV/events.json","paper":"https://pith.science/paper/YHC2UREB"},"agent_actions":{"view_html":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV","download_json":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV.json","view_paper":"https://pith.science/paper/YHC2UREB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03686&json=true","fetch_graph":"https://pith.science/api/pith-number/YHC2UREB47GDXIHJXWQ5NPDULV/graph.json","fetch_events":"https://pith.science/api/pith-number/YHC2UREB47GDXIHJXWQ5NPDULV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV/action/storage_attestation","attest_author":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV/action/author_attestation","sign_citation":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV/action/citation_signature","submit_replication":"https://pith.science/pith/YHC2UREB47GDXIHJXWQ5NPDULV/action/replication_record"}},"created_at":"2026-05-18T00:44:43.232040+00:00","updated_at":"2026-05-18T00:44:43.232040+00:00"}