{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:7GXFN4VEMJ7RFPJI3F6FHBXF5G","short_pith_number":"pith:7GXFN4VE","canonical_record":{"source":{"id":"2004.03096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-04-07T02:59:42Z","cross_cats_sorted":[],"title_canon_sha256":"8729fbe4e293214c4d2e50ee6ca8000ab64424040e0ffac9af695d301a5ed64b","abstract_canon_sha256":"0b0fb74d0bf1ae8506b2fbb733f6fa947cac9a6303a2cff4702edc27cb04bf0a"},"schema_version":"1.0"},"canonical_sha256":"f9ae56f2a4627f12bd28d97c5386e5e9a88283c58616d798a60591145cd66831","source":{"kind":"arxiv","id":"2004.03096","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.03096","created_at":"2026-07-05T01:58:40Z"},{"alias_kind":"arxiv_version","alias_value":"2004.03096v2","created_at":"2026-07-05T01:58:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.03096","created_at":"2026-07-05T01:58:40Z"},{"alias_kind":"pith_short_12","alias_value":"7GXFN4VEMJ7R","created_at":"2026-07-05T01:58:40Z"},{"alias_kind":"pith_short_16","alias_value":"7GXFN4VEMJ7RFPJI","created_at":"2026-07-05T01:58:40Z"},{"alias_kind":"pith_short_8","alias_value":"7GXFN4VE","created_at":"2026-07-05T01:58:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:7GXFN4VEMJ7RFPJI3F6FHBXF5G","target":"record","payload":{"canonical_record":{"source":{"id":"2004.03096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-04-07T02:59:42Z","cross_cats_sorted":[],"title_canon_sha256":"8729fbe4e293214c4d2e50ee6ca8000ab64424040e0ffac9af695d301a5ed64b","abstract_canon_sha256":"0b0fb74d0bf1ae8506b2fbb733f6fa947cac9a6303a2cff4702edc27cb04bf0a"},"schema_version":"1.0"},"canonical_sha256":"f9ae56f2a4627f12bd28d97c5386e5e9a88283c58616d798a60591145cd66831","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:40.700873Z","signature_b64":"UxeXyC8s5kfuGhF52eE5ATnjRJ+RQRFcb51e2fES8i4BiK7Eq4w4/vAAeAsnhuDTx6ISy2OXUNaZ9KCLrqfqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9ae56f2a4627f12bd28d97c5386e5e9a88283c58616d798a60591145cd66831","last_reissued_at":"2026-07-05T01:58:40.700460Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:40.700460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.03096","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:58:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yIbhzfl+YiqN0YzWjISO+Qim+HdXBJLKNegKg4fmQWpEu34j8e/NnEgrnRoowz11vJLvOxqAFxcIDrbJuFiQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T09:15:17.360552Z"},"content_sha256":"cc22881cebb1221e03eb6bcd7e583862bf4cfeadc01cd1e0f38c8dcce2771962","schema_version":"1.0","event_id":"sha256:cc22881cebb1221e03eb6bcd7e583862bf4cfeadc01cd1e0f38c8dcce2771962"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:7GXFN4VEMJ7RFPJI3F6FHBXF5G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Is Graph Structure Necessary for Multi-hop Question Answering?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Guoping Hu, Nan Shao, Shijin Wang, Ting Liu, Yiming Cui","submitted_at":"2020-04-07T02:59:42Z","abstract_excerpt":"Recently, attempting to model texts as graph structure and introducing graph neural networks to deal with it has become a trend in many NLP research areas. In this paper, we investigate whether the graph structure is necessary for multi-hop question answering. Our analysis is centered on HotpotQA. We construct a strong baseline model to establish that, with the proper use of pre-trained models, graph structure may not be necessary for multi-hop question answering. We point out that both graph structure and adjacency matrix are task-related prior knowledge, and graph-attention can be considered"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.03096","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/2004.03096/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-05T01:58:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xHqf5pQmMyudQkHYU4tyE6Ervo4oeqvBtyh/s4RN5qrDVs5GBXoCyspfYlLSvpUR/C6EmpzKCMwXwhSb8l63DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T09:15:17.361047Z"},"content_sha256":"e01ce4574569a66a57ed37b6a4c76994349a4572c52d67d18e69690aefa61989","schema_version":"1.0","event_id":"sha256:e01ce4574569a66a57ed37b6a4c76994349a4572c52d67d18e69690aefa61989"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GXFN4VEMJ7RFPJI3F6FHBXF5G/bundle.json","state_url":"https://pith.science/pith/7GXFN4VEMJ7RFPJI3F6FHBXF5G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GXFN4VEMJ7RFPJI3F6FHBXF5G/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-12T09:15:17Z","links":{"resolver":"https://pith.science/pith/7GXFN4VEMJ7RFPJI3F6FHBXF5G","bundle":"https://pith.science/pith/7GXFN4VEMJ7RFPJI3F6FHBXF5G/bundle.json","state":"https://pith.science/pith/7GXFN4VEMJ7RFPJI3F6FHBXF5G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GXFN4VEMJ7RFPJI3F6FHBXF5G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:7GXFN4VEMJ7RFPJI3F6FHBXF5G","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":"0b0fb74d0bf1ae8506b2fbb733f6fa947cac9a6303a2cff4702edc27cb04bf0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-04-07T02:59:42Z","title_canon_sha256":"8729fbe4e293214c4d2e50ee6ca8000ab64424040e0ffac9af695d301a5ed64b"},"schema_version":"1.0","source":{"id":"2004.03096","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.03096","created_at":"2026-07-05T01:58:40Z"},{"alias_kind":"arxiv_version","alias_value":"2004.03096v2","created_at":"2026-07-05T01:58:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.03096","created_at":"2026-07-05T01:58:40Z"},{"alias_kind":"pith_short_12","alias_value":"7GXFN4VEMJ7R","created_at":"2026-07-05T01:58:40Z"},{"alias_kind":"pith_short_16","alias_value":"7GXFN4VEMJ7RFPJI","created_at":"2026-07-05T01:58:40Z"},{"alias_kind":"pith_short_8","alias_value":"7GXFN4VE","created_at":"2026-07-05T01:58:40Z"}],"graph_snapshots":[{"event_id":"sha256:e01ce4574569a66a57ed37b6a4c76994349a4572c52d67d18e69690aefa61989","target":"graph","created_at":"2026-07-05T01:58:40Z","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/2004.03096/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, attempting to model texts as graph structure and introducing graph neural networks to deal with it has become a trend in many NLP research areas. In this paper, we investigate whether the graph structure is necessary for multi-hop question answering. Our analysis is centered on HotpotQA. We construct a strong baseline model to establish that, with the proper use of pre-trained models, graph structure may not be necessary for multi-hop question answering. We point out that both graph structure and adjacency matrix are task-related prior knowledge, and graph-attention can be considered","authors_text":"Guoping Hu, Nan Shao, Shijin Wang, Ting Liu, Yiming Cui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-04-07T02:59:42Z","title":"Is Graph Structure Necessary for Multi-hop Question Answering?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.03096","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:cc22881cebb1221e03eb6bcd7e583862bf4cfeadc01cd1e0f38c8dcce2771962","target":"record","created_at":"2026-07-05T01:58:40Z","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":"0b0fb74d0bf1ae8506b2fbb733f6fa947cac9a6303a2cff4702edc27cb04bf0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-04-07T02:59:42Z","title_canon_sha256":"8729fbe4e293214c4d2e50ee6ca8000ab64424040e0ffac9af695d301a5ed64b"},"schema_version":"1.0","source":{"id":"2004.03096","kind":"arxiv","version":2}},"canonical_sha256":"f9ae56f2a4627f12bd28d97c5386e5e9a88283c58616d798a60591145cd66831","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9ae56f2a4627f12bd28d97c5386e5e9a88283c58616d798a60591145cd66831","first_computed_at":"2026-07-05T01:58:40.700460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:58:40.700460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UxeXyC8s5kfuGhF52eE5ATnjRJ+RQRFcb51e2fES8i4BiK7Eq4w4/vAAeAsnhuDTx6ISy2OXUNaZ9KCLrqfqCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:58:40.700873Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.03096","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc22881cebb1221e03eb6bcd7e583862bf4cfeadc01cd1e0f38c8dcce2771962","sha256:e01ce4574569a66a57ed37b6a4c76994349a4572c52d67d18e69690aefa61989"],"state_sha256":"130832bfb980b559c8488f48e62496f68b6ed15e1a24e051d649a7b9935a93d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cCUTq+JTPWb2qDGeLxoyN4pYV7BKL3tX/V9CshSqlMb+TkBmpkL4BqZ/qXxw3MQgLkEhiNAegJZ+pzCGyBixDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T09:15:17.364774Z","bundle_sha256":"326814f496a9a20e7584fecaa12fd3b5e7b1d4cbf0709234a854003ae66b2135"}}