{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A46H5RIZ22NTJ7GW6JVVHFARED","short_pith_number":"pith:A46H5RIZ","schema_version":"1.0","canonical_sha256":"073c7ec519d69b34fcd6f26b53941120e0ef2543d54632c0f41a8b6283a93d9e","source":{"kind":"arxiv","id":"2304.07063","version":4},"attestation_state":"computed","paper":{"title":"Rethinking Complex Queries on Knowledge Graphs with Neural Link Predictors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Hang Yin, Yangqiu Song, Zihao Wang","submitted_at":"2023-04-14T11:35:35Z","abstract_excerpt":"Reasoning on knowledge graphs is a challenging task because it utilizes observed information to predict the missing one. Particularly, answering complex queries based on first-order logic is one of the crucial tasks to verify learning to reason abilities for generalization and composition. Recently, the prevailing method is query embedding which learns the embedding of a set of entities and treats logic operations as set operations and has shown great empirical success. Though there has been much research following the same formulation, many of its claims lack a formal and systematic inspectio"},"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":"2304.07063","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-04-14T11:35:35Z","cross_cats_sorted":["cs.DB","cs.LG","cs.LO"],"title_canon_sha256":"85870df025041f396c9fa8f255d9416e2e51a2b261573c3b82d180f6f8325bd7","abstract_canon_sha256":"0ae5f730e4eccc9f85371f2e49792a7f269eac6071f13dd6d2d97cbbf17786a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:43.320124Z","signature_b64":"CHDTx7k/zrNG+0RfPGriA43yO/PbWjbY6WaNaCNeNI8c1G/WYLTZsZ7IaWQrRauUOWOGans6yQfH7aVI88cjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"073c7ec519d69b34fcd6f26b53941120e0ef2543d54632c0f41a8b6283a93d9e","last_reissued_at":"2026-07-05T09:23:43.319648Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:43.319648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rethinking Complex Queries on Knowledge Graphs with Neural Link Predictors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Hang Yin, Yangqiu Song, Zihao Wang","submitted_at":"2023-04-14T11:35:35Z","abstract_excerpt":"Reasoning on knowledge graphs is a challenging task because it utilizes observed information to predict the missing one. Particularly, answering complex queries based on first-order logic is one of the crucial tasks to verify learning to reason abilities for generalization and composition. Recently, the prevailing method is query embedding which learns the embedding of a set of entities and treats logic operations as set operations and has shown great empirical success. Though there has been much research following the same formulation, many of its claims lack a formal and systematic inspectio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.07063","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/2304.07063/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":"2304.07063","created_at":"2026-07-05T09:23:43.319713+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.07063v4","created_at":"2026-07-05T09:23:43.319713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.07063","created_at":"2026-07-05T09:23:43.319713+00:00"},{"alias_kind":"pith_short_12","alias_value":"A46H5RIZ22NT","created_at":"2026-07-05T09:23:43.319713+00:00"},{"alias_kind":"pith_short_16","alias_value":"A46H5RIZ22NTJ7GW","created_at":"2026-07-05T09:23:43.319713+00:00"},{"alias_kind":"pith_short_8","alias_value":"A46H5RIZ","created_at":"2026-07-05T09:23:43.319713+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00759","citing_title":"Enhancing Transformers for Generalizable First-Order Logical Entailment","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A46H5RIZ22NTJ7GW6JVVHFARED","json":"https://pith.science/pith/A46H5RIZ22NTJ7GW6JVVHFARED.json","graph_json":"https://pith.science/api/pith-number/A46H5RIZ22NTJ7GW6JVVHFARED/graph.json","events_json":"https://pith.science/api/pith-number/A46H5RIZ22NTJ7GW6JVVHFARED/events.json","paper":"https://pith.science/paper/A46H5RIZ"},"agent_actions":{"view_html":"https://pith.science/pith/A46H5RIZ22NTJ7GW6JVVHFARED","download_json":"https://pith.science/pith/A46H5RIZ22NTJ7GW6JVVHFARED.json","view_paper":"https://pith.science/paper/A46H5RIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.07063&json=true","fetch_graph":"https://pith.science/api/pith-number/A46H5RIZ22NTJ7GW6JVVHFARED/graph.json","fetch_events":"https://pith.science/api/pith-number/A46H5RIZ22NTJ7GW6JVVHFARED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A46H5RIZ22NTJ7GW6JVVHFARED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A46H5RIZ22NTJ7GW6JVVHFARED/action/storage_attestation","attest_author":"https://pith.science/pith/A46H5RIZ22NTJ7GW6JVVHFARED/action/author_attestation","sign_citation":"https://pith.science/pith/A46H5RIZ22NTJ7GW6JVVHFARED/action/citation_signature","submit_replication":"https://pith.science/pith/A46H5RIZ22NTJ7GW6JVVHFARED/action/replication_record"}},"created_at":"2026-07-05T09:23:43.319713+00:00","updated_at":"2026-07-05T09:23:43.319713+00:00"}