{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QOM6MLTGIDDKFVHNYQADQVHAUX","short_pith_number":"pith:QOM6MLTG","schema_version":"1.0","canonical_sha256":"8399e62e6640c6a2d4edc4003854e0a5fa141fba9da5009c25425ce51a3291c9","source":{"kind":"arxiv","id":"1806.01445","version":4},"attestation_state":"computed","paper":{"title":"Embedding Logical Queries on Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Dan Jurafsky, Jure Leskovec, Marinka Zitnik, Payal Bajaj, William L. Hamilton","submitted_at":"2018-06-05T00:36:13Z","abstract_excerpt":"Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities. However, an open challenge in this area is developing techniques that can go beyond simple edge prediction and handle more complex logical queries, which might involve multiple unobserved edges, entities, and variables. For instance, given an incomplete biological knowledge graph, we might want to predict \"em what drugs are likely to target proteins involved with both diseases X and Y?\" -- a query that requires reasoning about all possible proteins that {"},"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":"1806.01445","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-05T00:36:13Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d5a6d9af00bba8cceb66acb066da1162999d7f4f3b550364f00ffd3f2b26e437","abstract_canon_sha256":"9ca3770553974caff7f49615e4a9c7b42ddc2ec163be9672686415bf361acf81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:33.705500Z","signature_b64":"I805a8AUhjz0HvXl9HSnCcb09w9HUHIq3vCdYMrpE5u0cns0CBWsZmmL4kk/ZIl8OPH81PWDMuxNZaWURBVOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8399e62e6640c6a2d4edc4003854e0a5fa141fba9da5009c25425ce51a3291c9","last_reissued_at":"2026-07-05T00:15:33.705102Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:33.705102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding Logical Queries on Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Dan Jurafsky, Jure Leskovec, Marinka Zitnik, Payal Bajaj, William L. Hamilton","submitted_at":"2018-06-05T00:36:13Z","abstract_excerpt":"Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities. However, an open challenge in this area is developing techniques that can go beyond simple edge prediction and handle more complex logical queries, which might involve multiple unobserved edges, entities, and variables. For instance, given an incomplete biological knowledge graph, we might want to predict \"em what drugs are likely to target proteins involved with both diseases X and Y?\" -- a query that requires reasoning about all possible proteins that {"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01445","kind":"arxiv","version":4},"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/1806.01445/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":"1806.01445","created_at":"2026-07-05T00:15:33.705166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01445v4","created_at":"2026-07-05T00:15:33.705166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01445","created_at":"2026-07-05T00:15:33.705166+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOM6MLTGIDDK","created_at":"2026-07-05T00:15:33.705166+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOM6MLTGIDDKFVHN","created_at":"2026-07-05T00:15:33.705166+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOM6MLTG","created_at":"2026-07-05T00:15:33.705166+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/QOM6MLTGIDDKFVHNYQADQVHAUX","json":"https://pith.science/pith/QOM6MLTGIDDKFVHNYQADQVHAUX.json","graph_json":"https://pith.science/api/pith-number/QOM6MLTGIDDKFVHNYQADQVHAUX/graph.json","events_json":"https://pith.science/api/pith-number/QOM6MLTGIDDKFVHNYQADQVHAUX/events.json","paper":"https://pith.science/paper/QOM6MLTG"},"agent_actions":{"view_html":"https://pith.science/pith/QOM6MLTGIDDKFVHNYQADQVHAUX","download_json":"https://pith.science/pith/QOM6MLTGIDDKFVHNYQADQVHAUX.json","view_paper":"https://pith.science/paper/QOM6MLTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01445&json=true","fetch_graph":"https://pith.science/api/pith-number/QOM6MLTGIDDKFVHNYQADQVHAUX/graph.json","fetch_events":"https://pith.science/api/pith-number/QOM6MLTGIDDKFVHNYQADQVHAUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOM6MLTGIDDKFVHNYQADQVHAUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOM6MLTGIDDKFVHNYQADQVHAUX/action/storage_attestation","attest_author":"https://pith.science/pith/QOM6MLTGIDDKFVHNYQADQVHAUX/action/author_attestation","sign_citation":"https://pith.science/pith/QOM6MLTGIDDKFVHNYQADQVHAUX/action/citation_signature","submit_replication":"https://pith.science/pith/QOM6MLTGIDDKFVHNYQADQVHAUX/action/replication_record"}},"created_at":"2026-07-05T00:15:33.705166+00:00","updated_at":"2026-07-05T00:15:33.705166+00:00"}