{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OEMB76LMNAWR3U3BQTFGWSNQ5H","short_pith_number":"pith:OEMB76LM","canonical_record":{"source":{"id":"2605.14178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2026-05-13T22:58:42Z","cross_cats_sorted":[],"title_canon_sha256":"701312d20bd3140e01327a54ce65299ac16c39945837b0bb3d214af47081b8f6","abstract_canon_sha256":"792d1d78c4fa22c9e917b60d4ad0a83f33c3e2d3f740fa039618827905a3fc56"},"schema_version":"1.0"},"canonical_sha256":"71181ff96c682d1dd36184ca6b49b0e9ddc29fee31a7127128a99cf32c0aced8","source":{"kind":"arxiv","id":"2605.14178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14178","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14178v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14178","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"OEMB76LMNAWR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OEMB76LMNAWR3U3B","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OEMB76LM","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OEMB76LMNAWR3U3BQTFGWSNQ5H","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2026-05-13T22:58:42Z","cross_cats_sorted":[],"title_canon_sha256":"701312d20bd3140e01327a54ce65299ac16c39945837b0bb3d214af47081b8f6","abstract_canon_sha256":"792d1d78c4fa22c9e917b60d4ad0a83f33c3e2d3f740fa039618827905a3fc56"},"schema_version":"1.0"},"canonical_sha256":"71181ff96c682d1dd36184ca6b49b0e9ddc29fee31a7127128a99cf32c0aced8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.280156Z","signature_b64":"nAQP3LnvW/KcRiWQzu47og+vq0bFrFTxLbkcyRggOaUPd1DVjReTh+mlq09lPy8QTYjzcJFceP0I5KE2m5etCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71181ff96c682d1dd36184ca6b49b0e9ddc29fee31a7127128a99cf32c0aced8","last_reissued_at":"2026-05-17T23:39:11.279624Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.279624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14178","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-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ufovxnBC+3/QbmO5KbuOJIVAhG9sGC/g87ZsqEURLEvtg1dBRSYI4nW5w3r0F0Hw1OBXFK9x5p2DXube5JXgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:18:12.531435Z"},"content_sha256":"99c843d9cd5d63bff83f18b2114793ab05ba73cb4b1c5ec2bccfff3d2146ae8c","schema_version":"1.0","event_id":"sha256:99c843d9cd5d63bff83f18b2114793ab05ba73cb4b1c5ec2bccfff3d2146ae8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OEMB76LMNAWR3U3BQTFGWSNQ5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Directed Q-Analysis and Directed Higher-Order Connectivity on Digraphs: A Quantitative Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Directed graphs can be analyzed for higher-order interactions by constructing directed clique complexes that capture multi-node directed relationships.","cross_cats":[],"primary_cat":"math.GM","authors_text":"Andr\\'e Fujita, Heitor Baldo, Koichi Sameshima, Luiz A. Baccal\\'a","submitted_at":"2026-05-13T22:58:42Z","abstract_excerpt":"Traditional graph analysis focuses on nodes and edges, that is, pairwise relationships. Yet many real-world networks, including biological, social, and communication networks, involve higher-order relationships in which multiple nodes interact simultaneously. This has led many to develop network topology analysis methods based on higher-order structures and higher-order connectivity, seeking to reveal complex interactions beyond node pairs. Many of the latter address only undirected networks. To overcome this, we lay out a mathematical formalism resting on directed clique complexes constructed"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we lay out a mathematical formalism resting on directed clique complexes constructed from directed graphs (their 'higher-order structures' or 'simplicial structures'), stressing the interrelations between directed cliques (their 'directed higher-order connectivities'), leading towards a more complete directed Q-analysis that allows quantifying, characterizing, and comparing similarities involving simplicial structures.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That directed cliques can be consistently defined from digraphs and that their interrelations meaningfully capture higher-order directed interactions without additional assumptions on the underlying data.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A new formalism for directed Q-analysis using directed clique complexes to quantify and compare higher-order connectivities in digraphs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Directed graphs can be analyzed for higher-order interactions by constructing directed clique complexes that capture multi-node directed relationships.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9bfbceaf7dcd1713b30bc8df735d307b8cb294a7d4c045b3e1dc0e0830d515d2"},"source":{"id":"2605.14178","kind":"arxiv","version":1},"verdict":{"id":"c1840247-71a4-4a2c-9d56-3598ab5278b4","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:49:03.246253Z","strongest_claim":"we lay out a mathematical formalism resting on directed clique complexes constructed from directed graphs (their 'higher-order structures' or 'simplicial structures'), stressing the interrelations between directed cliques (their 'directed higher-order connectivities'), leading towards a more complete directed Q-analysis that allows quantifying, characterizing, and comparing similarities involving simplicial structures.","one_line_summary":"A new formalism for directed Q-analysis using directed clique complexes to quantify and compare higher-order connectivities in digraphs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That directed cliques can be consistently defined from digraphs and that their interrelations meaningfully capture higher-order directed interactions without additional assumptions on the underlying data.","pith_extraction_headline":"Directed graphs can be analyzed for higher-order interactions by constructing directed clique complexes that capture multi-node directed relationships."},"references":{"count":300,"sample":[{"doi":"","year":null,"title":"Abdelnour, F. and Dayan, M. and Devinsky, O. and Thesen, T. and Raj, A. Estimating brain's functional graph from the structural graph's Laplacian. Proceedings of SPIE","work_id":"e91ac279-d6fe-4955-9b77-c2739217fff5","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Abdelnour, F. and Dayan, M. and Devinsky, O. and Thesen, T. and Raj, A. Functional brain connectivity is predictable from anatomic network's Laplacian eigen-structure. NeuroImage","work_id":"dedd6bc2-2d9c-4537-aad2-c85825dcf249","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Achard, S. and Bullmore, E. Efficiency and Cost of Economical Brain Functional Networks. PLoS Comput Biol","work_id":"f082db03-3131-46eb-9076-f3152f6b68f1","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Aharoni, R. and Berger, E. and Meshulam, R. Eigenvalues and homology of flag complexes and vector representations of graphs. Geom. Funct. Anal","work_id":"c6c19a62-f5de-45f2-8c32-f6634348b125","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Ahmadlou, M. and Adeli, H. and Adeli, A. Graph theoretical analysis of organization of functional brain networks in ADHD. Clinical EEG and neuroscience","work_id":"7c961119-58f2-482a-8486-5ab48083644c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":300,"snapshot_sha256":"566e27380f668a2aab4ce1750d33afe5e807877c9deb39dee64701be83080b00","internal_anchors":4},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8724ca9cfb4d4d602efeefe4a1ab8f14823bf9347ba3db9b044a37362042e167"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"c1840247-71a4-4a2c-9d56-3598ab5278b4"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ak3hStPOHRhnWxFDjr4EjpR62rWcEkRo0uJQoz3MXCRXVRHzenhUqQhG+L1SkApDwAP/blHKj3G3sTrlnHTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:18:12.532497Z"},"content_sha256":"78c797555ecc109aaa64e94af414e4a70e34897fcecea8f4f22345ce215c1c57","schema_version":"1.0","event_id":"sha256:78c797555ecc109aaa64e94af414e4a70e34897fcecea8f4f22345ce215c1c57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEMB76LMNAWR3U3BQTFGWSNQ5H/bundle.json","state_url":"https://pith.science/pith/OEMB76LMNAWR3U3BQTFGWSNQ5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEMB76LMNAWR3U3BQTFGWSNQ5H/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-05-25T23:18:12Z","links":{"resolver":"https://pith.science/pith/OEMB76LMNAWR3U3BQTFGWSNQ5H","bundle":"https://pith.science/pith/OEMB76LMNAWR3U3BQTFGWSNQ5H/bundle.json","state":"https://pith.science/pith/OEMB76LMNAWR3U3BQTFGWSNQ5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEMB76LMNAWR3U3BQTFGWSNQ5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OEMB76LMNAWR3U3BQTFGWSNQ5H","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":"792d1d78c4fa22c9e917b60d4ad0a83f33c3e2d3f740fa039618827905a3fc56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2026-05-13T22:58:42Z","title_canon_sha256":"701312d20bd3140e01327a54ce65299ac16c39945837b0bb3d214af47081b8f6"},"schema_version":"1.0","source":{"id":"2605.14178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14178","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14178v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14178","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"OEMB76LMNAWR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OEMB76LMNAWR3U3B","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OEMB76LM","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:78c797555ecc109aaa64e94af414e4a70e34897fcecea8f4f22345ce215c1c57","target":"graph","created_at":"2026-05-17T23:39:11Z","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 lay out a mathematical formalism resting on directed clique complexes constructed from directed graphs (their 'higher-order structures' or 'simplicial structures'), stressing the interrelations between directed cliques (their 'directed higher-order connectivities'), leading towards a more complete directed Q-analysis that allows quantifying, characterizing, and comparing similarities involving simplicial structures."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That directed cliques can be consistently defined from digraphs and that their interrelations meaningfully capture higher-order directed interactions without additional assumptions on the underlying data."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A new formalism for directed Q-analysis using directed clique complexes to quantify and compare higher-order connectivities in digraphs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Directed graphs can be analyzed for higher-order interactions by constructing directed clique complexes that capture multi-node directed relationships."}],"snapshot_sha256":"9bfbceaf7dcd1713b30bc8df735d307b8cb294a7d4c045b3e1dc0e0830d515d2"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8724ca9cfb4d4d602efeefe4a1ab8f14823bf9347ba3db9b044a37362042e167"},"paper":{"abstract_excerpt":"Traditional graph analysis focuses on nodes and edges, that is, pairwise relationships. Yet many real-world networks, including biological, social, and communication networks, involve higher-order relationships in which multiple nodes interact simultaneously. This has led many to develop network topology analysis methods based on higher-order structures and higher-order connectivity, seeking to reveal complex interactions beyond node pairs. Many of the latter address only undirected networks. To overcome this, we lay out a mathematical formalism resting on directed clique complexes constructed","authors_text":"Andr\\'e Fujita, Heitor Baldo, Koichi Sameshima, Luiz A. Baccal\\'a","cross_cats":[],"headline":"Directed graphs can be analyzed for higher-order interactions by constructing directed clique complexes that capture multi-node directed relationships.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2026-05-13T22:58:42Z","title":"Directed Q-Analysis and Directed Higher-Order Connectivity on Digraphs: A Quantitative Approach"},"references":{"count":300,"internal_anchors":4,"resolved_work":300,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Abdelnour, F. and Dayan, M. and Devinsky, O. and Thesen, T. and Raj, A. Estimating brain's functional graph from the structural graph's Laplacian. Proceedings of SPIE","work_id":"e91ac279-d6fe-4955-9b77-c2739217fff5","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Abdelnour, F. and Dayan, M. and Devinsky, O. and Thesen, T. and Raj, A. Functional brain connectivity is predictable from anatomic network's Laplacian eigen-structure. NeuroImage","work_id":"dedd6bc2-2d9c-4537-aad2-c85825dcf249","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Achard, S. and Bullmore, E. Efficiency and Cost of Economical Brain Functional Networks. PLoS Comput Biol","work_id":"f082db03-3131-46eb-9076-f3152f6b68f1","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Aharoni, R. and Berger, E. and Meshulam, R. Eigenvalues and homology of flag complexes and vector representations of graphs. Geom. Funct. Anal","work_id":"c6c19a62-f5de-45f2-8c32-f6634348b125","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Ahmadlou, M. and Adeli, H. and Adeli, A. Graph theoretical analysis of organization of functional brain networks in ADHD. Clinical EEG and neuroscience","work_id":"7c961119-58f2-482a-8486-5ab48083644c","year":null}],"snapshot_sha256":"566e27380f668a2aab4ce1750d33afe5e807877c9deb39dee64701be83080b00"},"source":{"id":"2605.14178","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:49:03.246253Z","id":"c1840247-71a4-4a2c-9d56-3598ab5278b4","model_set":{"reader":"grok-4.3"},"one_line_summary":"A new formalism for directed Q-analysis using directed clique complexes to quantify and compare higher-order connectivities in digraphs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Directed graphs can be analyzed for higher-order interactions by constructing directed clique complexes that capture multi-node directed relationships.","strongest_claim":"we lay out a mathematical formalism resting on directed clique complexes constructed from directed graphs (their 'higher-order structures' or 'simplicial structures'), stressing the interrelations between directed cliques (their 'directed higher-order connectivities'), leading towards a more complete directed Q-analysis that allows quantifying, characterizing, and comparing similarities involving simplicial structures.","weakest_assumption":"That directed cliques can be consistently defined from digraphs and that their interrelations meaningfully capture higher-order directed interactions without additional assumptions on the underlying data."}},"verdict_id":"c1840247-71a4-4a2c-9d56-3598ab5278b4"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:99c843d9cd5d63bff83f18b2114793ab05ba73cb4b1c5ec2bccfff3d2146ae8c","target":"record","created_at":"2026-05-17T23:39:11Z","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":"792d1d78c4fa22c9e917b60d4ad0a83f33c3e2d3f740fa039618827905a3fc56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2026-05-13T22:58:42Z","title_canon_sha256":"701312d20bd3140e01327a54ce65299ac16c39945837b0bb3d214af47081b8f6"},"schema_version":"1.0","source":{"id":"2605.14178","kind":"arxiv","version":1}},"canonical_sha256":"71181ff96c682d1dd36184ca6b49b0e9ddc29fee31a7127128a99cf32c0aced8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71181ff96c682d1dd36184ca6b49b0e9ddc29fee31a7127128a99cf32c0aced8","first_computed_at":"2026-05-17T23:39:11.279624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.279624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nAQP3LnvW/KcRiWQzu47og+vq0bFrFTxLbkcyRggOaUPd1DVjReTh+mlq09lPy8QTYjzcJFceP0I5KE2m5etCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.280156Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99c843d9cd5d63bff83f18b2114793ab05ba73cb4b1c5ec2bccfff3d2146ae8c","sha256:78c797555ecc109aaa64e94af414e4a70e34897fcecea8f4f22345ce215c1c57"],"state_sha256":"380ba7e7c44f582bfe277de6c7746ca2019bda62d7b03f94f905ac2a5a16c427"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgGOFW9YcxUa7kyQRprFhXkpM0QiNHWjADVjHy/4VCYwB1Na7fIlXIqZagS/tsQc2eXsEXkkKF2AVrN3vHilCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:18:12.537072Z","bundle_sha256":"cb1f9ddb29b2f676204cc83895fc2a7fc0d5c3b52a2b5849f70bf810b35bc36f"}}