{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:I2IADMGG2PWUYKVHEJITQFZV25","short_pith_number":"pith:I2IADMGG","schema_version":"1.0","canonical_sha256":"469001b0c6d3ed4c2aa72251381735d7749c4eefa59eb30def2a7a3cc5ae0243","source":{"kind":"arxiv","id":"1605.04227","version":3},"attestation_state":"computed","paper":{"title":"Relation Schema Induction using Tensor Factorization with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.DB"],"primary_cat":"cs.IR","authors_text":"Madhav Nimishakavi, Partha Talukdar, Uday Singh Saini","submitted_at":"2016-05-12T19:44:04Z","abstract_excerpt":"Given a set of documents from a specific domain (e.g., medical research journals), how do we automatically build a Knowledge Graph (KG) for that domain? Automatic identification of relations and their schemas, i.e., type signature of arguments of relations (e.g., undergo(Patient, Surgery)), is an important first step towards this goal. We refer to this problem as Relation Schema Induction (RSI). In this paper, we propose Schema Induction using Coupled Tensor Factorization (SICTF), a novel tensor factorization method for relation schema induction. SICTF factorizes Open Information Extraction (O"},"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":"1605.04227","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-05-12T19:44:04Z","cross_cats_sorted":["cs.CL","cs.DB"],"title_canon_sha256":"023eec752c127ca9f5240bd1d561c6773b62561ee5fa9a3b362c5e91d45bd832","abstract_canon_sha256":"c5bcce8b701f5b91f102007703c8eebaabd2b5d7fa174c7340810dc0e1da6494"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:33.471405Z","signature_b64":"3PBvIvly6uAZ67em4ALjbYE5yRDELjkY+GNOYUKTfAHrvaOXC8aToktYyEsNEMWERNWF9ejH1yveA4LnDNGIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"469001b0c6d3ed4c2aa72251381735d7749c4eefa59eb30def2a7a3cc5ae0243","last_reissued_at":"2026-05-18T00:58:33.470764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:33.470764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relation Schema Induction using Tensor Factorization with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.DB"],"primary_cat":"cs.IR","authors_text":"Madhav Nimishakavi, Partha Talukdar, Uday Singh Saini","submitted_at":"2016-05-12T19:44:04Z","abstract_excerpt":"Given a set of documents from a specific domain (e.g., medical research journals), how do we automatically build a Knowledge Graph (KG) for that domain? Automatic identification of relations and their schemas, i.e., type signature of arguments of relations (e.g., undergo(Patient, Surgery)), is an important first step towards this goal. We refer to this problem as Relation Schema Induction (RSI). In this paper, we propose Schema Induction using Coupled Tensor Factorization (SICTF), a novel tensor factorization method for relation schema induction. SICTF factorizes Open Information Extraction (O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04227","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":"1605.04227","created_at":"2026-05-18T00:58:33.470852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04227v3","created_at":"2026-05-18T00:58:33.470852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04227","created_at":"2026-05-18T00:58:33.470852+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2IADMGG2PWU","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2IADMGG2PWUYKVH","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2IADMGG","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.10416","citing_title":"Semi-Supervised Tensor Factorization for Node Classification in Complex Social Networks","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2IADMGG2PWUYKVHEJITQFZV25","json":"https://pith.science/pith/I2IADMGG2PWUYKVHEJITQFZV25.json","graph_json":"https://pith.science/api/pith-number/I2IADMGG2PWUYKVHEJITQFZV25/graph.json","events_json":"https://pith.science/api/pith-number/I2IADMGG2PWUYKVHEJITQFZV25/events.json","paper":"https://pith.science/paper/I2IADMGG"},"agent_actions":{"view_html":"https://pith.science/pith/I2IADMGG2PWUYKVHEJITQFZV25","download_json":"https://pith.science/pith/I2IADMGG2PWUYKVHEJITQFZV25.json","view_paper":"https://pith.science/paper/I2IADMGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04227&json=true","fetch_graph":"https://pith.science/api/pith-number/I2IADMGG2PWUYKVHEJITQFZV25/graph.json","fetch_events":"https://pith.science/api/pith-number/I2IADMGG2PWUYKVHEJITQFZV25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2IADMGG2PWUYKVHEJITQFZV25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2IADMGG2PWUYKVHEJITQFZV25/action/storage_attestation","attest_author":"https://pith.science/pith/I2IADMGG2PWUYKVHEJITQFZV25/action/author_attestation","sign_citation":"https://pith.science/pith/I2IADMGG2PWUYKVHEJITQFZV25/action/citation_signature","submit_replication":"https://pith.science/pith/I2IADMGG2PWUYKVHEJITQFZV25/action/replication_record"}},"created_at":"2026-05-18T00:58:33.470852+00:00","updated_at":"2026-05-18T00:58:33.470852+00:00"}