{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QXIQN6XU4RK5K2QDVFQASEV333","short_pith_number":"pith:QXIQN6XU","schema_version":"1.0","canonical_sha256":"85d106faf4e455d56a03a9600912bbded22120cf0fe0af91e5fd89fb6e632464","source":{"kind":"arxiv","id":"1902.02970","version":1},"attestation_state":"computed","paper":{"title":"Binarized Knowledge Graph Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Genki Akai, Katsuhiko Hayashi, Kazunori Komatani, Koki Kishimoto, Masashi Shimbo","submitted_at":"2019-02-08T08:27:25Z","abstract_excerpt":"Tensor factorization has become an increasingly popular approach to knowledge graph completion(KGC), which is the task of automatically predicting missing facts in a knowledge graph. However, even with a simple model like CANDECOMP/PARAFAC(CP) tensor decomposition, KGC on existing knowledge graphs is impractical in resource-limited environments, as a large amount of memory is required to store parameters represented as 32-bit or 64-bit floating point numbers. This limitation is expected to become more stringent as existing knowledge graphs, which are already huge, keep steadily growing in scal"},"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":"1902.02970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-08T08:27:25Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"83b9e820369c1ca4504320f007beb8f7d7d7bc56389ee9951367bf2478231301","abstract_canon_sha256":"802dc820e479b6e1c3f5ba9ffca472c5651042720f40ae2e56b471261896ce95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:28.712924Z","signature_b64":"Q08bw7aJawvbgQTMEbcSE1YRybk36Srup1eQRC4juaHUVl1mIKr1UX4VubbkyJZSWJR1xC8dmmppAX2qBK7fBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d106faf4e455d56a03a9600912bbded22120cf0fe0af91e5fd89fb6e632464","last_reissued_at":"2026-05-17T23:54:28.712351Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:28.712351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binarized Knowledge Graph Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Genki Akai, Katsuhiko Hayashi, Kazunori Komatani, Koki Kishimoto, Masashi Shimbo","submitted_at":"2019-02-08T08:27:25Z","abstract_excerpt":"Tensor factorization has become an increasingly popular approach to knowledge graph completion(KGC), which is the task of automatically predicting missing facts in a knowledge graph. However, even with a simple model like CANDECOMP/PARAFAC(CP) tensor decomposition, KGC on existing knowledge graphs is impractical in resource-limited environments, as a large amount of memory is required to store parameters represented as 32-bit or 64-bit floating point numbers. This limitation is expected to become more stringent as existing knowledge graphs, which are already huge, keep steadily growing in scal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02970","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":"1902.02970","created_at":"2026-05-17T23:54:28.712439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02970v1","created_at":"2026-05-17T23:54:28.712439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02970","created_at":"2026-05-17T23:54:28.712439+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXIQN6XU4RK5","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXIQN6XU4RK5K2QD","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXIQN6XU","created_at":"2026-05-18T12:33:27.125529+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/QXIQN6XU4RK5K2QDVFQASEV333","json":"https://pith.science/pith/QXIQN6XU4RK5K2QDVFQASEV333.json","graph_json":"https://pith.science/api/pith-number/QXIQN6XU4RK5K2QDVFQASEV333/graph.json","events_json":"https://pith.science/api/pith-number/QXIQN6XU4RK5K2QDVFQASEV333/events.json","paper":"https://pith.science/paper/QXIQN6XU"},"agent_actions":{"view_html":"https://pith.science/pith/QXIQN6XU4RK5K2QDVFQASEV333","download_json":"https://pith.science/pith/QXIQN6XU4RK5K2QDVFQASEV333.json","view_paper":"https://pith.science/paper/QXIQN6XU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02970&json=true","fetch_graph":"https://pith.science/api/pith-number/QXIQN6XU4RK5K2QDVFQASEV333/graph.json","fetch_events":"https://pith.science/api/pith-number/QXIQN6XU4RK5K2QDVFQASEV333/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXIQN6XU4RK5K2QDVFQASEV333/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXIQN6XU4RK5K2QDVFQASEV333/action/storage_attestation","attest_author":"https://pith.science/pith/QXIQN6XU4RK5K2QDVFQASEV333/action/author_attestation","sign_citation":"https://pith.science/pith/QXIQN6XU4RK5K2QDVFQASEV333/action/citation_signature","submit_replication":"https://pith.science/pith/QXIQN6XU4RK5K2QDVFQASEV333/action/replication_record"}},"created_at":"2026-05-17T23:54:28.712439+00:00","updated_at":"2026-05-17T23:54:28.712439+00:00"}