{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NYSKETAXSSUZUYYHVAS7MNGUNX","short_pith_number":"pith:NYSKETAX","canonical_record":{"source":{"id":"2605.17383","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T10:56:03Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"be4f4a975f1b6fd416dbcee97acd3145da2d7b14742c780be489bb9d32694fd1","abstract_canon_sha256":"3a01e8db8d89238d744f2eff34881d51aedc3523a1f441261fc1f728ed232ead"},"schema_version":"1.0"},"canonical_sha256":"6e24a24c1794a99a6307a825f634d46de59602cfa7b4ad14e677731e9df0eccb","source":{"kind":"arxiv","id":"2605.17383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17383","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17383v1","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17383","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"NYSKETAXSSUZ","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"pith_short_16","alias_value":"NYSKETAXSSUZUYYH","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"pith_short_8","alias_value":"NYSKETAX","created_at":"2026-05-20T00:03:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NYSKETAXSSUZUYYHVAS7MNGUNX","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17383","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T10:56:03Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"be4f4a975f1b6fd416dbcee97acd3145da2d7b14742c780be489bb9d32694fd1","abstract_canon_sha256":"3a01e8db8d89238d744f2eff34881d51aedc3523a1f441261fc1f728ed232ead"},"schema_version":"1.0"},"canonical_sha256":"6e24a24c1794a99a6307a825f634d46de59602cfa7b4ad14e677731e9df0eccb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:55.827147Z","signature_b64":"bdPvK7Uogv19Fad1FHRlr6NWCMOyC+Y1/QY4dwzrT1SM7O5oflwTkm5PHzBkYKmyMhG/OGY2iRLfkBBJY5DDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e24a24c1794a99a6307a825f634d46de59602cfa7b4ad14e677731e9df0eccb","last_reissued_at":"2026-05-20T00:03:55.826247Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:55.826247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17383","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-20T00:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3/D6u1m0/xZI5v+5t09UYFhaQLPS0TLVvteyum5D+pOARpyavOTceMU+ma70agBQKk6IDn1LqMGLGWtDlc2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:07.111382Z"},"content_sha256":"e7dcb4eb0b52a3afbe5d9490786989fd3ad024f858136d2b44ffceded77f1261","schema_version":"1.0","event_id":"sha256:e7dcb4eb0b52a3afbe5d9490786989fd3ad024f858136d2b44ffceded77f1261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NYSKETAXSSUZUYYHVAS7MNGUNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization problem for star covers of graphs without four cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"For graphs without four-cycles the SNT-rank is given by the minimum number of bipartite components in a star cover.","cross_cats":["math.RA"],"primary_cat":"math.CO","authors_text":"Damjana Kokol Bukov\\v{s}ek, Helena \\v{S}migoc, Polona Oblak","submitted_at":"2026-05-17T10:56:03Z","abstract_excerpt":"This work presents a study of star covers on graphs. Unlike traditional formulations that minimize the number of stars, our aim is to optimize the number of bipartite components used in the cover. This problem, motivated by a symmetric nonnegative trifactorization of matrices and the SNT-rank of graphs, is in general hard to solve. We consider a family of graphs that do not contain four cycles, and develop an algorithm to determine the SNT-rank of such graphs."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We consider a family of graphs that do not contain four cycles, and develop an algorithm to determine the SNT-rank of such graphs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The restriction to C4-free graphs is sufficient to make the optimization problem of counting bipartite components in a star cover both well-defined and algorithmically solvable.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Develops an algorithm to compute the SNT-rank of C4-free graphs by optimizing the number of bipartite components in star covers.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For graphs without four-cycles the SNT-rank is given by the minimum number of bipartite components in a star cover.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f39116e96a0d9e8ba268071f7d10b8f21b95cf3a1149acf115d7bc8e6578a03b"},"source":{"id":"2605.17383","kind":"arxiv","version":1},"verdict":{"id":"6a6f7ba7-5033-4936-87f4-96d8395430bb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T22:57:39.200100Z","strongest_claim":"We consider a family of graphs that do not contain four cycles, and develop an algorithm to determine the SNT-rank of such graphs.","one_line_summary":"Develops an algorithm to compute the SNT-rank of C4-free graphs by optimizing the number of bipartite components in star covers.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The restriction to C4-free graphs is sufficient to make the optimization problem of counting bipartite components in a star cover both well-defined and algorithmically solvable.","pith_extraction_headline":"For graphs without four-cycles the SNT-rank is given by the minimum number of bipartite components in a star cover."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17383/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.037570Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:12:57.372983Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.767388Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.706982Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"9e8dd51cfff8459ee5a75668eb6fa179de15f2ce6e111e01425d0224a26ee1fc"},"references":{"count":14,"sample":[{"doi":"","year":2016,"title":"LeRoy B. Beasley. Preservers of term ranks and star cover numbers of symmetric matrices.Electron. J. Linear Algebra, 31:549–564, 2016","work_id":"0f25248c-3dbb-40f5-aa8b-ce72503d005a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Beasley and Thomas J","work_id":"8ec6f85c-d377-49d4-8de5-675f4a2d779b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1981,"title":"D. de Caen, D. A. Gregory, and N. J. Pullman. The Boolean rank of zero-one matrices. InProceedings of the Third Caribbean Conference on Combinatorics and Computing (Bridgetown, 1981), pages 169–173. U","work_id":"9b9dffb1-3fb4-418f-888e-b71359dd3aaa","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Springer, Heidelberg, fourth edition, 2010","work_id":"18a2a350-201f-4553-84db-b996f82a937e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2045,"title":"Covering graphs with few complete bipartite subgraphs.Theoret","work_id":"6e34791c-d076-4d56-8f9e-847d6f3ffb14","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":14,"snapshot_sha256":"65f67f62c05ae2999b247f00376a216372b8a9aeef430c886b18ca67988b9cda","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9196be18a522ff2a54082670af0d8da4c2caea63fc64ca8e0cf46fd4204aadf5"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"6a6f7ba7-5033-4936-87f4-96d8395430bb"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+n9Nisg/I/YRCtYh9az4A3U/ILF7fQsK5xt2GVgDdKGMjxRSiGZCSJR0UMa3ac6uiuT/pDHIhzT0oxOW65AqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:07.112411Z"},"content_sha256":"7546d4f71efdc5caa3f5d0302d53f09d20d76e3a644a628f9f74a18f9d2e052f","schema_version":"1.0","event_id":"sha256:7546d4f71efdc5caa3f5d0302d53f09d20d76e3a644a628f9f74a18f9d2e052f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYSKETAXSSUZUYYHVAS7MNGUNX/bundle.json","state_url":"https://pith.science/pith/NYSKETAXSSUZUYYHVAS7MNGUNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYSKETAXSSUZUYYHVAS7MNGUNX/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-30T17:48:07Z","links":{"resolver":"https://pith.science/pith/NYSKETAXSSUZUYYHVAS7MNGUNX","bundle":"https://pith.science/pith/NYSKETAXSSUZUYYHVAS7MNGUNX/bundle.json","state":"https://pith.science/pith/NYSKETAXSSUZUYYHVAS7MNGUNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYSKETAXSSUZUYYHVAS7MNGUNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NYSKETAXSSUZUYYHVAS7MNGUNX","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":"3a01e8db8d89238d744f2eff34881d51aedc3523a1f441261fc1f728ed232ead","cross_cats_sorted":["math.RA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T10:56:03Z","title_canon_sha256":"be4f4a975f1b6fd416dbcee97acd3145da2d7b14742c780be489bb9d32694fd1"},"schema_version":"1.0","source":{"id":"2605.17383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17383","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17383v1","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17383","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"NYSKETAXSSUZ","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"pith_short_16","alias_value":"NYSKETAXSSUZUYYH","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"pith_short_8","alias_value":"NYSKETAX","created_at":"2026-05-20T00:03:55Z"}],"graph_snapshots":[{"event_id":"sha256:7546d4f71efdc5caa3f5d0302d53f09d20d76e3a644a628f9f74a18f9d2e052f","target":"graph","created_at":"2026-05-20T00:03:55Z","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 consider a family of graphs that do not contain four cycles, and develop an algorithm to determine the SNT-rank of such graphs."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The restriction to C4-free graphs is sufficient to make the optimization problem of counting bipartite components in a star cover both well-defined and algorithmically solvable."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Develops an algorithm to compute the SNT-rank of C4-free graphs by optimizing the number of bipartite components in star covers."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For graphs without four-cycles the SNT-rank is given by the minimum number of bipartite components in a star cover."}],"snapshot_sha256":"f39116e96a0d9e8ba268071f7d10b8f21b95cf3a1149acf115d7bc8e6578a03b"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9196be18a522ff2a54082670af0d8da4c2caea63fc64ca8e0cf46fd4204aadf5"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.037570Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:12:57.372983Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.767388Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.706982Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17383/integrity.json","findings":[],"snapshot_sha256":"9e8dd51cfff8459ee5a75668eb6fa179de15f2ce6e111e01425d0224a26ee1fc","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work presents a study of star covers on graphs. Unlike traditional formulations that minimize the number of stars, our aim is to optimize the number of bipartite components used in the cover. This problem, motivated by a symmetric nonnegative trifactorization of matrices and the SNT-rank of graphs, is in general hard to solve. We consider a family of graphs that do not contain four cycles, and develop an algorithm to determine the SNT-rank of such graphs.","authors_text":"Damjana Kokol Bukov\\v{s}ek, Helena \\v{S}migoc, Polona Oblak","cross_cats":["math.RA"],"headline":"For graphs without four-cycles the SNT-rank is given by the minimum number of bipartite components in a star cover.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T10:56:03Z","title":"Optimization problem for star covers of graphs without four cycles"},"references":{"count":14,"internal_anchors":0,"resolved_work":14,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"LeRoy B. Beasley. Preservers of term ranks and star cover numbers of symmetric matrices.Electron. J. Linear Algebra, 31:549–564, 2016","work_id":"0f25248c-3dbb-40f5-aa8b-ce72503d005a","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Beasley and Thomas J","work_id":"8ec6f85c-d377-49d4-8de5-675f4a2d779b","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"D. de Caen, D. A. Gregory, and N. J. Pullman. The Boolean rank of zero-one matrices. InProceedings of the Third Caribbean Conference on Combinatorics and Computing (Bridgetown, 1981), pages 169–173. U","work_id":"9b9dffb1-3fb4-418f-888e-b71359dd3aaa","year":1981},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Springer, Heidelberg, fourth edition, 2010","work_id":"18a2a350-201f-4553-84db-b996f82a937e","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Covering graphs with few complete bipartite subgraphs.Theoret","work_id":"6e34791c-d076-4d56-8f9e-847d6f3ffb14","year":2045}],"snapshot_sha256":"65f67f62c05ae2999b247f00376a216372b8a9aeef430c886b18ca67988b9cda"},"source":{"id":"2605.17383","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:57:39.200100Z","id":"6a6f7ba7-5033-4936-87f4-96d8395430bb","model_set":{"reader":"grok-4.3"},"one_line_summary":"Develops an algorithm to compute the SNT-rank of C4-free graphs by optimizing the number of bipartite components in star covers.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For graphs without four-cycles the SNT-rank is given by the minimum number of bipartite components in a star cover.","strongest_claim":"We consider a family of graphs that do not contain four cycles, and develop an algorithm to determine the SNT-rank of such graphs.","weakest_assumption":"The restriction to C4-free graphs is sufficient to make the optimization problem of counting bipartite components in a star cover both well-defined and algorithmically solvable."}},"verdict_id":"6a6f7ba7-5033-4936-87f4-96d8395430bb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e7dcb4eb0b52a3afbe5d9490786989fd3ad024f858136d2b44ffceded77f1261","target":"record","created_at":"2026-05-20T00:03:55Z","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":"3a01e8db8d89238d744f2eff34881d51aedc3523a1f441261fc1f728ed232ead","cross_cats_sorted":["math.RA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T10:56:03Z","title_canon_sha256":"be4f4a975f1b6fd416dbcee97acd3145da2d7b14742c780be489bb9d32694fd1"},"schema_version":"1.0","source":{"id":"2605.17383","kind":"arxiv","version":1}},"canonical_sha256":"6e24a24c1794a99a6307a825f634d46de59602cfa7b4ad14e677731e9df0eccb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e24a24c1794a99a6307a825f634d46de59602cfa7b4ad14e677731e9df0eccb","first_computed_at":"2026-05-20T00:03:55.826247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:55.826247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bdPvK7Uogv19Fad1FHRlr6NWCMOyC+Y1/QY4dwzrT1SM7O5oflwTkm5PHzBkYKmyMhG/OGY2iRLfkBBJY5DDAw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:55.827147Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7dcb4eb0b52a3afbe5d9490786989fd3ad024f858136d2b44ffceded77f1261","sha256:7546d4f71efdc5caa3f5d0302d53f09d20d76e3a644a628f9f74a18f9d2e052f"],"state_sha256":"c63baa6fffc3833f3f6ce127bccd7aa899a3c89bfb2f1582962fe7697c674b72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2K+71I3uCjHowJvIBB3x1Rfg90C56Y2wKmFKm1NNyYH+E78m0r5vpg09IrFnZotHc/dcaVClrrccPRAs2kDOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:48:07.115510Z","bundle_sha256":"62be9a6be7562e1ea758c9d4f3187bbdbb3dd16b3b8bde3922966d0910fab82e"}}