{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:L7EHZTM6VIN6MFRKS6EKMQJS5S","short_pith_number":"pith:L7EHZTM6","schema_version":"1.0","canonical_sha256":"5fc87ccd9eaa1be6162a9788a64132ec9c201fd99f189f5f3b82ec1652deb5b0","source":{"kind":"arxiv","id":"2007.03988","version":1},"attestation_state":"computed","paper":{"title":"Generalizing Tensor Decomposition for N-ary Relational Knowledge Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Quanming Yao, Yong Li, Yu Liu","submitted_at":"2020-07-08T09:49:38Z","abstract_excerpt":"With the rapid development of knowledge bases (KBs), link prediction task, which completes KBs with missing facts, has been broadly studied in especially binary relational KBs (a.k.a knowledge graph) with powerful tensor decomposition related methods. However, the ubiquitous n-ary relational KBs with higher-arity relational facts are paid less attention, in which existing translation based and neural network based approaches have weak expressiveness and high complexity in modeling various relations. Tensor decomposition has not been considered for n-ary relational KBs, while directly extending"},"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":"2007.03988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-07-08T09:49:38Z","cross_cats_sorted":[],"title_canon_sha256":"7af2e4b78682d95f535c2f746e570449adb6ed8b9f4caedb4a9938c056471914","abstract_canon_sha256":"2aaa5e4c14a1e41013db313229977c4a077bd235246edcd6c7fa700832da980e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:19.490656Z","signature_b64":"hXWeH5nnGOp43icdyY8fvnC2LqQiYprn8ma3HKHr4lJAo7X+uwsvwm45Wgu7WlYxUmte+pmzi/OtEcJoWqhgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fc87ccd9eaa1be6162a9788a64132ec9c201fd99f189f5f3b82ec1652deb5b0","last_reissued_at":"2026-07-05T01:17:19.490282Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:19.490282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalizing Tensor Decomposition for N-ary Relational Knowledge Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Quanming Yao, Yong Li, Yu Liu","submitted_at":"2020-07-08T09:49:38Z","abstract_excerpt":"With the rapid development of knowledge bases (KBs), link prediction task, which completes KBs with missing facts, has been broadly studied in especially binary relational KBs (a.k.a knowledge graph) with powerful tensor decomposition related methods. However, the ubiquitous n-ary relational KBs with higher-arity relational facts are paid less attention, in which existing translation based and neural network based approaches have weak expressiveness and high complexity in modeling various relations. Tensor decomposition has not been considered for n-ary relational KBs, while directly extending"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03988","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/2007.03988/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":"2007.03988","created_at":"2026-07-05T01:17:19.490340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03988v1","created_at":"2026-07-05T01:17:19.490340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03988","created_at":"2026-07-05T01:17:19.490340+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7EHZTM6VIN6","created_at":"2026-07-05T01:17:19.490340+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7EHZTM6VIN6MFRK","created_at":"2026-07-05T01:17:19.490340+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7EHZTM6","created_at":"2026-07-05T01:17:19.490340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.12129","citing_title":"SAG: SQL-Retrieval Augmented Generation with Query-Time Dynamic Hyperedges","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L7EHZTM6VIN6MFRKS6EKMQJS5S","json":"https://pith.science/pith/L7EHZTM6VIN6MFRKS6EKMQJS5S.json","graph_json":"https://pith.science/api/pith-number/L7EHZTM6VIN6MFRKS6EKMQJS5S/graph.json","events_json":"https://pith.science/api/pith-number/L7EHZTM6VIN6MFRKS6EKMQJS5S/events.json","paper":"https://pith.science/paper/L7EHZTM6"},"agent_actions":{"view_html":"https://pith.science/pith/L7EHZTM6VIN6MFRKS6EKMQJS5S","download_json":"https://pith.science/pith/L7EHZTM6VIN6MFRKS6EKMQJS5S.json","view_paper":"https://pith.science/paper/L7EHZTM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03988&json=true","fetch_graph":"https://pith.science/api/pith-number/L7EHZTM6VIN6MFRKS6EKMQJS5S/graph.json","fetch_events":"https://pith.science/api/pith-number/L7EHZTM6VIN6MFRKS6EKMQJS5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7EHZTM6VIN6MFRKS6EKMQJS5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7EHZTM6VIN6MFRKS6EKMQJS5S/action/storage_attestation","attest_author":"https://pith.science/pith/L7EHZTM6VIN6MFRKS6EKMQJS5S/action/author_attestation","sign_citation":"https://pith.science/pith/L7EHZTM6VIN6MFRKS6EKMQJS5S/action/citation_signature","submit_replication":"https://pith.science/pith/L7EHZTM6VIN6MFRKS6EKMQJS5S/action/replication_record"}},"created_at":"2026-07-05T01:17:19.490340+00:00","updated_at":"2026-07-05T01:17:19.490340+00:00"}