{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GNXWF23BI5YKOPKE5XU2DSX2QX","short_pith_number":"pith:GNXWF23B","canonical_record":{"source":{"id":"2212.09567","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-19T15:59:00Z","cross_cats_sorted":["cs.AI","cs.DB","cs.SI"],"title_canon_sha256":"dee7926a01b77699afac5a3345c3395f4d917c8f529ac1fc01cd413bef98b47d","abstract_canon_sha256":"964f1bdc547ffc6384c8bb92355aa90dca9a5f896775b4296c1591e22da27856"},"schema_version":"1.0"},"canonical_sha256":"336f62eb614770a73d44ede9a1cafa85d51f0805859dbb474b84ef28003bea2e","source":{"kind":"arxiv","id":"2212.09567","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.09567","created_at":"2026-07-05T06:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"2212.09567v3","created_at":"2026-07-05T06:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09567","created_at":"2026-07-05T06:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"GNXWF23BI5YK","created_at":"2026-07-05T06:18:19Z"},{"alias_kind":"pith_short_16","alias_value":"GNXWF23BI5YKOPKE","created_at":"2026-07-05T06:18:19Z"},{"alias_kind":"pith_short_8","alias_value":"GNXWF23B","created_at":"2026-07-05T06:18:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GNXWF23BI5YKOPKE5XU2DSX2QX","target":"record","payload":{"canonical_record":{"source":{"id":"2212.09567","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-19T15:59:00Z","cross_cats_sorted":["cs.AI","cs.DB","cs.SI"],"title_canon_sha256":"dee7926a01b77699afac5a3345c3395f4d917c8f529ac1fc01cd413bef98b47d","abstract_canon_sha256":"964f1bdc547ffc6384c8bb92355aa90dca9a5f896775b4296c1591e22da27856"},"schema_version":"1.0"},"canonical_sha256":"336f62eb614770a73d44ede9a1cafa85d51f0805859dbb474b84ef28003bea2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:18:19.341110Z","signature_b64":"ey3OFuAy8Tdm1I/LCEyX662MCYLrdXjlxNLwWs4XHbGpKnpRk2MlQ49yp1d6RuPqztX8frJuTM7whuLelhhDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"336f62eb614770a73d44ede9a1cafa85d51f0805859dbb474b84ef28003bea2e","last_reissued_at":"2026-07-05T06:18:19.340649Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:18:19.340649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.09567","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:18:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Xpjb/uhit+WDbjXVcx7xLOsoOL774Tm7TqlT3GRjGYDAKjUIPmipD/GZpoOsWbvX5lePht01CA59ZqfugBeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:30:24.674502Z"},"content_sha256":"c3da874cdaef349b2b729e17f7cc64bcebacb845b23201e7301f16f55abdbe3f","schema_version":"1.0","event_id":"sha256:c3da874cdaef349b2b729e17f7cc64bcebacb845b23201e7301f16f55abdbe3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GNXWF23BI5YKOPKE5XU2DSX2QX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.SI"],"primary_cat":"cs.LG","authors_text":"Juanzi Li, Lei Hou, Xin Lv, Yushi Bai","submitted_at":"2022-12-19T15:59:00Z","abstract_excerpt":"Answering complex logical queries on incomplete knowledge graphs is a challenging task, and has been widely studied. Embedding-based methods require training on complex queries, and cannot generalize well to out-of-distribution query structures. Recent work frames this task as an end-to-end optimization problem, and it only requires a pretrained link predictor. However, due to the exponentially large combinatorial search space, the optimal solution can only be approximated, limiting the final accuracy. In this work, we propose QTO (Query Computation Tree Optimization) that can efficiently find"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09567","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/2212.09567/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:18:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8xWv032eApi9mQsMXlyzKx6/qYuJYJfffyzSyjfu9N5mmP/k236haU1ZtM5/q7SYCjeHjNxMyL4F6xDPhtuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:30:24.674880Z"},"content_sha256":"009b39911a2ee664c1eb59d51c3afa0e62247fdb840c18cdcb8d56fe342c1640","schema_version":"1.0","event_id":"sha256:009b39911a2ee664c1eb59d51c3afa0e62247fdb840c18cdcb8d56fe342c1640"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNXWF23BI5YKOPKE5XU2DSX2QX/bundle.json","state_url":"https://pith.science/pith/GNXWF23BI5YKOPKE5XU2DSX2QX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNXWF23BI5YKOPKE5XU2DSX2QX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T08:30:24Z","links":{"resolver":"https://pith.science/pith/GNXWF23BI5YKOPKE5XU2DSX2QX","bundle":"https://pith.science/pith/GNXWF23BI5YKOPKE5XU2DSX2QX/bundle.json","state":"https://pith.science/pith/GNXWF23BI5YKOPKE5XU2DSX2QX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNXWF23BI5YKOPKE5XU2DSX2QX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GNXWF23BI5YKOPKE5XU2DSX2QX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"964f1bdc547ffc6384c8bb92355aa90dca9a5f896775b4296c1591e22da27856","cross_cats_sorted":["cs.AI","cs.DB","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-19T15:59:00Z","title_canon_sha256":"dee7926a01b77699afac5a3345c3395f4d917c8f529ac1fc01cd413bef98b47d"},"schema_version":"1.0","source":{"id":"2212.09567","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.09567","created_at":"2026-07-05T06:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"2212.09567v3","created_at":"2026-07-05T06:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09567","created_at":"2026-07-05T06:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"GNXWF23BI5YK","created_at":"2026-07-05T06:18:19Z"},{"alias_kind":"pith_short_16","alias_value":"GNXWF23BI5YKOPKE","created_at":"2026-07-05T06:18:19Z"},{"alias_kind":"pith_short_8","alias_value":"GNXWF23B","created_at":"2026-07-05T06:18:19Z"}],"graph_snapshots":[{"event_id":"sha256:009b39911a2ee664c1eb59d51c3afa0e62247fdb840c18cdcb8d56fe342c1640","target":"graph","created_at":"2026-07-05T06:18:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.09567/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Answering complex logical queries on incomplete knowledge graphs is a challenging task, and has been widely studied. Embedding-based methods require training on complex queries, and cannot generalize well to out-of-distribution query structures. Recent work frames this task as an end-to-end optimization problem, and it only requires a pretrained link predictor. However, due to the exponentially large combinatorial search space, the optimal solution can only be approximated, limiting the final accuracy. In this work, we propose QTO (Query Computation Tree Optimization) that can efficiently find","authors_text":"Juanzi Li, Lei Hou, Xin Lv, Yushi Bai","cross_cats":["cs.AI","cs.DB","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-19T15:59:00Z","title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09567","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c3da874cdaef349b2b729e17f7cc64bcebacb845b23201e7301f16f55abdbe3f","target":"record","created_at":"2026-07-05T06:18:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"964f1bdc547ffc6384c8bb92355aa90dca9a5f896775b4296c1591e22da27856","cross_cats_sorted":["cs.AI","cs.DB","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-19T15:59:00Z","title_canon_sha256":"dee7926a01b77699afac5a3345c3395f4d917c8f529ac1fc01cd413bef98b47d"},"schema_version":"1.0","source":{"id":"2212.09567","kind":"arxiv","version":3}},"canonical_sha256":"336f62eb614770a73d44ede9a1cafa85d51f0805859dbb474b84ef28003bea2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"336f62eb614770a73d44ede9a1cafa85d51f0805859dbb474b84ef28003bea2e","first_computed_at":"2026-07-05T06:18:19.340649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:18:19.340649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ey3OFuAy8Tdm1I/LCEyX662MCYLrdXjlxNLwWs4XHbGpKnpRk2MlQ49yp1d6RuPqztX8frJuTM7whuLelhhDCw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:18:19.341110Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.09567","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3da874cdaef349b2b729e17f7cc64bcebacb845b23201e7301f16f55abdbe3f","sha256:009b39911a2ee664c1eb59d51c3afa0e62247fdb840c18cdcb8d56fe342c1640"],"state_sha256":"0e9c966f34faf31797567677514acccbcdc97e255ada15de26af910d1b214818"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4A+7T9xDmok+uxj9SZJba3HfYkIiwRuu1fT6wUinDLi0EkTwJshKV5+PHWTCqqZPZ7nePnWMM3gmYY3C9BDPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T08:30:24.676778Z","bundle_sha256":"d92400aecf73246e56775c7553a66eb622a26d7ced99db3e4aebb0a9d2c9291f"}}