{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5V7YLIVJYFVRMBFL62SKNLGPY2","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":"166fdadd594b867e4e3c009970fb686f650a1e378a5c0315c826e338d7c1b381","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-14T17:49:29Z","title_canon_sha256":"8d4bc6adf0d204923e4485d80edff1c182d0af434d70e916cca241b9726ecfd7"},"schema_version":"1.0","source":{"id":"1908.05268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05268","created_at":"2026-07-05T04:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05268v2","created_at":"2026-07-05T04:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05268","created_at":"2026-07-05T04:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"5V7YLIVJYFVR","created_at":"2026-07-05T04:40:41Z"},{"alias_kind":"pith_short_16","alias_value":"5V7YLIVJYFVRMBFL","created_at":"2026-07-05T04:40:41Z"},{"alias_kind":"pith_short_8","alias_value":"5V7YLIVJ","created_at":"2026-07-05T04:40:41Z"}],"graph_snapshots":[{"event_id":"sha256:632003fe57fbe7a31f6afe0296c2a6f6698e8f3c7ed4b06014187228b6562b07","target":"graph","created_at":"2026-07-05T04:40:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05268/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Weisfeiler-Leman procedure is a widely-used technique for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples. Meanwhile, a fundamental tool in structural graph theory, which is often exploited in approaches to tackle the graph isomorphism problem, is the decomposition into 2- and 3-connected components.\n  We prove that the 2-dimensional Weisfeiler-Leman algorithm implicitly computes the decomposition of a graph into its 3-connected components. This implies that the dimension of the algorithm needed to distinguish two given non-i","authors_text":"Daniel Neuen, Sandra Kiefer","cross_cats":["cs.LO","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05268","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:2a170910927a304049ec6b7fa5168846723841321ce5bb52902fdb6e8cbc0496","target":"record","created_at":"2026-07-05T04:40:41Z","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":"166fdadd594b867e4e3c009970fb686f650a1e378a5c0315c826e338d7c1b381","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-14T17:49:29Z","title_canon_sha256":"8d4bc6adf0d204923e4485d80edff1c182d0af434d70e916cca241b9726ecfd7"},"schema_version":"1.0","source":{"id":"1908.05268","kind":"arxiv","version":2}},"canonical_sha256":"ed7f85a2a9c16b1604abf6a4a6accfc6a6cc8d0ec061e930d1773beb385564a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed7f85a2a9c16b1604abf6a4a6accfc6a6cc8d0ec061e930d1773beb385564a6","first_computed_at":"2026-07-05T04:40:41.885661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:40:41.885661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5z9/2+vHR33PyvPh34+Bv9bGSsdxEjWjrg9Ei8v5sfCxUgobi8AKR/hnJ68nPEaDA5OWtCXXP8UrmxzgHTe5Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:40:41.886014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a170910927a304049ec6b7fa5168846723841321ce5bb52902fdb6e8cbc0496","sha256:632003fe57fbe7a31f6afe0296c2a6f6698e8f3c7ed4b06014187228b6562b07"],"state_sha256":"c377fff22a775757c18ef952591900a174feb2c70dfaf70e92de1426d2c3879e"}