{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OQSGKZMZB227BOJ7GTDIY3IYBX","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":"0a3ef8ec108f42f838cc3128e58401b1502bec38563952685271deffa002e3e9","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-28T09:36:08Z","title_canon_sha256":"9fedd9de13e90ab5b82b92f6ec4093d25eadd676418a892e4e4d1bd8e8255a9c"},"schema_version":"1.0","source":{"id":"1509.08251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08251","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08251v1","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08251","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"OQSGKZMZB227","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OQSGKZMZB227BOJ7","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OQSGKZMZ","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:7c0222cd5ae27dd12fd06e62e95ef7614bcfea19f0bedb79c636fe2c91decef5","target":"graph","created_at":"2026-05-18T01:31:54Z","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":"An assignment of colours to the vertices of a graph is stable if any two vertices of the same colour have identically coloured neighbourhoods. The goal of colour refinement is to find a stable colouring that uses a minimum number of colours. This is a widely used subroutine for graph isomorphism testing algorithms, since any automorphism needs to be colour preserving. We give an $O((m+n)\\log n)$ algorithm for finding a canonical version of such a stable colouring, on graphs with $n$ vertices and $m$ edges. We show that no faster algorithm is possible, under some modest assumptions about the ty","authors_text":"Christoph Berkholz, Martin Grohe, Paul Bonsma","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-28T09:36:08Z","title":"Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08251","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:10c6d0538446a34f37c77a3515f3f1696323c51f7bcedc99c130598cdbc91355","target":"record","created_at":"2026-05-18T01:31:54Z","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":"0a3ef8ec108f42f838cc3128e58401b1502bec38563952685271deffa002e3e9","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-28T09:36:08Z","title_canon_sha256":"9fedd9de13e90ab5b82b92f6ec4093d25eadd676418a892e4e4d1bd8e8255a9c"},"schema_version":"1.0","source":{"id":"1509.08251","kind":"arxiv","version":1}},"canonical_sha256":"74246565990eb5f0b93f34c68c6d180dfff99cca4f8fea8b20722a6bf59d93ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74246565990eb5f0b93f34c68c6d180dfff99cca4f8fea8b20722a6bf59d93ee","first_computed_at":"2026-05-18T01:31:54.309850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:54.309850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S31ihACMpQRE+uXDDwtqP1iEu6H8dHA6ToqKlPfFVe13qHGlkOq70kiLbooqQiG21jXNNes/n1aIHyqgcmeJBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:54.310442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10c6d0538446a34f37c77a3515f3f1696323c51f7bcedc99c130598cdbc91355","sha256:7c0222cd5ae27dd12fd06e62e95ef7614bcfea19f0bedb79c636fe2c91decef5"],"state_sha256":"fb84be1433ea4f8a73c8bbaf236fb7363cef800861bb3598e2395dbb810afdd1"}