{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZQ2PHZ26C5OHOT6UV6LJMEJRQ5","short_pith_number":"pith:ZQ2PHZ26","canonical_record":{"source":{"id":"2605.13423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2026-05-13T12:17:58Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"05b415c99f91d9d5ea51535d29566e63f699e435daef9e6cc555cc7e4f36f382","abstract_canon_sha256":"9b8bf3b0f516e7f070052f5af812fa9c015efb226a976530d21abca83479f907"},"schema_version":"1.0"},"canonical_sha256":"cc34f3e75e175c774fd4af969611318751ef4d3a0a238bf42a7b025ecf516a75","source":{"kind":"arxiv","id":"2605.13423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13423","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13423v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13423","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZQ2PHZ26C5OH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZQ2PHZ26C5OHOT6U","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZQ2PHZ26","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZQ2PHZ26C5OHOT6UV6LJMEJRQ5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2026-05-13T12:17:58Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"05b415c99f91d9d5ea51535d29566e63f699e435daef9e6cc555cc7e4f36f382","abstract_canon_sha256":"9b8bf3b0f516e7f070052f5af812fa9c015efb226a976530d21abca83479f907"},"schema_version":"1.0"},"canonical_sha256":"cc34f3e75e175c774fd4af969611318751ef4d3a0a238bf42a7b025ecf516a75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:47.310040Z","signature_b64":"PGIL2jmbc5SwOt0P+9zyS3OU0c8NrnYeBdEgG/+KnotmiHakgmbe7FKNrU5x0ojIcTUClJhh0dl7lUtSa2GwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc34f3e75e175c774fd4af969611318751ef4d3a0a238bf42a7b025ecf516a75","last_reissued_at":"2026-05-18T02:44:47.309449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:47.309449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13423","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-18T02:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gmuUSVFdyJqrnlJjsbpdrE9+KFkZgOf7nhQc2K6xoGJ0hItPA/mZKgcGg+hAoWV2GdT/lk4lNH8Hv/AbxAK0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:35:13.467521Z"},"content_sha256":"cc9017efbca7a42e87030ae2a2a5e2e13c648bbbe36ebaf2507249b207d44575","schema_version":"1.0","event_id":"sha256:cc9017efbca7a42e87030ae2a2a5e2e13c648bbbe36ebaf2507249b207d44575"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZQ2PHZ26C5OHOT6UV6LJMEJRQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ultrametric Graphons and Hierarchical Community Networks: Spectral Theory and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Explicit formulas for deterministic ultrametric Laplacians approximate the spectra of random hierarchical networks with high probability as size grows.","cross_cats":["math.PR"],"primary_cat":"math.SP","authors_text":"\\'Angel Alfredo Mor\\'an Ledezma","submitted_at":"2026-05-13T12:17:58Z","abstract_excerpt":"We develop a theory of ultrametric graphons as limiting objects for random networks with nested hierarchical community structure. A graphon $W:[0,1]^2\\to[0,1]$ is called ultrametric if $W(x,y)=w(d(x,y))$, where $d$ is an ultrametric on $[0,1]$ induced by a family of nested partitions and $w$ is a positive kernel. The resulting random graphs exhibit a nested hierarchical community structure in which the density of connections is governed by the ultrametric distance between vertices. The Laplacian $L_d^k$ of the deterministic graph sampled from an ultrametric graphon is itself an ultrametric Lap"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The normalized eigenvalues and spectral projectors of the random Laplacian L_r^k are arbitrarily close to those of L_d^k with high probability as k→∞, so that the explicit formulas for L_d^k provide closed-form approximations for the spectrum and spectral projectors of L_r^k.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The random graph is generated exactly according to the ultrametric graphon W(x,y)=w(d(x,y)) where d is induced by a fixed family of nested partitions and w is a positive kernel; if the true network deviates from this exact generative process the explicit formulas and convergence claims fail.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Ultrametric graphons model hierarchical community networks and yield closed-form Laplacian spectra that approximate those of sampled random graphs with high probability as hierarchy depth grows.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Explicit formulas for deterministic ultrametric Laplacians approximate the spectra of random hierarchical networks with high probability as size grows.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d70d6972ea426201ae2419412625263e754f6f04cbe0e2b4c4f974426431e9b2"},"source":{"id":"2605.13423","kind":"arxiv","version":1},"verdict":{"id":"3105970f-5f66-4392-ac44-537956ca440c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:39:44.780903Z","strongest_claim":"The normalized eigenvalues and spectral projectors of the random Laplacian L_r^k are arbitrarily close to those of L_d^k with high probability as k→∞, so that the explicit formulas for L_d^k provide closed-form approximations for the spectrum and spectral projectors of L_r^k.","one_line_summary":"Ultrametric graphons model hierarchical community networks and yield closed-form Laplacian spectra that approximate those of sampled random graphs with high probability as hierarchy depth grows.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The random graph is generated exactly according to the ultrametric graphon W(x,y)=w(d(x,y)) where d is induced by a fixed family of nested partitions and w is a positive kernel; if the true network deviates from this exact generative process the explicit formulas and convergence claims fail.","pith_extraction_headline":"Explicit formulas for deterministic ultrametric Laplacians approximate the spectra of random hierarchical networks with high probability as size grows."},"references":{"count":55,"sample":[{"doi":"10.1093/oso/","year":2018,"title":"Oxford University Press, 2019.doi:10.1093/oso/ 9780198787754.001.0001","work_id":"946f999e-2af9-4da1-91bb-ebc04505a5cf","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1103/physreve.69.026113","year":2004,"title":"Finding and evaluating community structure in networks","work_id":"6eabfd49-9e3c-4043-9c2c-93d3cc94080c","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.physrep.2009.11.002","year":2010,"title":"Community Detection in Graphs","work_id":"9955b190-ca62-49dd-850e-c20031c597c8","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2002,"title":"Science297(5586), 1551–1555 (2002) https://doi.org/10","work_id":"62b2940c-eb90-408a-b54d-fdeaca1e25c5","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1073/pnas.0703740104","year":2007,"title":"Proceedings of the National Academy of Sciences104(39), 15224–15229 (2007) https://doi.org/10.1073/pnas.0703740104","work_id":"11ee01f0-016c-4c0f-9e2f-0dd14d80310c","ref_index":6,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":55,"snapshot_sha256":"87e97477d087e78bdde641a5c2827cc7961d4e9941fa9a70acc0f9736468d9d0","internal_anchors":1},"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":"3105970f-5f66-4392-ac44-537956ca440c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HP5rwcPox/nZRFchvoX5A7czpmrazsyMSfiuqP9IYnq4haqgyQNxv38m/ezh4g62IyMy3IidWDSUvmkmVb4LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:35:13.468167Z"},"content_sha256":"63a5f9cb333c1bf7184df4d2c61428066c0c6436bde15559ea4cd1521588a05e","schema_version":"1.0","event_id":"sha256:63a5f9cb333c1bf7184df4d2c61428066c0c6436bde15559ea4cd1521588a05e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQ2PHZ26C5OHOT6UV6LJMEJRQ5/bundle.json","state_url":"https://pith.science/pith/ZQ2PHZ26C5OHOT6UV6LJMEJRQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQ2PHZ26C5OHOT6UV6LJMEJRQ5/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-10T19:35:13Z","links":{"resolver":"https://pith.science/pith/ZQ2PHZ26C5OHOT6UV6LJMEJRQ5","bundle":"https://pith.science/pith/ZQ2PHZ26C5OHOT6UV6LJMEJRQ5/bundle.json","state":"https://pith.science/pith/ZQ2PHZ26C5OHOT6UV6LJMEJRQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQ2PHZ26C5OHOT6UV6LJMEJRQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZQ2PHZ26C5OHOT6UV6LJMEJRQ5","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":"9b8bf3b0f516e7f070052f5af812fa9c015efb226a976530d21abca83479f907","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2026-05-13T12:17:58Z","title_canon_sha256":"05b415c99f91d9d5ea51535d29566e63f699e435daef9e6cc555cc7e4f36f382"},"schema_version":"1.0","source":{"id":"2605.13423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13423","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13423v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13423","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZQ2PHZ26C5OH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZQ2PHZ26C5OHOT6U","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZQ2PHZ26","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:63a5f9cb333c1bf7184df4d2c61428066c0c6436bde15559ea4cd1521588a05e","target":"graph","created_at":"2026-05-18T02:44:47Z","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":"The normalized eigenvalues and spectral projectors of the random Laplacian L_r^k are arbitrarily close to those of L_d^k with high probability as k→∞, so that the explicit formulas for L_d^k provide closed-form approximations for the spectrum and spectral projectors of L_r^k."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The random graph is generated exactly according to the ultrametric graphon W(x,y)=w(d(x,y)) where d is induced by a fixed family of nested partitions and w is a positive kernel; if the true network deviates from this exact generative process the explicit formulas and convergence claims fail."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Ultrametric graphons model hierarchical community networks and yield closed-form Laplacian spectra that approximate those of sampled random graphs with high probability as hierarchy depth grows."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Explicit formulas for deterministic ultrametric Laplacians approximate the spectra of random hierarchical networks with high probability as size grows."}],"snapshot_sha256":"d70d6972ea426201ae2419412625263e754f6f04cbe0e2b4c4f974426431e9b2"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We develop a theory of ultrametric graphons as limiting objects for random networks with nested hierarchical community structure. A graphon $W:[0,1]^2\\to[0,1]$ is called ultrametric if $W(x,y)=w(d(x,y))$, where $d$ is an ultrametric on $[0,1]$ induced by a family of nested partitions and $w$ is a positive kernel. The resulting random graphs exhibit a nested hierarchical community structure in which the density of connections is governed by the ultrametric distance between vertices. The Laplacian $L_d^k$ of the deterministic graph sampled from an ultrametric graphon is itself an ultrametric Lap","authors_text":"\\'Angel Alfredo Mor\\'an Ledezma","cross_cats":["math.PR"],"headline":"Explicit formulas for deterministic ultrametric Laplacians approximate the spectra of random hierarchical networks with high probability as size grows.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2026-05-13T12:17:58Z","title":"Ultrametric Graphons and Hierarchical Community Networks: Spectral Theory and Applications"},"references":{"count":55,"internal_anchors":1,"resolved_work":55,"sample":[{"cited_arxiv_id":"","doi":"10.1093/oso/","is_internal_anchor":false,"ref_index":1,"title":"Oxford University Press, 2019.doi:10.1093/oso/ 9780198787754.001.0001","work_id":"946f999e-2af9-4da1-91bb-ebc04505a5cf","year":2018},{"cited_arxiv_id":"","doi":"10.1103/physreve.69.026113","is_internal_anchor":false,"ref_index":3,"title":"Finding and evaluating community structure in networks","work_id":"6eabfd49-9e3c-4043-9c2c-93d3cc94080c","year":2004},{"cited_arxiv_id":"","doi":"10.1016/j.physrep.2009.11.002","is_internal_anchor":false,"ref_index":4,"title":"Community Detection in Graphs","work_id":"9955b190-ca62-49dd-850e-c20031c597c8","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Science297(5586), 1551–1555 (2002) https://doi.org/10","work_id":"62b2940c-eb90-408a-b54d-fdeaca1e25c5","year":2002},{"cited_arxiv_id":"","doi":"10.1073/pnas.0703740104","is_internal_anchor":false,"ref_index":6,"title":"Proceedings of the National Academy of Sciences104(39), 15224–15229 (2007) https://doi.org/10.1073/pnas.0703740104","work_id":"11ee01f0-016c-4c0f-9e2f-0dd14d80310c","year":2007}],"snapshot_sha256":"87e97477d087e78bdde641a5c2827cc7961d4e9941fa9a70acc0f9736468d9d0"},"source":{"id":"2605.13423","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:39:44.780903Z","id":"3105970f-5f66-4392-ac44-537956ca440c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Ultrametric graphons model hierarchical community networks and yield closed-form Laplacian spectra that approximate those of sampled random graphs with high probability as hierarchy depth grows.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Explicit formulas for deterministic ultrametric Laplacians approximate the spectra of random hierarchical networks with high probability as size grows.","strongest_claim":"The normalized eigenvalues and spectral projectors of the random Laplacian L_r^k are arbitrarily close to those of L_d^k with high probability as k→∞, so that the explicit formulas for L_d^k provide closed-form approximations for the spectrum and spectral projectors of L_r^k.","weakest_assumption":"The random graph is generated exactly according to the ultrametric graphon W(x,y)=w(d(x,y)) where d is induced by a fixed family of nested partitions and w is a positive kernel; if the true network deviates from this exact generative process the explicit formulas and convergence claims fail."}},"verdict_id":"3105970f-5f66-4392-ac44-537956ca440c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cc9017efbca7a42e87030ae2a2a5e2e13c648bbbe36ebaf2507249b207d44575","target":"record","created_at":"2026-05-18T02:44:47Z","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":"9b8bf3b0f516e7f070052f5af812fa9c015efb226a976530d21abca83479f907","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2026-05-13T12:17:58Z","title_canon_sha256":"05b415c99f91d9d5ea51535d29566e63f699e435daef9e6cc555cc7e4f36f382"},"schema_version":"1.0","source":{"id":"2605.13423","kind":"arxiv","version":1}},"canonical_sha256":"cc34f3e75e175c774fd4af969611318751ef4d3a0a238bf42a7b025ecf516a75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc34f3e75e175c774fd4af969611318751ef4d3a0a238bf42a7b025ecf516a75","first_computed_at":"2026-05-18T02:44:47.309449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:47.309449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PGIL2jmbc5SwOt0P+9zyS3OU0c8NrnYeBdEgG/+KnotmiHakgmbe7FKNrU5x0ojIcTUClJhh0dl7lUtSa2GwAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:47.310040Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc9017efbca7a42e87030ae2a2a5e2e13c648bbbe36ebaf2507249b207d44575","sha256:63a5f9cb333c1bf7184df4d2c61428066c0c6436bde15559ea4cd1521588a05e"],"state_sha256":"b5b358ea3db008102c432b027f43e78d0bd7fc450b26fb0643a3aff5d2c81a0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgyCtL49PSHkAoX2Z7ZOrx/lLC5KjZ+2DQkY0446iddmru1uowgLF8P3HKqrtmrmU+z6fYKPc8QXkRHPRZcHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:35:13.470705Z","bundle_sha256":"4ee4d81de2f2b027f886614db15a7534f3df1d4f06a561fe66910c97a50596b4"}}