{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QA4BQIYZKMYWGSVJPSYE6RQKTV","short_pith_number":"pith:QA4BQIYZ","canonical_record":{"source":{"id":"2605.12699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T19:52:27Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eb88ad6d77d2a611241434eaf22fabc68c3f81236f3b186b3d66404ab627bd14","abstract_canon_sha256":"f4dfddfd0ead7e6f2632005af9fff151828a4892b5881689d4452edeb349a19e"},"schema_version":"1.0"},"canonical_sha256":"80381823195331634aa97cb04f460a9d50c65c0e84ec074a540ad7b1242a4cda","source":{"kind":"arxiv","id":"2605.12699","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12699","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12699v1","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12699","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"QA4BQIYZKMYW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"QA4BQIYZKMYWGSVJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"QA4BQIYZ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QA4BQIYZKMYWGSVJPSYE6RQKTV","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T19:52:27Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eb88ad6d77d2a611241434eaf22fabc68c3f81236f3b186b3d66404ab627bd14","abstract_canon_sha256":"f4dfddfd0ead7e6f2632005af9fff151828a4892b5881689d4452edeb349a19e"},"schema_version":"1.0"},"canonical_sha256":"80381823195331634aa97cb04f460a9d50c65c0e84ec074a540ad7b1242a4cda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:49.726725Z","signature_b64":"1FQs5ZXUjERTcTULXwuNRThIWnyjDenUvBvH9Z51MXGi393RuEyGtY6aN9OU9uJWX8XqcBIoLENN7yQPzHeYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80381823195331634aa97cb04f460a9d50c65c0e84ec074a540ad7b1242a4cda","last_reissued_at":"2026-05-18T03:09:49.725684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:49.725684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12699","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-05-18T03:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZZQ34zRJVEneUOUmJCOmNWzpijLJpMvYx7TCxMKJXbaQvSG/a3+ys8SBFIoqB7zNAhgG8W+anXx2uREHZP4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:10:03.973773Z"},"content_sha256":"e5a53863b0754d02ee525c758ba3dfa4eec58bbdaf236bb99c1fe222891bfeb2","schema_version":"1.0","event_id":"sha256:e5a53863b0754d02ee525c758ba3dfa4eec58bbdaf236bb99c1fe222891bfeb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QA4BQIYZKMYWGSVJPSYE6RQKTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling Heterophily in Multiplex Graphs: An Adaptive Approach for Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Dimension-specific matrices paired with a product of low- and high-pass filters let node classification adapt to mixed homophily and heterophily across multiplex edge types.","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Kamel Abdous, Mohamed Bouguessa, Nairouz Mrabah","submitted_at":"2026-05-12T19:52:27Z","abstract_excerpt":"Existing multiplex graph models often assume homophily, where connected nodes tend to belong to the same class or share similar attributes. Consequently, these models may struggle with graphs exhibiting heterophily, where connected nodes typically belong to different classes and have dissimilar attributes. While recent methods have been developed to learn reliable node representations from unidimensional graphs with heterophily, they do not fully address the complexities of multiplex graphs. In a multiplex graph, nodes are linked through multiple types of edges (referred to as dimensions), whi"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Extensive experiments on synthetic and real-world datasets provide evidence that the proposed method captures the complex interplay of homophilic and heterophilic interactions in multiplex graphs, and tends to yield improved node classification performance compared to state-of-the-art methods.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the product of trainable low-pass and high-pass filters approximated via Chebyshev polynomials, combined with dimension-specific compatibility matrices, can reliably separate and model the heterophilic characteristics of each dimension without introducing instability or requiring extensive hyperparameter tuning.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A new method for node classification in multiplex graphs adapts to mixed homophily and heterophily per dimension via compatibility matrices and Chebyshev-approximated product filters optimized with proximal gradients.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Dimension-specific matrices paired with a product of low- and high-pass filters let node classification adapt to mixed homophily and heterophily across multiplex edge types.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f5e3dd9827e452ec834b89c4e3d5c15a71f42662a58172ed335f6020b6f4abc4"},"source":{"id":"2605.12699","kind":"arxiv","version":1},"verdict":{"id":"a3da8118-8c71-4ef3-8bd1-0ac3f126253c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:56:04.874048Z","strongest_claim":"Extensive experiments on synthetic and real-world datasets provide evidence that the proposed method captures the complex interplay of homophilic and heterophilic interactions in multiplex graphs, and tends to yield improved node classification performance compared to state-of-the-art methods.","one_line_summary":"A new method for node classification in multiplex graphs adapts to mixed homophily and heterophily per dimension via compatibility matrices and Chebyshev-approximated product filters optimized with proximal gradients.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the product of trainable low-pass and high-pass filters approximated via Chebyshev polynomials, combined with dimension-specific compatibility matrices, can reliably separate and model the heterophilic characteristics of each dimension without introducing instability or requiring extensive hyperparameter tuning.","pith_extraction_headline":"Dimension-specific matrices paired with a product of low- and high-pass filters let node classification adapt to mixed homophily and heterophily across multiplex edge types."},"references":{"count":46,"sample":[{"doi":"","year":2024,"title":"A geometric perspective for high- dimensional multiplex graphs","work_id":"9189c1fb-95d1-450f-9104-dd24ec4cc683","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Hierarchical aggregations for high-dimensional multiplex graph embedding.IEEE Transactions on Knowledge and Data Engineering, 36(4):1624–1637, 2024","work_id":"ceb41666-50e7-4b40-a34f-0d70ff8eb944","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Mixhop: Higher-order graph con- volutional architectures via sparsified neighborhood mixing","work_id":"d9ba0ed6-b1b1-449e-9cc3-fc04a93562ab","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Heterophily in social groups formation: a social network analysis.Quality & Quantity, 53(2):599–619, 2019","work_id":"ba3fde4a-b9ff-4de2-b890-f8a5c969b863","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"The new challenges of multiplex net- works: Measures and models.The European Physical Journal Special Topics, 226:401–416, 2017","work_id":"61c59bd4-1a84-48af-a93c-979773ac1d90","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":46,"snapshot_sha256":"b62ade8e0eb77ea865524deed978177c1873fc194e1eab8d8e89feab27ae86d7","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"de90c485ef08efdb009a2b6580bc82f52f7fb1de193d5f132924eca443d6cd4c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"a3da8118-8c71-4ef3-8bd1-0ac3f126253c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+vM64sAI9MF5+KAGZL3juDDhW1bTES+vXNXQHbnxTZP04CklRxx2uU+UPKMM4XP5qBAoLDimDhotJtFNRP+XCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:10:03.974948Z"},"content_sha256":"5c8b6d56ac9e95f4e5517255e2d8592ba851a0f6d22428d17ffac2284072cf37","schema_version":"1.0","event_id":"sha256:5c8b6d56ac9e95f4e5517255e2d8592ba851a0f6d22428d17ffac2284072cf37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QA4BQIYZKMYWGSVJPSYE6RQKTV/bundle.json","state_url":"https://pith.science/pith/QA4BQIYZKMYWGSVJPSYE6RQKTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QA4BQIYZKMYWGSVJPSYE6RQKTV/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-06-08T15:10:03Z","links":{"resolver":"https://pith.science/pith/QA4BQIYZKMYWGSVJPSYE6RQKTV","bundle":"https://pith.science/pith/QA4BQIYZKMYWGSVJPSYE6RQKTV/bundle.json","state":"https://pith.science/pith/QA4BQIYZKMYWGSVJPSYE6RQKTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QA4BQIYZKMYWGSVJPSYE6RQKTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QA4BQIYZKMYWGSVJPSYE6RQKTV","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":"f4dfddfd0ead7e6f2632005af9fff151828a4892b5881689d4452edeb349a19e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T19:52:27Z","title_canon_sha256":"eb88ad6d77d2a611241434eaf22fabc68c3f81236f3b186b3d66404ab627bd14"},"schema_version":"1.0","source":{"id":"2605.12699","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12699","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12699v1","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12699","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"QA4BQIYZKMYW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"QA4BQIYZKMYWGSVJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"QA4BQIYZ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:5c8b6d56ac9e95f4e5517255e2d8592ba851a0f6d22428d17ffac2284072cf37","target":"graph","created_at":"2026-05-18T03:09:49Z","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":"Extensive experiments on synthetic and real-world datasets provide evidence that the proposed method captures the complex interplay of homophilic and heterophilic interactions in multiplex graphs, and tends to yield improved node classification performance compared to state-of-the-art methods."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the product of trainable low-pass and high-pass filters approximated via Chebyshev polynomials, combined with dimension-specific compatibility matrices, can reliably separate and model the heterophilic characteristics of each dimension without introducing instability or requiring extensive hyperparameter tuning."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A new method for node classification in multiplex graphs adapts to mixed homophily and heterophily per dimension via compatibility matrices and Chebyshev-approximated product filters optimized with proximal gradients."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Dimension-specific matrices paired with a product of low- and high-pass filters let node classification adapt to mixed homophily and heterophily across multiplex edge types."}],"snapshot_sha256":"f5e3dd9827e452ec834b89c4e3d5c15a71f42662a58172ed335f6020b6f4abc4"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"de90c485ef08efdb009a2b6580bc82f52f7fb1de193d5f132924eca443d6cd4c"},"paper":{"abstract_excerpt":"Existing multiplex graph models often assume homophily, where connected nodes tend to belong to the same class or share similar attributes. Consequently, these models may struggle with graphs exhibiting heterophily, where connected nodes typically belong to different classes and have dissimilar attributes. While recent methods have been developed to learn reliable node representations from unidimensional graphs with heterophily, they do not fully address the complexities of multiplex graphs. In a multiplex graph, nodes are linked through multiple types of edges (referred to as dimensions), whi","authors_text":"Kamel Abdous, Mohamed Bouguessa, Nairouz Mrabah","cross_cats":["cs.AI"],"headline":"Dimension-specific matrices paired with a product of low- and high-pass filters let node classification adapt to mixed homophily and heterophily across multiplex edge types.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T19:52:27Z","title":"Modeling Heterophily in Multiplex Graphs: An Adaptive Approach for Node Classification"},"references":{"count":46,"internal_anchors":1,"resolved_work":46,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A geometric perspective for high- dimensional multiplex graphs","work_id":"9189c1fb-95d1-450f-9104-dd24ec4cc683","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Hierarchical aggregations for high-dimensional multiplex graph embedding.IEEE Transactions on Knowledge and Data Engineering, 36(4):1624–1637, 2024","work_id":"ceb41666-50e7-4b40-a34f-0d70ff8eb944","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Mixhop: Higher-order graph con- volutional architectures via sparsified neighborhood mixing","work_id":"d9ba0ed6-b1b1-449e-9cc3-fc04a93562ab","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Heterophily in social groups formation: a social network analysis.Quality & Quantity, 53(2):599–619, 2019","work_id":"ba3fde4a-b9ff-4de2-b890-f8a5c969b863","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"The new challenges of multiplex net- works: Measures and models.The European Physical Journal Special Topics, 226:401–416, 2017","work_id":"61c59bd4-1a84-48af-a93c-979773ac1d90","year":2017}],"snapshot_sha256":"b62ade8e0eb77ea865524deed978177c1873fc194e1eab8d8e89feab27ae86d7"},"source":{"id":"2605.12699","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:56:04.874048Z","id":"a3da8118-8c71-4ef3-8bd1-0ac3f126253c","model_set":{"reader":"grok-4.3"},"one_line_summary":"A new method for node classification in multiplex graphs adapts to mixed homophily and heterophily per dimension via compatibility matrices and Chebyshev-approximated product filters optimized with proximal gradients.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Dimension-specific matrices paired with a product of low- and high-pass filters let node classification adapt to mixed homophily and heterophily across multiplex edge types.","strongest_claim":"Extensive experiments on synthetic and real-world datasets provide evidence that the proposed method captures the complex interplay of homophilic and heterophilic interactions in multiplex graphs, and tends to yield improved node classification performance compared to state-of-the-art methods.","weakest_assumption":"That the product of trainable low-pass and high-pass filters approximated via Chebyshev polynomials, combined with dimension-specific compatibility matrices, can reliably separate and model the heterophilic characteristics of each dimension without introducing instability or requiring extensive hyperparameter tuning."}},"verdict_id":"a3da8118-8c71-4ef3-8bd1-0ac3f126253c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e5a53863b0754d02ee525c758ba3dfa4eec58bbdaf236bb99c1fe222891bfeb2","target":"record","created_at":"2026-05-18T03:09:49Z","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":"f4dfddfd0ead7e6f2632005af9fff151828a4892b5881689d4452edeb349a19e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T19:52:27Z","title_canon_sha256":"eb88ad6d77d2a611241434eaf22fabc68c3f81236f3b186b3d66404ab627bd14"},"schema_version":"1.0","source":{"id":"2605.12699","kind":"arxiv","version":1}},"canonical_sha256":"80381823195331634aa97cb04f460a9d50c65c0e84ec074a540ad7b1242a4cda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80381823195331634aa97cb04f460a9d50c65c0e84ec074a540ad7b1242a4cda","first_computed_at":"2026-05-18T03:09:49.725684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:49.725684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1FQs5ZXUjERTcTULXwuNRThIWnyjDenUvBvH9Z51MXGi393RuEyGtY6aN9OU9uJWX8XqcBIoLENN7yQPzHeYBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:49.726725Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12699","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5a53863b0754d02ee525c758ba3dfa4eec58bbdaf236bb99c1fe222891bfeb2","sha256:5c8b6d56ac9e95f4e5517255e2d8592ba851a0f6d22428d17ffac2284072cf37"],"state_sha256":"e016b2fd0a9e083c2a71368dfe002e77d96be9c51e67f5e476156e4ce96470e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivdUAfZMamy+IfBa9evLeeLjLuV5Fu+iJwZ1CXUPrWMzN2jtQ+YKZ/yetJWyy979hHN30xaNbb6QGZEMOT35CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:10:03.979764Z","bundle_sha256":"92cd352740baf11bb04683c56d4bbc454ef363f9fbed91aa40258bcded6a077e"}}