{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MATAKSB4HOLW7I2MMLLUGAPUVI","short_pith_number":"pith:MATAKSB4","canonical_record":{"source":{"id":"1811.01127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-02T23:48:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"65926e576df385d9a67f36add135b5211ccf41111bccf261bac25afcd7b8e22d","abstract_canon_sha256":"c47084bd2d7c7dbfdfc6e33faccc46822aafa89e11a6ee348609a6a015d3ce8d"},"schema_version":"1.0"},"canonical_sha256":"602605483c3b976fa34c62d74301f4aa1eb1ee1324385c20ec3ea94357d8c49f","source":{"kind":"arxiv","id":"1811.01127","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01127","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01127v2","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01127","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"MATAKSB4HOLW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MATAKSB4HOLW7I2M","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MATAKSB4","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MATAKSB4HOLW7I2MMLLUGAPUVI","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-02T23:48:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"65926e576df385d9a67f36add135b5211ccf41111bccf261bac25afcd7b8e22d","abstract_canon_sha256":"c47084bd2d7c7dbfdfc6e33faccc46822aafa89e11a6ee348609a6a015d3ce8d"},"schema_version":"1.0"},"canonical_sha256":"602605483c3b976fa34c62d74301f4aa1eb1ee1324385c20ec3ea94357d8c49f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:12.712039Z","signature_b64":"3z48dTHFlxEi8afmJfO26sjXm94VTfrxcginCzwDRwEQTyh4qSdESKnNDOV2t8mKO1whBoRD8fjqcniiXS1lAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"602605483c3b976fa34c62d74301f4aa1eb1ee1324385c20ec3ea94357d8c49f","last_reissued_at":"2026-05-17T23:41:12.711617Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:12.711617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01127","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-05-17T23:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsEeRbaDBHCkefoaP5PeOMQ3aS/z4GQF9TB3np9D+9SlZw8UgnGI+O32y6d41uwRsWfU8Ee9l1YjJ9ebQ0SvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:47:29.981338Z"},"content_sha256":"5425a6446b5c22f5a597d3f7a3a79339b480f4689edba031177c3b8289b528dd","schema_version":"1.0","event_id":"sha256:5425a6446b5c22f5a597d3f7a3a79339b480f4689edba031177c3b8289b528dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MATAKSB4HOLW7I2MMLLUGAPUVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Explicit Paths for Multi-hop Reading Comprehension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Ashish Sabharwal, Peter Clark, Souvik Kundu, Tushar Khot","submitted_at":"2018-11-02T23:48:46Z","abstract_excerpt":"We propose a novel, path-based reasoning approach for the multi-hop reading comprehension task where a system needs to combine facts from multiple passages to answer a question. Although inspired by multi-hop reasoning over knowledge graphs, our proposed approach operates directly over unstructured text. It generates potential paths through passages and scores them without any direct path supervision. The proposed model, named PathNet, attempts to extract implicit relations from text through entity pair representations, and compose them to encode each path. To capture additional context, PathN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01127","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":""},"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-05-17T23:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hL6oYmzXM/Yvbs9yq/5svPnuapFWDwNVek+b4yAQPZZ9EU9dLdTzFNJXsRK0TNEDmVlJnu+GFfIwZGq0ebKcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:47:29.981682Z"},"content_sha256":"072fef4e8324a0607a8ea7e2f8d90003f4b3be05b4811709490a2684a73a3728","schema_version":"1.0","event_id":"sha256:072fef4e8324a0607a8ea7e2f8d90003f4b3be05b4811709490a2684a73a3728"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MATAKSB4HOLW7I2MMLLUGAPUVI/bundle.json","state_url":"https://pith.science/pith/MATAKSB4HOLW7I2MMLLUGAPUVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MATAKSB4HOLW7I2MMLLUGAPUVI/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-02T16:47:29Z","links":{"resolver":"https://pith.science/pith/MATAKSB4HOLW7I2MMLLUGAPUVI","bundle":"https://pith.science/pith/MATAKSB4HOLW7I2MMLLUGAPUVI/bundle.json","state":"https://pith.science/pith/MATAKSB4HOLW7I2MMLLUGAPUVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MATAKSB4HOLW7I2MMLLUGAPUVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MATAKSB4HOLW7I2MMLLUGAPUVI","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":"c47084bd2d7c7dbfdfc6e33faccc46822aafa89e11a6ee348609a6a015d3ce8d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-02T23:48:46Z","title_canon_sha256":"65926e576df385d9a67f36add135b5211ccf41111bccf261bac25afcd7b8e22d"},"schema_version":"1.0","source":{"id":"1811.01127","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01127","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01127v2","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01127","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"MATAKSB4HOLW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MATAKSB4HOLW7I2M","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MATAKSB4","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:072fef4e8324a0607a8ea7e2f8d90003f4b3be05b4811709490a2684a73a3728","target":"graph","created_at":"2026-05-17T23:41:12Z","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"},"paper":{"abstract_excerpt":"We propose a novel, path-based reasoning approach for the multi-hop reading comprehension task where a system needs to combine facts from multiple passages to answer a question. Although inspired by multi-hop reasoning over knowledge graphs, our proposed approach operates directly over unstructured text. It generates potential paths through passages and scores them without any direct path supervision. The proposed model, named PathNet, attempts to extract implicit relations from text through entity pair representations, and compose them to encode each path. To capture additional context, PathN","authors_text":"Ashish Sabharwal, Peter Clark, Souvik Kundu, Tushar Khot","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-02T23:48:46Z","title":"Exploiting Explicit Paths for Multi-hop Reading Comprehension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01127","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:5425a6446b5c22f5a597d3f7a3a79339b480f4689edba031177c3b8289b528dd","target":"record","created_at":"2026-05-17T23:41:12Z","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":"c47084bd2d7c7dbfdfc6e33faccc46822aafa89e11a6ee348609a6a015d3ce8d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-02T23:48:46Z","title_canon_sha256":"65926e576df385d9a67f36add135b5211ccf41111bccf261bac25afcd7b8e22d"},"schema_version":"1.0","source":{"id":"1811.01127","kind":"arxiv","version":2}},"canonical_sha256":"602605483c3b976fa34c62d74301f4aa1eb1ee1324385c20ec3ea94357d8c49f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"602605483c3b976fa34c62d74301f4aa1eb1ee1324385c20ec3ea94357d8c49f","first_computed_at":"2026-05-17T23:41:12.711617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:12.711617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3z48dTHFlxEi8afmJfO26sjXm94VTfrxcginCzwDRwEQTyh4qSdESKnNDOV2t8mKO1whBoRD8fjqcniiXS1lAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:12.712039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01127","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5425a6446b5c22f5a597d3f7a3a79339b480f4689edba031177c3b8289b528dd","sha256:072fef4e8324a0607a8ea7e2f8d90003f4b3be05b4811709490a2684a73a3728"],"state_sha256":"c13a2264c8d863a805718f986b93082baaa77eed9c35337e3c9a8eb59f5bc5c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vDhPDyUweh7195pH02lTEEwYJDzhbNqXfguf0Y8pgJUeOiOGqskI3eMYbpVS5tSGtyLhwb23E8T+/bI1jSJGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:47:29.983511Z","bundle_sha256":"42b23c3f72f4c902d379f1a8295d35940a3fa1488b9f6873a0ecc709c1c06fe3"}}