{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OVAABUYFY2ZA26ZMMXFVFBDE7I","short_pith_number":"pith:OVAABUYF","schema_version":"1.0","canonical_sha256":"754000d305c6b20d7b2c65cb528464fa1485fbf0825c1f806793a710aa02fae9","source":{"kind":"arxiv","id":"1809.09414","version":3},"attestation_state":"computed","paper":{"title":"Triple Trustworthiness Measurement for Knowledge Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Shengbin Jia, Xiaojun Chen, Yang Xiang","submitted_at":"2018-09-25T11:37:27Z","abstract_excerpt":"The Knowledge graph (KG) uses the triples to describe the facts in the real world. It has been widely used in intelligent analysis and applications. However, possible noises and conflicts are inevitably introduced in the process of constructing. And the KG based tasks or applications assume that the knowledge in the KG is completely correct and inevitably bring about potential deviations. In this paper, we establish a knowledge graph triple trustworthiness measurement model that quantify their semantic correctness and the true degree of the facts expressed. The model is a crisscrossing neural "},"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":"1809.09414","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-25T11:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"9b394d5c833aef5d4f565d86e5c580b81e693c31188859e5a282705efd9d2d52","abstract_canon_sha256":"5ee882c3aed5cbae659b1153e1be74e15bcb8c5de48992775202a776563c4510"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:41.980831Z","signature_b64":"LUyuh9yU6R0HU+Jgu6b29Oi7NtsxgqsZJonPeD4JnQN7uRRyTFuxD4F9kKDP/rvjz2YcW1XxwWBBB4VkH5GjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"754000d305c6b20d7b2c65cb528464fa1485fbf0825c1f806793a710aa02fae9","last_reissued_at":"2026-05-17T23:53:41.980367Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:41.980367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triple Trustworthiness Measurement for Knowledge Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Shengbin Jia, Xiaojun Chen, Yang Xiang","submitted_at":"2018-09-25T11:37:27Z","abstract_excerpt":"The Knowledge graph (KG) uses the triples to describe the facts in the real world. It has been widely used in intelligent analysis and applications. However, possible noises and conflicts are inevitably introduced in the process of constructing. And the KG based tasks or applications assume that the knowledge in the KG is completely correct and inevitably bring about potential deviations. In this paper, we establish a knowledge graph triple trustworthiness measurement model that quantify their semantic correctness and the true degree of the facts expressed. The model is a crisscrossing neural "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09414","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.09414","created_at":"2026-05-17T23:53:41.980439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09414v3","created_at":"2026-05-17T23:53:41.980439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09414","created_at":"2026-05-17T23:53:41.980439+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVAABUYFY2ZA","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVAABUYFY2ZA26ZM","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVAABUYF","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OVAABUYFY2ZA26ZMMXFVFBDE7I","json":"https://pith.science/pith/OVAABUYFY2ZA26ZMMXFVFBDE7I.json","graph_json":"https://pith.science/api/pith-number/OVAABUYFY2ZA26ZMMXFVFBDE7I/graph.json","events_json":"https://pith.science/api/pith-number/OVAABUYFY2ZA26ZMMXFVFBDE7I/events.json","paper":"https://pith.science/paper/OVAABUYF"},"agent_actions":{"view_html":"https://pith.science/pith/OVAABUYFY2ZA26ZMMXFVFBDE7I","download_json":"https://pith.science/pith/OVAABUYFY2ZA26ZMMXFVFBDE7I.json","view_paper":"https://pith.science/paper/OVAABUYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09414&json=true","fetch_graph":"https://pith.science/api/pith-number/OVAABUYFY2ZA26ZMMXFVFBDE7I/graph.json","fetch_events":"https://pith.science/api/pith-number/OVAABUYFY2ZA26ZMMXFVFBDE7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVAABUYFY2ZA26ZMMXFVFBDE7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVAABUYFY2ZA26ZMMXFVFBDE7I/action/storage_attestation","attest_author":"https://pith.science/pith/OVAABUYFY2ZA26ZMMXFVFBDE7I/action/author_attestation","sign_citation":"https://pith.science/pith/OVAABUYFY2ZA26ZMMXFVFBDE7I/action/citation_signature","submit_replication":"https://pith.science/pith/OVAABUYFY2ZA26ZMMXFVFBDE7I/action/replication_record"}},"created_at":"2026-05-17T23:53:41.980439+00:00","updated_at":"2026-05-17T23:53:41.980439+00:00"}