{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:F6BQKJWSP4IEFHPSEWY7LUYN7O","short_pith_number":"pith:F6BQKJWS","schema_version":"1.0","canonical_sha256":"2f830526d27f10429df225b1f5d30dfb9d7d9777dfc9cccaefd845e2c1cf1f18","source":{"kind":"arxiv","id":"2302.13114","version":3},"attestation_state":"computed","paper":{"title":"Sequential Query Encoding For Complex Query Answering on Knowledge Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jiaxin Bai, Tianshi Zheng, Yangqiu Song","submitted_at":"2023-02-25T16:33:53Z","abstract_excerpt":"Complex Query Answering (CQA) is an important and fundamental task for knowledge graph (KG) reasoning. Query encoding (QE) is proposed as a fast and robust solution to CQA. In the encoding process, most existing QE methods first parse the logical query into an executable computational direct-acyclic graph (DAG), then use neural networks to parameterize the operators, and finally, recursively execute these neuralized operators. However, the parameterization-and-execution paradigm may be potentially over-complicated, as it can be structurally simplified by a single neural network encoder. Meanwh"},"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":"2302.13114","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-02-25T16:33:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8170919d9e5ec2fcaafa8ab07fc67619e03a71090f9fda043bc0d0f20aa7cb58","abstract_canon_sha256":"0642c1934bcf6fc4d63714a459edad4a8144389d47df32e034625562b96a3ab7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:28.296750Z","signature_b64":"8UUbz4bL2r1i1S8u5hp9sH+cmzSfVXPptvYVTuA8iyZyORFl9lFIeY6WVJ8nvMAATQmrllUXyQVK+WFXkPA2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f830526d27f10429df225b1f5d30dfb9d7d9777dfc9cccaefd845e2c1cf1f18","last_reissued_at":"2026-07-05T06:24:28.296194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:28.296194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Query Encoding For Complex Query Answering on Knowledge Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jiaxin Bai, Tianshi Zheng, Yangqiu Song","submitted_at":"2023-02-25T16:33:53Z","abstract_excerpt":"Complex Query Answering (CQA) is an important and fundamental task for knowledge graph (KG) reasoning. Query encoding (QE) is proposed as a fast and robust solution to CQA. In the encoding process, most existing QE methods first parse the logical query into an executable computational direct-acyclic graph (DAG), then use neural networks to parameterize the operators, and finally, recursively execute these neuralized operators. However, the parameterization-and-execution paradigm may be potentially over-complicated, as it can be structurally simplified by a single neural network encoder. Meanwh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13114","kind":"arxiv","version":3},"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/2302.13114/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":"2302.13114","created_at":"2026-07-05T06:24:28.296258+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.13114v3","created_at":"2026-07-05T06:24:28.296258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13114","created_at":"2026-07-05T06:24:28.296258+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6BQKJWSP4IE","created_at":"2026-07-05T06:24:28.296258+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6BQKJWSP4IEFHPS","created_at":"2026-07-05T06:24:28.296258+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6BQKJWS","created_at":"2026-07-05T06:24:28.296258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25985","citing_title":"Neural Scalable Symbolic Search Framework for Complex Logical Queries with Multiple Free Variables","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F6BQKJWSP4IEFHPSEWY7LUYN7O","json":"https://pith.science/pith/F6BQKJWSP4IEFHPSEWY7LUYN7O.json","graph_json":"https://pith.science/api/pith-number/F6BQKJWSP4IEFHPSEWY7LUYN7O/graph.json","events_json":"https://pith.science/api/pith-number/F6BQKJWSP4IEFHPSEWY7LUYN7O/events.json","paper":"https://pith.science/paper/F6BQKJWS"},"agent_actions":{"view_html":"https://pith.science/pith/F6BQKJWSP4IEFHPSEWY7LUYN7O","download_json":"https://pith.science/pith/F6BQKJWSP4IEFHPSEWY7LUYN7O.json","view_paper":"https://pith.science/paper/F6BQKJWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.13114&json=true","fetch_graph":"https://pith.science/api/pith-number/F6BQKJWSP4IEFHPSEWY7LUYN7O/graph.json","fetch_events":"https://pith.science/api/pith-number/F6BQKJWSP4IEFHPSEWY7LUYN7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6BQKJWSP4IEFHPSEWY7LUYN7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6BQKJWSP4IEFHPSEWY7LUYN7O/action/storage_attestation","attest_author":"https://pith.science/pith/F6BQKJWSP4IEFHPSEWY7LUYN7O/action/author_attestation","sign_citation":"https://pith.science/pith/F6BQKJWSP4IEFHPSEWY7LUYN7O/action/citation_signature","submit_replication":"https://pith.science/pith/F6BQKJWSP4IEFHPSEWY7LUYN7O/action/replication_record"}},"created_at":"2026-07-05T06:24:28.296258+00:00","updated_at":"2026-07-05T06:24:28.296258+00:00"}