{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2HKXQPI2I65Z24ZRL6HK37TLDL","short_pith_number":"pith:2HKXQPI2","canonical_record":{"source":{"id":"2607.07934","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T21:30:51Z","cross_cats_sorted":[],"title_canon_sha256":"8353853cd49c368a9ad0cff25e60efd4e1caca32417f91e6bc2b2b05fa68ce87","abstract_canon_sha256":"7d1c6375d731cbee38e18e2ef9829ce46ad48226be0a5f0872417c306d90abf1"},"schema_version":"1.0"},"canonical_sha256":"d1d5783d1a47bb9d73315f8eadfe6b1acd5854c7696d9ebdb6e104ab7f5dcd9c","source":{"kind":"arxiv","id":"2607.07934","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07934","created_at":"2026-07-10T00:19:05Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07934v1","created_at":"2026-07-10T00:19:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07934","created_at":"2026-07-10T00:19:05Z"},{"alias_kind":"pith_short_12","alias_value":"2HKXQPI2I65Z","created_at":"2026-07-10T00:19:05Z"},{"alias_kind":"pith_short_16","alias_value":"2HKXQPI2I65Z24ZR","created_at":"2026-07-10T00:19:05Z"},{"alias_kind":"pith_short_8","alias_value":"2HKXQPI2","created_at":"2026-07-10T00:19:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2HKXQPI2I65Z24ZRL6HK37TLDL","target":"record","payload":{"canonical_record":{"source":{"id":"2607.07934","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T21:30:51Z","cross_cats_sorted":[],"title_canon_sha256":"8353853cd49c368a9ad0cff25e60efd4e1caca32417f91e6bc2b2b05fa68ce87","abstract_canon_sha256":"7d1c6375d731cbee38e18e2ef9829ce46ad48226be0a5f0872417c306d90abf1"},"schema_version":"1.0"},"canonical_sha256":"d1d5783d1a47bb9d73315f8eadfe6b1acd5854c7696d9ebdb6e104ab7f5dcd9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T00:19:05.287325Z","signature_b64":"ccFrk0DChH8bMehvK5m3qwPTma130+tPo7RWV3/7OGdSVb1adclwQhCFBGUjgm3eWOuiNNRWDUl7qRmaGaeoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1d5783d1a47bb9d73315f8eadfe6b1acd5854c7696d9ebdb6e104ab7f5dcd9c","last_reissued_at":"2026-07-10T00:19:05.286894Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T00:19:05.286894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.07934","source_version":1,"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-07-10T00:19:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UmXa++z7ac0AgE5yQihhuYfby/KVrr/9xgv31/0dU9hSaGDPf/rKH16EYvdj3JJgCE9UyJVpnZ735ZAKXF3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:59:59.553302Z"},"content_sha256":"c357c5615fc721e4f231fceb458c06520f4fec413c071b18df9f985a9c0d2e9d","schema_version":"1.0","event_id":"sha256:c357c5615fc721e4f231fceb458c06520f4fec413c071b18df9f985a9c0d2e9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2HKXQPI2I65Z24ZRL6HK37TLDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas G\\\"obel, Marc Roth, Matthias Lanzinger, Panagiotis Aivasiliotis","submitted_at":"2026-07-08T21:30:51Z","abstract_excerpt":"The Weisfeiler--Leman (WL) algorithm is one of the most influential heuristics for the graph isomorphism problem. The expressive power of WL has been extensively studied in the contexts of descriptive complexity, logics, graph neural networks, and the theory of homomorphism indistinguishabily. Notably, two graphs are indistinguishable by the $k$-dimensional WL algorithm if and only if they are indistinguishable by homomorphism-counts from graphs of treewidth at most $k$. An intrinsic question is to find a natural version of the WL algorithm for relational structures of higher arity admitting a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07934","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07934/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-10T00:19:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i81lB4wQ+kStA5h7xaNA2/Yrd+Wma2WgT0oIEOW9Pj7n44XOASU395hZaEukXMzBEomeEZV4lbxllz6wKF++DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:59:59.554104Z"},"content_sha256":"51f894ecbda1e3e70c0c82cdd987e139f5b3b2f68e005d944199b29b9099ab89","schema_version":"1.0","event_id":"sha256:51f894ecbda1e3e70c0c82cdd987e139f5b3b2f68e005d944199b29b9099ab89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HKXQPI2I65Z24ZRL6HK37TLDL/bundle.json","state_url":"https://pith.science/pith/2HKXQPI2I65Z24ZRL6HK37TLDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HKXQPI2I65Z24ZRL6HK37TLDL/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-08-03T15:59:59Z","links":{"resolver":"https://pith.science/pith/2HKXQPI2I65Z24ZRL6HK37TLDL","bundle":"https://pith.science/pith/2HKXQPI2I65Z24ZRL6HK37TLDL/bundle.json","state":"https://pith.science/pith/2HKXQPI2I65Z24ZRL6HK37TLDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HKXQPI2I65Z24ZRL6HK37TLDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2HKXQPI2I65Z24ZRL6HK37TLDL","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":"7d1c6375d731cbee38e18e2ef9829ce46ad48226be0a5f0872417c306d90abf1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T21:30:51Z","title_canon_sha256":"8353853cd49c368a9ad0cff25e60efd4e1caca32417f91e6bc2b2b05fa68ce87"},"schema_version":"1.0","source":{"id":"2607.07934","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07934","created_at":"2026-07-10T00:19:05Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07934v1","created_at":"2026-07-10T00:19:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07934","created_at":"2026-07-10T00:19:05Z"},{"alias_kind":"pith_short_12","alias_value":"2HKXQPI2I65Z","created_at":"2026-07-10T00:19:05Z"},{"alias_kind":"pith_short_16","alias_value":"2HKXQPI2I65Z24ZR","created_at":"2026-07-10T00:19:05Z"},{"alias_kind":"pith_short_8","alias_value":"2HKXQPI2","created_at":"2026-07-10T00:19:05Z"}],"graph_snapshots":[{"event_id":"sha256:51f894ecbda1e3e70c0c82cdd987e139f5b3b2f68e005d944199b29b9099ab89","target":"graph","created_at":"2026-07-10T00:19:05Z","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/2607.07934/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Weisfeiler--Leman (WL) algorithm is one of the most influential heuristics for the graph isomorphism problem. The expressive power of WL has been extensively studied in the contexts of descriptive complexity, logics, graph neural networks, and the theory of homomorphism indistinguishabily. Notably, two graphs are indistinguishable by the $k$-dimensional WL algorithm if and only if they are indistinguishable by homomorphism-counts from graphs of treewidth at most $k$. An intrinsic question is to find a natural version of the WL algorithm for relational structures of higher arity admitting a","authors_text":"Andreas G\\\"obel, Marc Roth, Matthias Lanzinger, Panagiotis Aivasiliotis","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07934","kind":"arxiv","version":1},"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:c357c5615fc721e4f231fceb458c06520f4fec413c071b18df9f985a9c0d2e9d","target":"record","created_at":"2026-07-10T00:19:05Z","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":"7d1c6375d731cbee38e18e2ef9829ce46ad48226be0a5f0872417c306d90abf1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T21:30:51Z","title_canon_sha256":"8353853cd49c368a9ad0cff25e60efd4e1caca32417f91e6bc2b2b05fa68ce87"},"schema_version":"1.0","source":{"id":"2607.07934","kind":"arxiv","version":1}},"canonical_sha256":"d1d5783d1a47bb9d73315f8eadfe6b1acd5854c7696d9ebdb6e104ab7f5dcd9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1d5783d1a47bb9d73315f8eadfe6b1acd5854c7696d9ebdb6e104ab7f5dcd9c","first_computed_at":"2026-07-10T00:19:05.286894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-10T00:19:05.286894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ccFrk0DChH8bMehvK5m3qwPTma130+tPo7RWV3/7OGdSVb1adclwQhCFBGUjgm3eWOuiNNRWDUl7qRmaGaeoBg==","signature_status":"signed_v1","signed_at":"2026-07-10T00:19:05.287325Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07934","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c357c5615fc721e4f231fceb458c06520f4fec413c071b18df9f985a9c0d2e9d","sha256:51f894ecbda1e3e70c0c82cdd987e139f5b3b2f68e005d944199b29b9099ab89"],"state_sha256":"8178f53b172e1e1eac068440d2c6846f7500e0684aaf436bde631b7046758aae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZjQDFAmkYE5t+2YSFwakLdeUtTagK6847zzJ5rTATzUJds+IlXyufIeTIB4CQcbBHi91tZtRj89QBtYZHEFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:59:59.558480Z","bundle_sha256":"1171fa01c0383e64762c8f13e06a16b76ae2cef532a4c310f7929baa8fb5effa"}}