{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IFVLD23MSFDKYFDAPLJR2JLVKW","short_pith_number":"pith:IFVLD23M","schema_version":"1.0","canonical_sha256":"416ab1eb6c9146ac14607ad31d257555baaed09c1d5570ec6dfb41392e1fdb2a","source":{"kind":"arxiv","id":"1904.12211","version":1},"attestation_state":"computed","paper":{"title":"Soft Marginal TransE for Scholarly Knowledge Graph Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.AI","authors_text":"Hamed Shariat Yazdi, Jens Lehmann, Mojtaba Nayyeri, Sahar Vahdati","submitted_at":"2019-04-27T20:40:03Z","abstract_excerpt":"Knowledge graphs (KGs), i.e. representation of information as a semantic graph, provide a significant test bed for many tasks including question answering, recommendation, and link prediction. Various amount of scholarly metadata have been made vailable as knowledge graphs from the diversity of data providers and agents. However, these high-quantities of data remain far from quality criteria in terms of completeness while growing at a rapid pace. Most of the attempts in completing such KGs are following traditional data digitization, harvesting and collaborative curation approaches. Whereas, a"},"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":"1904.12211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-04-27T20:40:03Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"bf9c0c53db8cc6c7ab6ae6e4c86444932c0d5e9fcf51facc76e6cdff547f3b1e","abstract_canon_sha256":"365765500e2b6b1d5ab0c62a41b0bb110d45346c9ef9a5db4ec9cf835a80a430"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:38.666042Z","signature_b64":"gBK5gEqxVj1JZ4QNh4Mxdfeu1u0vd4IEylOqywOsgcoxyDVi6e3l7MKvzOrAqFsj657RPqVDCCWGGiRZ0TcJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"416ab1eb6c9146ac14607ad31d257555baaed09c1d5570ec6dfb41392e1fdb2a","last_reissued_at":"2026-05-17T23:47:38.665506Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:38.665506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Soft Marginal TransE for Scholarly Knowledge Graph Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.AI","authors_text":"Hamed Shariat Yazdi, Jens Lehmann, Mojtaba Nayyeri, Sahar Vahdati","submitted_at":"2019-04-27T20:40:03Z","abstract_excerpt":"Knowledge graphs (KGs), i.e. representation of information as a semantic graph, provide a significant test bed for many tasks including question answering, recommendation, and link prediction. Various amount of scholarly metadata have been made vailable as knowledge graphs from the diversity of data providers and agents. However, these high-quantities of data remain far from quality criteria in terms of completeness while growing at a rapid pace. Most of the attempts in completing such KGs are following traditional data digitization, harvesting and collaborative curation approaches. Whereas, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12211","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.12211","created_at":"2026-05-17T23:47:38.665592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12211v1","created_at":"2026-05-17T23:47:38.665592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12211","created_at":"2026-05-17T23:47:38.665592+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFVLD23MSFDK","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFVLD23MSFDKYFDA","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFVLD23M","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05336","citing_title":"Adaptive Margin Ranking Loss for Knowledge Graph Embeddings via a Correntropy Objective Function","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFVLD23MSFDKYFDAPLJR2JLVKW","json":"https://pith.science/pith/IFVLD23MSFDKYFDAPLJR2JLVKW.json","graph_json":"https://pith.science/api/pith-number/IFVLD23MSFDKYFDAPLJR2JLVKW/graph.json","events_json":"https://pith.science/api/pith-number/IFVLD23MSFDKYFDAPLJR2JLVKW/events.json","paper":"https://pith.science/paper/IFVLD23M"},"agent_actions":{"view_html":"https://pith.science/pith/IFVLD23MSFDKYFDAPLJR2JLVKW","download_json":"https://pith.science/pith/IFVLD23MSFDKYFDAPLJR2JLVKW.json","view_paper":"https://pith.science/paper/IFVLD23M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12211&json=true","fetch_graph":"https://pith.science/api/pith-number/IFVLD23MSFDKYFDAPLJR2JLVKW/graph.json","fetch_events":"https://pith.science/api/pith-number/IFVLD23MSFDKYFDAPLJR2JLVKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFVLD23MSFDKYFDAPLJR2JLVKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFVLD23MSFDKYFDAPLJR2JLVKW/action/storage_attestation","attest_author":"https://pith.science/pith/IFVLD23MSFDKYFDAPLJR2JLVKW/action/author_attestation","sign_citation":"https://pith.science/pith/IFVLD23MSFDKYFDAPLJR2JLVKW/action/citation_signature","submit_replication":"https://pith.science/pith/IFVLD23MSFDKYFDAPLJR2JLVKW/action/replication_record"}},"created_at":"2026-05-17T23:47:38.665592+00:00","updated_at":"2026-05-17T23:47:38.665592+00:00"}