{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:G26S644EVZAOZIDE3OE7QWCPK5","short_pith_number":"pith:G26S644E","canonical_record":{"source":{"id":"2605.11151","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-11T18:58:49Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"4d7271962b5f2eed352656d00664f12bd6cc4a38ab2b0977261d2c1aae95966d","abstract_canon_sha256":"70d7c84781a912443786fabd96a9330664f8449b1b721ae57e0c06c3947334da"},"schema_version":"1.0"},"canonical_sha256":"36bd2f7384ae40eca064db89f8584f5767b252369e6e36fe75200c557a358fae","source":{"kind":"arxiv","id":"2605.11151","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11151","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11151v2","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11151","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"G26S644EVZAO","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"G26S644EVZAOZIDE","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"G26S644E","created_at":"2026-05-21T01:04:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:G26S644EVZAOZIDE3OE7QWCPK5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.11151","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-11T18:58:49Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"4d7271962b5f2eed352656d00664f12bd6cc4a38ab2b0977261d2c1aae95966d","abstract_canon_sha256":"70d7c84781a912443786fabd96a9330664f8449b1b721ae57e0c06c3947334da"},"schema_version":"1.0"},"canonical_sha256":"36bd2f7384ae40eca064db89f8584f5767b252369e6e36fe75200c557a358fae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:27.605171Z","signature_b64":"FPE86N2tADh1RVPAIRDjp5cXW3NTGiICTqXIvnZuK0NOQq1+dGuzjhgvMhUMLdtT7k4PJ5V1W/rC1TRSujJuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36bd2f7384ae40eca064db89f8584f5767b252369e6e36fe75200c557a358fae","last_reissued_at":"2026-05-21T01:04:27.604098Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:27.604098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.11151","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-05-21T01:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qn/ZmnxgN63vQKBDqccqCYh7ddX9up7ecpuZJisxSXqgp8O+WRG0bI40ptuQ3MLciGdeSF6LVnqjrL7t0tT6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T11:08:31.479780Z"},"content_sha256":"e9e84aa27dffe8ccaad6875b7275bd4067963f7b466766c3ada82114c140c085","schema_version":"1.0","event_id":"sha256:e9e84aa27dffe8ccaad6875b7275bd4067963f7b466766c3ada82114c140c085"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:G26S644EVZAOZIDE3OE7QWCPK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RankQ: Offline-to-Online Reinforcement Learning via Self-Supervised Action Ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"RankQ augments Q-learning with a self-supervised ranking loss to direct policies toward higher-quality actions beyond suboptimal offline data.","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Andrew Choi, Wei Xu","submitted_at":"2026-05-11T18:58:49Z","abstract_excerpt":"Offline-to-online reinforcement learning (RL) improves sample efficiency by leveraging pre-collected datasets prior to online interaction. A key challenge, however, is learning an accurate critic in large state--action spaces with limited dataset coverage. To mitigate harmful updates from value overestimation, prior methods impose pessimism by down-weighting out-of-distribution (OOD) actions relative to dataset actions. While effective, this essentially acts as a behavior cloning anchor and can hinder downstream online policy improvement when dataset actions are suboptimal. We propose RankQ, a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Across sparse reward D4RL benchmarks, RankQ achieves performance competitive with or superior to seven prior methods. In vision-based robot learning, RankQ enables effective offline-to-online fine-tuning of a pretrained vision-language-action (VLA) model in a low-data regime, achieving on average a 42.7% higher simulation success rate than the next best method. In a high-data setting, RankQ improves simulation performance by 13.7% over the next best method and achieves strong sim-to-real transfer, increasing real-world cube stacking success from 43.1% to 84.7% relative to the VLA's initial performance.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That augmenting temporal-difference learning with a self-supervised multi-term ranking loss will enforce structured action ordering and direct action gradients toward higher-quality behaviors without introducing instability, bias, or harmful updates in large state-action spaces with limited dataset coverage.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"RankQ adds a self-supervised ranking loss to Q-learning to learn structured action orderings, yielding competitive or better performance than prior methods on D4RL benchmarks and large gains in vision-based robot fine-tuning.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"RankQ augments Q-learning with a self-supervised ranking loss to direct policies toward higher-quality actions beyond suboptimal offline data.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"772ebd84eacb0e0134ff2e0975d0767bc612939f9a87a55386a8530ba77e8f55"},"source":{"id":"2605.11151","kind":"arxiv","version":2},"verdict":{"id":"20eff315-56d8-47cc-a6e7-4dfa4f32ce5e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T02:26:18.930997Z","strongest_claim":"Across sparse reward D4RL benchmarks, RankQ achieves performance competitive with or superior to seven prior methods. In vision-based robot learning, RankQ enables effective offline-to-online fine-tuning of a pretrained vision-language-action (VLA) model in a low-data regime, achieving on average a 42.7% higher simulation success rate than the next best method. In a high-data setting, RankQ improves simulation performance by 13.7% over the next best method and achieves strong sim-to-real transfer, increasing real-world cube stacking success from 43.1% to 84.7% relative to the VLA's initial performance.","one_line_summary":"RankQ adds a self-supervised ranking loss to Q-learning to learn structured action orderings, yielding competitive or better performance than prior methods on D4RL benchmarks and large gains in vision-based robot fine-tuning.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That augmenting temporal-difference learning with a self-supervised multi-term ranking loss will enforce structured action ordering and direct action gradients toward higher-quality behaviors without introducing instability, bias, or harmful updates in large state-action spaces with limited dataset coverage.","pith_extraction_headline":"RankQ augments Q-learning with a self-supervised ranking loss to direct policies toward higher-quality actions beyond suboptimal offline data."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.11151/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T05:02:00.606507Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:34:24.236844Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T10:31:16.648446Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T08:44:39.526372Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e51ac91bedd335b40ba1bd8e66a7308143f27c2d730bcab8c5a4264400dd4ab3"},"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":"20eff315-56d8-47cc-a6e7-4dfa4f32ce5e"},"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:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8EKUZheoq6I0FDvAxZoDUq9e2c95EAae/uBtdb++yb/hDS9zMM+WKDIwCJFfJ45I55xIhWvTYeTviaY01yF4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T11:08:31.480504Z"},"content_sha256":"b8f04e4550a07d4536696b9c57adfaf7a1d62cf2213b819d0659ab60d24029c5","schema_version":"1.0","event_id":"sha256:b8f04e4550a07d4536696b9c57adfaf7a1d62cf2213b819d0659ab60d24029c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G26S644EVZAOZIDE3OE7QWCPK5/bundle.json","state_url":"https://pith.science/pith/G26S644EVZAOZIDE3OE7QWCPK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G26S644EVZAOZIDE3OE7QWCPK5/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-21T11:08:31Z","links":{"resolver":"https://pith.science/pith/G26S644EVZAOZIDE3OE7QWCPK5","bundle":"https://pith.science/pith/G26S644EVZAOZIDE3OE7QWCPK5/bundle.json","state":"https://pith.science/pith/G26S644EVZAOZIDE3OE7QWCPK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G26S644EVZAOZIDE3OE7QWCPK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:G26S644EVZAOZIDE3OE7QWCPK5","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":"70d7c84781a912443786fabd96a9330664f8449b1b721ae57e0c06c3947334da","cross_cats_sorted":["cs.RO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-11T18:58:49Z","title_canon_sha256":"4d7271962b5f2eed352656d00664f12bd6cc4a38ab2b0977261d2c1aae95966d"},"schema_version":"1.0","source":{"id":"2605.11151","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11151","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11151v2","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11151","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"G26S644EVZAO","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"G26S644EVZAOZIDE","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"G26S644E","created_at":"2026-05-21T01:04:27Z"}],"graph_snapshots":[{"event_id":"sha256:b8f04e4550a07d4536696b9c57adfaf7a1d62cf2213b819d0659ab60d24029c5","target":"graph","created_at":"2026-05-21T01:04:27Z","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":"Across sparse reward D4RL benchmarks, RankQ achieves performance competitive with or superior to seven prior methods. In vision-based robot learning, RankQ enables effective offline-to-online fine-tuning of a pretrained vision-language-action (VLA) model in a low-data regime, achieving on average a 42.7% higher simulation success rate than the next best method. In a high-data setting, RankQ improves simulation performance by 13.7% over the next best method and achieves strong sim-to-real transfer, increasing real-world cube stacking success from 43.1% to 84.7% relative to the VLA's initial performance."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That augmenting temporal-difference learning with a self-supervised multi-term ranking loss will enforce structured action ordering and direct action gradients toward higher-quality behaviors without introducing instability, bias, or harmful updates in large state-action spaces with limited dataset coverage."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"RankQ adds a self-supervised ranking loss to Q-learning to learn structured action orderings, yielding competitive or better performance than prior methods on D4RL benchmarks and large gains in vision-based robot fine-tuning."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"RankQ augments Q-learning with a self-supervised ranking loss to direct policies toward higher-quality actions beyond suboptimal offline data."}],"snapshot_sha256":"772ebd84eacb0e0134ff2e0975d0767bc612939f9a87a55386a8530ba77e8f55"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T05:02:00.606507Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:34:24.236844Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T10:31:16.648446Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T08:44:39.526372Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.11151/integrity.json","findings":[],"snapshot_sha256":"e51ac91bedd335b40ba1bd8e66a7308143f27c2d730bcab8c5a4264400dd4ab3","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Offline-to-online reinforcement learning (RL) improves sample efficiency by leveraging pre-collected datasets prior to online interaction. A key challenge, however, is learning an accurate critic in large state--action spaces with limited dataset coverage. To mitigate harmful updates from value overestimation, prior methods impose pessimism by down-weighting out-of-distribution (OOD) actions relative to dataset actions. While effective, this essentially acts as a behavior cloning anchor and can hinder downstream online policy improvement when dataset actions are suboptimal. We propose RankQ, a","authors_text":"Andrew Choi, Wei Xu","cross_cats":["cs.RO"],"headline":"RankQ augments Q-learning with a self-supervised ranking loss to direct policies toward higher-quality actions beyond suboptimal offline data.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-11T18:58:49Z","title":"RankQ: Offline-to-Online Reinforcement Learning via Self-Supervised Action Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.11151","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T02:26:18.930997Z","id":"20eff315-56d8-47cc-a6e7-4dfa4f32ce5e","model_set":{"reader":"grok-4.3"},"one_line_summary":"RankQ adds a self-supervised ranking loss to Q-learning to learn structured action orderings, yielding competitive or better performance than prior methods on D4RL benchmarks and large gains in vision-based robot fine-tuning.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"RankQ augments Q-learning with a self-supervised ranking loss to direct policies toward higher-quality actions beyond suboptimal offline data.","strongest_claim":"Across sparse reward D4RL benchmarks, RankQ achieves performance competitive with or superior to seven prior methods. In vision-based robot learning, RankQ enables effective offline-to-online fine-tuning of a pretrained vision-language-action (VLA) model in a low-data regime, achieving on average a 42.7% higher simulation success rate than the next best method. In a high-data setting, RankQ improves simulation performance by 13.7% over the next best method and achieves strong sim-to-real transfer, increasing real-world cube stacking success from 43.1% to 84.7% relative to the VLA's initial performance.","weakest_assumption":"That augmenting temporal-difference learning with a self-supervised multi-term ranking loss will enforce structured action ordering and direct action gradients toward higher-quality behaviors without introducing instability, bias, or harmful updates in large state-action spaces with limited dataset coverage."}},"verdict_id":"20eff315-56d8-47cc-a6e7-4dfa4f32ce5e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e9e84aa27dffe8ccaad6875b7275bd4067963f7b466766c3ada82114c140c085","target":"record","created_at":"2026-05-21T01:04:27Z","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":"70d7c84781a912443786fabd96a9330664f8449b1b721ae57e0c06c3947334da","cross_cats_sorted":["cs.RO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-11T18:58:49Z","title_canon_sha256":"4d7271962b5f2eed352656d00664f12bd6cc4a38ab2b0977261d2c1aae95966d"},"schema_version":"1.0","source":{"id":"2605.11151","kind":"arxiv","version":2}},"canonical_sha256":"36bd2f7384ae40eca064db89f8584f5767b252369e6e36fe75200c557a358fae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36bd2f7384ae40eca064db89f8584f5767b252369e6e36fe75200c557a358fae","first_computed_at":"2026-05-21T01:04:27.604098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:27.604098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FPE86N2tADh1RVPAIRDjp5cXW3NTGiICTqXIvnZuK0NOQq1+dGuzjhgvMhUMLdtT7k4PJ5V1W/rC1TRSujJuAA==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:27.605171Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.11151","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9e84aa27dffe8ccaad6875b7275bd4067963f7b466766c3ada82114c140c085","sha256:b8f04e4550a07d4536696b9c57adfaf7a1d62cf2213b819d0659ab60d24029c5"],"state_sha256":"5dd051e735611d9eef00f5d15526571dbf554a1a80437aef38556a604000b603"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xb/DezSJThFfZyzMgA4idxx09NHmZJk7+oO5jw/Ni6yu3mdfJsP65byCBtN1ENdyu5HofRH+PAIHGcrZRBwJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T11:08:31.485615Z","bundle_sha256":"4a6a66913c0a6862110edcd8712c1d0c0b086333d6e89a204500bacc80f74f10"}}