{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UI76EBVUAZDDDM5MNFQHPVQCFU","short_pith_number":"pith:UI76EBVU","canonical_record":{"source":{"id":"1907.07328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-07-17T04:29:27Z","cross_cats_sorted":[],"title_canon_sha256":"1eff0d5cf2207ad51cb7582a1c8ecf42043376cbe2cd505a4067afac44f94fb1","abstract_canon_sha256":"6eda19dc2ebe1fbdf872b309a953e829b8fb437cdeaa34cccb4d91ef86f19f92"},"schema_version":"1.0"},"canonical_sha256":"a23fe206b4064631b3ac696077d6022d35dd849fa464d46d20d3339d9614b758","source":{"kind":"arxiv","id":"1907.07328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07328","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07328v1","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07328","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"UI76EBVUAZDD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UI76EBVUAZDDDM5M","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UI76EBVU","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UI76EBVUAZDDDM5MNFQHPVQCFU","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-07-17T04:29:27Z","cross_cats_sorted":[],"title_canon_sha256":"1eff0d5cf2207ad51cb7582a1c8ecf42043376cbe2cd505a4067afac44f94fb1","abstract_canon_sha256":"6eda19dc2ebe1fbdf872b309a953e829b8fb437cdeaa34cccb4d91ef86f19f92"},"schema_version":"1.0"},"canonical_sha256":"a23fe206b4064631b3ac696077d6022d35dd849fa464d46d20d3339d9614b758","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:22.657691Z","signature_b64":"iRV0qC2/UjOtpx+/1vVSv1/1iCnuYXh5T9nZI+q+vlFcsUntkUGm5RxgfzDFLrG/NapAtmdqpl2h6lmfOczpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a23fe206b4064631b3ac696077d6022d35dd849fa464d46d20d3339d9614b758","last_reissued_at":"2026-05-17T23:40:22.656363Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:22.656363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07328","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:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wRLBjaypIcpP50hR3ZU/MlQAA2BLdMmMfWoJ3QRYaCsZfvJVSYVamAzuq9B9VH5d2XAdAIgP90M0vALgPQABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:18:18.572538Z"},"content_sha256":"dd07b4fa2578763aef2fb99d0b0cbbb5158e33aa56e55ab229ce750eff276955","schema_version":"1.0","event_id":"sha256:dd07b4fa2578763aef2fb99d0b0cbbb5158e33aa56e55ab229ce750eff276955"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UI76EBVUAZDDDM5MNFQHPVQCFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Representation Mapping for Relation Detection in Knowledge Base Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jiajun Chen, Jianbing Zhang, Peng Wu, Rongxiang Weng, Shujian Huang, Xiaohui Yan, Zaixiang Zheng","submitted_at":"2019-07-17T04:29:27Z","abstract_excerpt":"Relation detection is a core step in many natural language process applications including knowledge base question answering. Previous efforts show that single-fact questions could be answered with high accuracy. However, one critical problem is that current approaches only get high accuracy for questions whose relations have been seen in the training data. But for unseen relations, the performance will drop rapidly. The main reason for this problem is that the representations for unseen relations are missing. In this paper, we propose a simple mapping method, named representation adapter, to l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07328","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:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kSSo3DDzO2+4h2hanKANQE7ryENy2PntXKLjA6doLug2AYVHjngPbp482FOXjI2vhqQFKTLC3FEDGn8/oJiGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:18:18.573194Z"},"content_sha256":"da92d8f27ab1499f23ad829b830f3bb98072693f48a1ed6ee01fe6d7c2e6563e","schema_version":"1.0","event_id":"sha256:da92d8f27ab1499f23ad829b830f3bb98072693f48a1ed6ee01fe6d7c2e6563e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UI76EBVUAZDDDM5MNFQHPVQCFU/bundle.json","state_url":"https://pith.science/pith/UI76EBVUAZDDDM5MNFQHPVQCFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UI76EBVUAZDDDM5MNFQHPVQCFU/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-25T12:18:18Z","links":{"resolver":"https://pith.science/pith/UI76EBVUAZDDDM5MNFQHPVQCFU","bundle":"https://pith.science/pith/UI76EBVUAZDDDM5MNFQHPVQCFU/bundle.json","state":"https://pith.science/pith/UI76EBVUAZDDDM5MNFQHPVQCFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UI76EBVUAZDDDM5MNFQHPVQCFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UI76EBVUAZDDDM5MNFQHPVQCFU","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":"6eda19dc2ebe1fbdf872b309a953e829b8fb437cdeaa34cccb4d91ef86f19f92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-07-17T04:29:27Z","title_canon_sha256":"1eff0d5cf2207ad51cb7582a1c8ecf42043376cbe2cd505a4067afac44f94fb1"},"schema_version":"1.0","source":{"id":"1907.07328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07328","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07328v1","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07328","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"UI76EBVUAZDD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UI76EBVUAZDDDM5M","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UI76EBVU","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:da92d8f27ab1499f23ad829b830f3bb98072693f48a1ed6ee01fe6d7c2e6563e","target":"graph","created_at":"2026-05-17T23:40:22Z","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":"Relation detection is a core step in many natural language process applications including knowledge base question answering. Previous efforts show that single-fact questions could be answered with high accuracy. However, one critical problem is that current approaches only get high accuracy for questions whose relations have been seen in the training data. But for unseen relations, the performance will drop rapidly. The main reason for this problem is that the representations for unseen relations are missing. In this paper, we propose a simple mapping method, named representation adapter, to l","authors_text":"Jiajun Chen, Jianbing Zhang, Peng Wu, Rongxiang Weng, Shujian Huang, Xiaohui Yan, Zaixiang Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-07-17T04:29:27Z","title":"Learning Representation Mapping for Relation Detection in Knowledge Base Question Answering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07328","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:dd07b4fa2578763aef2fb99d0b0cbbb5158e33aa56e55ab229ce750eff276955","target":"record","created_at":"2026-05-17T23:40:22Z","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":"6eda19dc2ebe1fbdf872b309a953e829b8fb437cdeaa34cccb4d91ef86f19f92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-07-17T04:29:27Z","title_canon_sha256":"1eff0d5cf2207ad51cb7582a1c8ecf42043376cbe2cd505a4067afac44f94fb1"},"schema_version":"1.0","source":{"id":"1907.07328","kind":"arxiv","version":1}},"canonical_sha256":"a23fe206b4064631b3ac696077d6022d35dd849fa464d46d20d3339d9614b758","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a23fe206b4064631b3ac696077d6022d35dd849fa464d46d20d3339d9614b758","first_computed_at":"2026-05-17T23:40:22.656363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:22.656363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iRV0qC2/UjOtpx+/1vVSv1/1iCnuYXh5T9nZI+q+vlFcsUntkUGm5RxgfzDFLrG/NapAtmdqpl2h6lmfOczpAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:22.657691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd07b4fa2578763aef2fb99d0b0cbbb5158e33aa56e55ab229ce750eff276955","sha256:da92d8f27ab1499f23ad829b830f3bb98072693f48a1ed6ee01fe6d7c2e6563e"],"state_sha256":"7c5d9ea56b8f7f9353b749326527206d8efbf5f005982d709457cf8b479404c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"roUvETp6K8AhtyfDy2hGalPa/+J85fbMgbYVegRjdaxu5F54wBDcoptqja/azkZH7uMU/eB7hLwjPtKknvJVCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:18:18.576722Z","bundle_sha256":"7fdfcde3637cd63a883d34035318a32db66900b38bc6a940a5c9e9fd9972ee0b"}}