{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:G7NHMWM6OK5RVAPHDTVO3V4S7J","short_pith_number":"pith:G7NHMWM6","canonical_record":{"source":{"id":"2605.18248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-18T11:48:23Z","cross_cats_sorted":[],"title_canon_sha256":"91e407978ea834e3f83c9843875a963ed4da31de38a69f283124562f1c7c54f1","abstract_canon_sha256":"4510401568b4f072e42270aa254f616537f365272ef1c78af08581958862c1d5"},"schema_version":"1.0"},"canonical_sha256":"37da76599e72bb1a81e71ceaedd792fa71914d663bb53a9a645582109dbcec28","source":{"kind":"arxiv","id":"2605.18248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18248","created_at":"2026-05-20T00:05:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18248v1","created_at":"2026-05-20T00:05:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18248","created_at":"2026-05-20T00:05:52Z"},{"alias_kind":"pith_short_12","alias_value":"G7NHMWM6OK5R","created_at":"2026-05-20T00:05:52Z"},{"alias_kind":"pith_short_16","alias_value":"G7NHMWM6OK5RVAPH","created_at":"2026-05-20T00:05:52Z"},{"alias_kind":"pith_short_8","alias_value":"G7NHMWM6","created_at":"2026-05-20T00:05:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:G7NHMWM6OK5RVAPHDTVO3V4S7J","target":"record","payload":{"canonical_record":{"source":{"id":"2605.18248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-18T11:48:23Z","cross_cats_sorted":[],"title_canon_sha256":"91e407978ea834e3f83c9843875a963ed4da31de38a69f283124562f1c7c54f1","abstract_canon_sha256":"4510401568b4f072e42270aa254f616537f365272ef1c78af08581958862c1d5"},"schema_version":"1.0"},"canonical_sha256":"37da76599e72bb1a81e71ceaedd792fa71914d663bb53a9a645582109dbcec28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:52.093042Z","signature_b64":"BDSPuk0vyy8sNNZV+zwwLoLqS6IC83ZAVDwBC8fir+fRc3FR+h/N1l/soGpG+//uc23lUqZyyNst1N14y+M2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37da76599e72bb1a81e71ceaedd792fa71914d663bb53a9a645582109dbcec28","last_reissued_at":"2026-05-20T00:05:52.092382Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:52.092382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.18248","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:05:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sw/2+vvVmtUK8ZZoOhg9l2mCcnRXGf2ii2tATkVK9IipVzvU9BjyBPyBfhbml6QRwNfpQ0YDOHbt4lvqiUCXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:17:57.462910Z"},"content_sha256":"8379fba5ee01c790cc33ac5af6ae26aca19fceb147ae4a6b0d03d1fc4bf9abdd","schema_version":"1.0","event_id":"sha256:8379fba5ee01c790cc33ac5af6ae26aca19fceb147ae4a6b0d03d1fc4bf9abdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:G7NHMWM6OK5RVAPHDTVO3V4S7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decidability of MSO Reparameterization over Countable Chains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"It is decidable whether a given MSO formula admits a d-dimensional reparameterization over countable labelled linear orders.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexander Rabinovich","submitted_at":"2026-05-18T11:48:23Z","abstract_excerpt":"Interpretations are a fundamental tool in mathematical logic, allowing structures to be encoded within other structures via logical definitions. We study $\\MSO$ \\emph{multidimensional point interpretations}, where elements of an interpreted structure are represented by tuples of elements of the host structure, and address the problem of simplifying such interpretations by reducing their representation dimension.\n  To formalize simplification, we use the notion of \\emph{reparameterization}. Our main result shows that, over the class of countable labelled linear orders, it is decidable whether a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our main result shows that, over the class of countable labelled linear orders, it is decidable whether a given MSO formula admits a d-dimensional reparameterization.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The host structures are restricted to countable labelled linear orders and the logic is full MSO; the decidability may fail outside this class or for other logics.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"It is decidable whether an MSO formula over countable labelled linear orders admits a d-dimensional reparameterization.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"It is decidable whether a given MSO formula admits a d-dimensional reparameterization over countable labelled linear orders.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"eb8ff5d54a595d8217843983fde0d0684d345018691df8c8a1cc644c2432ca8e"},"source":{"id":"2605.18248","kind":"arxiv","version":1},"verdict":{"id":"e37381ac-e1d8-4002-bdfa-ca49dca5c645","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:56:25.743077Z","strongest_claim":"Our main result shows that, over the class of countable labelled linear orders, it is decidable whether a given MSO formula admits a d-dimensional reparameterization.","one_line_summary":"It is decidable whether an MSO formula over countable labelled linear orders admits a d-dimensional reparameterization.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The host structures are restricted to countable labelled linear orders and the logic is full MSO; the decidability may fail outside this class or for other logics.","pith_extraction_headline":"It is decidable whether a given MSO formula admits a d-dimensional reparameterization over countable labelled linear orders."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18248/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-20T00:02:59.089592Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.516241Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.272065Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:59.000707Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"7d109082b46248eb9f25a7f6ece2e2958b2f51faead23af7341babd27f93e1a6"},"references":{"count":12,"sample":[{"doi":"","year":2011,"title":"Expressing cardinality quantifiers in monadic second-order logic over chains , journal =","work_id":"6252911d-f1b7-417c-b5dc-d128c11ba2c9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"On the Growth Rates of Polyregular Functions , booktitle =","work_id":"9e6fcddc-7ef7-49bc-82d8-ca0d9307673a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The Structure of Polynomial Growth for Tree Automata/Transducers and","work_id":"714d90c6-e44d-4989-bad8-5b17202d1496","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"The structure of polynomial growth for tree automata/transducers and MSO set queries , author=. 2025 , eprint=","work_id":"e92226a9-711c-4951-a1ef-0f46b73305f5","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Tarski, Alfred and Mostowski, Andrzej and Robinson, Raphael M. , title =","work_id":"d410a853-031c-4447-9d6a-b99fea95b8fe","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":12,"snapshot_sha256":"7ecafa6de1665d7c08098c5a7f23d60781c5888eac593334296f3df2437cbfb1","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":"e37381ac-e1d8-4002-bdfa-ca49dca5c645"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:05:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trGNgXfAkpYBduD9O/re8k/Dflxjgb4x4NtjG7nu6wzqJyh9KIbsNm21IYISpRSHs2KQT9CCaI9Z5huLxZ8hDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:17:57.464078Z"},"content_sha256":"02e0698cc8ac666aec3d68bcbb73be7df0003cf258e9f8db547b43b33bc044ed","schema_version":"1.0","event_id":"sha256:02e0698cc8ac666aec3d68bcbb73be7df0003cf258e9f8db547b43b33bc044ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7NHMWM6OK5RVAPHDTVO3V4S7J/bundle.json","state_url":"https://pith.science/pith/G7NHMWM6OK5RVAPHDTVO3V4S7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7NHMWM6OK5RVAPHDTVO3V4S7J/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-30T21:17:57Z","links":{"resolver":"https://pith.science/pith/G7NHMWM6OK5RVAPHDTVO3V4S7J","bundle":"https://pith.science/pith/G7NHMWM6OK5RVAPHDTVO3V4S7J/bundle.json","state":"https://pith.science/pith/G7NHMWM6OK5RVAPHDTVO3V4S7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7NHMWM6OK5RVAPHDTVO3V4S7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:G7NHMWM6OK5RVAPHDTVO3V4S7J","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":"4510401568b4f072e42270aa254f616537f365272ef1c78af08581958862c1d5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-18T11:48:23Z","title_canon_sha256":"91e407978ea834e3f83c9843875a963ed4da31de38a69f283124562f1c7c54f1"},"schema_version":"1.0","source":{"id":"2605.18248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18248","created_at":"2026-05-20T00:05:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18248v1","created_at":"2026-05-20T00:05:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18248","created_at":"2026-05-20T00:05:52Z"},{"alias_kind":"pith_short_12","alias_value":"G7NHMWM6OK5R","created_at":"2026-05-20T00:05:52Z"},{"alias_kind":"pith_short_16","alias_value":"G7NHMWM6OK5RVAPH","created_at":"2026-05-20T00:05:52Z"},{"alias_kind":"pith_short_8","alias_value":"G7NHMWM6","created_at":"2026-05-20T00:05:52Z"}],"graph_snapshots":[{"event_id":"sha256:02e0698cc8ac666aec3d68bcbb73be7df0003cf258e9f8db547b43b33bc044ed","target":"graph","created_at":"2026-05-20T00:05:52Z","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 main result shows that, over the class of countable labelled linear orders, it is decidable whether a given MSO formula admits a d-dimensional reparameterization."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The host structures are restricted to countable labelled linear orders and the logic is full MSO; the decidability may fail outside this class or for other logics."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"It is decidable whether an MSO formula over countable labelled linear orders admits a d-dimensional reparameterization."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"It is decidable whether a given MSO formula admits a d-dimensional reparameterization over countable labelled linear orders."}],"snapshot_sha256":"eb8ff5d54a595d8217843983fde0d0684d345018691df8c8a1cc644c2432ca8e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T00:02:59.089592Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.516241Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.272065Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T23:21:59.000707Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.18248/integrity.json","findings":[],"snapshot_sha256":"7d109082b46248eb9f25a7f6ece2e2958b2f51faead23af7341babd27f93e1a6","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Interpretations are a fundamental tool in mathematical logic, allowing structures to be encoded within other structures via logical definitions. We study $\\MSO$ \\emph{multidimensional point interpretations}, where elements of an interpreted structure are represented by tuples of elements of the host structure, and address the problem of simplifying such interpretations by reducing their representation dimension.\n  To formalize simplification, we use the notion of \\emph{reparameterization}. Our main result shows that, over the class of countable labelled linear orders, it is decidable whether a","authors_text":"Alexander Rabinovich","cross_cats":[],"headline":"It is decidable whether a given MSO formula admits a d-dimensional reparameterization over countable labelled linear orders.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-18T11:48:23Z","title":"Decidability of MSO Reparameterization over Countable Chains"},"references":{"count":12,"internal_anchors":0,"resolved_work":12,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Expressing cardinality quantifiers in monadic second-order logic over chains , journal =","work_id":"6252911d-f1b7-417c-b5dc-d128c11ba2c9","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"On the Growth Rates of Polyregular Functions , booktitle =","work_id":"9e6fcddc-7ef7-49bc-82d8-ca0d9307673a","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"The Structure of Polynomial Growth for Tree Automata/Transducers and","work_id":"714d90c6-e44d-4989-bad8-5b17202d1496","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"The structure of polynomial growth for tree automata/transducers and MSO set queries , author=. 2025 , eprint=","work_id":"e92226a9-711c-4951-a1ef-0f46b73305f5","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Tarski, Alfred and Mostowski, Andrzej and Robinson, Raphael M. , title =","work_id":"d410a853-031c-4447-9d6a-b99fea95b8fe","year":null}],"snapshot_sha256":"7ecafa6de1665d7c08098c5a7f23d60781c5888eac593334296f3df2437cbfb1"},"source":{"id":"2605.18248","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:56:25.743077Z","id":"e37381ac-e1d8-4002-bdfa-ca49dca5c645","model_set":{"reader":"grok-4.3"},"one_line_summary":"It is decidable whether an MSO formula over countable labelled linear orders admits a d-dimensional reparameterization.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"It is decidable whether a given MSO formula admits a d-dimensional reparameterization over countable labelled linear orders.","strongest_claim":"Our main result shows that, over the class of countable labelled linear orders, it is decidable whether a given MSO formula admits a d-dimensional reparameterization.","weakest_assumption":"The host structures are restricted to countable labelled linear orders and the logic is full MSO; the decidability may fail outside this class or for other logics."}},"verdict_id":"e37381ac-e1d8-4002-bdfa-ca49dca5c645"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8379fba5ee01c790cc33ac5af6ae26aca19fceb147ae4a6b0d03d1fc4bf9abdd","target":"record","created_at":"2026-05-20T00:05:52Z","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":"4510401568b4f072e42270aa254f616537f365272ef1c78af08581958862c1d5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-18T11:48:23Z","title_canon_sha256":"91e407978ea834e3f83c9843875a963ed4da31de38a69f283124562f1c7c54f1"},"schema_version":"1.0","source":{"id":"2605.18248","kind":"arxiv","version":1}},"canonical_sha256":"37da76599e72bb1a81e71ceaedd792fa71914d663bb53a9a645582109dbcec28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37da76599e72bb1a81e71ceaedd792fa71914d663bb53a9a645582109dbcec28","first_computed_at":"2026-05-20T00:05:52.092382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:52.092382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BDSPuk0vyy8sNNZV+zwwLoLqS6IC83ZAVDwBC8fir+fRc3FR+h/N1l/soGpG+//uc23lUqZyyNst1N14y+M2Cw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:52.093042Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8379fba5ee01c790cc33ac5af6ae26aca19fceb147ae4a6b0d03d1fc4bf9abdd","sha256:02e0698cc8ac666aec3d68bcbb73be7df0003cf258e9f8db547b43b33bc044ed"],"state_sha256":"ea62e38b1b61625540c8008cd1f1a1e1f4e9811b6bffc0a0af2576fb726ba544"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XsJ88AMw5tzXW7LzNZm3N8SDKuGjBxTZ+CSvlpXx4/SsbTE8iyFfXsQHzo52sLYFyNAvzTOkjGK3RvoC4AvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:17:57.469360Z","bundle_sha256":"a0624cdcc821d2f24493904a1f4ab8f77f1a700ff470572cf7af350836ec8ac7"}}