{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:3KGF6T3H6N5FMPI42Q4WIA66EZ","short_pith_number":"pith:3KGF6T3H","canonical_record":{"source":{"id":"2305.13691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-05-23T04:57:31Z","cross_cats_sorted":[],"title_canon_sha256":"15cb22b068714c37214b5fb44b3289298e7f431a36dba21bdd39f05fcd36853d","abstract_canon_sha256":"a10a81123f1605894e5724a40bedee978dd11c72de35a5c9fa4d9f25569acedb"},"schema_version":"1.0"},"canonical_sha256":"da8c5f4f67f37a563d1cd4396403de26402bca293652e99f4546f41773642c29","source":{"kind":"arxiv","id":"2305.13691","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.13691","created_at":"2026-07-05T07:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"2305.13691v2","created_at":"2026-07-05T07:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13691","created_at":"2026-07-05T07:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"3KGF6T3H6N5F","created_at":"2026-07-05T07:44:18Z"},{"alias_kind":"pith_short_16","alias_value":"3KGF6T3H6N5FMPI4","created_at":"2026-07-05T07:44:18Z"},{"alias_kind":"pith_short_8","alias_value":"3KGF6T3H","created_at":"2026-07-05T07:44:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:3KGF6T3H6N5FMPI42Q4WIA66EZ","target":"record","payload":{"canonical_record":{"source":{"id":"2305.13691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-05-23T04:57:31Z","cross_cats_sorted":[],"title_canon_sha256":"15cb22b068714c37214b5fb44b3289298e7f431a36dba21bdd39f05fcd36853d","abstract_canon_sha256":"a10a81123f1605894e5724a40bedee978dd11c72de35a5c9fa4d9f25569acedb"},"schema_version":"1.0"},"canonical_sha256":"da8c5f4f67f37a563d1cd4396403de26402bca293652e99f4546f41773642c29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:18.094980Z","signature_b64":"03ITeXemUbLLxkV4uOV3KN8lD1gsTUS3tk9K5pNy80TiOFT2jPUxAJsRF3kNIHjoKNAZ68pT88z1yhtzBHXtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da8c5f4f67f37a563d1cd4396403de26402bca293652e99f4546f41773642c29","last_reissued_at":"2026-07-05T07:44:18.094468Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:18.094468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.13691","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-05T07:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caHa0PW2FHIzn3PT3XGuss1L5ini6+58ZFVSmUVHgk8N4mk2+Z0d9SYX5QMtxTY/U+mOkKOwGrLTiqRD2s8qCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:00:38.498801Z"},"content_sha256":"d34d56265a79129601ca2d4369f97058eca00b25053f1615484169a099789193","schema_version":"1.0","event_id":"sha256:d34d56265a79129601ca2d4369f97058eca00b25053f1615484169a099789193"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:3KGF6T3H6N5FMPI42Q4WIA66EZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Few-Shot Data Synthesis for Open Domain Multi-Hop Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Mingda Chen, Wen-tau Yih, Xilun Chen","submitted_at":"2023-05-23T04:57:31Z","abstract_excerpt":"Few-shot learning for open domain multi-hop question answering typically relies on the incontext learning capability of large language models (LLMs). While powerful, these LLMs usually contain tens or hundreds of billions of parameters, making them rather inefficient at inference time. To improve performance of smaller language models, we propose a data synthesis framework for multi-hop question answering that requires less than 10 human annotated question answer pairs. Our framework depends only on rich, naturally-occurring relationships among documents and is built upon the data generation f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.13691","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.13691/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sDjJSX+mlBpu71pmcUIZ/ygmmaxRitQ+EWiDYeUzdkzvXNE8E2n2vnPPcB/CXJxgNt2mLPIoc+S9tzQtULSTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:00:38.499596Z"},"content_sha256":"630aa3ecb42e241929fdcf3f31a2f62f463f9c9bfeb2d0632c4b6472be934d5f","schema_version":"1.0","event_id":"sha256:630aa3ecb42e241929fdcf3f31a2f62f463f9c9bfeb2d0632c4b6472be934d5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KGF6T3H6N5FMPI42Q4WIA66EZ/bundle.json","state_url":"https://pith.science/pith/3KGF6T3H6N5FMPI42Q4WIA66EZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KGF6T3H6N5FMPI42Q4WIA66EZ/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-09T10:00:38Z","links":{"resolver":"https://pith.science/pith/3KGF6T3H6N5FMPI42Q4WIA66EZ","bundle":"https://pith.science/pith/3KGF6T3H6N5FMPI42Q4WIA66EZ/bundle.json","state":"https://pith.science/pith/3KGF6T3H6N5FMPI42Q4WIA66EZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KGF6T3H6N5FMPI42Q4WIA66EZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3KGF6T3H6N5FMPI42Q4WIA66EZ","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":"a10a81123f1605894e5724a40bedee978dd11c72de35a5c9fa4d9f25569acedb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-05-23T04:57:31Z","title_canon_sha256":"15cb22b068714c37214b5fb44b3289298e7f431a36dba21bdd39f05fcd36853d"},"schema_version":"1.0","source":{"id":"2305.13691","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.13691","created_at":"2026-07-05T07:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"2305.13691v2","created_at":"2026-07-05T07:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13691","created_at":"2026-07-05T07:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"3KGF6T3H6N5F","created_at":"2026-07-05T07:44:18Z"},{"alias_kind":"pith_short_16","alias_value":"3KGF6T3H6N5FMPI4","created_at":"2026-07-05T07:44:18Z"},{"alias_kind":"pith_short_8","alias_value":"3KGF6T3H","created_at":"2026-07-05T07:44:18Z"}],"graph_snapshots":[{"event_id":"sha256:630aa3ecb42e241929fdcf3f31a2f62f463f9c9bfeb2d0632c4b6472be934d5f","target":"graph","created_at":"2026-07-05T07:44:18Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.13691/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Few-shot learning for open domain multi-hop question answering typically relies on the incontext learning capability of large language models (LLMs). While powerful, these LLMs usually contain tens or hundreds of billions of parameters, making them rather inefficient at inference time. To improve performance of smaller language models, we propose a data synthesis framework for multi-hop question answering that requires less than 10 human annotated question answer pairs. Our framework depends only on rich, naturally-occurring relationships among documents and is built upon the data generation f","authors_text":"Mingda Chen, Wen-tau Yih, Xilun Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-05-23T04:57:31Z","title":"Few-Shot Data Synthesis for Open Domain Multi-Hop Question Answering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.13691","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d34d56265a79129601ca2d4369f97058eca00b25053f1615484169a099789193","target":"record","created_at":"2026-07-05T07:44:18Z","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":"a10a81123f1605894e5724a40bedee978dd11c72de35a5c9fa4d9f25569acedb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-05-23T04:57:31Z","title_canon_sha256":"15cb22b068714c37214b5fb44b3289298e7f431a36dba21bdd39f05fcd36853d"},"schema_version":"1.0","source":{"id":"2305.13691","kind":"arxiv","version":2}},"canonical_sha256":"da8c5f4f67f37a563d1cd4396403de26402bca293652e99f4546f41773642c29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da8c5f4f67f37a563d1cd4396403de26402bca293652e99f4546f41773642c29","first_computed_at":"2026-07-05T07:44:18.094468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:44:18.094468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"03ITeXemUbLLxkV4uOV3KN8lD1gsTUS3tk9K5pNy80TiOFT2jPUxAJsRF3kNIHjoKNAZ68pT88z1yhtzBHXtDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:44:18.094980Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.13691","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d34d56265a79129601ca2d4369f97058eca00b25053f1615484169a099789193","sha256:630aa3ecb42e241929fdcf3f31a2f62f463f9c9bfeb2d0632c4b6472be934d5f"],"state_sha256":"e945d2f7974e5ea7a8ab51c23a237dbedd30fde8094dcaeab1badf43b4f7c9f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVEjGj5sqXaOfzpqc0URZtge77qusoIkO5Z7/c2fFHXq+RXLA7odw6tecYodCAtz0xSqcLjarwbQWJQhNdQ2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T10:00:38.504930Z","bundle_sha256":"16dd713ec5333d5233c6bdefc5e4364396f3c8ec7d2be5ada47540a1ec2b129b"}}