{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SQGYHWQ7GAGQFYAX4XLTG5ATSY","short_pith_number":"pith:SQGYHWQ7","schema_version":"1.0","canonical_sha256":"940d83da1f300d02e017e5d73374139601990939e57291473990aed615c2e73a","source":{"kind":"arxiv","id":"1904.12052","version":2},"attestation_state":"computed","paper":{"title":"Data Poisoning Attack against Knowledge Graph Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chenglin Miao, Hengtong Zhang, Jing Gao, Kui Ren, Lu Su, Tianhang Zheng, Yaliang Li","submitted_at":"2019-04-26T21:12:19Z","abstract_excerpt":"Knowledge graph embedding (KGE) is a technique for learning continuous embeddings for entities and relations in the knowledge graph.Due to its benefit to a variety of downstream tasks such as knowledge graph completion, question answering and recommendation, KGE has gained significant attention recently. Despite its effectiveness in a benign environment, KGE' robustness to adversarial attacks is not well-studied. Existing attack methods on graph data cannot be directly applied to attack the embeddings of knowledge graph due to its heterogeneity. To fill this gap, we propose a collection of dat"},"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.12052","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T21:12:19Z","cross_cats_sorted":["cs.AI","cs.CR","stat.ML"],"title_canon_sha256":"d88110d9c5f9abfe093a9715bc7755dcdeb2183d196358f147fede6e3f35ec5c","abstract_canon_sha256":"8f98c0639b0ff4baee49bbcd8f809acb4c9f0dc5a6e8744ba6f8b8f38b68fa02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:41.762432Z","signature_b64":"0G9nKM05DHRudwKZUAR9FFuE5INGyUBn6mwFRipp5PtUWb9spKB8FzR58dYz79gqA5xedESrJGJuykZ4boAFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"940d83da1f300d02e017e5d73374139601990939e57291473990aed615c2e73a","last_reissued_at":"2026-05-17T23:42:41.761864Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:41.761864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Poisoning Attack against Knowledge Graph Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chenglin Miao, Hengtong Zhang, Jing Gao, Kui Ren, Lu Su, Tianhang Zheng, Yaliang Li","submitted_at":"2019-04-26T21:12:19Z","abstract_excerpt":"Knowledge graph embedding (KGE) is a technique for learning continuous embeddings for entities and relations in the knowledge graph.Due to its benefit to a variety of downstream tasks such as knowledge graph completion, question answering and recommendation, KGE has gained significant attention recently. Despite its effectiveness in a benign environment, KGE' robustness to adversarial attacks is not well-studied. Existing attack methods on graph data cannot be directly applied to attack the embeddings of knowledge graph due to its heterogeneity. To fill this gap, we propose a collection of dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12052","kind":"arxiv","version":2},"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.12052","created_at":"2026-05-17T23:42:41.761950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12052v2","created_at":"2026-05-17T23:42:41.761950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12052","created_at":"2026-05-17T23:42:41.761950+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQGYHWQ7GAGQ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQGYHWQ7GAGQFYAX","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQGYHWQ7","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.09033","citing_title":"ShadowMerge: A Novel Poisoning Attack on Graph-Based Agent Memory via Relation-Channel Conflicts","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09033","citing_title":"ShadowMerge: A Novel Poisoning Attack on Graph-Based Agent Memory via Relation-Channel Conflicts","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09033","citing_title":"ShadowMerge: A Novel Poisoning Attack on Graph-Based Agent Memory via Relation-Channel Conflicts","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SQGYHWQ7GAGQFYAX4XLTG5ATSY","json":"https://pith.science/pith/SQGYHWQ7GAGQFYAX4XLTG5ATSY.json","graph_json":"https://pith.science/api/pith-number/SQGYHWQ7GAGQFYAX4XLTG5ATSY/graph.json","events_json":"https://pith.science/api/pith-number/SQGYHWQ7GAGQFYAX4XLTG5ATSY/events.json","paper":"https://pith.science/paper/SQGYHWQ7"},"agent_actions":{"view_html":"https://pith.science/pith/SQGYHWQ7GAGQFYAX4XLTG5ATSY","download_json":"https://pith.science/pith/SQGYHWQ7GAGQFYAX4XLTG5ATSY.json","view_paper":"https://pith.science/paper/SQGYHWQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12052&json=true","fetch_graph":"https://pith.science/api/pith-number/SQGYHWQ7GAGQFYAX4XLTG5ATSY/graph.json","fetch_events":"https://pith.science/api/pith-number/SQGYHWQ7GAGQFYAX4XLTG5ATSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQGYHWQ7GAGQFYAX4XLTG5ATSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQGYHWQ7GAGQFYAX4XLTG5ATSY/action/storage_attestation","attest_author":"https://pith.science/pith/SQGYHWQ7GAGQFYAX4XLTG5ATSY/action/author_attestation","sign_citation":"https://pith.science/pith/SQGYHWQ7GAGQFYAX4XLTG5ATSY/action/citation_signature","submit_replication":"https://pith.science/pith/SQGYHWQ7GAGQFYAX4XLTG5ATSY/action/replication_record"}},"created_at":"2026-05-17T23:42:41.761950+00:00","updated_at":"2026-05-17T23:42:41.761950+00:00"}