{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KFSCJKBZRTLEKXCV4HZ2PM63BA","short_pith_number":"pith:KFSCJKBZ","canonical_record":{"source":{"id":"2605.20387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-19T18:37:13Z","cross_cats_sorted":[],"title_canon_sha256":"bb3dbd4bd1b6e862bad28a1757831d2dd8667c75569cf2c9d3ff94c00fdb224f","abstract_canon_sha256":"0dbe02b116aa81700b2c3ae459c652a4cf8f002c2e2b4e7de3b5bac535bd1dff"},"schema_version":"1.0"},"canonical_sha256":"516424a8398cd6455c55e1f3a7b3db082b592b40a6962cdb243d7e61da75e951","source":{"kind":"arxiv","id":"2605.20387","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20387","created_at":"2026-05-21T01:04:36Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20387v1","created_at":"2026-05-21T01:04:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20387","created_at":"2026-05-21T01:04:36Z"},{"alias_kind":"pith_short_12","alias_value":"KFSCJKBZRTLE","created_at":"2026-05-21T01:04:36Z"},{"alias_kind":"pith_short_16","alias_value":"KFSCJKBZRTLEKXCV","created_at":"2026-05-21T01:04:36Z"},{"alias_kind":"pith_short_8","alias_value":"KFSCJKBZ","created_at":"2026-05-21T01:04:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KFSCJKBZRTLEKXCV4HZ2PM63BA","target":"record","payload":{"canonical_record":{"source":{"id":"2605.20387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-19T18:37:13Z","cross_cats_sorted":[],"title_canon_sha256":"bb3dbd4bd1b6e862bad28a1757831d2dd8667c75569cf2c9d3ff94c00fdb224f","abstract_canon_sha256":"0dbe02b116aa81700b2c3ae459c652a4cf8f002c2e2b4e7de3b5bac535bd1dff"},"schema_version":"1.0"},"canonical_sha256":"516424a8398cd6455c55e1f3a7b3db082b592b40a6962cdb243d7e61da75e951","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:36.065389Z","signature_b64":"d10/N/I/Fk32Anuc17jhiFpMw+PsI+Qo8Q9a4mRVTxuhrgHF21FDh+KYzdM0SToVMXpmBoDt6iMqeg59ySCICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"516424a8398cd6455c55e1f3a7b3db082b592b40a6962cdb243d7e61da75e951","last_reissued_at":"2026-05-21T01:04:36.064876Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:36.064876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.20387","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-21T01:04:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEWINhWNHH70NN+oqzK1N0ZeFj4Hyqir7FZgTefrjc5TWX5rd0bc/Ixm8dKR6m2xBsCixfALT5mitU4QNBhVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:13:06.219433Z"},"content_sha256":"f3eac6111e16f15c053f4b4a003f3020552bfc76bc9958e988de84932ee0026f","schema_version":"1.0","event_id":"sha256:f3eac6111e16f15c053f4b4a003f3020552bfc76bc9958e988de84932ee0026f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KFSCJKBZRTLEKXCV4HZ2PM63BA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An iterative Constraint Programming approach to integrate maximum workload constraints in preemptive jobshop scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cyrille Briand (UT3, LAAS-ROC), Tanguy Terrien (LAAS-ROC)","submitted_at":"2026-05-19T18:37:13Z","abstract_excerpt":"Optimizing schedules in real-world settings often requires considering workload constraints, specially for human resources, to ensure regulatory compliance, impose rest periods, or level the workload over the working horizon. This paper focuses on tackling this family of constraints in the context of preemptive jobshop scheduling, as preemption is particularly relevant when human resources are involved (allowing personnel to flexibly switch between tasks). Preemption also offers theoretical insights as a relaxation of non-preemptive problems. The main contribution of this paper is a Constraint"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20387","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.20387/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T01:04:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5/I+g2+PXKcR9WRZxrMjbgkr4wi9UBBwDLPuwdWm2RyfkOfCe4V33a6jU612lSass0uFhn8MkGSYcOCJnm7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:13:06.220053Z"},"content_sha256":"f45c7a92b51370454aff811c7ddaa65f059e228d019f486aba972e927e5c6a17","schema_version":"1.0","event_id":"sha256:f45c7a92b51370454aff811c7ddaa65f059e228d019f486aba972e927e5c6a17"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:KFSCJKBZRTLEKXCV4HZ2PM63BA","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10479-012-1061-0doi:10.1007/s10479-012-1061-0) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Stefaan Haspeslagh, Patrick De Causmaecker, Andrea Schaerf, and Martin St levik. The first international nurse rostering competition 2010. Annals of Operations Research , 218(1):209--221, 2014. https://doi.org/10.1007/s10479-012-1061-0 doi:","arxiv_id":"2605.20387","detector":"doi_compliance","evidence":{"ref_index":37,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Stefaan Haspeslagh, Patrick De Causmaecker, Andrea Schaerf, and Martin St levik. The first international nurse rostering competition 2010. Annals of Operations Research , 218(1):209--221, 2014. https://doi.org/10.1007/s10479-012-1061-0 doi:","reconstructed_doi":"10.1007/s10479-012-1061-0doi:10.1007/s10479-012-1061-0"},"severity":"advisory","ref_index":37,"audited_at":"2026-05-21T07:13:39.117337Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10479-012-1061-0doi:10.1007/s10479-012-1061-0","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"38176391f7abd1b69642bf8cc2b30ad0b731d665f51eefad74b851ea4ca8b98e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":5864,"payload_sha256":"535bf32ee94934a074c77f8f9ebec3df8fe17290f39cf7c548aac380947bf658","signature_b64":"xWM9+oSp4V8b5BW6ke6pvewxYQ0ErFo7PDxmqtPbMNGKTfb+7yl+xRo+4dLpJr7kMM9ciTFTawNlJVx3ZBPHBQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T07:14:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XxRjGQLMcu+rSZiqOFkOwhIYxi5ZW9vPbMr4TuD3eOiEEvjAzBzBaRpK1cCjdzcH5eEVd5OK7pcmsAoRTbmxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:13:06.221397Z"},"content_sha256":"81ac64dfdfffbd087dffa6c5ace97d79727f4c3e32977edfb19fe5e90faeb7e9","schema_version":"1.0","event_id":"sha256:81ac64dfdfffbd087dffa6c5ace97d79727f4c3e32977edfb19fe5e90faeb7e9"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:KFSCJKBZRTLEKXCV4HZ2PM63BA","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10601-018-9281-9doi:10.1007/s10601-018-9281-9) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Philippe Laborie, J \\'e r \\^o me Rogerie, Paul Shaw, and Petr Vil \\'i m. IBM ILOG CP optimizer for scheduling: 20+ years of scheduling with constraints at IBM/ILOG . Constraints , 23(2):210--250, 2018. https://doi.org/10.1007/s10601-018-928","arxiv_id":"2605.20387","detector":"doi_compliance","evidence":{"ref_index":30,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Philippe Laborie, J \\'e r \\^o me Rogerie, Paul Shaw, and Petr Vil \\'i m. IBM ILOG CP optimizer for scheduling: 20+ years of scheduling with constraints at IBM/ILOG . Constraints , 23(2):210--250, 2018. https://doi.org/10.1007/s10601-018-928","reconstructed_doi":"10.1007/s10601-018-9281-9doi:10.1007/s10601-018-9281-9"},"severity":"advisory","ref_index":30,"audited_at":"2026-05-21T07:13:39.117337Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10601-018-9281-9doi:10.1007/s10601-018-9281-9","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"f9a36b10c4270bbc5ef0b1e10ad2ebd5d390442fef4a63e277b2fed0c400c541","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":5863,"payload_sha256":"09a4bbd59473202e1ba15bc26af91e878baf1974aa46b6750734414c36a2a130","signature_b64":"P6e/wUMoyIcuwLe2aXOoQqVe/lgHJUBpOuQXKkjc3KC5trRAuJLrzu9zhEZuRZ0uouGCGjf61vYr4i/tpmAuDg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T07:14:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o17veHTIB59IDIr9mqBmE+tItqg/j9JADRtYSzmoOZ36+TyGud2WYhwcGb06UYh3saI2K3NBQArufMoHYBxlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:13:06.221815Z"},"content_sha256":"57368416a02a5830815d7474248edade41ff6130451b3c5eaa21cdb9b9744fa2","schema_version":"1.0","event_id":"sha256:57368416a02a5830815d7474248edade41ff6130451b3c5eaa21cdb9b9744fa2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFSCJKBZRTLEKXCV4HZ2PM63BA/bundle.json","state_url":"https://pith.science/pith/KFSCJKBZRTLEKXCV4HZ2PM63BA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFSCJKBZRTLEKXCV4HZ2PM63BA/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-25T03:13:06Z","links":{"resolver":"https://pith.science/pith/KFSCJKBZRTLEKXCV4HZ2PM63BA","bundle":"https://pith.science/pith/KFSCJKBZRTLEKXCV4HZ2PM63BA/bundle.json","state":"https://pith.science/pith/KFSCJKBZRTLEKXCV4HZ2PM63BA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFSCJKBZRTLEKXCV4HZ2PM63BA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KFSCJKBZRTLEKXCV4HZ2PM63BA","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0dbe02b116aa81700b2c3ae459c652a4cf8f002c2e2b4e7de3b5bac535bd1dff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-19T18:37:13Z","title_canon_sha256":"bb3dbd4bd1b6e862bad28a1757831d2dd8667c75569cf2c9d3ff94c00fdb224f"},"schema_version":"1.0","source":{"id":"2605.20387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20387","created_at":"2026-05-21T01:04:36Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20387v1","created_at":"2026-05-21T01:04:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20387","created_at":"2026-05-21T01:04:36Z"},{"alias_kind":"pith_short_12","alias_value":"KFSCJKBZRTLE","created_at":"2026-05-21T01:04:36Z"},{"alias_kind":"pith_short_16","alias_value":"KFSCJKBZRTLEKXCV","created_at":"2026-05-21T01:04:36Z"},{"alias_kind":"pith_short_8","alias_value":"KFSCJKBZ","created_at":"2026-05-21T01:04:36Z"}],"graph_snapshots":[{"event_id":"sha256:f45c7a92b51370454aff811c7ddaa65f059e228d019f486aba972e927e5c6a17","target":"graph","created_at":"2026-05-21T01:04:36Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.20387/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimizing schedules in real-world settings often requires considering workload constraints, specially for human resources, to ensure regulatory compliance, impose rest periods, or level the workload over the working horizon. This paper focuses on tackling this family of constraints in the context of preemptive jobshop scheduling, as preemption is particularly relevant when human resources are involved (allowing personnel to flexibly switch between tasks). Preemption also offers theoretical insights as a relaxation of non-preemptive problems. The main contribution of this paper is a Constraint","authors_text":"Cyrille Briand (UT3, LAAS-ROC), Tanguy Terrien (LAAS-ROC)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-19T18:37:13Z","title":"An iterative Constraint Programming approach to integrate maximum workload constraints in preemptive jobshop scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20387","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f3eac6111e16f15c053f4b4a003f3020552bfc76bc9958e988de84932ee0026f","target":"record","created_at":"2026-05-21T01:04:36Z","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":"0dbe02b116aa81700b2c3ae459c652a4cf8f002c2e2b4e7de3b5bac535bd1dff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-19T18:37:13Z","title_canon_sha256":"bb3dbd4bd1b6e862bad28a1757831d2dd8667c75569cf2c9d3ff94c00fdb224f"},"schema_version":"1.0","source":{"id":"2605.20387","kind":"arxiv","version":1}},"canonical_sha256":"516424a8398cd6455c55e1f3a7b3db082b592b40a6962cdb243d7e61da75e951","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"516424a8398cd6455c55e1f3a7b3db082b592b40a6962cdb243d7e61da75e951","first_computed_at":"2026-05-21T01:04:36.064876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:36.064876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d10/N/I/Fk32Anuc17jhiFpMw+PsI+Qo8Q9a4mRVTxuhrgHF21FDh+KYzdM0SToVMXpmBoDt6iMqeg59ySCICg==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:36.065389Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20387","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:57368416a02a5830815d7474248edade41ff6130451b3c5eaa21cdb9b9744fa2","sha256:81ac64dfdfffbd087dffa6c5ace97d79727f4c3e32977edfb19fe5e90faeb7e9"]}],"invalid_events":[],"applied_event_ids":["sha256:f3eac6111e16f15c053f4b4a003f3020552bfc76bc9958e988de84932ee0026f","sha256:f45c7a92b51370454aff811c7ddaa65f059e228d019f486aba972e927e5c6a17"],"state_sha256":"c93741f53acffd4aa8ecf4c529d946fa58d98f9c93fcd65b74a0e9ec8611366f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZHT9KQ9npGKbqiqawDiqj/PkJikKnYB8ZKmHt2nxOt59L3HRG7rDK+LBFNP2q6nnVDXOL2O0MISHhGEouqHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:13:06.225103Z","bundle_sha256":"287faa1eaa1561180112764f295ce728e79fbf00c7e3a33d05c51fb1babae446"}}