{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LWZFHMS4W64FTA7YTJOEYM4A3U","short_pith_number":"pith:LWZFHMS4","schema_version":"1.0","canonical_sha256":"5db253b25cb7b85983f89a5c4c3380dd0a65845b8d9b80c885589a2e56fcafed","source":{"kind":"arxiv","id":"1801.06766","version":1},"attestation_state":"computed","paper":{"title":"Learning to Speed Up Query Planning in Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"F A Rezaur Rahman Chowdhury, Janardhan Rao Doppa, Md Rakibul Islam, Mohammad Hossain Namaki, Yinghui Wu","submitted_at":"2018-01-21T04:49:23Z","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"},"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":"1801.06766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-01-21T04:49:23Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"a28feba7458dbd56f3e79fa9b412a2da3b77379b69448424982139c22c0363bb","abstract_canon_sha256":"4ea9b6dfe56990411f060f22edff992b18d41f6d34a1ddbf564870cad2c54d44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:27.816505Z","signature_b64":"XVOvY6flAAe3GF8ikIzcVC9xNOughhJV9wwKrnsyChIKIZv2pa7VY0BaWRzGjcwCrAulSxEQaYiUV9/RT7XGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5db253b25cb7b85983f89a5c4c3380dd0a65845b8d9b80c885589a2e56fcafed","last_reissued_at":"2026-05-18T00:25:27.815779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:27.815779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Speed Up Query Planning in Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"F A Rezaur Rahman Chowdhury, Janardhan Rao Doppa, Md Rakibul Islam, Mohammad Hossain Namaki, Yinghui Wu","submitted_at":"2018-01-21T04:49:23Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06766","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1801.06766","created_at":"2026-05-18T00:25:27.815916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.06766v1","created_at":"2026-05-18T00:25:27.815916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06766","created_at":"2026-05-18T00:25:27.815916+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWZFHMS4W64F","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWZFHMS4W64FTA7Y","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWZFHMS4","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LWZFHMS4W64FTA7YTJOEYM4A3U","json":"https://pith.science/pith/LWZFHMS4W64FTA7YTJOEYM4A3U.json","graph_json":"https://pith.science/api/pith-number/LWZFHMS4W64FTA7YTJOEYM4A3U/graph.json","events_json":"https://pith.science/api/pith-number/LWZFHMS4W64FTA7YTJOEYM4A3U/events.json","paper":"https://pith.science/paper/LWZFHMS4"},"agent_actions":{"view_html":"https://pith.science/pith/LWZFHMS4W64FTA7YTJOEYM4A3U","download_json":"https://pith.science/pith/LWZFHMS4W64FTA7YTJOEYM4A3U.json","view_paper":"https://pith.science/paper/LWZFHMS4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.06766&json=true","fetch_graph":"https://pith.science/api/pith-number/LWZFHMS4W64FTA7YTJOEYM4A3U/graph.json","fetch_events":"https://pith.science/api/pith-number/LWZFHMS4W64FTA7YTJOEYM4A3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWZFHMS4W64FTA7YTJOEYM4A3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWZFHMS4W64FTA7YTJOEYM4A3U/action/storage_attestation","attest_author":"https://pith.science/pith/LWZFHMS4W64FTA7YTJOEYM4A3U/action/author_attestation","sign_citation":"https://pith.science/pith/LWZFHMS4W64FTA7YTJOEYM4A3U/action/citation_signature","submit_replication":"https://pith.science/pith/LWZFHMS4W64FTA7YTJOEYM4A3U/action/replication_record"}},"created_at":"2026-05-18T00:25:27.815916+00:00","updated_at":"2026-05-18T00:25:27.815916+00:00"}