{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YF6Q6WFESKNLMY7FPAWQJZGPWV","short_pith_number":"pith:YF6Q6WFE","canonical_record":{"source":{"id":"2605.06639","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-07T17:49:09Z","cross_cats_sorted":["cs.AI","cs.CL","cs.MA"],"title_canon_sha256":"bdb824664eb729b97f9636399a078ea2d309fcee715c7fadf02788e627016269","abstract_canon_sha256":"b8fd2ec1394c6f4d7e5f57b9f7439374eeef98be31d1a639ed097d815751a76f"},"schema_version":"1.0"},"canonical_sha256":"c17d0f58a4929ab663e5782d04e4cfb57d59e3b59f6cb043e21ff81a7d72f48c","source":{"kind":"arxiv","id":"2605.06639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06639","created_at":"2026-05-18T15:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06639v1","created_at":"2026-05-18T15:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06639","created_at":"2026-05-18T15:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"YF6Q6WFESKNL","created_at":"2026-05-18T15:04:06Z"},{"alias_kind":"pith_short_16","alias_value":"YF6Q6WFESKNLMY7F","created_at":"2026-05-18T15:04:06Z"},{"alias_kind":"pith_short_8","alias_value":"YF6Q6WFE","created_at":"2026-05-18T15:04:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YF6Q6WFESKNLMY7FPAWQJZGPWV","target":"record","payload":{"canonical_record":{"source":{"id":"2605.06639","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-07T17:49:09Z","cross_cats_sorted":["cs.AI","cs.CL","cs.MA"],"title_canon_sha256":"bdb824664eb729b97f9636399a078ea2d309fcee715c7fadf02788e627016269","abstract_canon_sha256":"b8fd2ec1394c6f4d7e5f57b9f7439374eeef98be31d1a639ed097d815751a76f"},"schema_version":"1.0"},"canonical_sha256":"c17d0f58a4929ab663e5782d04e4cfb57d59e3b59f6cb043e21ff81a7d72f48c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T15:04:06.584035Z","signature_b64":"jW4DZ7LUCy3N9JFre5Ainwf6yi2OH8mhEqtwJMHER0GKjjNxdI3h6Sb3mTxKnA+hzUk7hrxBGkwccnw49jQlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c17d0f58a4929ab663e5782d04e4cfb57d59e3b59f6cb043e21ff81a7d72f48c","last_reissued_at":"2026-05-18T15:04:06.583108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T15:04:06.583108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.06639","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-18T15:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8hnRZLgrvJPK5bx/jzRCR75gdV0N9Cazh3a1yU68KW9mSq3tqaI2m/+6vOLWYJ3TUIp2oRiXxoCzppjsy3FGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:15:25.710394Z"},"content_sha256":"d4ced786f62773d7b88d891725c0c567cf383bb172c69a99091f10de7d1100c9","schema_version":"1.0","event_id":"sha256:d4ced786f62773d7b88d891725c0c567cf383bb172c69a99091f10de7d1100c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YF6Q6WFESKNLMY7FPAWQJZGPWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive Agent Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Reinforcement learning trains agents to recursively delegate sub-tasks to copies of themselves for divide-and-conquer scaling.","cross_cats":["cs.AI","cs.CL","cs.MA"],"primary_cat":"cs.LG","authors_text":"Apurva Gandhi, Aviral Kumar, Graham Neubig, Satyaki Chakraborty, Xiangjun Wang","submitted_at":"2026-05-07T17:49:09Z","abstract_excerpt":"We introduce Recursive Agent Optimization (RAO), a reinforcement learning approach for training recursive agents: agents that can spawn and delegate sub-tasks to new instantiations of themselves recursively. Recursive agents implement an inference-time scaling algorithm that naturally allows agents to scale to longer contexts and generalize to more difficult problems via divide-and-conquer. RAO provides a method to train models to best take advantage of such recursive inference, teaching agents when and how to delegate and communicate. We find that recursive agents trained in this way enjoy be"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"recursive agents trained in this way enjoy better training efficiency, can scale to tasks that go beyond the model's context window, generalize to tasks much harder than the ones the agent was trained on, and can enjoy reduced wall-clock time compared to single-agent systems.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That reinforcement learning can reliably teach agents effective delegation and communication rules without introducing prohibitive overhead, infinite recursion risks, or communication failures that undermine the divide-and-conquer benefit.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"RAO uses RL to train recursive agents that delegate sub-tasks to self-copies, yielding better training efficiency, generalization to harder tasks, scaling beyond context windows, and lower wall-clock time.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Reinforcement learning trains agents to recursively delegate sub-tasks to copies of themselves for divide-and-conquer scaling.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e26f00cf26afb6c49adff121b77b1bd73f36e7cad59c275bb1291f537cf0493e"},"source":{"id":"2605.06639","kind":"arxiv","version":1},"verdict":{"id":"8a6f412a-77b0-43a3-a411-ba11d31646eb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T12:06:44.950664Z","strongest_claim":"recursive agents trained in this way enjoy better training efficiency, can scale to tasks that go beyond the model's context window, generalize to tasks much harder than the ones the agent was trained on, and can enjoy reduced wall-clock time compared to single-agent systems.","one_line_summary":"RAO uses RL to train recursive agents that delegate sub-tasks to self-copies, yielding better training efficiency, generalization to harder tasks, scaling beyond context windows, and lower wall-clock time.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That reinforcement learning can reliably teach agents effective delegation and communication rules without introducing prohibitive overhead, infinite recursion risks, or communication failures that undermine the divide-and-conquer benefit.","pith_extraction_headline":"Reinforcement learning trains agents to recursively delegate sub-tasks to copies of themselves for divide-and-conquer scaling."},"references":{"count":20,"sample":[{"doi":"","year":null,"title":"def craft(ingredients: dict, target: tuple[str, int]) -> str Craft items using ingredients from your inventory. - ingredients: Dict of item_name: count to consume - target: (item_name, total_count) wh","work_id":"","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"def get_info(items: list) -> list[dict] Get recipe information for items. - Returns: List with {\"item\": str, \"can_craft\": bool, \"is_base\": bool, \"in_inventory\": int, \"crafting_depth\": int, \"recipes\": ","work_id":"","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Successfully crafted all required items","work_id":"","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"def craft(ingredients: dict, target: tuple[str, int]) -> str Craft items using ingredients from your inventory. - ingredients: Dict of {item_name: count} to consume - target: (item_name, total_count) ","work_id":"","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"def get_info(items: list) -> list[dict] Get recipe information for items. - Returns: List with {\"item\": str, \"can_craft\": bool, \"is_base\": bool, \"in_inventory\": int, \"crafting_depth\": int, \"recipes\": ","work_id":"","ref_index":6,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":0,"snapshot_sha256":"2a90faabf929bb8527f5ef7f73fd63d6cb2733fc2af1819ad4f9624bd0f2deb1","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":"8a6f412a-77b0-43a3-a411-ba11d31646eb"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T15:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uM+aC77MezXIrELvmoAvonL6PpgfFN3IwDsa2PrMavmYBagM1OIhsez7S1EVw2Bb6BS8RFEQvKwB35bZpnGQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:15:25.710925Z"},"content_sha256":"3581aedb229a0aa48db07b9728c3dc9f264756e9109487a92faadd8435cf0de7","schema_version":"1.0","event_id":"sha256:3581aedb229a0aa48db07b9728c3dc9f264756e9109487a92faadd8435cf0de7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YF6Q6WFESKNLMY7FPAWQJZGPWV/bundle.json","state_url":"https://pith.science/pith/YF6Q6WFESKNLMY7FPAWQJZGPWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YF6Q6WFESKNLMY7FPAWQJZGPWV/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-04T05:15:25Z","links":{"resolver":"https://pith.science/pith/YF6Q6WFESKNLMY7FPAWQJZGPWV","bundle":"https://pith.science/pith/YF6Q6WFESKNLMY7FPAWQJZGPWV/bundle.json","state":"https://pith.science/pith/YF6Q6WFESKNLMY7FPAWQJZGPWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YF6Q6WFESKNLMY7FPAWQJZGPWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YF6Q6WFESKNLMY7FPAWQJZGPWV","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":"b8fd2ec1394c6f4d7e5f57b9f7439374eeef98be31d1a639ed097d815751a76f","cross_cats_sorted":["cs.AI","cs.CL","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-07T17:49:09Z","title_canon_sha256":"bdb824664eb729b97f9636399a078ea2d309fcee715c7fadf02788e627016269"},"schema_version":"1.0","source":{"id":"2605.06639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06639","created_at":"2026-05-18T15:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06639v1","created_at":"2026-05-18T15:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06639","created_at":"2026-05-18T15:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"YF6Q6WFESKNL","created_at":"2026-05-18T15:04:06Z"},{"alias_kind":"pith_short_16","alias_value":"YF6Q6WFESKNLMY7F","created_at":"2026-05-18T15:04:06Z"},{"alias_kind":"pith_short_8","alias_value":"YF6Q6WFE","created_at":"2026-05-18T15:04:06Z"}],"graph_snapshots":[{"event_id":"sha256:3581aedb229a0aa48db07b9728c3dc9f264756e9109487a92faadd8435cf0de7","target":"graph","created_at":"2026-05-18T15:04:06Z","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":"recursive agents trained in this way enjoy better training efficiency, can scale to tasks that go beyond the model's context window, generalize to tasks much harder than the ones the agent was trained on, and can enjoy reduced wall-clock time compared to single-agent systems."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That reinforcement learning can reliably teach agents effective delegation and communication rules without introducing prohibitive overhead, infinite recursion risks, or communication failures that undermine the divide-and-conquer benefit."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"RAO uses RL to train recursive agents that delegate sub-tasks to self-copies, yielding better training efficiency, generalization to harder tasks, scaling beyond context windows, and lower wall-clock time."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Reinforcement learning trains agents to recursively delegate sub-tasks to copies of themselves for divide-and-conquer scaling."}],"snapshot_sha256":"e26f00cf26afb6c49adff121b77b1bd73f36e7cad59c275bb1291f537cf0493e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We introduce Recursive Agent Optimization (RAO), a reinforcement learning approach for training recursive agents: agents that can spawn and delegate sub-tasks to new instantiations of themselves recursively. Recursive agents implement an inference-time scaling algorithm that naturally allows agents to scale to longer contexts and generalize to more difficult problems via divide-and-conquer. RAO provides a method to train models to best take advantage of such recursive inference, teaching agents when and how to delegate and communicate. We find that recursive agents trained in this way enjoy be","authors_text":"Apurva Gandhi, Aviral Kumar, Graham Neubig, Satyaki Chakraborty, Xiangjun Wang","cross_cats":["cs.AI","cs.CL","cs.MA"],"headline":"Reinforcement learning trains agents to recursively delegate sub-tasks to copies of themselves for divide-and-conquer scaling.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-07T17:49:09Z","title":"Recursive Agent Optimization"},"references":{"count":20,"internal_anchors":0,"resolved_work":0,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"def craft(ingredients: dict, target: tuple[str, int]) -> str Craft items using ingredients from your inventory. - ingredients: Dict of item_name: count to consume - target: (item_name, total_count) wh","work_id":"","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"def get_info(items: list) -> list[dict] Get recipe information for items. - Returns: List with {\"item\": str, \"can_craft\": bool, \"is_base\": bool, \"in_inventory\": int, \"crafting_depth\": int, \"recipes\": ","work_id":"","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Successfully crafted all required items","work_id":"","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"def craft(ingredients: dict, target: tuple[str, int]) -> str Craft items using ingredients from your inventory. - ingredients: Dict of {item_name: count} to consume - target: (item_name, total_count) ","work_id":"","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":6,"title":"def get_info(items: list) -> list[dict] Get recipe information for items. - Returns: List with {\"item\": str, \"can_craft\": bool, \"is_base\": bool, \"in_inventory\": int, \"crafting_depth\": int, \"recipes\": ","work_id":"","year":null}],"snapshot_sha256":"2a90faabf929bb8527f5ef7f73fd63d6cb2733fc2af1819ad4f9624bd0f2deb1"},"source":{"id":"2605.06639","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-08T12:06:44.950664Z","id":"8a6f412a-77b0-43a3-a411-ba11d31646eb","model_set":{"reader":"grok-4.3"},"one_line_summary":"RAO uses RL to train recursive agents that delegate sub-tasks to self-copies, yielding better training efficiency, generalization to harder tasks, scaling beyond context windows, and lower wall-clock time.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Reinforcement learning trains agents to recursively delegate sub-tasks to copies of themselves for divide-and-conquer scaling.","strongest_claim":"recursive agents trained in this way enjoy better training efficiency, can scale to tasks that go beyond the model's context window, generalize to tasks much harder than the ones the agent was trained on, and can enjoy reduced wall-clock time compared to single-agent systems.","weakest_assumption":"That reinforcement learning can reliably teach agents effective delegation and communication rules without introducing prohibitive overhead, infinite recursion risks, or communication failures that undermine the divide-and-conquer benefit."}},"verdict_id":"8a6f412a-77b0-43a3-a411-ba11d31646eb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d4ced786f62773d7b88d891725c0c567cf383bb172c69a99091f10de7d1100c9","target":"record","created_at":"2026-05-18T15:04:06Z","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":"b8fd2ec1394c6f4d7e5f57b9f7439374eeef98be31d1a639ed097d815751a76f","cross_cats_sorted":["cs.AI","cs.CL","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-07T17:49:09Z","title_canon_sha256":"bdb824664eb729b97f9636399a078ea2d309fcee715c7fadf02788e627016269"},"schema_version":"1.0","source":{"id":"2605.06639","kind":"arxiv","version":1}},"canonical_sha256":"c17d0f58a4929ab663e5782d04e4cfb57d59e3b59f6cb043e21ff81a7d72f48c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c17d0f58a4929ab663e5782d04e4cfb57d59e3b59f6cb043e21ff81a7d72f48c","first_computed_at":"2026-05-18T15:04:06.583108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T15:04:06.583108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jW4DZ7LUCy3N9JFre5Ainwf6yi2OH8mhEqtwJMHER0GKjjNxdI3h6Sb3mTxKnA+hzUk7hrxBGkwccnw49jQlDg==","signature_status":"signed_v1","signed_at":"2026-05-18T15:04:06.584035Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.06639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4ced786f62773d7b88d891725c0c567cf383bb172c69a99091f10de7d1100c9","sha256:3581aedb229a0aa48db07b9728c3dc9f264756e9109487a92faadd8435cf0de7"],"state_sha256":"46597be4fa9c5946bb61210f0528a757fafbeb6ced24aeb58e129d8da207a35d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODxvTxo1rcMxlFy4dj9wkcAaGpTPtgQ+XfEwolGX8KAkM/QwgmFwUdBSdjL9w0g2kuc9wmAdUiKcdAd7kzv0Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:15:25.713262Z","bundle_sha256":"a6fcd41ca1a5346f5f89d874e1be8b6fda63b51b37f024830e1558e87a37fefe"}}