{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LPS5TBRGTIWU7ELFMZHFSM5HZC","short_pith_number":"pith:LPS5TBRG","canonical_record":{"source":{"id":"2605.00725","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-01T15:19:40Z","cross_cats_sorted":[],"title_canon_sha256":"56cff3031d4c4a74d444e4542dfc16da40597f4f9e8516f95146106f44b69a3f","abstract_canon_sha256":"5d8255e42472a9c9b110513e6ef537bf6b6154aa31d6cac8fe1e317edde4ee00"},"schema_version":"1.0"},"canonical_sha256":"5be5d986269a2d4f9165664e5933a7c89cdd65b02d55235b711dae6484db6402","source":{"kind":"arxiv","id":"2605.00725","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.00725","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.00725v2","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00725","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_12","alias_value":"LPS5TBRGTIWU","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_16","alias_value":"LPS5TBRGTIWU7ELF","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_8","alias_value":"LPS5TBRG","created_at":"2026-06-19T16:09:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LPS5TBRGTIWU7ELFMZHFSM5HZC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.00725","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-01T15:19:40Z","cross_cats_sorted":[],"title_canon_sha256":"56cff3031d4c4a74d444e4542dfc16da40597f4f9e8516f95146106f44b69a3f","abstract_canon_sha256":"5d8255e42472a9c9b110513e6ef537bf6b6154aa31d6cac8fe1e317edde4ee00"},"schema_version":"1.0"},"canonical_sha256":"5be5d986269a2d4f9165664e5933a7c89cdd65b02d55235b711dae6484db6402","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:58.762807Z","signature_b64":"m7aX1fyPHLUaYTmTtC0sFOVCdQQj/F9teRwugX8WIPRbExmdxSRtDdwMiLGHi1xr4BOSQT76EaeffzJKVV12Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5be5d986269a2d4f9165664e5933a7c89cdd65b02d55235b711dae6484db6402","last_reissued_at":"2026-06-19T16:09:58.762305Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:58.762305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.00725","source_version":2,"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-06-19T16:09:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mKAdLWPcN4KGwnKXSRQoCFEuER2jKoUJur1chY1FQgvI5s6mOdnnVLH7EjuBCZgwlOpCAOV2zJBrigWPciLaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T14:33:50.870128Z"},"content_sha256":"5073f51fbab45f8a3751c7d61c0545e52557aa98e159029ffc16a0db4b629732","schema_version":"1.0","event_id":"sha256:5073f51fbab45f8a3751c7d61c0545e52557aa98e159029ffc16a0db4b629732"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LPS5TBRGTIWU7ELFMZHFSM5HZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weisfeiler Lehman Test on Combinatorial Complexes: Generalized Expressive Power of Topological Neural Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Upper and lower neighborhoods suffice to achieve the full expressive power of the Combinatorial Complex Weisfeiler-Lehman test.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Duxin Chen, Jiawen Chen, Qi Shao, Wenwu Yu, Zhiqiang Ge","submitted_at":"2026-05-01T15:19:40Z","abstract_excerpt":"Topological neural networks have emerged as effective tools for modeling higher-order relational structures beyond pairwise graphs, including hypergraphs, simplicial complexes, and cell complexes. However, existing Weisfeiler-Leman type expressivity analyses are typically developed on different structural domains and rely on domain-specific neighborhood systems, making their expressive powers difficult to compare within a common formalism. In this paper, we introduce the Combinatorial Complex Weisfeiler-Leman (CCWL) framework, a unified expressive power refinement defined on combinatorial comp"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We further prove that upper and lower neighborhoods are sufficient among the four adjacent WL tests to reach the expressivity of the full CCWL framework across topological structures of combinatorial complexes.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the four neighborhood relations defined in the combinatorial complex framework are exhaustive and that the axiomatic extension of the WL test preserves all relevant topological distinctions without additional constraints on the complexes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The Combinatorial Complex Weisfeiler-Lehman test unifies expressive-power analysis for topological neural networks on combinatorial complexes, with a proof that upper and lower neighborhoods suffice for maximum expressivity.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Upper and lower neighborhoods suffice to achieve the full expressive power of the Combinatorial Complex Weisfeiler-Lehman test.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9ee41978891ccf9295534861fe60c09bdbf017a8698ec3fbb4f6ee6bdf513411"},"source":{"id":"2605.00725","kind":"arxiv","version":2},"verdict":{"id":"18714f65-1ad4-450a-b957-a7727e7c5ddc","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T19:17:22.826297Z","strongest_claim":"We further prove that upper and lower neighborhoods are sufficient among the four adjacent WL tests to reach the expressivity of the full CCWL framework across topological structures of combinatorial complexes.","one_line_summary":"The Combinatorial Complex Weisfeiler-Lehman test unifies expressive-power analysis for topological neural networks on combinatorial complexes, with a proof that upper and lower neighborhoods suffice for maximum expressivity.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the four neighborhood relations defined in the combinatorial complex framework are exhaustive and that the axiomatic extension of the WL test preserves all relevant topological distinctions without additional constraints on the complexes.","pith_extraction_headline":"Upper and lower neighborhoods suffice to achieve the full expressive power of the Combinatorial Complex Weisfeiler-Lehman test."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.00725/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T19:36:16.678470Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"fcaecd07ed696c7f019984acbb26b9d0a64561e7a7b1a8f42c7c8016837e7f99"},"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":"18714f65-1ad4-450a-b957-a7727e7c5ddc"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:09:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxKcgq2Gs0l1b0qLDJ2Kir0HDJbO1AtWxDe49vR6Pvk22udnebinyWV20FEpRrsvhzU5oX+XuudSbQB0kKIwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T14:33:50.870603Z"},"content_sha256":"04802526520a9466f506668a564f5cdda4feb54bbe6c6095ccef57f2ce1ca9e2","schema_version":"1.0","event_id":"sha256:04802526520a9466f506668a564f5cdda4feb54bbe6c6095ccef57f2ce1ca9e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPS5TBRGTIWU7ELFMZHFSM5HZC/bundle.json","state_url":"https://pith.science/pith/LPS5TBRGTIWU7ELFMZHFSM5HZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPS5TBRGTIWU7ELFMZHFSM5HZC/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-07-03T14:33:50Z","links":{"resolver":"https://pith.science/pith/LPS5TBRGTIWU7ELFMZHFSM5HZC","bundle":"https://pith.science/pith/LPS5TBRGTIWU7ELFMZHFSM5HZC/bundle.json","state":"https://pith.science/pith/LPS5TBRGTIWU7ELFMZHFSM5HZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPS5TBRGTIWU7ELFMZHFSM5HZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LPS5TBRGTIWU7ELFMZHFSM5HZC","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":"5d8255e42472a9c9b110513e6ef537bf6b6154aa31d6cac8fe1e317edde4ee00","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-01T15:19:40Z","title_canon_sha256":"56cff3031d4c4a74d444e4542dfc16da40597f4f9e8516f95146106f44b69a3f"},"schema_version":"1.0","source":{"id":"2605.00725","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.00725","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.00725v2","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00725","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_12","alias_value":"LPS5TBRGTIWU","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_16","alias_value":"LPS5TBRGTIWU7ELF","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_8","alias_value":"LPS5TBRG","created_at":"2026-06-19T16:09:58Z"}],"graph_snapshots":[{"event_id":"sha256:04802526520a9466f506668a564f5cdda4feb54bbe6c6095ccef57f2ce1ca9e2","target":"graph","created_at":"2026-06-19T16:09:58Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We further prove that upper and lower neighborhoods are sufficient among the four adjacent WL tests to reach the expressivity of the full CCWL framework across topological structures of combinatorial complexes."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the four neighborhood relations defined in the combinatorial complex framework are exhaustive and that the axiomatic extension of the WL test preserves all relevant topological distinctions without additional constraints on the complexes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The Combinatorial Complex Weisfeiler-Lehman test unifies expressive-power analysis for topological neural networks on combinatorial complexes, with a proof that upper and lower neighborhoods suffice for maximum expressivity."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Upper and lower neighborhoods suffice to achieve the full expressive power of the Combinatorial Complex Weisfeiler-Lehman test."}],"snapshot_sha256":"9ee41978891ccf9295534861fe60c09bdbf017a8698ec3fbb4f6ee6bdf513411"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T19:36:16.678470Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.00725/integrity.json","findings":[],"snapshot_sha256":"fcaecd07ed696c7f019984acbb26b9d0a64561e7a7b1a8f42c7c8016837e7f99","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Topological neural networks have emerged as effective tools for modeling higher-order relational structures beyond pairwise graphs, including hypergraphs, simplicial complexes, and cell complexes. However, existing Weisfeiler-Leman type expressivity analyses are typically developed on different structural domains and rely on domain-specific neighborhood systems, making their expressive powers difficult to compare within a common formalism. In this paper, we introduce the Combinatorial Complex Weisfeiler-Leman (CCWL) framework, a unified expressive power refinement defined on combinatorial comp","authors_text":"Duxin Chen, Jiawen Chen, Qi Shao, Wenwu Yu, Zhiqiang Ge","cross_cats":[],"headline":"Upper and lower neighborhoods suffice to achieve the full expressive power of the Combinatorial Complex Weisfeiler-Lehman test.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-01T15:19:40Z","title":"Weisfeiler Lehman Test on Combinatorial Complexes: Generalized Expressive Power of Topological Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.00725","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-09T19:17:22.826297Z","id":"18714f65-1ad4-450a-b957-a7727e7c5ddc","model_set":{"reader":"grok-4.3"},"one_line_summary":"The Combinatorial Complex Weisfeiler-Lehman test unifies expressive-power analysis for topological neural networks on combinatorial complexes, with a proof that upper and lower neighborhoods suffice for maximum expressivity.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Upper and lower neighborhoods suffice to achieve the full expressive power of the Combinatorial Complex Weisfeiler-Lehman test.","strongest_claim":"We further prove that upper and lower neighborhoods are sufficient among the four adjacent WL tests to reach the expressivity of the full CCWL framework across topological structures of combinatorial complexes.","weakest_assumption":"That the four neighborhood relations defined in the combinatorial complex framework are exhaustive and that the axiomatic extension of the WL test preserves all relevant topological distinctions without additional constraints on the complexes."}},"verdict_id":"18714f65-1ad4-450a-b957-a7727e7c5ddc"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5073f51fbab45f8a3751c7d61c0545e52557aa98e159029ffc16a0db4b629732","target":"record","created_at":"2026-06-19T16:09:58Z","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":"5d8255e42472a9c9b110513e6ef537bf6b6154aa31d6cac8fe1e317edde4ee00","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-01T15:19:40Z","title_canon_sha256":"56cff3031d4c4a74d444e4542dfc16da40597f4f9e8516f95146106f44b69a3f"},"schema_version":"1.0","source":{"id":"2605.00725","kind":"arxiv","version":2}},"canonical_sha256":"5be5d986269a2d4f9165664e5933a7c89cdd65b02d55235b711dae6484db6402","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5be5d986269a2d4f9165664e5933a7c89cdd65b02d55235b711dae6484db6402","first_computed_at":"2026-06-19T16:09:58.762305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:09:58.762305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m7aX1fyPHLUaYTmTtC0sFOVCdQQj/F9teRwugX8WIPRbExmdxSRtDdwMiLGHi1xr4BOSQT76EaeffzJKVV12Aw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:09:58.762807Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.00725","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5073f51fbab45f8a3751c7d61c0545e52557aa98e159029ffc16a0db4b629732","sha256:04802526520a9466f506668a564f5cdda4feb54bbe6c6095ccef57f2ce1ca9e2"],"state_sha256":"050ef54a5edd1b97e42dd6ea523bc9703ddaa91b1ed95cce5c6f5ecbd2bfc242"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxFqfv92HNQbHINphEcPRVG6nZncFI2Lz4xV+fgBXt698QPke/lAdD7j59VS2e19gMYx3yFawYy6ed7XNWXWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T14:33:50.872663Z","bundle_sha256":"d15e5a7f61112de386eae460b1c0e967b7b81be2ed308ca9a7a51da5b16552aa"}}