{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LWZFHMS4W64FTA7YTJOEYM4A3U","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":"4ea9b6dfe56990411f060f22edff992b18d41f6d34a1ddbf564870cad2c54d44","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-01-21T04:49:23Z","title_canon_sha256":"a28feba7458dbd56f3e79fa9b412a2da3b77379b69448424982139c22c0363bb"},"schema_version":"1.0","source":{"id":"1801.06766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06766","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06766v1","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06766","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"LWZFHMS4W64F","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LWZFHMS4W64FTA7Y","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LWZFHMS4","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:58bd1a5932fb2ba1cb3df0ac2a86fb2d4219b7ffb0662d5a1d701c37d975e374","target":"graph","created_at":"2026-05-18T00:25:27Z","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"},"paper":{"abstract_excerpt":"Querying graph structured data is a fundamental operation that enables important applications including knowledge graph search, social network analysis, and cyber-network security. However, the growing size of real-world data graphs poses severe challenges for graph databases to meet the response-time requirements of the applications. Planning the computational steps of query processing - Query Planning - is central to address these challenges. In this paper, we study the problem of learning to speedup query planning in graph databases towards the goal of improving the computational-efficiency","authors_text":"F A Rezaur Rahman Chowdhury, Janardhan Rao Doppa, Md Rakibul Islam, Mohammad Hossain Namaki, Yinghui Wu","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-01-21T04:49:23Z","title":"Learning to Speed Up Query Planning in Graph Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06766","kind":"arxiv","version":1},"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:48684ba47dc6ac3b8eeb17055710e60fcd2614a1acc604b2b0f1af995cfa0cf9","target":"record","created_at":"2026-05-18T00:25:27Z","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":"4ea9b6dfe56990411f060f22edff992b18d41f6d34a1ddbf564870cad2c54d44","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-01-21T04:49:23Z","title_canon_sha256":"a28feba7458dbd56f3e79fa9b412a2da3b77379b69448424982139c22c0363bb"},"schema_version":"1.0","source":{"id":"1801.06766","kind":"arxiv","version":1}},"canonical_sha256":"5db253b25cb7b85983f89a5c4c3380dd0a65845b8d9b80c885589a2e56fcafed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5db253b25cb7b85983f89a5c4c3380dd0a65845b8d9b80c885589a2e56fcafed","first_computed_at":"2026-05-18T00:25:27.815779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:27.815779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XVOvY6flAAe3GF8ikIzcVC9xNOughhJV9wwKrnsyChIKIZv2pa7VY0BaWRzGjcwCrAulSxEQaYiUV9/RT7XGCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:27.816505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06766","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48684ba47dc6ac3b8eeb17055710e60fcd2614a1acc604b2b0f1af995cfa0cf9","sha256:58bd1a5932fb2ba1cb3df0ac2a86fb2d4219b7ffb0662d5a1d701c37d975e374"],"state_sha256":"9fdf9f4171f7ce579afa74e1c0036245b66d1b441e9dd98bdb07b7403633dabe"}