{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X6USANQ33OG462WD2WUK7ZMYO6","short_pith_number":"pith:X6USANQ3","schema_version":"1.0","canonical_sha256":"bfa920361bdb8dcf6ac3d5a8afe598778af4f5cbc5692942cb5a0a4f50709031","source":{"kind":"arxiv","id":"1907.09582","version":1},"attestation_state":"computed","paper":{"title":"The $k$-Dimensional Weisfeiler-Leman Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.LO"],"primary_cat":"cs.CC","authors_text":"Neil Immerman, Rik Sengupta","submitted_at":"2019-07-22T21:16:29Z","abstract_excerpt":"In this note, we provide details of the $k$-dimensional Weisfeiler-Leman Algorithm and its analysis from Immerman-Lander (1990). In particular, we present an optimized version of the algorithm that runs in time $O(n^{k+1}\\log n)$, where $k$ is fixed (not varying with $n$)."},"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":"1907.09582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-22T21:16:29Z","cross_cats_sorted":["cs.DS","math.LO"],"title_canon_sha256":"4a10d685869b12f34e171cdbb1c9f48a8aaa684d2645eb73ba724ca36c194030","abstract_canon_sha256":"0b90a6a70ea404ea439f914af245391b0eb71a0e11fb8ea81299c4793be021a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:52.860775Z","signature_b64":"oSidYAZqWmkNRPp8a9xxlJqv73ctwTdsFUX9hwhbE3BOg5nZTmov79m6g7psl/S1uDz/1ONk1HxgZdIVN6ZkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfa920361bdb8dcf6ac3d5a8afe598778af4f5cbc5692942cb5a0a4f50709031","last_reissued_at":"2026-05-17T23:39:52.860288Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:52.860288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $k$-Dimensional Weisfeiler-Leman Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.LO"],"primary_cat":"cs.CC","authors_text":"Neil Immerman, Rik Sengupta","submitted_at":"2019-07-22T21:16:29Z","abstract_excerpt":"In this note, we provide details of the $k$-dimensional Weisfeiler-Leman Algorithm and its analysis from Immerman-Lander (1990). In particular, we present an optimized version of the algorithm that runs in time $O(n^{k+1}\\log n)$, where $k$ is fixed (not varying with $n$)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09582","kind":"arxiv","version":1},"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":"1907.09582","created_at":"2026-05-17T23:39:52.860361+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09582v1","created_at":"2026-05-17T23:39:52.860361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09582","created_at":"2026-05-17T23:39:52.860361+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6USANQ33OG4","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6USANQ33OG462WD","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6USANQ3","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19702","citing_title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X6USANQ33OG462WD2WUK7ZMYO6","json":"https://pith.science/pith/X6USANQ33OG462WD2WUK7ZMYO6.json","graph_json":"https://pith.science/api/pith-number/X6USANQ33OG462WD2WUK7ZMYO6/graph.json","events_json":"https://pith.science/api/pith-number/X6USANQ33OG462WD2WUK7ZMYO6/events.json","paper":"https://pith.science/paper/X6USANQ3"},"agent_actions":{"view_html":"https://pith.science/pith/X6USANQ33OG462WD2WUK7ZMYO6","download_json":"https://pith.science/pith/X6USANQ33OG462WD2WUK7ZMYO6.json","view_paper":"https://pith.science/paper/X6USANQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09582&json=true","fetch_graph":"https://pith.science/api/pith-number/X6USANQ33OG462WD2WUK7ZMYO6/graph.json","fetch_events":"https://pith.science/api/pith-number/X6USANQ33OG462WD2WUK7ZMYO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6USANQ33OG462WD2WUK7ZMYO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6USANQ33OG462WD2WUK7ZMYO6/action/storage_attestation","attest_author":"https://pith.science/pith/X6USANQ33OG462WD2WUK7ZMYO6/action/author_attestation","sign_citation":"https://pith.science/pith/X6USANQ33OG462WD2WUK7ZMYO6/action/citation_signature","submit_replication":"https://pith.science/pith/X6USANQ33OG462WD2WUK7ZMYO6/action/replication_record"}},"created_at":"2026-05-17T23:39:52.860361+00:00","updated_at":"2026-05-17T23:39:52.860361+00:00"}