{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KVIQTO6GC6PVZVDXZQMFBVGRPV","short_pith_number":"pith:KVIQTO6G","canonical_record":{"source":{"id":"2605.14058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-13T19:33:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a4ab96662b01f0ab7e03d12c26d5157a8c50013b407c91afd989cfc9322492ee","abstract_canon_sha256":"9ffd0c4a9a11105978979c9f9d00e10ef2d389b310bcddf8d4736bce089a528b"},"schema_version":"1.0"},"canonical_sha256":"555109bbc6179f5cd477cc1850d4d17d75f7a1c411c8f577125b4c0c4a2143c6","source":{"kind":"arxiv","id":"2605.14058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14058","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14058v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14058","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"KVIQTO6GC6PV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KVIQTO6GC6PVZVDX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KVIQTO6G","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KVIQTO6GC6PVZVDXZQMFBVGRPV","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-13T19:33:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a4ab96662b01f0ab7e03d12c26d5157a8c50013b407c91afd989cfc9322492ee","abstract_canon_sha256":"9ffd0c4a9a11105978979c9f9d00e10ef2d389b310bcddf8d4736bce089a528b"},"schema_version":"1.0"},"canonical_sha256":"555109bbc6179f5cd477cc1850d4d17d75f7a1c411c8f577125b4c0c4a2143c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:12.559021Z","signature_b64":"SihZ8O5TWAwxNX0lvDOBwHsPYm8EnZF6nhoi1iaDOjLZOMXLSDDoOMbZXrLrGr6ObeuINQeeE6bAu7eSYCmOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"555109bbc6179f5cd477cc1850d4d17d75f7a1c411c8f577125b4c0c4a2143c6","last_reissued_at":"2026-05-17T23:39:12.558120Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:12.558120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14058","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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUbKjsNumSrs3nEDK91DwOJzvSLw8Mv/oiQb3tFPxzfYDN91yRK0uukzQor9+gDkrwFowWojNr1ltltS86UZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:13:15.454957Z"},"content_sha256":"3206f553b0eaeb5c026947c6f07ef0665499e23601199ebcb08817eca3819dfc","schema_version":"1.0","event_id":"sha256:3206f553b0eaeb5c026947c6f07ef0665499e23601199ebcb08817eca3819dfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KVIQTO6GC6PVZVDXZQMFBVGRPV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Non-convex optimization solvers compute four classical lower bounds on the nonnegative rank of matrices, including the first method for the self-scaled bound.","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Arnaud Vandaele, Nicolas Gillis, Timothy Baeckelant","submitted_at":"2026-05-13T19:33:30Z","abstract_excerpt":"The nonnegative rank of a nonnegative matrix $X$ is the smallest number of nonnegative rank-one factors that sum to $X$. Since computing the nonnegative rank is NP-hard, it is common to circumvent this issue by computing lower and upper bounds. In this paper, we propose non-convex formulations and practical implementations for four important lower bounds for the nonnegative rank, namely the fooling set bound (FSB), the rectangle covering bound (RCB), the hyperplane separation bound (HSB), and the self-scaled bound (SSB). In particular, our algorithm for computing the SSB is the first available"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"our algorithm for computing the SSB is the first available in the literature, to the best of our knowledge. It allows us to improve the best known lower bound on the nonnegative rank for some matrices. In some cases, they coincide with the best known upper bound, thereby establishing their exact nonnegative rank for the first time.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That non-convex solvers reliably reach solutions accurate enough to certify valid lower bounds without getting stuck in poor local minima that would invalidate the bound.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Non-convex solvers compute improved lower bounds on nonnegative matrix rank, with a new algorithm for the self-scaled bound that establishes exact rank for some matrices.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Non-convex optimization solvers compute four classical lower bounds on the nonnegative rank of matrices, including the first method for the self-scaled bound.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"05bbb9381eeed6dc7c681a3b05a9a7ac5242e12a95b55c33f26ab8eb20070c84"},"source":{"id":"2605.14058","kind":"arxiv","version":1},"verdict":{"id":"a1f4fb96-7a62-4d2a-8964-b72a30a30ff3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:40:53.417325Z","strongest_claim":"our algorithm for computing the SSB is the first available in the literature, to the best of our knowledge. It allows us to improve the best known lower bound on the nonnegative rank for some matrices. In some cases, they coincide with the best known upper bound, thereby establishing their exact nonnegative rank for the first time.","one_line_summary":"Non-convex solvers compute improved lower bounds on nonnegative matrix rank, with a new algorithm for the self-scaled bound that establishes exact rank for some matrices.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That non-convex solvers reliably reach solutions accurate enough to certify valid lower bounds without getting stuck in poor local minima that would invalidate the bound.","pith_extraction_headline":"Non-convex optimization solvers compute four classical lower bounds on the nonnegative rank of matrices, including the first method for the self-scaled bound."},"references":{"count":33,"sample":[{"doi":"","year":2004,"title":"G. Alexe, S. Alexe, Y. Crama, S. Foldes, P. L. Hammer, and B. Simeone. Consensus algorithms for the generation of all maximal bicliques.Discrete Applied Mathematics, 145(1):11–21, 2004","work_id":"ced3dce0-1b4f-4532-bffa-23f8855247cf","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"S. Arora, R. Ge, R. Kannan, and A. Moitra. Computing a nonnegative matrix factorization–provably. InACM Symposium on Theory of Computing, pages 145–162, 2012","work_id":"96f0493b-6af9-45ff-ae98-18911e33b1ba","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1986,"title":"C. Barefoot, K. A. Hefner, K. F. Jones, and J. R. Lundgren. Biclique covers of the complements of cycles and paths in a digraph.Congressus Numerantium, 53:133–146, 1986","work_id":"08c0bc8f-cc57-4b8b-b706-b3044e0ba4ad","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"L. Beasley and T. Laffey. Real rank versus nonnegative rank.Linear Algebra and Its Applications, 431(12):2330–2335, 2009","work_id":"abc20f60-83ab-4de6-877d-98137a22a006","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"A. Ben-Tal and A. Nemirovski. On polyhedral approximations of the second-order cone.Mathematics of Operations Research, 26(2):193–205, 2001","work_id":"eaba1884-ad09-4474-a02a-27a0a49895b8","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":33,"snapshot_sha256":"cf5f6b5062fbc975012a995846822aa012dcb5f97f9c4945780d69607b825216","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"1c36424ee47656c29d8ae9768f7da7ef547146395c1bbec7f76eaf530623cef0"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"a1f4fb96-7a62-4d2a-8964-b72a30a30ff3"},"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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlEbEWfx+X1i9ALu2UU5RyS89o0Q7M+rt1zO8Gdf4pn/H8YbO75wuPhP7ZEZqYdOAkPa4Px/tpXGCqQcFttQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:13:15.456103Z"},"content_sha256":"7cbb5b030ba085d7a40a31ddbbb0f196c179a96cb05e6091876c1d17ca07b16d","schema_version":"1.0","event_id":"sha256:7cbb5b030ba085d7a40a31ddbbb0f196c179a96cb05e6091876c1d17ca07b16d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVIQTO6GC6PVZVDXZQMFBVGRPV/bundle.json","state_url":"https://pith.science/pith/KVIQTO6GC6PVZVDXZQMFBVGRPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVIQTO6GC6PVZVDXZQMFBVGRPV/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-26T14:13:15Z","links":{"resolver":"https://pith.science/pith/KVIQTO6GC6PVZVDXZQMFBVGRPV","bundle":"https://pith.science/pith/KVIQTO6GC6PVZVDXZQMFBVGRPV/bundle.json","state":"https://pith.science/pith/KVIQTO6GC6PVZVDXZQMFBVGRPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVIQTO6GC6PVZVDXZQMFBVGRPV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KVIQTO6GC6PVZVDXZQMFBVGRPV","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":"9ffd0c4a9a11105978979c9f9d00e10ef2d389b310bcddf8d4736bce089a528b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-13T19:33:30Z","title_canon_sha256":"a4ab96662b01f0ab7e03d12c26d5157a8c50013b407c91afd989cfc9322492ee"},"schema_version":"1.0","source":{"id":"2605.14058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14058","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14058v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14058","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"KVIQTO6GC6PV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KVIQTO6GC6PVZVDX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KVIQTO6G","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:7cbb5b030ba085d7a40a31ddbbb0f196c179a96cb05e6091876c1d17ca07b16d","target":"graph","created_at":"2026-05-17T23:39:12Z","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 algorithm for computing the SSB is the first available in the literature, to the best of our knowledge. It allows us to improve the best known lower bound on the nonnegative rank for some matrices. In some cases, they coincide with the best known upper bound, thereby establishing their exact nonnegative rank for the first time."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That non-convex solvers reliably reach solutions accurate enough to certify valid lower bounds without getting stuck in poor local minima that would invalidate the bound."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Non-convex solvers compute improved lower bounds on nonnegative matrix rank, with a new algorithm for the self-scaled bound that establishes exact rank for some matrices."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Non-convex optimization solvers compute four classical lower bounds on the nonnegative rank of matrices, including the first method for the self-scaled bound."}],"snapshot_sha256":"05bbb9381eeed6dc7c681a3b05a9a7ac5242e12a95b55c33f26ab8eb20070c84"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"1c36424ee47656c29d8ae9768f7da7ef547146395c1bbec7f76eaf530623cef0"},"paper":{"abstract_excerpt":"The nonnegative rank of a nonnegative matrix $X$ is the smallest number of nonnegative rank-one factors that sum to $X$. Since computing the nonnegative rank is NP-hard, it is common to circumvent this issue by computing lower and upper bounds. In this paper, we propose non-convex formulations and practical implementations for four important lower bounds for the nonnegative rank, namely the fooling set bound (FSB), the rectangle covering bound (RCB), the hyperplane separation bound (HSB), and the self-scaled bound (SSB). In particular, our algorithm for computing the SSB is the first available","authors_text":"Arnaud Vandaele, Nicolas Gillis, Timothy Baeckelant","cross_cats":["cs.DM"],"headline":"Non-convex optimization solvers compute four classical lower bounds on the nonnegative rank of matrices, including the first method for the self-scaled bound.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-13T19:33:30Z","title":"Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers"},"references":{"count":33,"internal_anchors":1,"resolved_work":33,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"G. Alexe, S. Alexe, Y. Crama, S. Foldes, P. L. Hammer, and B. Simeone. Consensus algorithms for the generation of all maximal bicliques.Discrete Applied Mathematics, 145(1):11–21, 2004","work_id":"ced3dce0-1b4f-4532-bffa-23f8855247cf","year":2004},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"S. Arora, R. Ge, R. Kannan, and A. Moitra. Computing a nonnegative matrix factorization–provably. InACM Symposium on Theory of Computing, pages 145–162, 2012","work_id":"96f0493b-6af9-45ff-ae98-18911e33b1ba","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"C. Barefoot, K. A. Hefner, K. F. Jones, and J. R. Lundgren. Biclique covers of the complements of cycles and paths in a digraph.Congressus Numerantium, 53:133–146, 1986","work_id":"08c0bc8f-cc57-4b8b-b706-b3044e0ba4ad","year":1986},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"L. Beasley and T. Laffey. Real rank versus nonnegative rank.Linear Algebra and Its Applications, 431(12):2330–2335, 2009","work_id":"abc20f60-83ab-4de6-877d-98137a22a006","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A. Ben-Tal and A. Nemirovski. On polyhedral approximations of the second-order cone.Mathematics of Operations Research, 26(2):193–205, 2001","work_id":"eaba1884-ad09-4474-a02a-27a0a49895b8","year":2001}],"snapshot_sha256":"cf5f6b5062fbc975012a995846822aa012dcb5f97f9c4945780d69607b825216"},"source":{"id":"2605.14058","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:40:53.417325Z","id":"a1f4fb96-7a62-4d2a-8964-b72a30a30ff3","model_set":{"reader":"grok-4.3"},"one_line_summary":"Non-convex solvers compute improved lower bounds on nonnegative matrix rank, with a new algorithm for the self-scaled bound that establishes exact rank for some matrices.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Non-convex optimization solvers compute four classical lower bounds on the nonnegative rank of matrices, including the first method for the self-scaled bound.","strongest_claim":"our algorithm for computing the SSB is the first available in the literature, to the best of our knowledge. It allows us to improve the best known lower bound on the nonnegative rank for some matrices. In some cases, they coincide with the best known upper bound, thereby establishing their exact nonnegative rank for the first time.","weakest_assumption":"That non-convex solvers reliably reach solutions accurate enough to certify valid lower bounds without getting stuck in poor local minima that would invalidate the bound."}},"verdict_id":"a1f4fb96-7a62-4d2a-8964-b72a30a30ff3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3206f553b0eaeb5c026947c6f07ef0665499e23601199ebcb08817eca3819dfc","target":"record","created_at":"2026-05-17T23:39:12Z","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":"9ffd0c4a9a11105978979c9f9d00e10ef2d389b310bcddf8d4736bce089a528b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-13T19:33:30Z","title_canon_sha256":"a4ab96662b01f0ab7e03d12c26d5157a8c50013b407c91afd989cfc9322492ee"},"schema_version":"1.0","source":{"id":"2605.14058","kind":"arxiv","version":1}},"canonical_sha256":"555109bbc6179f5cd477cc1850d4d17d75f7a1c411c8f577125b4c0c4a2143c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"555109bbc6179f5cd477cc1850d4d17d75f7a1c411c8f577125b4c0c4a2143c6","first_computed_at":"2026-05-17T23:39:12.558120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:12.558120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SihZ8O5TWAwxNX0lvDOBwHsPYm8EnZF6nhoi1iaDOjLZOMXLSDDoOMbZXrLrGr6ObeuINQeeE6bAu7eSYCmOBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:12.559021Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3206f553b0eaeb5c026947c6f07ef0665499e23601199ebcb08817eca3819dfc","sha256:7cbb5b030ba085d7a40a31ddbbb0f196c179a96cb05e6091876c1d17ca07b16d"],"state_sha256":"c153345900336bfae4c3c21dc235a6e21a023ef18f0973095ea4d88fda92e8aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXGoknKWegiruLp5usOEuv3Uuo2F9wrkSOY+bHQ14ylAM9DR0/ahjrAVCxxddphpRk+vyhFqXtPXgD7BkvY5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:13:15.460302Z","bundle_sha256":"8714d20acf685e3d15e61b710ae740bdf97b7182285235a44fe4c96bcfcee2fb"}}