{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B4OPMFKWTT5QHHZ2MA24W7ZUTJ","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":"6ada3800bb84a1831e0243f2553e05b215a17bb7fc22e992b5e3a1b6cfaa69a9","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-19T21:07:41Z","title_canon_sha256":"124494f2191e33db579d8f70116d9cc551122147e4940bef3211f4bf587a8fa2"},"schema_version":"1.0","source":{"id":"1806.07466","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07466","created_at":"2026-05-17T23:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07466v2","created_at":"2026-05-17T23:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07466","created_at":"2026-05-17T23:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"B4OPMFKWTT5Q","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B4OPMFKWTT5QHHZ2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B4OPMFKW","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:c8dea712659dde070eee20d2f562f9a0b3498af4ec420e7900d4a446e82a0286","target":"graph","created_at":"2026-05-17T23:49:11Z","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 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","authors_text":"Daniel Wiebking, Pascal Schweitzer","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-19T21:07:41Z","title":"A unifying method for the design of algorithms canonizing combinatorial objects"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07466","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:a1f00acdbfc63bb498ddd5ae81240fc33c61f4642a6760a9e7c858f85ae5423d","target":"record","created_at":"2026-05-17T23:49:11Z","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":"6ada3800bb84a1831e0243f2553e05b215a17bb7fc22e992b5e3a1b6cfaa69a9","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-19T21:07:41Z","title_canon_sha256":"124494f2191e33db579d8f70116d9cc551122147e4940bef3211f4bf587a8fa2"},"schema_version":"1.0","source":{"id":"1806.07466","kind":"arxiv","version":2}},"canonical_sha256":"0f1cf615569cfb039f3a6035cb7f349a69b8c547b9cc980c7cabdb871313329c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f1cf615569cfb039f3a6035cb7f349a69b8c547b9cc980c7cabdb871313329c","first_computed_at":"2026-05-17T23:49:11.633815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:11.633815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FnyHMFtjzaOte+WyGjRUQ0yd188w7jZpwq8FTtA7egy5ctZ2VNCrh4eW3MkExek9pwOgEZr+Fe9b33nC8XPWBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:11.634739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07466","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1f00acdbfc63bb498ddd5ae81240fc33c61f4642a6760a9e7c858f85ae5423d","sha256:c8dea712659dde070eee20d2f562f9a0b3498af4ec420e7900d4a446e82a0286"],"state_sha256":"0908818421248f9cfa439d284c02744900aea2c3aa2bd1de0feac5b222dec3b3"}