{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KS2CLQVLJTWHS43E7NPB2P2XIB","short_pith_number":"pith:KS2CLQVL","canonical_record":{"source":{"id":"1811.04801","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-09T15:44:43Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"9f2da5efe0103b684e73583d88e8d0692534eac7766e6cc0c06188dbb5b31690","abstract_canon_sha256":"b502f06a5d56b6bf64d0cbd25c51d818b4b83cad1d86d8a8cdbdc1de86f1e9a7"},"schema_version":"1.0"},"canonical_sha256":"54b425c2ab4cec797364fb5e1d3f57404aa4b7d1e178ada3a02bac13188a63c8","source":{"kind":"arxiv","id":"1811.04801","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04801","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04801v3","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04801","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"KS2CLQVLJTWH","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KS2CLQVLJTWHS43E","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KS2CLQVL","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KS2CLQVLJTWHS43E7NPB2P2XIB","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04801","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-09T15:44:43Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"9f2da5efe0103b684e73583d88e8d0692534eac7766e6cc0c06188dbb5b31690","abstract_canon_sha256":"b502f06a5d56b6bf64d0cbd25c51d818b4b83cad1d86d8a8cdbdc1de86f1e9a7"},"schema_version":"1.0"},"canonical_sha256":"54b425c2ab4cec797364fb5e1d3f57404aa4b7d1e178ada3a02bac13188a63c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:03.072341Z","signature_b64":"ZKXNq6KDQxOfvZ4kE8GmW806p6JM9LgLP/akt3/ZsnQgzoUBP7axORZbin4SgOgWdkoQAynzbGHs9Z5Hp031AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54b425c2ab4cec797364fb5e1d3f57404aa4b7d1e178ada3a02bac13188a63c8","last_reissued_at":"2026-05-17T23:49:03.071711Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:03.071711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04801","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQQHZtQ3NwQeXBkko1vMhHa7O2mqx/eD6FIbKadWBQDQPxenuq/PzsY2wOntN5PnxuzMruhdiP1EFzN4qMG8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:23:10.358484Z"},"content_sha256":"2dba349ea3fd7382c4179449a240c968de7060391159b3721d3c17eb2c7382e7","schema_version":"1.0","event_id":"sha256:2dba349ea3fd7382c4179449a240c968de7060391159b3721d3c17eb2c7382e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KS2CLQVLJTWHS43E7NPB2P2XIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.DM","authors_text":"Frank Fuhlbr\\\"uck, Johannes K\\\"obler, Oleg Verbitsky, V. Arvind","submitted_at":"2018-11-09T15:44:43Z","abstract_excerpt":"The $k$-dimensional Weisfeiler-Leman algorithm ($k$-WL) is a fruitful approach to the Graph Isomorphism problem. 2-WL corresponds to the original algorithm suggested by Weisfeiler and Leman over 50 years ago. 1-WL is the classical color refinement routine. Indistinguishability by $k$-WL is an equivalence relation on graphs that is of fundamental importance for isomorphism testing, descriptive complexity theory, and graph similarity testing which is also of some relevance in artificial intelligence. Focusing on dimensions $k=1,2$, we investigate subgraph patterns whose counts are $k$-WL invaria"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04801","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1EBsAOBegL9Chz+IsvGpt2jPnAmQuM2pM9lr0XW+GXacl+GnO25wcWJURTPf95Up9mrRuyTuY1J45N7fFZP4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:23:10.359161Z"},"content_sha256":"cf3829e6cc2785ebfb2e4566723201b9f1a63428a5966e01922dfce492c9061e","schema_version":"1.0","event_id":"sha256:cf3829e6cc2785ebfb2e4566723201b9f1a63428a5966e01922dfce492c9061e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KS2CLQVLJTWHS43E7NPB2P2XIB/bundle.json","state_url":"https://pith.science/pith/KS2CLQVLJTWHS43E7NPB2P2XIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KS2CLQVLJTWHS43E7NPB2P2XIB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T14:23:10Z","links":{"resolver":"https://pith.science/pith/KS2CLQVLJTWHS43E7NPB2P2XIB","bundle":"https://pith.science/pith/KS2CLQVLJTWHS43E7NPB2P2XIB/bundle.json","state":"https://pith.science/pith/KS2CLQVLJTWHS43E7NPB2P2XIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KS2CLQVLJTWHS43E7NPB2P2XIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KS2CLQVLJTWHS43E7NPB2P2XIB","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":"b502f06a5d56b6bf64d0cbd25c51d818b4b83cad1d86d8a8cdbdc1de86f1e9a7","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-09T15:44:43Z","title_canon_sha256":"9f2da5efe0103b684e73583d88e8d0692534eac7766e6cc0c06188dbb5b31690"},"schema_version":"1.0","source":{"id":"1811.04801","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04801","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04801v3","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04801","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"KS2CLQVLJTWH","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KS2CLQVLJTWHS43E","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KS2CLQVL","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:cf3829e6cc2785ebfb2e4566723201b9f1a63428a5966e01922dfce492c9061e","target":"graph","created_at":"2026-05-17T23:49:03Z","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":"The $k$-dimensional Weisfeiler-Leman algorithm ($k$-WL) is a fruitful approach to the Graph Isomorphism problem. 2-WL corresponds to the original algorithm suggested by Weisfeiler and Leman over 50 years ago. 1-WL is the classical color refinement routine. Indistinguishability by $k$-WL is an equivalence relation on graphs that is of fundamental importance for isomorphism testing, descriptive complexity theory, and graph similarity testing which is also of some relevance in artificial intelligence. Focusing on dimensions $k=1,2$, we investigate subgraph patterns whose counts are $k$-WL invaria","authors_text":"Frank Fuhlbr\\\"uck, Johannes K\\\"obler, Oleg Verbitsky, V. Arvind","cross_cats":["cs.CC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-09T15:44:43Z","title":"On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04801","kind":"arxiv","version":3},"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:2dba349ea3fd7382c4179449a240c968de7060391159b3721d3c17eb2c7382e7","target":"record","created_at":"2026-05-17T23:49:03Z","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":"b502f06a5d56b6bf64d0cbd25c51d818b4b83cad1d86d8a8cdbdc1de86f1e9a7","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-09T15:44:43Z","title_canon_sha256":"9f2da5efe0103b684e73583d88e8d0692534eac7766e6cc0c06188dbb5b31690"},"schema_version":"1.0","source":{"id":"1811.04801","kind":"arxiv","version":3}},"canonical_sha256":"54b425c2ab4cec797364fb5e1d3f57404aa4b7d1e178ada3a02bac13188a63c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54b425c2ab4cec797364fb5e1d3f57404aa4b7d1e178ada3a02bac13188a63c8","first_computed_at":"2026-05-17T23:49:03.071711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:03.071711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZKXNq6KDQxOfvZ4kE8GmW806p6JM9LgLP/akt3/ZsnQgzoUBP7axORZbin4SgOgWdkoQAynzbGHs9Z5Hp031AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:03.072341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04801","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dba349ea3fd7382c4179449a240c968de7060391159b3721d3c17eb2c7382e7","sha256:cf3829e6cc2785ebfb2e4566723201b9f1a63428a5966e01922dfce492c9061e"],"state_sha256":"0df50ea207d1ea4a1b63d693542b16c46b48764f6b5c063a73aa407313aee2d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFWNIuFL1coCgvw7wy5KVyYMAB/uVBm5mICvlGcFws11SAJI994KbrQRhfNN66eLhjg7AoHkVjMxMy/MdxgwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:23:10.362746Z","bundle_sha256":"067d761f3ed8534dbba62ce9eddb6a03f916c2be82ca2dbe7ade01761ffb9f4c"}}