{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3BN7DL2NM73FZGYIGE3WUVF4KZ","short_pith_number":"pith:3BN7DL2N","canonical_record":{"source":{"id":"1904.01246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-02T07:08:25Z","cross_cats_sorted":[],"title_canon_sha256":"c5cf8e004fdf8587973c6ff4035f2dc01fb8c645257cfbc069ebb5cbade2f03d","abstract_canon_sha256":"6068ed97f61543b0a9d74af3bae2a2bedc23449354fdd0d312f21bcf6b0aa52b"},"schema_version":"1.0"},"canonical_sha256":"d85bf1af4d67f65c9b0831376a54bc566055ae962d2ef0ba0f8dc8882d4b4a8c","source":{"kind":"arxiv","id":"1904.01246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01246","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01246v1","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01246","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"3BN7DL2NM73F","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3BN7DL2NM73FZGYI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3BN7DL2N","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3BN7DL2NM73FZGYIGE3WUVF4KZ","target":"record","payload":{"canonical_record":{"source":{"id":"1904.01246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-02T07:08:25Z","cross_cats_sorted":[],"title_canon_sha256":"c5cf8e004fdf8587973c6ff4035f2dc01fb8c645257cfbc069ebb5cbade2f03d","abstract_canon_sha256":"6068ed97f61543b0a9d74af3bae2a2bedc23449354fdd0d312f21bcf6b0aa52b"},"schema_version":"1.0"},"canonical_sha256":"d85bf1af4d67f65c9b0831376a54bc566055ae962d2ef0ba0f8dc8882d4b4a8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:35.415752Z","signature_b64":"wF9V6nZcdsoW/Lw1Vbup6DH1/kpQ2b/XgLEv9fJ4P+3E5etrb9ljE9O69sn3IkVj848vZANAndsuaznVB7cNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d85bf1af4d67f65c9b0831376a54bc566055ae962d2ef0ba0f8dc8882d4b4a8c","last_reissued_at":"2026-05-17T23:49:35.415173Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:35.415173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.01246","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-05-17T23:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4phAy0Z5ar3EfML4l7LtOXIrdrV5WhtX5LZwyUUEHZv4hHWcc5jpg/MP045zZ/ByC/60du0vYOAAH8SJrWhiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:24:34.983675Z"},"content_sha256":"99d6fee9d785ba5a936c376d78074b8f1a67e67ec4dfa06dfa5d9f8fbe4d18e0","schema_version":"1.0","event_id":"sha256:99d6fee9d785ba5a936c376d78074b8f1a67e67ec4dfa06dfa5d9f8fbe4d18e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3BN7DL2NM73FZGYIGE3WUVF4KZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"UHop: An Unrestricted-Hop Relation Extraction Framework for Knowledge-Based Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chih-Hung Chang, Jijnasa Nayak, Lun-Wei Ku, Yi-Pei Chen, Zi-Yuan Chen","submitted_at":"2019-04-02T07:08:25Z","abstract_excerpt":"In relation extraction for knowledge-based question answering, searching from one entity to another entity via a single relation is called \"one hop\". In related work, an exhaustive search from all one-hop relations, two-hop relations, and so on to the max-hop relations in the knowledge graph is necessary but expensive. Therefore, the number of hops is generally restricted to two or three. In this paper, we propose UHop, an unrestricted-hop framework which relaxes this restriction by use of a transition-based search framework to replace the relation-chain-based search one. We conduct experiment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01246","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":""},"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:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WgFH8HU0Tgwvj/D+ooYzxYlydIW0D6c28sDzgz2X6d0EYWHoV5yT4XPOOh5AO6KG5NTnD8ixalh5S/nWgP2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:24:34.984277Z"},"content_sha256":"f75e9677cb7988c13c8b5600ca800ce45fcfa6116548a90183ed1c1f0ca87341","schema_version":"1.0","event_id":"sha256:f75e9677cb7988c13c8b5600ca800ce45fcfa6116548a90183ed1c1f0ca87341"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BN7DL2NM73FZGYIGE3WUVF4KZ/bundle.json","state_url":"https://pith.science/pith/3BN7DL2NM73FZGYIGE3WUVF4KZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BN7DL2NM73FZGYIGE3WUVF4KZ/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-05-31T20:24:34Z","links":{"resolver":"https://pith.science/pith/3BN7DL2NM73FZGYIGE3WUVF4KZ","bundle":"https://pith.science/pith/3BN7DL2NM73FZGYIGE3WUVF4KZ/bundle.json","state":"https://pith.science/pith/3BN7DL2NM73FZGYIGE3WUVF4KZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BN7DL2NM73FZGYIGE3WUVF4KZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3BN7DL2NM73FZGYIGE3WUVF4KZ","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":"6068ed97f61543b0a9d74af3bae2a2bedc23449354fdd0d312f21bcf6b0aa52b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-02T07:08:25Z","title_canon_sha256":"c5cf8e004fdf8587973c6ff4035f2dc01fb8c645257cfbc069ebb5cbade2f03d"},"schema_version":"1.0","source":{"id":"1904.01246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01246","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01246v1","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01246","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"3BN7DL2NM73F","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3BN7DL2NM73FZGYI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3BN7DL2N","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:f75e9677cb7988c13c8b5600ca800ce45fcfa6116548a90183ed1c1f0ca87341","target":"graph","created_at":"2026-05-17T23:49:35Z","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":"In relation extraction for knowledge-based question answering, searching from one entity to another entity via a single relation is called \"one hop\". In related work, an exhaustive search from all one-hop relations, two-hop relations, and so on to the max-hop relations in the knowledge graph is necessary but expensive. Therefore, the number of hops is generally restricted to two or three. In this paper, we propose UHop, an unrestricted-hop framework which relaxes this restriction by use of a transition-based search framework to replace the relation-chain-based search one. We conduct experiment","authors_text":"Chih-Hung Chang, Jijnasa Nayak, Lun-Wei Ku, Yi-Pei Chen, Zi-Yuan Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-02T07:08:25Z","title":"UHop: An Unrestricted-Hop Relation Extraction Framework for Knowledge-Based Question Answering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01246","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:99d6fee9d785ba5a936c376d78074b8f1a67e67ec4dfa06dfa5d9f8fbe4d18e0","target":"record","created_at":"2026-05-17T23:49:35Z","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":"6068ed97f61543b0a9d74af3bae2a2bedc23449354fdd0d312f21bcf6b0aa52b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-02T07:08:25Z","title_canon_sha256":"c5cf8e004fdf8587973c6ff4035f2dc01fb8c645257cfbc069ebb5cbade2f03d"},"schema_version":"1.0","source":{"id":"1904.01246","kind":"arxiv","version":1}},"canonical_sha256":"d85bf1af4d67f65c9b0831376a54bc566055ae962d2ef0ba0f8dc8882d4b4a8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d85bf1af4d67f65c9b0831376a54bc566055ae962d2ef0ba0f8dc8882d4b4a8c","first_computed_at":"2026-05-17T23:49:35.415173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:35.415173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wF9V6nZcdsoW/Lw1Vbup6DH1/kpQ2b/XgLEv9fJ4P+3E5etrb9ljE9O69sn3IkVj848vZANAndsuaznVB7cNDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:35.415752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.01246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99d6fee9d785ba5a936c376d78074b8f1a67e67ec4dfa06dfa5d9f8fbe4d18e0","sha256:f75e9677cb7988c13c8b5600ca800ce45fcfa6116548a90183ed1c1f0ca87341"],"state_sha256":"98600a9129767abcd66372ef3737bcab0c7a418a245109002ed09b55ea0e230a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kaQ4R71y9gkEwFpHkzqP/VEXTD+BPmxow/OsXn5iDQZXDJmRyxNAYoLkAvd1ldvvfdOooHErwcR6U8GhMiiTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:24:34.988299Z","bundle_sha256":"314eac75875cc9af5deef634d315cc98604841b2eeb3fc69343ac128e0043e66"}}