{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5I75L2HHKVBCCZGWGIHTRLK4YA","short_pith_number":"pith:5I75L2HH","schema_version":"1.0","canonical_sha256":"ea3fd5e8e755422164d6320f38ad5cc003fb326f93ecbb6de1db3685dde74206","source":{"kind":"arxiv","id":"1808.03668","version":6},"attestation_state":"computed","paper":{"title":"DeepLOB: Deep Convolutional Neural Networks for Limit Order Books","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.CP","authors_text":"Stefan Zohren, Stephen Roberts, Zihao Zhang","submitted_at":"2018-08-10T18:36:49Z","abstract_excerpt":"We develop a large-scale deep learning model to predict price movements from limit order book (LOB) data of cash equities. The architecture utilises convolutional filters to capture the spatial structure of the limit order books as well as LSTM modules to capture longer time dependencies. The proposed network outperforms all existing state-of-the-art algorithms on the benchmark LOB dataset [1]. In a more realistic setting, we test our model by using one year market quotes from the London Stock Exchange and the model delivers a remarkably stable out-of-sample prediction accuracy for a variety o"},"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":"1808.03668","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2018-08-10T18:36:49Z","cross_cats_sorted":[],"title_canon_sha256":"dcd345c98c0d6438cbd826a4559b75fce480538c9a4331d685c8c17b7d8e2c26","abstract_canon_sha256":"6b71c405994d453f0b0600d90c5a1855403c9e43db7f67accc33148ce1a08a1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:18.237633Z","signature_b64":"d122209v5pVIYqVzn/SAR8fraahFclFRSk/HH5u+m2EfkvdZ5O5Di3Z/uGHRQRSQtZ3XHQJjLcw/q0U7Hj7sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea3fd5e8e755422164d6320f38ad5cc003fb326f93ecbb6de1db3685dde74206","last_reissued_at":"2026-07-05T00:35:18.237150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:18.237150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeepLOB: Deep Convolutional Neural Networks for Limit Order Books","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.CP","authors_text":"Stefan Zohren, Stephen Roberts, Zihao Zhang","submitted_at":"2018-08-10T18:36:49Z","abstract_excerpt":"We develop a large-scale deep learning model to predict price movements from limit order book (LOB) data of cash equities. The architecture utilises convolutional filters to capture the spatial structure of the limit order books as well as LSTM modules to capture longer time dependencies. The proposed network outperforms all existing state-of-the-art algorithms on the benchmark LOB dataset [1]. In a more realistic setting, we test our model by using one year market quotes from the London Stock Exchange and the model delivers a remarkably stable out-of-sample prediction accuracy for a variety o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03668","kind":"arxiv","version":6},"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/1808.03668/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":"1808.03668","created_at":"2026-07-05T00:35:18.237222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03668v6","created_at":"2026-07-05T00:35:18.237222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03668","created_at":"2026-07-05T00:35:18.237222+00:00"},{"alias_kind":"pith_short_12","alias_value":"5I75L2HHKVBC","created_at":"2026-07-05T00:35:18.237222+00:00"},{"alias_kind":"pith_short_16","alias_value":"5I75L2HHKVBCCZGW","created_at":"2026-07-05T00:35:18.237222+00:00"},{"alias_kind":"pith_short_8","alias_value":"5I75L2HH","created_at":"2026-07-05T00:35:18.237222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25986","citing_title":"The Inference-Compute Frontier and a Latency-Efficient Architecture for Limit Order Book Prediction","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5I75L2HHKVBCCZGWGIHTRLK4YA","json":"https://pith.science/pith/5I75L2HHKVBCCZGWGIHTRLK4YA.json","graph_json":"https://pith.science/api/pith-number/5I75L2HHKVBCCZGWGIHTRLK4YA/graph.json","events_json":"https://pith.science/api/pith-number/5I75L2HHKVBCCZGWGIHTRLK4YA/events.json","paper":"https://pith.science/paper/5I75L2HH"},"agent_actions":{"view_html":"https://pith.science/pith/5I75L2HHKVBCCZGWGIHTRLK4YA","download_json":"https://pith.science/pith/5I75L2HHKVBCCZGWGIHTRLK4YA.json","view_paper":"https://pith.science/paper/5I75L2HH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03668&json=true","fetch_graph":"https://pith.science/api/pith-number/5I75L2HHKVBCCZGWGIHTRLK4YA/graph.json","fetch_events":"https://pith.science/api/pith-number/5I75L2HHKVBCCZGWGIHTRLK4YA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5I75L2HHKVBCCZGWGIHTRLK4YA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5I75L2HHKVBCCZGWGIHTRLK4YA/action/storage_attestation","attest_author":"https://pith.science/pith/5I75L2HHKVBCCZGWGIHTRLK4YA/action/author_attestation","sign_citation":"https://pith.science/pith/5I75L2HHKVBCCZGWGIHTRLK4YA/action/citation_signature","submit_replication":"https://pith.science/pith/5I75L2HHKVBCCZGWGIHTRLK4YA/action/replication_record"}},"created_at":"2026-07-05T00:35:18.237222+00:00","updated_at":"2026-07-05T00:35:18.237222+00:00"}