{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VQNPXGYZWB5EKEQUFOBXKLVLQY","short_pith_number":"pith:VQNPXGYZ","canonical_record":{"source":{"id":"2509.11706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-09-15T09:07:04Z","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph"],"title_canon_sha256":"a166e7b1949f016afbde5af766bf9de3de25773045401e3b0cde1859818585c9","abstract_canon_sha256":"e39bd7954e5c526bb1b69abe57dc5cd939deb3d3d934d58fb8a9c0d7612c1e12"},"schema_version":"1.0"},"canonical_sha256":"ac1afb9b19b07a4512142b83752eab8626f18801aec88b488474080e22075dd4","source":{"kind":"arxiv","id":"2509.11706","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.11706","created_at":"2026-06-19T16:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"2509.11706v2","created_at":"2026-06-19T16:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.11706","created_at":"2026-06-19T16:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"VQNPXGYZWB5E","created_at":"2026-06-19T16:09:50Z"},{"alias_kind":"pith_short_16","alias_value":"VQNPXGYZWB5EKEQU","created_at":"2026-06-19T16:09:50Z"},{"alias_kind":"pith_short_8","alias_value":"VQNPXGYZ","created_at":"2026-06-19T16:09:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VQNPXGYZWB5EKEQUFOBXKLVLQY","target":"record","payload":{"canonical_record":{"source":{"id":"2509.11706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-09-15T09:07:04Z","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph"],"title_canon_sha256":"a166e7b1949f016afbde5af766bf9de3de25773045401e3b0cde1859818585c9","abstract_canon_sha256":"e39bd7954e5c526bb1b69abe57dc5cd939deb3d3d934d58fb8a9c0d7612c1e12"},"schema_version":"1.0"},"canonical_sha256":"ac1afb9b19b07a4512142b83752eab8626f18801aec88b488474080e22075dd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:50.946464Z","signature_b64":"laXLbXiAzS9Qn1LUs0253E8xo1aQC+STz11MksOZh8wcEvRj/INOwcs0kYd7ldvHV+P/CG+baNy9CxpWxbxzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac1afb9b19b07a4512142b83752eab8626f18801aec88b488474080e22075dd4","last_reissued_at":"2026-06-19T16:09:50.946024Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:50.946024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.11706","source_version":2,"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-06-19T16:09:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LdQdB7qoEgovveXbNE54j1kDFi/y7qFIF51nvh1J1+SFhtilP656+xi7ffOoCypeByxphz1mIS74bbISW1mDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T02:10:45.139643Z"},"content_sha256":"7de90a92ac9b9bc1c1e40ff473bb0debaadcd7c5ccf5c1b0a40e6480511ed259","schema_version":"1.0","event_id":"sha256:7de90a92ac9b9bc1c1e40ff473bb0debaadcd7c5ccf5c1b0a40e6480511ed259"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VQNPXGYZWB5EKEQUFOBXKLVLQY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Threshold and quasi-stationary distribution for the SIS model on networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Expanding the state space with a memory of when nodes last became susceptible improves the pair approximation for the SIS epidemic model on networks.","cross_cats":["cond-mat.stat-mech","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Cristopher Moore, George Cantwell","submitted_at":"2025-09-15T09:07:04Z","abstract_excerpt":"We study the Susceptible-Infectious-Susceptible (SIS) model on arbitrary networks. The well-established pair approximation treats neighboring pairs of nodes exactly while making a mean field approximation for the rest of the network. We improve the method by expanding the state space dynamically, giving nodes a memory of when they last became susceptible. The resulting approximation is simple to implement and appears to be highly accurate, both in locating the epidemic threshold and in computing the quasi-stationary fraction of infected individuals above the threshold, for both finite graphs a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The resulting approximation is simple to implement and appears to be highly accurate, both in locating the epidemic threshold and in computing the quasi-stationary fraction of infected individuals above the threshold, for both finite graphs and infinite random graphs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The dynamic expansion of the state space with memory of last susceptibility time sufficiently captures the higher-order correlations that the standard pair approximation misses, without introducing new fitting parameters that must be tuned to each network.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Dynamic state expansion with infection memory improves pair approximation accuracy for SIS epidemic threshold and quasi-stationary distribution on arbitrary networks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Expanding the state space with a memory of when nodes last became susceptible improves the pair approximation for the SIS epidemic model on networks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"21900ef5ab2482ca5fd3b0ac0d5fa873a3ecdd3a30c6852fc7356ffb640366d9"},"source":{"id":"2509.11706","kind":"arxiv","version":2},"verdict":{"id":"a3a2ca2c-78bc-4970-85c8-56e93fd4c7c2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T16:59:53.467910Z","strongest_claim":"The resulting approximation is simple to implement and appears to be highly accurate, both in locating the epidemic threshold and in computing the quasi-stationary fraction of infected individuals above the threshold, for both finite graphs and infinite random graphs.","one_line_summary":"Dynamic state expansion with infection memory improves pair approximation accuracy for SIS epidemic threshold and quasi-stationary distribution on arbitrary networks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The dynamic expansion of the state space with memory of last susceptibility time sufficiently captures the higher-order correlations that the standard pair approximation misses, without introducing new fitting parameters that must be tuned to each network.","pith_extraction_headline":"Expanding the state space with a memory of when nodes last became susceptible improves the pair approximation for the SIS epidemic model on networks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.11706/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":35,"sample":[{"doi":"","year":null,"title":"Our SISK pair approximation also allows us to compute this and if it approximatesP ij more accurately, then it should approximate spatial correlations more accurately","work_id":"70ff2dc1-c489-4f19-ae5d-29dd4c2a3e85","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"surface- to-volume ratio","work_id":"92911673-0495-4830-aae1-8a0bfb3389d5","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"While these equations describe the large-Klimit of our approach, we believe that that they are still not exact, even on random regular graphs","work_id":"afcf2f5b-e614-4f3d-b33c-50aafc795acc","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-319-50806-1","year":2017,"title":"I. Z. Kiss, J. C. Miller, and P. L. Simon,Math- ematics of Epidemics on Networks: From Exact to Approximate Models, volume 46 ofInterdisciplinary Applied Mathematics. Springer International Publish- i","work_id":"63f80f98-7c41-4296-b390-866e8d043c36","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"R. Pastor-Satorras, C. Castellano, P. Van Mieghem, and A. Vespignani, Epidemic processes in complex networks.Reviews of Modern Physics87(3), 925– 979 (2015), URLhttps://link.aps.org/doi/10.1103/ RevMo","work_id":"d0985a8d-8803-47bd-9453-b3c0c60f8a16","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":35,"snapshot_sha256":"afceb10974b9e7cdeb8530a244b41e2768aa7f7f808f57b889557a7a77b9d965","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"437ac2058f524f83704fea01f36618e2736e0a7f690eb30f1bd229728d6faa44"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"a3a2ca2c-78bc-4970-85c8-56e93fd4c7c2"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:09:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wk+obGbRvLUNqG3BuXjwMsicRyrEn/lGCUDp+t+kY7i0fWHZmGT11jI+HHKkCUrzW9VHiJEV9zpzHhYCNkE4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T02:10:45.140214Z"},"content_sha256":"61b648a918993de0e0b3434313ba245a136982ae22e0ca198057220b493be665","schema_version":"1.0","event_id":"sha256:61b648a918993de0e0b3434313ba245a136982ae22e0ca198057220b493be665"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQNPXGYZWB5EKEQUFOBXKLVLQY/bundle.json","state_url":"https://pith.science/pith/VQNPXGYZWB5EKEQUFOBXKLVLQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQNPXGYZWB5EKEQUFOBXKLVLQY/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-08-23T02:10:45Z","links":{"resolver":"https://pith.science/pith/VQNPXGYZWB5EKEQUFOBXKLVLQY","bundle":"https://pith.science/pith/VQNPXGYZWB5EKEQUFOBXKLVLQY/bundle.json","state":"https://pith.science/pith/VQNPXGYZWB5EKEQUFOBXKLVLQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQNPXGYZWB5EKEQUFOBXKLVLQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VQNPXGYZWB5EKEQUFOBXKLVLQY","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":"e39bd7954e5c526bb1b69abe57dc5cd939deb3d3d934d58fb8a9c0d7612c1e12","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-09-15T09:07:04Z","title_canon_sha256":"a166e7b1949f016afbde5af766bf9de3de25773045401e3b0cde1859818585c9"},"schema_version":"1.0","source":{"id":"2509.11706","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.11706","created_at":"2026-06-19T16:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"2509.11706v2","created_at":"2026-06-19T16:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.11706","created_at":"2026-06-19T16:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"VQNPXGYZWB5E","created_at":"2026-06-19T16:09:50Z"},{"alias_kind":"pith_short_16","alias_value":"VQNPXGYZWB5EKEQU","created_at":"2026-06-19T16:09:50Z"},{"alias_kind":"pith_short_8","alias_value":"VQNPXGYZ","created_at":"2026-06-19T16:09:50Z"}],"graph_snapshots":[{"event_id":"sha256:61b648a918993de0e0b3434313ba245a136982ae22e0ca198057220b493be665","target":"graph","created_at":"2026-06-19T16:09:50Z","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 resulting approximation is simple to implement and appears to be highly accurate, both in locating the epidemic threshold and in computing the quasi-stationary fraction of infected individuals above the threshold, for both finite graphs and infinite random graphs."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The dynamic expansion of the state space with memory of last susceptibility time sufficiently captures the higher-order correlations that the standard pair approximation misses, without introducing new fitting parameters that must be tuned to each network."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Dynamic state expansion with infection memory improves pair approximation accuracy for SIS epidemic threshold and quasi-stationary distribution on arbitrary networks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Expanding the state space with a memory of when nodes last became susceptible improves the pair approximation for the SIS epidemic model on networks."}],"snapshot_sha256":"21900ef5ab2482ca5fd3b0ac0d5fa873a3ecdd3a30c6852fc7356ffb640366d9"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"437ac2058f524f83704fea01f36618e2736e0a7f690eb30f1bd229728d6faa44"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.11706/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the Susceptible-Infectious-Susceptible (SIS) model on arbitrary networks. The well-established pair approximation treats neighboring pairs of nodes exactly while making a mean field approximation for the rest of the network. We improve the method by expanding the state space dynamically, giving nodes a memory of when they last became susceptible. The resulting approximation is simple to implement and appears to be highly accurate, both in locating the epidemic threshold and in computing the quasi-stationary fraction of infected individuals above the threshold, for both finite graphs a","authors_text":"Cristopher Moore, George Cantwell","cross_cats":["cond-mat.stat-mech","physics.soc-ph"],"headline":"Expanding the state space with a memory of when nodes last became susceptible improves the pair approximation for the SIS epidemic model on networks.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-09-15T09:07:04Z","title":"Threshold and quasi-stationary distribution for the SIS model on networks"},"references":{"count":35,"internal_anchors":0,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Our SISK pair approximation also allows us to compute this and if it approximatesP ij more accurately, then it should approximate spatial correlations more accurately","work_id":"70ff2dc1-c489-4f19-ae5d-29dd4c2a3e85","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"surface- to-volume ratio","work_id":"92911673-0495-4830-aae1-8a0bfb3389d5","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"While these equations describe the large-Klimit of our approach, we believe that that they are still not exact, even on random regular graphs","work_id":"afcf2f5b-e614-4f3d-b33c-50aafc795acc","year":null},{"cited_arxiv_id":"","doi":"10.1007/978-3-319-50806-1","is_internal_anchor":false,"ref_index":4,"title":"I. Z. Kiss, J. C. Miller, and P. L. Simon,Math- ematics of Epidemics on Networks: From Exact to Approximate Models, volume 46 ofInterdisciplinary Applied Mathematics. Springer International Publish- i","work_id":"63f80f98-7c41-4296-b390-866e8d043c36","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"R. Pastor-Satorras, C. Castellano, P. Van Mieghem, and A. Vespignani, Epidemic processes in complex networks.Reviews of Modern Physics87(3), 925– 979 (2015), URLhttps://link.aps.org/doi/10.1103/ RevMo","work_id":"d0985a8d-8803-47bd-9453-b3c0c60f8a16","year":2015}],"snapshot_sha256":"afceb10974b9e7cdeb8530a244b41e2768aa7f7f808f57b889557a7a77b9d965"},"source":{"id":"2509.11706","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-18T16:59:53.467910Z","id":"a3a2ca2c-78bc-4970-85c8-56e93fd4c7c2","model_set":{"reader":"grok-4.3"},"one_line_summary":"Dynamic state expansion with infection memory improves pair approximation accuracy for SIS epidemic threshold and quasi-stationary distribution on arbitrary networks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Expanding the state space with a memory of when nodes last became susceptible improves the pair approximation for the SIS epidemic model on networks.","strongest_claim":"The resulting approximation is simple to implement and appears to be highly accurate, both in locating the epidemic threshold and in computing the quasi-stationary fraction of infected individuals above the threshold, for both finite graphs and infinite random graphs.","weakest_assumption":"The dynamic expansion of the state space with memory of last susceptibility time sufficiently captures the higher-order correlations that the standard pair approximation misses, without introducing new fitting parameters that must be tuned to each network."}},"verdict_id":"a3a2ca2c-78bc-4970-85c8-56e93fd4c7c2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7de90a92ac9b9bc1c1e40ff473bb0debaadcd7c5ccf5c1b0a40e6480511ed259","target":"record","created_at":"2026-06-19T16:09:50Z","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":"e39bd7954e5c526bb1b69abe57dc5cd939deb3d3d934d58fb8a9c0d7612c1e12","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-09-15T09:07:04Z","title_canon_sha256":"a166e7b1949f016afbde5af766bf9de3de25773045401e3b0cde1859818585c9"},"schema_version":"1.0","source":{"id":"2509.11706","kind":"arxiv","version":2}},"canonical_sha256":"ac1afb9b19b07a4512142b83752eab8626f18801aec88b488474080e22075dd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac1afb9b19b07a4512142b83752eab8626f18801aec88b488474080e22075dd4","first_computed_at":"2026-06-19T16:09:50.946024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:09:50.946024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"laXLbXiAzS9Qn1LUs0253E8xo1aQC+STz11MksOZh8wcEvRj/INOwcs0kYd7ldvHV+P/CG+baNy9CxpWxbxzCQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:09:50.946464Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.11706","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7de90a92ac9b9bc1c1e40ff473bb0debaadcd7c5ccf5c1b0a40e6480511ed259","sha256:61b648a918993de0e0b3434313ba245a136982ae22e0ca198057220b493be665"],"state_sha256":"7dab28aae64134fa3645f227729c6c7196f3a6a4ab4f0ec7a09c84cc1843acae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SszarGkFTQ+EgUzalzNzY8ccYFq3l353BleZ2mTkBBmr0+2z69lW9H2o/iFf3yrsNDRSg8EjMMHgLi3Y/wpaCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T02:10:45.143272Z","bundle_sha256":"2574fcfdb31631c183c4476433119428f1590f9ceafaf85a3446ae9add0af9cf"}}