{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6YR3PRSJ4LIZ4AKOY62I4Q2RAJ","short_pith_number":"pith:6YR3PRSJ","canonical_record":{"source":{"id":"2605.12685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T19:33:39Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3b4948d69bc0a6ca80d36b9d7e2ff5fd65a92e7c5842153cabc78d44b7040948","abstract_canon_sha256":"5eed13d50b53827798cbd06df4036e31661bd9cbb5fd1143e13313a37e38587e"},"schema_version":"1.0"},"canonical_sha256":"f623b7c649e2d19e014ec7b48e43510272869b1d13df90b160b10406bc27ab8e","source":{"kind":"arxiv","id":"2605.12685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12685","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12685v1","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12685","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"6YR3PRSJ4LIZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"6YR3PRSJ4LIZ4AKO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"6YR3PRSJ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6YR3PRSJ4LIZ4AKOY62I4Q2RAJ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T19:33:39Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3b4948d69bc0a6ca80d36b9d7e2ff5fd65a92e7c5842153cabc78d44b7040948","abstract_canon_sha256":"5eed13d50b53827798cbd06df4036e31661bd9cbb5fd1143e13313a37e38587e"},"schema_version":"1.0"},"canonical_sha256":"f623b7c649e2d19e014ec7b48e43510272869b1d13df90b160b10406bc27ab8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:49.938075Z","signature_b64":"oex9ynIl1bA5bhgJ9aOWoSE6E0a2UsNlaLwfk1qVnT5cOMfRl4Hfezn3VyKQSPdrMO+WoMJ4CzBxGy3AdcJDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f623b7c649e2d19e014ec7b48e43510272869b1d13df90b160b10406bc27ab8e","last_reissued_at":"2026-05-18T03:09:49.937235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:49.937235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12685","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":"TEzcHCeMmoLc1BIrCRzjEJRzmPYbNKKGBb/emkWH1iloEaehhR4li2WAo5mu/c4m5VEQVx+1HdfYws/aVOADDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:39:31.107994Z"},"content_sha256":"9d977e0b65af65e3334ce1cf23b5a275dac1f514197ba4fb535b5ea8acfcf730","schema_version":"1.0","event_id":"sha256:9d977e0b65af65e3334ce1cf23b5a275dac1f514197ba4fb535b5ea8acfcf730"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6YR3PRSJ4LIZ4AKOY62I4Q2RAJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Perspective for Learning Graph Representations Across Multi-Level Abstractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A unified contrastive framework learns graph representations by linearly combining node, proximity, cluster, and graph level signals with a parameter-free self-weighting mechanism.","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Abdoulaye Banir\\'e Diallo, Mohamed Bouguessa, Mohamed Mahmoud Amar, Nairouz Mrabah","submitted_at":"2026-05-12T19:33:39Z","abstract_excerpt":"Graph Self-Supervised Learning (GSSL) has emerged as a powerful paradigm for generating high-quality representations for graph-structured data. While multi-scale graph contrastive learning has received increasing attention, many existing methods still predominantly focus on a single graph abstraction level. To address this limitation, we propose a unified contrastive framework that can target node-level, proximity-level, cluster-level, and graph-level information and integrate them through a linear combination of similarity scores on positive pairs and dissimilarity scores (i.e., similarity sc"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our approach not only enhances optimization flexibility but also eliminates the computational overhead of hyperparameter tuning in conventional multi-task GSSL methods. Comprehensive experiments on real-world datasets show that our methods consistently outperform state-of-the-art approaches across downstream tasks, including classification, clustering, and link prediction, in both single-level and multi-level scenarios.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That a linear combination of per-level similarity and dissimilarity scores, modulated by the proposed self-weighting, captures complementary multi-level information without destructive interference or the need for level-specific tuning.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A multi-level graph contrastive framework with adaptive self-weighting outperforms prior single-level and multi-task GSSL methods on classification, clustering, and link prediction.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A unified contrastive framework learns graph representations by linearly combining node, proximity, cluster, and graph level signals with a parameter-free self-weighting mechanism.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4165d5c4a16d4ee6835e5764ee633c407ca175c63de606d7d8ef7c38558d9851"},"source":{"id":"2605.12685","kind":"arxiv","version":1},"verdict":{"id":"0607749a-e518-4620-a903-8109b68471b4","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T21:05:19.597474Z","strongest_claim":"Our approach not only enhances optimization flexibility but also eliminates the computational overhead of hyperparameter tuning in conventional multi-task GSSL methods. Comprehensive experiments on real-world datasets show that our methods consistently outperform state-of-the-art approaches across downstream tasks, including classification, clustering, and link prediction, in both single-level and multi-level scenarios.","one_line_summary":"A multi-level graph contrastive framework with adaptive self-weighting outperforms prior single-level and multi-task GSSL methods on classification, clustering, and link prediction.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That a linear combination of per-level similarity and dissimilarity scores, modulated by the proposed self-weighting, captures complementary multi-level information without destructive interference or the need for level-specific tuning.","pith_extraction_headline":"A unified contrastive framework learns graph representations by linearly combining node, proximity, cluster, and graph level signals with a parameter-free self-weighting mechanism."},"references":{"count":63,"sample":[{"doi":"","year":2025,"title":"Re- thinking deep clustering paradigms: Self-supervision is all you need,","work_id":"ccfd593a-e0d1-4ad3-81c2-68eadb62ea0d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Big self-supervised models are strong semi-supervised learners,","work_id":"513d3240-0fb8-405d-8153-170946d79204","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Toward convex manifolds: A geometric perspective for deep graph clus- tering of single-cell rna-seq data","work_id":"1a78b8db-4cf3-49c6-8d71-ba8a43ef62e2","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Exploring the interaction between local and global latent configurations for clustering single-cell rna-seq: a unified per- spective,","work_id":"f7f39add-2782-41a9-b4e6-5575c165a68c","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Graph self-supervised learning: A survey,","work_id":"9ae3777f-5e13-46dd-a82b-33f6487f25c1","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":63,"snapshot_sha256":"9e193197d17575f88b1bd1bfa636ad0653033eb3cbcfb3b4dd028ff3f72a473f","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"62748dd041f8adec6ffbb31f47a6e727c5a0f5c1a86bd5cfeb126bce6da81280"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"0607749a-e518-4620-a903-8109b68471b4"},"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":"R35sLEQtL0FY1KLiG8BM7ZmMJsYx6MPmi2rl65IyVUC2i4k9mJ1KGJaP7enuinMIz92JgzYrKkkBU8TC0n1/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:39:31.108533Z"},"content_sha256":"0f2a062485b9eb84526bbe6a7f037fdcb66a4d3db00c86f0e12d0b558e3d373d","schema_version":"1.0","event_id":"sha256:0f2a062485b9eb84526bbe6a7f037fdcb66a4d3db00c86f0e12d0b558e3d373d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/bundle.json","state_url":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/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-08T22:39:31Z","links":{"resolver":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ","bundle":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/bundle.json","state":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6YR3PRSJ4LIZ4AKOY62I4Q2RAJ","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":"5eed13d50b53827798cbd06df4036e31661bd9cbb5fd1143e13313a37e38587e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T19:33:39Z","title_canon_sha256":"3b4948d69bc0a6ca80d36b9d7e2ff5fd65a92e7c5842153cabc78d44b7040948"},"schema_version":"1.0","source":{"id":"2605.12685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12685","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12685v1","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12685","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"6YR3PRSJ4LIZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"6YR3PRSJ4LIZ4AKO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"6YR3PRSJ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:0f2a062485b9eb84526bbe6a7f037fdcb66a4d3db00c86f0e12d0b558e3d373d","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":"Our approach not only enhances optimization flexibility but also eliminates the computational overhead of hyperparameter tuning in conventional multi-task GSSL methods. Comprehensive experiments on real-world datasets show that our methods consistently outperform state-of-the-art approaches across downstream tasks, including classification, clustering, and link prediction, in both single-level and multi-level scenarios."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That a linear combination of per-level similarity and dissimilarity scores, modulated by the proposed self-weighting, captures complementary multi-level information without destructive interference or the need for level-specific tuning."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A multi-level graph contrastive framework with adaptive self-weighting outperforms prior single-level and multi-task GSSL methods on classification, clustering, and link prediction."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A unified contrastive framework learns graph representations by linearly combining node, proximity, cluster, and graph level signals with a parameter-free self-weighting mechanism."}],"snapshot_sha256":"4165d5c4a16d4ee6835e5764ee633c407ca175c63de606d7d8ef7c38558d9851"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"62748dd041f8adec6ffbb31f47a6e727c5a0f5c1a86bd5cfeb126bce6da81280"},"paper":{"abstract_excerpt":"Graph Self-Supervised Learning (GSSL) has emerged as a powerful paradigm for generating high-quality representations for graph-structured data. While multi-scale graph contrastive learning has received increasing attention, many existing methods still predominantly focus on a single graph abstraction level. To address this limitation, we propose a unified contrastive framework that can target node-level, proximity-level, cluster-level, and graph-level information and integrate them through a linear combination of similarity scores on positive pairs and dissimilarity scores (i.e., similarity sc","authors_text":"Abdoulaye Banir\\'e Diallo, Mohamed Bouguessa, Mohamed Mahmoud Amar, Nairouz Mrabah","cross_cats":["cs.AI"],"headline":"A unified contrastive framework learns graph representations by linearly combining node, proximity, cluster, and graph level signals with a parameter-free self-weighting mechanism.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T19:33:39Z","title":"A Unified Perspective for Learning Graph Representations Across Multi-Level Abstractions"},"references":{"count":63,"internal_anchors":1,"resolved_work":63,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Re- thinking deep clustering paradigms: Self-supervision is all you need,","work_id":"ccfd593a-e0d1-4ad3-81c2-68eadb62ea0d","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Big self-supervised models are strong semi-supervised learners,","work_id":"513d3240-0fb8-405d-8153-170946d79204","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Toward convex manifolds: A geometric perspective for deep graph clus- tering of single-cell rna-seq data","work_id":"1a78b8db-4cf3-49c6-8d71-ba8a43ef62e2","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Exploring the interaction between local and global latent configurations for clustering single-cell rna-seq: a unified per- spective,","work_id":"f7f39add-2782-41a9-b4e6-5575c165a68c","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Graph self-supervised learning: A survey,","work_id":"9ae3777f-5e13-46dd-a82b-33f6487f25c1","year":2022}],"snapshot_sha256":"9e193197d17575f88b1bd1bfa636ad0653033eb3cbcfb3b4dd028ff3f72a473f"},"source":{"id":"2605.12685","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T21:05:19.597474Z","id":"0607749a-e518-4620-a903-8109b68471b4","model_set":{"reader":"grok-4.3"},"one_line_summary":"A multi-level graph contrastive framework with adaptive self-weighting outperforms prior single-level and multi-task GSSL methods on classification, clustering, and link prediction.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A unified contrastive framework learns graph representations by linearly combining node, proximity, cluster, and graph level signals with a parameter-free self-weighting mechanism.","strongest_claim":"Our approach not only enhances optimization flexibility but also eliminates the computational overhead of hyperparameter tuning in conventional multi-task GSSL methods. Comprehensive experiments on real-world datasets show that our methods consistently outperform state-of-the-art approaches across downstream tasks, including classification, clustering, and link prediction, in both single-level and multi-level scenarios.","weakest_assumption":"That a linear combination of per-level similarity and dissimilarity scores, modulated by the proposed self-weighting, captures complementary multi-level information without destructive interference or the need for level-specific tuning."}},"verdict_id":"0607749a-e518-4620-a903-8109b68471b4"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9d977e0b65af65e3334ce1cf23b5a275dac1f514197ba4fb535b5ea8acfcf730","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":"5eed13d50b53827798cbd06df4036e31661bd9cbb5fd1143e13313a37e38587e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T19:33:39Z","title_canon_sha256":"3b4948d69bc0a6ca80d36b9d7e2ff5fd65a92e7c5842153cabc78d44b7040948"},"schema_version":"1.0","source":{"id":"2605.12685","kind":"arxiv","version":1}},"canonical_sha256":"f623b7c649e2d19e014ec7b48e43510272869b1d13df90b160b10406bc27ab8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f623b7c649e2d19e014ec7b48e43510272869b1d13df90b160b10406bc27ab8e","first_computed_at":"2026-05-18T03:09:49.937235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:49.937235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oex9ynIl1bA5bhgJ9aOWoSE6E0a2UsNlaLwfk1qVnT5cOMfRl4Hfezn3VyKQSPdrMO+WoMJ4CzBxGy3AdcJDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:49.938075Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d977e0b65af65e3334ce1cf23b5a275dac1f514197ba4fb535b5ea8acfcf730","sha256:0f2a062485b9eb84526bbe6a7f037fdcb66a4d3db00c86f0e12d0b558e3d373d"],"state_sha256":"5200b855575e2da4a8bb2a76d828b69ab7413ef9650d2cb731e55a15bb218aaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wsYf8QzMq8UhXlgnCUNz4ZAG6Y8gHbhSNBiWWbIrhyB8VQyAr93h1rKHqhX4cSmLmuJm77Q1gTgcrL6DhipeBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:39:31.110943Z","bundle_sha256":"a2f1b3560a6719c5ba33f98e81ce1a7e9c28d2aa80cf78018876ae027051019b"}}