{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:L5IG6PJKRWUBCAMRIEOX4TE6NV","short_pith_number":"pith:L5IG6PJK","canonical_record":{"source":{"id":"2308.06431","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-08-12T01:34:41Z","cross_cats_sorted":["cs.DB","cs.IR"],"title_canon_sha256":"3f438b562e7d638174a47e494055a4b723da3c6305cdaafe5393c53276039501","abstract_canon_sha256":"a56bd2159345bbf811fe4a279016570b1afb59959c067e41fc49e70b7d6bfb93"},"schema_version":"1.0"},"canonical_sha256":"5f506f3d2a8da8110191411d7e4c9e6d6916424629b3c0fc1162cb4f17eec171","source":{"kind":"arxiv","id":"2308.06431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.06431","created_at":"2026-07-05T06:40:39Z"},{"alias_kind":"arxiv_version","alias_value":"2308.06431v1","created_at":"2026-07-05T06:40:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06431","created_at":"2026-07-05T06:40:39Z"},{"alias_kind":"pith_short_12","alias_value":"L5IG6PJKRWUB","created_at":"2026-07-05T06:40:39Z"},{"alias_kind":"pith_short_16","alias_value":"L5IG6PJKRWUBCAMR","created_at":"2026-07-05T06:40:39Z"},{"alias_kind":"pith_short_8","alias_value":"L5IG6PJK","created_at":"2026-07-05T06:40:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:L5IG6PJKRWUBCAMRIEOX4TE6NV","target":"record","payload":{"canonical_record":{"source":{"id":"2308.06431","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-08-12T01:34:41Z","cross_cats_sorted":["cs.DB","cs.IR"],"title_canon_sha256":"3f438b562e7d638174a47e494055a4b723da3c6305cdaafe5393c53276039501","abstract_canon_sha256":"a56bd2159345bbf811fe4a279016570b1afb59959c067e41fc49e70b7d6bfb93"},"schema_version":"1.0"},"canonical_sha256":"5f506f3d2a8da8110191411d7e4c9e6d6916424629b3c0fc1162cb4f17eec171","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:39.961597Z","signature_b64":"3JAN0A7fLy1990sbZ3/Ep3l1T/TCE6FsYoczT71yxql/N3PvHZkCPfmC7KaVaNljgz+vG3O301Zh517tfWYTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f506f3d2a8da8110191411d7e4c9e6d6916424629b3c0fc1162cb4f17eec171","last_reissued_at":"2026-07-05T06:40:39.961123Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:39.961123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.06431","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-07-05T06:40:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q99hLVBBlTQdypIFTDICfzBEwyfqT+3h3EFXI8RzOgMxhYlbuIbbC1yhqMVv8iMO1siC1rIVISkG4fqJGe7+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:07:19.876493Z"},"content_sha256":"87b7905adbda76c8201d1608b586ce214532424a98729d229a31cfc22f7e68b3","schema_version":"1.0","event_id":"sha256:87b7905adbda76c8201d1608b586ce214532424a98729d229a31cfc22f7e68b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:L5IG6PJKRWUBCAMRIEOX4TE6NV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Prediction for Multi-hop Questions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB","cs.IR"],"primary_cat":"cs.CL","authors_text":"Davood Rafiei, Mohammadreza Samadi","submitted_at":"2023-08-12T01:34:41Z","abstract_excerpt":"We study the problem of Query Performance Prediction (QPP) for open-domain multi-hop Question Answering (QA), where the task is to estimate the difficulty of evaluating a multi-hop question over a corpus. Despite the extensive research on predicting the performance of ad-hoc and QA retrieval models, there has been a lack of study on the estimation of the difficulty of multi-hop questions. The problem is challenging due to the multi-step nature of the retrieval process, potential dependency of the steps and the reasoning involved. To tackle this challenge, we propose multHP, a novel pre-retriev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06431","kind":"arxiv","version":1},"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/2308.06431/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-05T06:40:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSAw98e6xUk7JeBW1UX1sEoeyfimhTsrfjS+oKy767s4baNotiiPSrT+2AXjKKShGS2wb2Wmzt8b6MivrLBdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:07:19.876858Z"},"content_sha256":"4dd2b807f8f54090bf5468970956431aa841f88b1ecd78a91f70c737b2c7da38","schema_version":"1.0","event_id":"sha256:4dd2b807f8f54090bf5468970956431aa841f88b1ecd78a91f70c737b2c7da38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5IG6PJKRWUBCAMRIEOX4TE6NV/bundle.json","state_url":"https://pith.science/pith/L5IG6PJKRWUBCAMRIEOX4TE6NV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5IG6PJKRWUBCAMRIEOX4TE6NV/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-07T10:07:19Z","links":{"resolver":"https://pith.science/pith/L5IG6PJKRWUBCAMRIEOX4TE6NV","bundle":"https://pith.science/pith/L5IG6PJKRWUBCAMRIEOX4TE6NV/bundle.json","state":"https://pith.science/pith/L5IG6PJKRWUBCAMRIEOX4TE6NV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5IG6PJKRWUBCAMRIEOX4TE6NV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:L5IG6PJKRWUBCAMRIEOX4TE6NV","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":"a56bd2159345bbf811fe4a279016570b1afb59959c067e41fc49e70b7d6bfb93","cross_cats_sorted":["cs.DB","cs.IR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-08-12T01:34:41Z","title_canon_sha256":"3f438b562e7d638174a47e494055a4b723da3c6305cdaafe5393c53276039501"},"schema_version":"1.0","source":{"id":"2308.06431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.06431","created_at":"2026-07-05T06:40:39Z"},{"alias_kind":"arxiv_version","alias_value":"2308.06431v1","created_at":"2026-07-05T06:40:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06431","created_at":"2026-07-05T06:40:39Z"},{"alias_kind":"pith_short_12","alias_value":"L5IG6PJKRWUB","created_at":"2026-07-05T06:40:39Z"},{"alias_kind":"pith_short_16","alias_value":"L5IG6PJKRWUBCAMR","created_at":"2026-07-05T06:40:39Z"},{"alias_kind":"pith_short_8","alias_value":"L5IG6PJK","created_at":"2026-07-05T06:40:39Z"}],"graph_snapshots":[{"event_id":"sha256:4dd2b807f8f54090bf5468970956431aa841f88b1ecd78a91f70c737b2c7da38","target":"graph","created_at":"2026-07-05T06:40:39Z","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/2308.06431/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of Query Performance Prediction (QPP) for open-domain multi-hop Question Answering (QA), where the task is to estimate the difficulty of evaluating a multi-hop question over a corpus. Despite the extensive research on predicting the performance of ad-hoc and QA retrieval models, there has been a lack of study on the estimation of the difficulty of multi-hop questions. The problem is challenging due to the multi-step nature of the retrieval process, potential dependency of the steps and the reasoning involved. To tackle this challenge, we propose multHP, a novel pre-retriev","authors_text":"Davood Rafiei, Mohammadreza Samadi","cross_cats":["cs.DB","cs.IR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-08-12T01:34:41Z","title":"Performance Prediction for Multi-hop Questions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06431","kind":"arxiv","version":1},"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:87b7905adbda76c8201d1608b586ce214532424a98729d229a31cfc22f7e68b3","target":"record","created_at":"2026-07-05T06:40:39Z","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":"a56bd2159345bbf811fe4a279016570b1afb59959c067e41fc49e70b7d6bfb93","cross_cats_sorted":["cs.DB","cs.IR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-08-12T01:34:41Z","title_canon_sha256":"3f438b562e7d638174a47e494055a4b723da3c6305cdaafe5393c53276039501"},"schema_version":"1.0","source":{"id":"2308.06431","kind":"arxiv","version":1}},"canonical_sha256":"5f506f3d2a8da8110191411d7e4c9e6d6916424629b3c0fc1162cb4f17eec171","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f506f3d2a8da8110191411d7e4c9e6d6916424629b3c0fc1162cb4f17eec171","first_computed_at":"2026-07-05T06:40:39.961123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:40:39.961123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3JAN0A7fLy1990sbZ3/Ep3l1T/TCE6FsYoczT71yxql/N3PvHZkCPfmC7KaVaNljgz+vG3O301Zh517tfWYTAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:40:39.961597Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.06431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87b7905adbda76c8201d1608b586ce214532424a98729d229a31cfc22f7e68b3","sha256:4dd2b807f8f54090bf5468970956431aa841f88b1ecd78a91f70c737b2c7da38"],"state_sha256":"65ec013eb7765b97d1090313cd7dc768b55274bc939ac0df3d904c76151e6387"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6xvky5/BuaR29e8fxR7A1KJJuzVBqTpGEniic0OhVmQmFcwueQcN0XjNRmTB2wxFbokB8r79pREvBpdY8cfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:07:19.878827Z","bundle_sha256":"20c0ab80253f7492a1cc2135ef237c315b4cd738d51d1483dcb27cdc06eec7ac"}}