{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:47RIP3XYETSJYAYN4327RNZJB5","short_pith_number":"pith:47RIP3XY","canonical_record":{"source":{"id":"2011.01060","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2020-11-02T15:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"0b7e362fc7e522cf5d8515bc3403627601cabc472a2c0440987ff258e924a954","abstract_canon_sha256":"3d39e86b1955e8af58634476393ac184648f11474b8e6b73035ce55eadccd85b"},"schema_version":"1.0"},"canonical_sha256":"e7e287eef824e49c030de6f5f8b7290f5472d85a7b5eb8aa0ad7260f1410bc3a","source":{"kind":"arxiv","id":"2011.01060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.01060","created_at":"2026-07-05T01:51:10Z"},{"alias_kind":"arxiv_version","alias_value":"2011.01060v2","created_at":"2026-07-05T01:51:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.01060","created_at":"2026-07-05T01:51:10Z"},{"alias_kind":"pith_short_12","alias_value":"47RIP3XYETSJ","created_at":"2026-07-05T01:51:10Z"},{"alias_kind":"pith_short_16","alias_value":"47RIP3XYETSJYAYN","created_at":"2026-07-05T01:51:10Z"},{"alias_kind":"pith_short_8","alias_value":"47RIP3XY","created_at":"2026-07-05T01:51:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:47RIP3XYETSJYAYN4327RNZJB5","target":"record","payload":{"canonical_record":{"source":{"id":"2011.01060","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2020-11-02T15:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"0b7e362fc7e522cf5d8515bc3403627601cabc472a2c0440987ff258e924a954","abstract_canon_sha256":"3d39e86b1955e8af58634476393ac184648f11474b8e6b73035ce55eadccd85b"},"schema_version":"1.0"},"canonical_sha256":"e7e287eef824e49c030de6f5f8b7290f5472d85a7b5eb8aa0ad7260f1410bc3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:10.020080Z","signature_b64":"aCts1QWhwV0gkYFgy7y6bXxz60xvm+kmreSbmeSVXwpjUMOfSzMFeiDNhOUjGGTplN5bXF9riENZgs8lCi76Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7e287eef824e49c030de6f5f8b7290f5472d85a7b5eb8aa0ad7260f1410bc3a","last_reissued_at":"2026-07-05T01:51:10.019555Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:10.019555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.01060","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-07-05T01:51:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NFaaEO3he0q0cuXMKpRaKCzlFVkhlcr28kNjqhrdzzvLsWbD/ZxleKvKtTiFmFzswNXPfkhnay0qN30IlvDHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T06:01:24.596143Z"},"content_sha256":"23b50d73a3da5152d5562b23c98251aa6883677020a2e899c2fe1d940b4e64e4","schema_version":"1.0","event_id":"sha256:23b50d73a3da5152d5562b23c98251aa6883677020a2e899c2fe1d940b4e64e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:47RIP3XYETSJYAYN4327RNZJB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A new multi-hop QA dataset provides explicit reasoning paths and guarantees that models must chain multiple pieces of evidence.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Akiko Aizawa, Anh-Khoa Duong Nguyen, Saku Sugawara, Xanh Ho","submitted_at":"2020-11-02T15:42:40Z","abstract_excerpt":"A multi-hop question answering (QA) dataset aims to test reasoning and inference skills by requiring a model to read multiple paragraphs to answer a given question. However, current datasets do not provide a complete explanation for the reasoning process from the question to the answer. Further, previous studies revealed that many examples in existing multi-hop datasets do not require multi-hop reasoning to answer a question. In this study, we present a new multi-hop QA dataset, called 2WikiMultiHopQA, which uses structured and unstructured data. In our dataset, we introduce the evidence infor"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our dataset is challenging for multi-hop models and it ensures that multi-hop reasoning is required.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The pipeline and templates used to generate questions from Wikidata and Wikipedia truly produce examples that cannot be solved without chaining multiple pieces of evidence (section describing the generation process).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Introduces 2WikiMultiHopQA, a multi-hop QA dataset with explicit evidence chains generated via templates and Wikidata logical rules to force and evaluate multi-hop reasoning.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A new multi-hop QA dataset provides explicit reasoning paths and guarantees that models must chain multiple pieces of evidence.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"721b30bb163cd8fa4488ca43212fa573efff4146b327861faf9414012638414d"},"source":{"id":"2011.01060","kind":"arxiv","version":2},"verdict":{"id":"37f65007-46d9-4f80-9954-a6374040bc79","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T07:35:29.009101Z","strongest_claim":"Our dataset is challenging for multi-hop models and it ensures that multi-hop reasoning is required.","one_line_summary":"Introduces 2WikiMultiHopQA, a multi-hop QA dataset with explicit evidence chains generated via templates and Wikidata logical rules to force and evaluate multi-hop reasoning.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The pipeline and templates used to generate questions from Wikidata and Wikipedia truly produce examples that cannot be solved without chaining multiple pieces of evidence (section describing the generation process).","pith_extraction_headline":"A new multi-hop QA dataset provides explicit reasoning paths and guarantees that models must chain multiple pieces of evidence."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.01060/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":15,"sample":[{"doi":"","year":1993,"title":"In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, SIGMOD ’93, page 207–216, New York, NY , USA","work_id":"98128415-244d-4c92-a5dc-b51ec85147d9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing , pages 1533–1544, Seattle, Washington, USA, October","work_id":"db3cb5c8-c6d0-497e-8e68-42ba546da6b4","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Large-scale Simple Question Answering with Memory Networks","work_id":"f99ac6ec-9a3c-47f6-8a5d-d44a87cc5310","ref_index":3,"cited_arxiv_id":"1506.02075","is_internal_anchor":true},{"doi":"","year":2019,"title":"Understanding dataset design choices for Multi-hop reasoning. In Proceed- ings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Tec","work_id":"13612f84-0843-42c4-8425-d7a493498569","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"HybridQA: A dataset of multi-hop question answering over tabular and textual data. ArXiv, abs/2004.07347. Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova","work_id":"5fcb8daa-ece5-40c8-8a10-83174824aaf5","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"ca529492b6233d3aee13e65caa4d5f73029cadc12326741fee46a6cad20cfdaf","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f2ff044ed5f0b0c48b0ed35a5ebe8fa8655fad1b0333c4802549062f39b7c7f2"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"37f65007-46d9-4f80-9954-a6374040bc79"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:51:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D4pgBjE4Iu40bAuuqN0IP0AsVQO5cmgi5nRM67NcJqhXzfcdeXauC4ux7GL/sXB5qbYvNxye/SS702CF4tSKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T06:01:24.596712Z"},"content_sha256":"59446065ef8aaa2819aee83335536c3855a33299ded29cbc8f34749e8587df66","schema_version":"1.0","event_id":"sha256:59446065ef8aaa2819aee83335536c3855a33299ded29cbc8f34749e8587df66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47RIP3XYETSJYAYN4327RNZJB5/bundle.json","state_url":"https://pith.science/pith/47RIP3XYETSJYAYN4327RNZJB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47RIP3XYETSJYAYN4327RNZJB5/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-07-18T06:01:24Z","links":{"resolver":"https://pith.science/pith/47RIP3XYETSJYAYN4327RNZJB5","bundle":"https://pith.science/pith/47RIP3XYETSJYAYN4327RNZJB5/bundle.json","state":"https://pith.science/pith/47RIP3XYETSJYAYN4327RNZJB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47RIP3XYETSJYAYN4327RNZJB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:47RIP3XYETSJYAYN4327RNZJB5","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":"3d39e86b1955e8af58634476393ac184648f11474b8e6b73035ce55eadccd85b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2020-11-02T15:42:40Z","title_canon_sha256":"0b7e362fc7e522cf5d8515bc3403627601cabc472a2c0440987ff258e924a954"},"schema_version":"1.0","source":{"id":"2011.01060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.01060","created_at":"2026-07-05T01:51:10Z"},{"alias_kind":"arxiv_version","alias_value":"2011.01060v2","created_at":"2026-07-05T01:51:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.01060","created_at":"2026-07-05T01:51:10Z"},{"alias_kind":"pith_short_12","alias_value":"47RIP3XYETSJ","created_at":"2026-07-05T01:51:10Z"},{"alias_kind":"pith_short_16","alias_value":"47RIP3XYETSJYAYN","created_at":"2026-07-05T01:51:10Z"},{"alias_kind":"pith_short_8","alias_value":"47RIP3XY","created_at":"2026-07-05T01:51:10Z"}],"graph_snapshots":[{"event_id":"sha256:59446065ef8aaa2819aee83335536c3855a33299ded29cbc8f34749e8587df66","target":"graph","created_at":"2026-07-05T01:51:10Z","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 dataset is challenging for multi-hop models and it ensures that multi-hop reasoning is required."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The pipeline and templates used to generate questions from Wikidata and Wikipedia truly produce examples that cannot be solved without chaining multiple pieces of evidence (section describing the generation process)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Introduces 2WikiMultiHopQA, a multi-hop QA dataset with explicit evidence chains generated via templates and Wikidata logical rules to force and evaluate multi-hop reasoning."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A new multi-hop QA dataset provides explicit reasoning paths and guarantees that models must chain multiple pieces of evidence."}],"snapshot_sha256":"721b30bb163cd8fa4488ca43212fa573efff4146b327861faf9414012638414d"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f2ff044ed5f0b0c48b0ed35a5ebe8fa8655fad1b0333c4802549062f39b7c7f2"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.01060/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A multi-hop question answering (QA) dataset aims to test reasoning and inference skills by requiring a model to read multiple paragraphs to answer a given question. However, current datasets do not provide a complete explanation for the reasoning process from the question to the answer. Further, previous studies revealed that many examples in existing multi-hop datasets do not require multi-hop reasoning to answer a question. In this study, we present a new multi-hop QA dataset, called 2WikiMultiHopQA, which uses structured and unstructured data. In our dataset, we introduce the evidence infor","authors_text":"Akiko Aizawa, Anh-Khoa Duong Nguyen, Saku Sugawara, Xanh Ho","cross_cats":[],"headline":"A new multi-hop QA dataset provides explicit reasoning paths and guarantees that models must chain multiple pieces of evidence.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2020-11-02T15:42:40Z","title":"Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps"},"references":{"count":15,"internal_anchors":2,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, SIGMOD ’93, page 207–216, New York, NY , USA","work_id":"98128415-244d-4c92-a5dc-b51ec85147d9","year":1993},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing , pages 1533–1544, Seattle, Washington, USA, October","work_id":"db3cb5c8-c6d0-497e-8e68-42ba546da6b4","year":2013},{"cited_arxiv_id":"1506.02075","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Large-scale Simple Question Answering with Memory Networks","work_id":"f99ac6ec-9a3c-47f6-8a5d-d44a87cc5310","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Understanding dataset design choices for Multi-hop reasoning. In Proceed- ings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Tec","work_id":"13612f84-0843-42c4-8425-d7a493498569","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"HybridQA: A dataset of multi-hop question answering over tabular and textual data. ArXiv, abs/2004.07347. Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova","work_id":"5fcb8daa-ece5-40c8-8a10-83174824aaf5","year":2004}],"snapshot_sha256":"ca529492b6233d3aee13e65caa4d5f73029cadc12326741fee46a6cad20cfdaf"},"source":{"id":"2011.01060","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-18T07:35:29.009101Z","id":"37f65007-46d9-4f80-9954-a6374040bc79","model_set":{"reader":"grok-4.3"},"one_line_summary":"Introduces 2WikiMultiHopQA, a multi-hop QA dataset with explicit evidence chains generated via templates and Wikidata logical rules to force and evaluate multi-hop reasoning.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A new multi-hop QA dataset provides explicit reasoning paths and guarantees that models must chain multiple pieces of evidence.","strongest_claim":"Our dataset is challenging for multi-hop models and it ensures that multi-hop reasoning is required.","weakest_assumption":"The pipeline and templates used to generate questions from Wikidata and Wikipedia truly produce examples that cannot be solved without chaining multiple pieces of evidence (section describing the generation process)."}},"verdict_id":"37f65007-46d9-4f80-9954-a6374040bc79"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:23b50d73a3da5152d5562b23c98251aa6883677020a2e899c2fe1d940b4e64e4","target":"record","created_at":"2026-07-05T01:51:10Z","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":"3d39e86b1955e8af58634476393ac184648f11474b8e6b73035ce55eadccd85b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2020-11-02T15:42:40Z","title_canon_sha256":"0b7e362fc7e522cf5d8515bc3403627601cabc472a2c0440987ff258e924a954"},"schema_version":"1.0","source":{"id":"2011.01060","kind":"arxiv","version":2}},"canonical_sha256":"e7e287eef824e49c030de6f5f8b7290f5472d85a7b5eb8aa0ad7260f1410bc3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7e287eef824e49c030de6f5f8b7290f5472d85a7b5eb8aa0ad7260f1410bc3a","first_computed_at":"2026-07-05T01:51:10.019555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:51:10.019555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aCts1QWhwV0gkYFgy7y6bXxz60xvm+kmreSbmeSVXwpjUMOfSzMFeiDNhOUjGGTplN5bXF9riENZgs8lCi76Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T01:51:10.020080Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.01060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23b50d73a3da5152d5562b23c98251aa6883677020a2e899c2fe1d940b4e64e4","sha256:59446065ef8aaa2819aee83335536c3855a33299ded29cbc8f34749e8587df66"],"state_sha256":"2863ed39630e33fcd5715ed083cab4a6c6d08291c3afb9506abfd35fa056f39f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RuZ9KU3SZAIeNgizwLfhdpAVCaJYsl6bdTmoru7FeZNcT2dt/VLQwQiX/oE08wxtDt8xJYoY19MKtWZYJ6ZaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T06:01:24.599233Z","bundle_sha256":"baeb36fb909cfb18c105563b47f778e9556717375756302e8dc96931265769e7"}}