{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:E4F6NLV23VE77KQWC5WN26MVVV","short_pith_number":"pith:E4F6NLV2","schema_version":"1.0","canonical_sha256":"270be6aebadd49ffaa16176cdd7995ad6d32d993a2da7662cd5ba4fad01bd90b","source":{"kind":"arxiv","id":"2305.12416","version":1},"attestation_state":"computed","paper":{"title":"Direct Fact Retrieval from Knowledge Graphs without Entity Linking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Alham Fikri Aji, Jens Lehmann, Jinheon Baek, Sung Ju Hwang","submitted_at":"2023-05-21T09:46:53Z","abstract_excerpt":"There has been a surge of interest in utilizing Knowledge Graphs (KGs) for various natural language processing/understanding tasks. The conventional mechanism to retrieve facts in KGs usually involves three steps: entity span detection, entity disambiguation, and relation classification. However, this approach requires additional labels for training each of the three subcomponents in addition to pairs of input texts and facts, and also may accumulate errors propagated from failures in previous steps. To tackle these limitations, we propose a simple knowledge retrieval framework, which directly"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2305.12416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-05-21T09:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"2f9df8e77e601c0fe637e3778b1d68e4748b3216d7b61ab5cc25be37664d492b","abstract_canon_sha256":"4e1c9404e16385a0708cfab0cb2b7d0cac29cb9f3ab087c1a339eb797dc996e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:12:10.258787Z","signature_b64":"NzIhuszMvbhamZwhx+pD1vy5R9XgUaVVZ9R4QdkLWoBXP2KIjGZybZGIB2PaHG8OpBdivdJgQOVF+NWoISE9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"270be6aebadd49ffaa16176cdd7995ad6d32d993a2da7662cd5ba4fad01bd90b","last_reissued_at":"2026-07-05T06:12:10.258386Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:12:10.258386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Direct Fact Retrieval from Knowledge Graphs without Entity Linking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Alham Fikri Aji, Jens Lehmann, Jinheon Baek, Sung Ju Hwang","submitted_at":"2023-05-21T09:46:53Z","abstract_excerpt":"There has been a surge of interest in utilizing Knowledge Graphs (KGs) for various natural language processing/understanding tasks. The conventional mechanism to retrieve facts in KGs usually involves three steps: entity span detection, entity disambiguation, and relation classification. However, this approach requires additional labels for training each of the three subcomponents in addition to pairs of input texts and facts, and also may accumulate errors propagated from failures in previous steps. To tackle these limitations, we propose a simple knowledge retrieval framework, which directly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12416","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/2305.12416/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.12416","created_at":"2026-07-05T06:12:10.258444+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.12416v1","created_at":"2026-07-05T06:12:10.258444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12416","created_at":"2026-07-05T06:12:10.258444+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4F6NLV23VE7","created_at":"2026-07-05T06:12:10.258444+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4F6NLV23VE77KQW","created_at":"2026-07-05T06:12:10.258444+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4F6NLV2","created_at":"2026-07-05T06:12:10.258444+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15443","citing_title":"SKETCH: Structured Knowledge Enhanced Text Comprehension for Holistic Retrieval","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E4F6NLV23VE77KQWC5WN26MVVV","json":"https://pith.science/pith/E4F6NLV23VE77KQWC5WN26MVVV.json","graph_json":"https://pith.science/api/pith-number/E4F6NLV23VE77KQWC5WN26MVVV/graph.json","events_json":"https://pith.science/api/pith-number/E4F6NLV23VE77KQWC5WN26MVVV/events.json","paper":"https://pith.science/paper/E4F6NLV2"},"agent_actions":{"view_html":"https://pith.science/pith/E4F6NLV23VE77KQWC5WN26MVVV","download_json":"https://pith.science/pith/E4F6NLV23VE77KQWC5WN26MVVV.json","view_paper":"https://pith.science/paper/E4F6NLV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.12416&json=true","fetch_graph":"https://pith.science/api/pith-number/E4F6NLV23VE77KQWC5WN26MVVV/graph.json","fetch_events":"https://pith.science/api/pith-number/E4F6NLV23VE77KQWC5WN26MVVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4F6NLV23VE77KQWC5WN26MVVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4F6NLV23VE77KQWC5WN26MVVV/action/storage_attestation","attest_author":"https://pith.science/pith/E4F6NLV23VE77KQWC5WN26MVVV/action/author_attestation","sign_citation":"https://pith.science/pith/E4F6NLV23VE77KQWC5WN26MVVV/action/citation_signature","submit_replication":"https://pith.science/pith/E4F6NLV23VE77KQWC5WN26MVVV/action/replication_record"}},"created_at":"2026-07-05T06:12:10.258444+00:00","updated_at":"2026-07-05T06:12:10.258444+00:00"}