{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:B6ASKBVZH3HUTCLEWBOQVCXFGA","short_pith_number":"pith:B6ASKBVZ","schema_version":"1.0","canonical_sha256":"0f812506b93ecf498964b05d0a8ae5303aa407b0439028cb7e6fe8aec2e1a80d","source":{"kind":"arxiv","id":"2002.05969","version":2},"attestation_state":"computed","paper":{"title":"Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongyu Ren, Jure Leskovec, Weihua Hu","submitted_at":"2020-02-14T11:20:10Z","abstract_excerpt":"Answering complex logical queries on large-scale incomplete knowledge graphs (KGs) is a fundamental yet challenging task. Recently, a promising approach to this problem has been to embed KG entities as well as the query into a vector space such that entities that answer the query are embedded close to the query. However, prior work models queries as single points in the vector space, which is problematic because a complex query represents a potentially large set of its answer entities, but it is unclear how such a set can be represented as a single point. Furthermore, prior work can only handl"},"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":"2002.05969","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-14T11:20:10Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"ea87e71a26bab4d9bfea2391b18c63beb67f0d2e04c078c9dc2a0d08cc065d92","abstract_canon_sha256":"c68a906bd76f8f61aafa19b8992cc077e0af50b831efd8a6050683533328e24a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:42.756063Z","signature_b64":"Fmtg70CUh9uz7b9zSGFWCHbWgjKFd662Xs50n6TqL4rMfc5DgOhzmHW8i9apNWE8oG5/xpcWQbBXoFyL/vfGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f812506b93ecf498964b05d0a8ae5303aa407b0439028cb7e6fe8aec2e1a80d","last_reissued_at":"2026-07-05T00:44:42.755679Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:42.755679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongyu Ren, Jure Leskovec, Weihua Hu","submitted_at":"2020-02-14T11:20:10Z","abstract_excerpt":"Answering complex logical queries on large-scale incomplete knowledge graphs (KGs) is a fundamental yet challenging task. Recently, a promising approach to this problem has been to embed KG entities as well as the query into a vector space such that entities that answer the query are embedded close to the query. However, prior work models queries as single points in the vector space, which is problematic because a complex query represents a potentially large set of its answer entities, but it is unclear how such a set can be represented as a single point. Furthermore, prior work can only handl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.05969","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.05969/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":"2002.05969","created_at":"2026-07-05T00:44:42.755735+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.05969v2","created_at":"2026-07-05T00:44:42.755735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.05969","created_at":"2026-07-05T00:44:42.755735+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6ASKBVZH3HU","created_at":"2026-07-05T00:44:42.755735+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6ASKBVZH3HUTCLE","created_at":"2026-07-05T00:44:42.755735+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6ASKBVZ","created_at":"2026-07-05T00:44:42.755735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07422","citing_title":"InductWave: Inductive Multi-Hop Logical Query Answering on Knowledge Graphs","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14907","citing_title":"KGPFN: Unlocking the Potential of Knowledge Graph Foundation Model via In-Context Learning","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B6ASKBVZH3HUTCLEWBOQVCXFGA","json":"https://pith.science/pith/B6ASKBVZH3HUTCLEWBOQVCXFGA.json","graph_json":"https://pith.science/api/pith-number/B6ASKBVZH3HUTCLEWBOQVCXFGA/graph.json","events_json":"https://pith.science/api/pith-number/B6ASKBVZH3HUTCLEWBOQVCXFGA/events.json","paper":"https://pith.science/paper/B6ASKBVZ"},"agent_actions":{"view_html":"https://pith.science/pith/B6ASKBVZH3HUTCLEWBOQVCXFGA","download_json":"https://pith.science/pith/B6ASKBVZH3HUTCLEWBOQVCXFGA.json","view_paper":"https://pith.science/paper/B6ASKBVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.05969&json=true","fetch_graph":"https://pith.science/api/pith-number/B6ASKBVZH3HUTCLEWBOQVCXFGA/graph.json","fetch_events":"https://pith.science/api/pith-number/B6ASKBVZH3HUTCLEWBOQVCXFGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6ASKBVZH3HUTCLEWBOQVCXFGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6ASKBVZH3HUTCLEWBOQVCXFGA/action/storage_attestation","attest_author":"https://pith.science/pith/B6ASKBVZH3HUTCLEWBOQVCXFGA/action/author_attestation","sign_citation":"https://pith.science/pith/B6ASKBVZH3HUTCLEWBOQVCXFGA/action/citation_signature","submit_replication":"https://pith.science/pith/B6ASKBVZH3HUTCLEWBOQVCXFGA/action/replication_record"}},"created_at":"2026-07-05T00:44:42.755735+00:00","updated_at":"2026-07-05T00:44:42.755735+00:00"}