{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:J3KM5RHEISU6ODO52ZWIT7L3FG","short_pith_number":"pith:J3KM5RHE","canonical_record":{"source":{"id":"2605.12800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-12T22:38:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2d5a1ef7807d78ef1e8fa17ec765c94b8f96a00d7769182a989edc1b6a35ce2d","abstract_canon_sha256":"13be7e8ad2282a85cb0d754a49b77c4cf4a4185db01e8ee5cea3587ed58af5b9"},"schema_version":"1.0"},"canonical_sha256":"4ed4cec4e444a9e70dddd66c89fd7b29a48fae6dce5019e835994a0d568aece8","source":{"kind":"arxiv","id":"2605.12800","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12800","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12800v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12800","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"J3KM5RHEISU6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"J3KM5RHEISU6ODO5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"J3KM5RHE","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:J3KM5RHEISU6ODO52ZWIT7L3FG","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-12T22:38:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2d5a1ef7807d78ef1e8fa17ec765c94b8f96a00d7769182a989edc1b6a35ce2d","abstract_canon_sha256":"13be7e8ad2282a85cb0d754a49b77c4cf4a4185db01e8ee5cea3587ed58af5b9"},"schema_version":"1.0"},"canonical_sha256":"4ed4cec4e444a9e70dddd66c89fd7b29a48fae6dce5019e835994a0d568aece8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:12.735623Z","signature_b64":"cZxLoRs/9dosOoHkUgyGqfKMXxegXytqq1+cU/Ymvcq16qcx01sEh764SF1akkcAFrSezhrG60n3z6x9RsDECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ed4cec4e444a9e70dddd66c89fd7b29a48fae6dce5019e835994a0d568aece8","last_reissued_at":"2026-05-18T03:09:12.735140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:12.735140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12800","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-18T03:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIAoR3QshZ6AYNHlMkMeC/O53Nxut3TqRGjL4jZ6uIneAl/RBARhGn4UA5EsUR6yfL5ryp6Qa7XiZ8D5CAiSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:59:21.554528Z"},"content_sha256":"c2971056f9fdeadbccc627686e69a2662ac6e0dd78fd202011ca94b6afd030d1","schema_version":"1.0","event_id":"sha256:c2971056f9fdeadbccc627686e69a2662ac6e0dd78fd202011ca94b6afd030d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:J3KM5RHEISU6ODO52ZWIT7L3FG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resolution Information: Limits of Ambiguity Resolution for Generative Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Resolution information reduces to a prior-dependent binary divergence when posteriors are unconstrained, and repeated sampling then drives semantic ambiguity to zero exponentially fast.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Angeles Vazquez-Castro, Faheem Dustin Quazi, Zhu Han","submitted_at":"2026-05-12T22:38:15Z","abstract_excerpt":"In generative communication, the transmitter sends a compact generative description, such as model parameters or a latent representation, rather than raw data. The receiver uses this description to form a posterior belief over the underlying state and to resolve semantic ambiguity: which interpretation, decision, or action is supported by the received representation? Inspired by Shannon's geometric view of communication as uncertainty resolution, we introduce resolution information as the minimum information update, measured in nats, required to move the receiver's posterior belief into a low-"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"resolution information reduces to a binary divergence that depends only on each region's prior probability. In this case, the shape of the regions is irrelevant. Under repeated sampling, ambiguity decays exponentially with an exponent equal to the resolution information... polytope-type regions can exhibit residual ambiguity that no amount of additional information can remove. These results reveal a fundamental departure from classical channel coding.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The generative representation constrains the posterior family in specific geometric ways (half-spaces resolvable, polytope-type regions leaving irreducible floors) that determine whether asymptotic ambiguity resolution is possible.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Resolution information equals a binary divergence based only on prior probabilities when posteriors are unconstrained, but constrained generative representations can induce irreducible ambiguity floors due to posterior geometry.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Resolution information reduces to a prior-dependent binary divergence when posteriors are unconstrained, and repeated sampling then drives semantic ambiguity to zero exponentially fast.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d0b0c3ec09c5c0e1efcd214f4f287c84259b26f496cf9c1c20f8bf8b11badc00"},"source":{"id":"2605.12800","kind":"arxiv","version":1},"verdict":{"id":"23850d79-cd13-49bd-99ab-bb7c3b8bcbbf","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:18:14.605998Z","strongest_claim":"resolution information reduces to a binary divergence that depends only on each region's prior probability. In this case, the shape of the regions is irrelevant. Under repeated sampling, ambiguity decays exponentially with an exponent equal to the resolution information... polytope-type regions can exhibit residual ambiguity that no amount of additional information can remove. These results reveal a fundamental departure from classical channel coding.","one_line_summary":"Resolution information equals a binary divergence based only on prior probabilities when posteriors are unconstrained, but constrained generative representations can induce irreducible ambiguity floors due to posterior geometry.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The generative representation constrains the posterior family in specific geometric ways (half-spaces resolvable, polytope-type regions leaving irreducible floors) that determine whether asymptotic ambiguity resolution is possible.","pith_extraction_headline":"Resolution information reduces to a prior-dependent binary divergence when posteriors are unconstrained, and repeated sampling then drives semantic ambiguity to zero exponentially fast."},"references":{"count":20,"sample":[{"doi":"","year":2006,"title":"T. M. Cover and J. A. Thomas,Elements of Information Theory, 2nd ed. Wiley, 2006","work_id":"47da5a58-3199-4889-8bcd-e82616b84978","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1949,"title":"Communication in the Presence of Noise,","work_id":"a5d3812c-01d8-4108-bd6f-a01fc5c8c904","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"A rate-distortion framework for characterizing semantic information,","work_id":"9300c1c5-45ad-4507-b3fa-92e8570e9c34","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Semantic communications: Principles and challenges","work_id":"d430bbab-1711-45b8-bd02-dd8d8ce249f4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Semantic communications: Principles and challenges,","work_id":"5838ffae-8395-42ce-9ff7-49eff076fa22","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":20,"snapshot_sha256":"eb01dd2e2f345343150ba077bc3991fc0a50df8a873b8f01e7f5c3270c642733","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"099493951418fe4b3e2c83754cf8256c2a760e4583ea6d30f0c3c953b355e237"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"23850d79-cd13-49bd-99ab-bb7c3b8bcbbf"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlElIcN99AI3PGMD4QzuZ6CFf7SCXLB3IsMAmx5JQXBkpKsw1Hq4ihMwQIdhK5A8ZaKouqVx/WIL8sJyG2nfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:59:21.555132Z"},"content_sha256":"5fb9bd9d93290e895cf104e36c9d206fc6b01a52bc9db30140349b14bca2d656","schema_version":"1.0","event_id":"sha256:5fb9bd9d93290e895cf104e36c9d206fc6b01a52bc9db30140349b14bca2d656"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3KM5RHEISU6ODO52ZWIT7L3FG/bundle.json","state_url":"https://pith.science/pith/J3KM5RHEISU6ODO52ZWIT7L3FG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3KM5RHEISU6ODO52ZWIT7L3FG/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-26T21:59:21Z","links":{"resolver":"https://pith.science/pith/J3KM5RHEISU6ODO52ZWIT7L3FG","bundle":"https://pith.science/pith/J3KM5RHEISU6ODO52ZWIT7L3FG/bundle.json","state":"https://pith.science/pith/J3KM5RHEISU6ODO52ZWIT7L3FG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3KM5RHEISU6ODO52ZWIT7L3FG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:J3KM5RHEISU6ODO52ZWIT7L3FG","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":"13be7e8ad2282a85cb0d754a49b77c4cf4a4185db01e8ee5cea3587ed58af5b9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-12T22:38:15Z","title_canon_sha256":"2d5a1ef7807d78ef1e8fa17ec765c94b8f96a00d7769182a989edc1b6a35ce2d"},"schema_version":"1.0","source":{"id":"2605.12800","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12800","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12800v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12800","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"J3KM5RHEISU6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"J3KM5RHEISU6ODO5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"J3KM5RHE","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:5fb9bd9d93290e895cf104e36c9d206fc6b01a52bc9db30140349b14bca2d656","target":"graph","created_at":"2026-05-18T03:09:12Z","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":"resolution information reduces to a binary divergence that depends only on each region's prior probability. In this case, the shape of the regions is irrelevant. Under repeated sampling, ambiguity decays exponentially with an exponent equal to the resolution information... polytope-type regions can exhibit residual ambiguity that no amount of additional information can remove. These results reveal a fundamental departure from classical channel coding."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The generative representation constrains the posterior family in specific geometric ways (half-spaces resolvable, polytope-type regions leaving irreducible floors) that determine whether asymptotic ambiguity resolution is possible."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Resolution information equals a binary divergence based only on prior probabilities when posteriors are unconstrained, but constrained generative representations can induce irreducible ambiguity floors due to posterior geometry."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Resolution information reduces to a prior-dependent binary divergence when posteriors are unconstrained, and repeated sampling then drives semantic ambiguity to zero exponentially fast."}],"snapshot_sha256":"d0b0c3ec09c5c0e1efcd214f4f287c84259b26f496cf9c1c20f8bf8b11badc00"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"099493951418fe4b3e2c83754cf8256c2a760e4583ea6d30f0c3c953b355e237"},"paper":{"abstract_excerpt":"In generative communication, the transmitter sends a compact generative description, such as model parameters or a latent representation, rather than raw data. The receiver uses this description to form a posterior belief over the underlying state and to resolve semantic ambiguity: which interpretation, decision, or action is supported by the received representation? Inspired by Shannon's geometric view of communication as uncertainty resolution, we introduce resolution information as the minimum information update, measured in nats, required to move the receiver's posterior belief into a low-","authors_text":"Angeles Vazquez-Castro, Faheem Dustin Quazi, Zhu Han","cross_cats":["math.IT"],"headline":"Resolution information reduces to a prior-dependent binary divergence when posteriors are unconstrained, and repeated sampling then drives semantic ambiguity to zero exponentially fast.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-12T22:38:15Z","title":"Resolution Information: Limits of Ambiguity Resolution for Generative Communication"},"references":{"count":20,"internal_anchors":0,"resolved_work":20,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"T. M. Cover and J. A. Thomas,Elements of Information Theory, 2nd ed. Wiley, 2006","work_id":"47da5a58-3199-4889-8bcd-e82616b84978","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Communication in the Presence of Noise,","work_id":"a5d3812c-01d8-4108-bd6f-a01fc5c8c904","year":1949},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A rate-distortion framework for characterizing semantic information,","work_id":"9300c1c5-45ad-4507-b3fa-92e8570e9c34","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Semantic communications: Principles and challenges","work_id":"d430bbab-1711-45b8-bd02-dd8d8ce249f4","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Semantic communications: Principles and challenges,","work_id":"5838ffae-8395-42ce-9ff7-49eff076fa22","year":2022}],"snapshot_sha256":"eb01dd2e2f345343150ba077bc3991fc0a50df8a873b8f01e7f5c3270c642733"},"source":{"id":"2605.12800","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:18:14.605998Z","id":"23850d79-cd13-49bd-99ab-bb7c3b8bcbbf","model_set":{"reader":"grok-4.3"},"one_line_summary":"Resolution information equals a binary divergence based only on prior probabilities when posteriors are unconstrained, but constrained generative representations can induce irreducible ambiguity floors due to posterior geometry.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Resolution information reduces to a prior-dependent binary divergence when posteriors are unconstrained, and repeated sampling then drives semantic ambiguity to zero exponentially fast.","strongest_claim":"resolution information reduces to a binary divergence that depends only on each region's prior probability. In this case, the shape of the regions is irrelevant. Under repeated sampling, ambiguity decays exponentially with an exponent equal to the resolution information... polytope-type regions can exhibit residual ambiguity that no amount of additional information can remove. These results reveal a fundamental departure from classical channel coding.","weakest_assumption":"The generative representation constrains the posterior family in specific geometric ways (half-spaces resolvable, polytope-type regions leaving irreducible floors) that determine whether asymptotic ambiguity resolution is possible."}},"verdict_id":"23850d79-cd13-49bd-99ab-bb7c3b8bcbbf"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c2971056f9fdeadbccc627686e69a2662ac6e0dd78fd202011ca94b6afd030d1","target":"record","created_at":"2026-05-18T03:09:12Z","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":"13be7e8ad2282a85cb0d754a49b77c4cf4a4185db01e8ee5cea3587ed58af5b9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-12T22:38:15Z","title_canon_sha256":"2d5a1ef7807d78ef1e8fa17ec765c94b8f96a00d7769182a989edc1b6a35ce2d"},"schema_version":"1.0","source":{"id":"2605.12800","kind":"arxiv","version":1}},"canonical_sha256":"4ed4cec4e444a9e70dddd66c89fd7b29a48fae6dce5019e835994a0d568aece8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ed4cec4e444a9e70dddd66c89fd7b29a48fae6dce5019e835994a0d568aece8","first_computed_at":"2026-05-18T03:09:12.735140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:12.735140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cZxLoRs/9dosOoHkUgyGqfKMXxegXytqq1+cU/Ymvcq16qcx01sEh764SF1akkcAFrSezhrG60n3z6x9RsDECA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:12.735623Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12800","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2971056f9fdeadbccc627686e69a2662ac6e0dd78fd202011ca94b6afd030d1","sha256:5fb9bd9d93290e895cf104e36c9d206fc6b01a52bc9db30140349b14bca2d656"],"state_sha256":"ebb6e165043b36ea7533586a88eec9f175dbd5451963b602b239560923d17c0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DEqvydC9WrDBLBjOHZy4TvL5B+UlSvq49P0JKycwqLc0WWC07surkMiJDiHExOezFWHIbeTSn3RdgNmUdISmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:59:21.557936Z","bundle_sha256":"11c403b92a768918c588315fa2a1a18a0ed1e6ff8b8b26dc24747e8bb4b3421a"}}