{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ELMUCLIFRYCSZ6KAYYDJ4OKA46","short_pith_number":"pith:ELMUCLIF","schema_version":"1.0","canonical_sha256":"22d9412d058e052cf940c6069e3940e7acfad633378aae2a75e3c27039461461","source":{"kind":"arxiv","id":"1101.5211","version":1},"attestation_state":"computed","paper":{"title":"The Weisfeiler-Lehman Method and Graph Isomorphism Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B. L. Douglas","submitted_at":"2011-01-27T05:51:11Z","abstract_excerpt":"Properties of the `$k$-equivalent' graph families constructed in Cai, F\\\"{u}rer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive $k$-dim WL method. An extension to the recursive $k$-dim WL method is presented that is shown to efficiently characterise all such types of `counterexample' graphs, under certain assumptions. These assumptions are shown to hold in all known cases."},"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":"1101.5211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-27T05:51:11Z","cross_cats_sorted":[],"title_canon_sha256":"256ebe2d839683764695636134bb90fab7a54428cbb319647968f6eeef43a86c","abstract_canon_sha256":"afe2ae3b03ff6fd1c5be63ba711c57642d62b3dad722614224447d374e26764b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:35.919392Z","signature_b64":"qLLxUzcQt6vmvezfkjZWqdpKF/WAdfB7FliGAozpVbkntLkT8JqrhwJcJb+k38SMsOp0eLpEXob5pZlPbYdiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22d9412d058e052cf940c6069e3940e7acfad633378aae2a75e3c27039461461","last_reissued_at":"2026-05-18T04:30:35.918775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:35.918775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Weisfeiler-Lehman Method and Graph Isomorphism Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B. L. Douglas","submitted_at":"2011-01-27T05:51:11Z","abstract_excerpt":"Properties of the `$k$-equivalent' graph families constructed in Cai, F\\\"{u}rer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive $k$-dim WL method. An extension to the recursive $k$-dim WL method is presented that is shown to efficiently characterise all such types of `counterexample' graphs, under certain assumptions. These assumptions are shown to hold in all known cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5211","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":"1101.5211","created_at":"2026-05-18T04:30:35.918876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5211v1","created_at":"2026-05-18T04:30:35.918876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5211","created_at":"2026-05-18T04:30:35.918876+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELMUCLIFRYCS","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELMUCLIFRYCSZ6KA","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELMUCLIF","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1810.00826","citing_title":"How Powerful are Graph Neural Networks?","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"1609.02907","citing_title":"Semi-Supervised Classification with Graph Convolutional Networks","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ELMUCLIFRYCSZ6KAYYDJ4OKA46","json":"https://pith.science/pith/ELMUCLIFRYCSZ6KAYYDJ4OKA46.json","graph_json":"https://pith.science/api/pith-number/ELMUCLIFRYCSZ6KAYYDJ4OKA46/graph.json","events_json":"https://pith.science/api/pith-number/ELMUCLIFRYCSZ6KAYYDJ4OKA46/events.json","paper":"https://pith.science/paper/ELMUCLIF"},"agent_actions":{"view_html":"https://pith.science/pith/ELMUCLIFRYCSZ6KAYYDJ4OKA46","download_json":"https://pith.science/pith/ELMUCLIFRYCSZ6KAYYDJ4OKA46.json","view_paper":"https://pith.science/paper/ELMUCLIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5211&json=true","fetch_graph":"https://pith.science/api/pith-number/ELMUCLIFRYCSZ6KAYYDJ4OKA46/graph.json","fetch_events":"https://pith.science/api/pith-number/ELMUCLIFRYCSZ6KAYYDJ4OKA46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELMUCLIFRYCSZ6KAYYDJ4OKA46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELMUCLIFRYCSZ6KAYYDJ4OKA46/action/storage_attestation","attest_author":"https://pith.science/pith/ELMUCLIFRYCSZ6KAYYDJ4OKA46/action/author_attestation","sign_citation":"https://pith.science/pith/ELMUCLIFRYCSZ6KAYYDJ4OKA46/action/citation_signature","submit_replication":"https://pith.science/pith/ELMUCLIFRYCSZ6KAYYDJ4OKA46/action/replication_record"}},"created_at":"2026-05-18T04:30:35.918876+00:00","updated_at":"2026-05-18T04:30:35.918876+00:00"}