{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LWDKY4MI64RYCSMIT7TYGFYX6D","short_pith_number":"pith:LWDKY4MI","canonical_record":{"source":{"id":"2605.15704","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-15T07:49:44Z","cross_cats_sorted":[],"title_canon_sha256":"12d14100026e1ec4c61e446e5df432cbe9e57558874c7bed58872cb05421c8c9","abstract_canon_sha256":"421ff1898e8738d4ec38430cc31aff21cb8834ece5137b36ac30e9bd17015599"},"schema_version":"1.0"},"canonical_sha256":"5d86ac7188f7238149889fe7831717f0ee23a2f8f234cd64c389e4549bc35f18","source":{"kind":"arxiv","id":"2605.15704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15704","created_at":"2026-05-20T00:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15704v1","created_at":"2026-05-20T00:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15704","created_at":"2026-05-20T00:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"LWDKY4MI64RY","created_at":"2026-05-20T00:01:13Z"},{"alias_kind":"pith_short_16","alias_value":"LWDKY4MI64RYCSMI","created_at":"2026-05-20T00:01:13Z"},{"alias_kind":"pith_short_8","alias_value":"LWDKY4MI","created_at":"2026-05-20T00:01:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LWDKY4MI64RYCSMIT7TYGFYX6D","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15704","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-15T07:49:44Z","cross_cats_sorted":[],"title_canon_sha256":"12d14100026e1ec4c61e446e5df432cbe9e57558874c7bed58872cb05421c8c9","abstract_canon_sha256":"421ff1898e8738d4ec38430cc31aff21cb8834ece5137b36ac30e9bd17015599"},"schema_version":"1.0"},"canonical_sha256":"5d86ac7188f7238149889fe7831717f0ee23a2f8f234cd64c389e4549bc35f18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:13.462047Z","signature_b64":"dQVYiDDyFcL9xtxLJy4MKBkM/zvsv6TgEF3dFlTxgKPS3ldfzkD5lkVzJkHFNKE7OznEuc72o4pmYXa9tFTiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d86ac7188f7238149889fe7831717f0ee23a2f8f234cd64c389e4549bc35f18","last_reissued_at":"2026-05-20T00:01:13.461258Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:13.461258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15704","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:01:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhZErU0GvMs4a23RbHhd2C/6+noX49kFce55PDXjSt2EirY07vhjbkmmSfBa3RvcD/jJ/iRygzPgsqVeET3TBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:17:48.268364Z"},"content_sha256":"bf304959e99dd4d7f68cbcc3ebb7d5093499776b7806c4468756ae48a6331253","schema_version":"1.0","event_id":"sha256:bf304959e99dd4d7f68cbcc3ebb7d5093499776b7806c4468756ae48a6331253"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LWDKY4MI64RYCSMIT7TYGFYX6D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scale: Deep Reinforcement Learning for Container Scheduling in Serverless Edge Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A deep reinforcement learning scheduler for serverless edge containers stays within 1.15 times of optimal while deciding up to 99 percent faster.","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrea Sabbioni, Chen Chen, Lei Jiao, Reza Farahani, Zihan Jia","submitted_at":"2026-05-15T07:49:44Z","abstract_excerpt":"Serverless computing has emerged as a promising computing paradigm for edge computing. However, adopting the event driven model in highly dynamic, heterogeneous, and distributed edge systems poses significant challenges in request placement and resource management. Efficiently allocating requests to containers is therefore critical to reduce resource over provisioning and unnecessary data movement. This paper proposes Scale, a Service Level Objective aware container scheduling and resource allocation framework designed for serverless edge computing. Scale employs a policy based deep reinforcem"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Scale achieves solutions within a factor of 1.11 to 1.15 of a state of the art Integer Linear Programming solver, while reducing decision making time by up to 99%.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The policy-based deep reinforcement learning algorithm can jointly incorporate SLO constraints, end-to-end latency, and data locality to balance system stability and performance under dynamic workloads (abstract).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Scale applies policy-based deep reinforcement learning to SLO-aware container scheduling in serverless edge computing, achieving near-optimal results with drastically reduced decision time in simulations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A deep reinforcement learning scheduler for serverless edge containers stays within 1.15 times of optimal while deciding up to 99 percent faster.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"bb4d64f1d46d5f3ef0c22099660bd59464e2035eb7f4e69957bde9622feedef0"},"source":{"id":"2605.15704","kind":"arxiv","version":1},"verdict":{"id":"285a8b89-4ee5-48a5-acb4-8fd0e694c7c2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:26:59.190723Z","strongest_claim":"Scale achieves solutions within a factor of 1.11 to 1.15 of a state of the art Integer Linear Programming solver, while reducing decision making time by up to 99%.","one_line_summary":"Scale applies policy-based deep reinforcement learning to SLO-aware container scheduling in serverless edge computing, achieving near-optimal results with drastically reduced decision time in simulations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The policy-based deep reinforcement learning algorithm can jointly incorporate SLO constraints, end-to-end latency, and data locality to balance system stability and performance under dynamic workloads (abstract).","pith_extraction_headline":"A deep reinforcement learning scheduler for serverless edge containers stays within 1.15 times of optimal while deciding up to 99 percent faster."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15704/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.217565Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:41:02.822089Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:27.252552Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:21:56.028418Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c8188c17f40f43d96280d35850840b8bd120d1b3c669608eeac988ec857b715c"},"references":{"count":30,"sample":[{"doi":"","year":2024,"title":"Cross-edge orchestration of serverless functions with probabilistic caching.IEEE Transactions on Services Computing, 17(5):2139–2150, 2024","work_id":"68e45028-e7ee-4667-a98d-c9493eeb8d6b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Sebs-flow: Benchmarking server- less cloud function workflows","work_id":"346cc1d8-a0c1-422c-8d4c-f075db36924e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Octopus: Decentralized workflow-granular scheduling for serverless workflow","work_id":"52116d9b-b9bf-4cc6-9c82-57dc3b28d49c","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"S-cache: Function caching for serverless edge computing","work_id":"540ae780-8dce-48cf-bff3-5676f03ac212","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Fasei: Fast serverless edge inference with synergistic lazy loading and layer-wise caching","work_id":"700a011e-ea8a-4706-a02c-042a949c1f29","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":30,"snapshot_sha256":"df11cc56866355d17e5f9131a51e4b77e93e4d32b36b33866d5b28dd46ecc42c","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"73e7053e2dbe4456de603222a6ad050bfc69adfa79dd7f1fcf18fa79ae1b3f22"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"285a8b89-4ee5-48a5-acb4-8fd0e694c7c2"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tylfa7VD8CaGhbunNCc6upq3JG/imY45aZexRRPNPlWhY6QNsj3MqacO+7DrT4fqylPX+fBc8bvmYiysXKQ4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:17:48.269686Z"},"content_sha256":"5321d10afc38b630ec3ded8bac6a7dc572a698bb3ef20c3512238f53a3bdabb0","schema_version":"1.0","event_id":"sha256:5321d10afc38b630ec3ded8bac6a7dc572a698bb3ef20c3512238f53a3bdabb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWDKY4MI64RYCSMIT7TYGFYX6D/bundle.json","state_url":"https://pith.science/pith/LWDKY4MI64RYCSMIT7TYGFYX6D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWDKY4MI64RYCSMIT7TYGFYX6D/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-09T05:17:48Z","links":{"resolver":"https://pith.science/pith/LWDKY4MI64RYCSMIT7TYGFYX6D","bundle":"https://pith.science/pith/LWDKY4MI64RYCSMIT7TYGFYX6D/bundle.json","state":"https://pith.science/pith/LWDKY4MI64RYCSMIT7TYGFYX6D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWDKY4MI64RYCSMIT7TYGFYX6D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LWDKY4MI64RYCSMIT7TYGFYX6D","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":"421ff1898e8738d4ec38430cc31aff21cb8834ece5137b36ac30e9bd17015599","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-15T07:49:44Z","title_canon_sha256":"12d14100026e1ec4c61e446e5df432cbe9e57558874c7bed58872cb05421c8c9"},"schema_version":"1.0","source":{"id":"2605.15704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15704","created_at":"2026-05-20T00:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15704v1","created_at":"2026-05-20T00:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15704","created_at":"2026-05-20T00:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"LWDKY4MI64RY","created_at":"2026-05-20T00:01:13Z"},{"alias_kind":"pith_short_16","alias_value":"LWDKY4MI64RYCSMI","created_at":"2026-05-20T00:01:13Z"},{"alias_kind":"pith_short_8","alias_value":"LWDKY4MI","created_at":"2026-05-20T00:01:13Z"}],"graph_snapshots":[{"event_id":"sha256:5321d10afc38b630ec3ded8bac6a7dc572a698bb3ef20c3512238f53a3bdabb0","target":"graph","created_at":"2026-05-20T00:01:13Z","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":"Scale achieves solutions within a factor of 1.11 to 1.15 of a state of the art Integer Linear Programming solver, while reducing decision making time by up to 99%."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The policy-based deep reinforcement learning algorithm can jointly incorporate SLO constraints, end-to-end latency, and data locality to balance system stability and performance under dynamic workloads (abstract)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Scale applies policy-based deep reinforcement learning to SLO-aware container scheduling in serverless edge computing, achieving near-optimal results with drastically reduced decision time in simulations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A deep reinforcement learning scheduler for serverless edge containers stays within 1.15 times of optimal while deciding up to 99 percent faster."}],"snapshot_sha256":"bb4d64f1d46d5f3ef0c22099660bd59464e2035eb7f4e69957bde9622feedef0"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"73e7053e2dbe4456de603222a6ad050bfc69adfa79dd7f1fcf18fa79ae1b3f22"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.217565Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:41:02.822089Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:27.252552Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:21:56.028418Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15704/integrity.json","findings":[],"snapshot_sha256":"c8188c17f40f43d96280d35850840b8bd120d1b3c669608eeac988ec857b715c","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Serverless computing has emerged as a promising computing paradigm for edge computing. However, adopting the event driven model in highly dynamic, heterogeneous, and distributed edge systems poses significant challenges in request placement and resource management. Efficiently allocating requests to containers is therefore critical to reduce resource over provisioning and unnecessary data movement. This paper proposes Scale, a Service Level Objective aware container scheduling and resource allocation framework designed for serverless edge computing. Scale employs a policy based deep reinforcem","authors_text":"Andrea Sabbioni, Chen Chen, Lei Jiao, Reza Farahani, Zihan Jia","cross_cats":[],"headline":"A deep reinforcement learning scheduler for serverless edge containers stays within 1.15 times of optimal while deciding up to 99 percent faster.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-15T07:49:44Z","title":"Scale: Deep Reinforcement Learning for Container Scheduling in Serverless Edge Computing"},"references":{"count":30,"internal_anchors":0,"resolved_work":30,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Cross-edge orchestration of serverless functions with probabilistic caching.IEEE Transactions on Services Computing, 17(5):2139–2150, 2024","work_id":"68e45028-e7ee-4667-a98d-c9493eeb8d6b","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Sebs-flow: Benchmarking server- less cloud function workflows","work_id":"346cc1d8-a0c1-422c-8d4c-f075db36924e","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Octopus: Decentralized workflow-granular scheduling for serverless workflow","work_id":"52116d9b-b9bf-4cc6-9c82-57dc3b28d49c","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"S-cache: Function caching for serverless edge computing","work_id":"540ae780-8dce-48cf-bff3-5676f03ac212","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Fasei: Fast serverless edge inference with synergistic lazy loading and layer-wise caching","work_id":"700a011e-ea8a-4706-a02c-042a949c1f29","year":2025}],"snapshot_sha256":"df11cc56866355d17e5f9131a51e4b77e93e4d32b36b33866d5b28dd46ecc42c"},"source":{"id":"2605.15704","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:26:59.190723Z","id":"285a8b89-4ee5-48a5-acb4-8fd0e694c7c2","model_set":{"reader":"grok-4.3"},"one_line_summary":"Scale applies policy-based deep reinforcement learning to SLO-aware container scheduling in serverless edge computing, achieving near-optimal results with drastically reduced decision time in simulations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A deep reinforcement learning scheduler for serverless edge containers stays within 1.15 times of optimal while deciding up to 99 percent faster.","strongest_claim":"Scale achieves solutions within a factor of 1.11 to 1.15 of a state of the art Integer Linear Programming solver, while reducing decision making time by up to 99%.","weakest_assumption":"The policy-based deep reinforcement learning algorithm can jointly incorporate SLO constraints, end-to-end latency, and data locality to balance system stability and performance under dynamic workloads (abstract)."}},"verdict_id":"285a8b89-4ee5-48a5-acb4-8fd0e694c7c2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bf304959e99dd4d7f68cbcc3ebb7d5093499776b7806c4468756ae48a6331253","target":"record","created_at":"2026-05-20T00:01:13Z","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":"421ff1898e8738d4ec38430cc31aff21cb8834ece5137b36ac30e9bd17015599","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-15T07:49:44Z","title_canon_sha256":"12d14100026e1ec4c61e446e5df432cbe9e57558874c7bed58872cb05421c8c9"},"schema_version":"1.0","source":{"id":"2605.15704","kind":"arxiv","version":1}},"canonical_sha256":"5d86ac7188f7238149889fe7831717f0ee23a2f8f234cd64c389e4549bc35f18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d86ac7188f7238149889fe7831717f0ee23a2f8f234cd64c389e4549bc35f18","first_computed_at":"2026-05-20T00:01:13.461258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:13.461258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dQVYiDDyFcL9xtxLJy4MKBkM/zvsv6TgEF3dFlTxgKPS3ldfzkD5lkVzJkHFNKE7OznEuc72o4pmYXa9tFTiCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:13.462047Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf304959e99dd4d7f68cbcc3ebb7d5093499776b7806c4468756ae48a6331253","sha256:5321d10afc38b630ec3ded8bac6a7dc572a698bb3ef20c3512238f53a3bdabb0"],"state_sha256":"f724e24fd08d6e9639faa3daa07617e15c73e66e42d21142ee898a9ac14dfe58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4SwU4y2LtZhXpx6U6LWK6mqBx8mEINO516ugpyk5CHwpORUfs7u6XKzHviTd8+Nbv7eFscW3UNuXFahFgA4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:17:48.275330Z","bundle_sha256":"5cf69befdb38da24cb51d1a700aec84b9b908c8973bfe077b8c5c4dee8a6fd25"}}