{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B4OPMFKWTT5QHHZ2MA24W7ZUTJ","short_pith_number":"pith:B4OPMFKW","schema_version":"1.0","canonical_sha256":"0f1cf615569cfb039f3a6035cb7f349a69b8c547b9cc980c7cabdb871313329c","source":{"kind":"arxiv","id":"1806.07466","version":2},"attestation_state":"computed","paper":{"title":"A unifying method for the design of algorithms canonizing combinatorial objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Wiebking, Pascal Schweitzer","submitted_at":"2018-06-19T21:07:41Z","abstract_excerpt":"We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, hypergraphs, relational structures, codes, permutation groups, tree decompositions, and so on.\n  Our approach allows for a systematic transfer of the techniques that have been developed for isomorphism testing to canonization. We use it to design a canonization algorithm for combinatorial objects in general. This result gives new fastest canonization algorithms with an asymptotic running time matching the best known i"},"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":"1806.07466","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-19T21:07:41Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"124494f2191e33db579d8f70116d9cc551122147e4940bef3211f4bf587a8fa2","abstract_canon_sha256":"6ada3800bb84a1831e0243f2553e05b215a17bb7fc22e992b5e3a1b6cfaa69a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:11.634739Z","signature_b64":"FnyHMFtjzaOte+WyGjRUQ0yd188w7jZpwq8FTtA7egy5ctZ2VNCrh4eW3MkExek9pwOgEZr+Fe9b33nC8XPWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f1cf615569cfb039f3a6035cb7f349a69b8c547b9cc980c7cabdb871313329c","last_reissued_at":"2026-05-17T23:49:11.633815Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:11.633815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A unifying method for the design of algorithms canonizing combinatorial objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Wiebking, Pascal Schweitzer","submitted_at":"2018-06-19T21:07:41Z","abstract_excerpt":"We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, hypergraphs, relational structures, codes, permutation groups, tree decompositions, and so on.\n  Our approach allows for a systematic transfer of the techniques that have been developed for isomorphism testing to canonization. We use it to design a canonization algorithm for combinatorial objects in general. This result gives new fastest canonization algorithms with an asymptotic running time matching the best known i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07466","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":"1806.07466","created_at":"2026-05-17T23:49:11.633931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07466v2","created_at":"2026-05-17T23:49:11.633931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07466","created_at":"2026-05-17T23:49:11.633931+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4OPMFKWTT5Q","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4OPMFKWTT5QHHZ2","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4OPMFKW","created_at":"2026-05-18T12:32:13.499390+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/B4OPMFKWTT5QHHZ2MA24W7ZUTJ","json":"https://pith.science/pith/B4OPMFKWTT5QHHZ2MA24W7ZUTJ.json","graph_json":"https://pith.science/api/pith-number/B4OPMFKWTT5QHHZ2MA24W7ZUTJ/graph.json","events_json":"https://pith.science/api/pith-number/B4OPMFKWTT5QHHZ2MA24W7ZUTJ/events.json","paper":"https://pith.science/paper/B4OPMFKW"},"agent_actions":{"view_html":"https://pith.science/pith/B4OPMFKWTT5QHHZ2MA24W7ZUTJ","download_json":"https://pith.science/pith/B4OPMFKWTT5QHHZ2MA24W7ZUTJ.json","view_paper":"https://pith.science/paper/B4OPMFKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07466&json=true","fetch_graph":"https://pith.science/api/pith-number/B4OPMFKWTT5QHHZ2MA24W7ZUTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/B4OPMFKWTT5QHHZ2MA24W7ZUTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4OPMFKWTT5QHHZ2MA24W7ZUTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4OPMFKWTT5QHHZ2MA24W7ZUTJ/action/storage_attestation","attest_author":"https://pith.science/pith/B4OPMFKWTT5QHHZ2MA24W7ZUTJ/action/author_attestation","sign_citation":"https://pith.science/pith/B4OPMFKWTT5QHHZ2MA24W7ZUTJ/action/citation_signature","submit_replication":"https://pith.science/pith/B4OPMFKWTT5QHHZ2MA24W7ZUTJ/action/replication_record"}},"created_at":"2026-05-17T23:49:11.633931+00:00","updated_at":"2026-05-17T23:49:11.633931+00:00"}