{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KCHVUR74OF7EQK6T7PMSHQW42I","short_pith_number":"pith:KCHVUR74","schema_version":"1.0","canonical_sha256":"508f5a47fc717e482bd3fbd923c2dcd22d0c7150667e2cb224a049178ebbca2b","source":{"kind":"arxiv","id":"2403.09267","version":4},"attestation_state":"computed","paper":{"title":"Deep Limit Order Book Forecasting","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"q-fin.TR","authors_text":"Antonio Briola, Silvia Bartolucci, Tomaso Aste","submitted_at":"2024-03-14T10:44:10Z","abstract_excerpt":"We exploit cutting-edge deep learning methodologies to explore the predictability of high-frequency Limit Order Book mid-price changes for a heterogeneous set of stocks traded on the NASDAQ exchange. In so doing, we release `LOBFrame', an open-source code base to efficiently process large-scale Limit Order Book data and quantitatively assess state-of-the-art deep learning models' forecasting capabilities. Our results are twofold. We demonstrate that the stocks' microstructural characteristics influence the efficacy of deep learning methods and that their high forecasting power does not necessa"},"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":"2403.09267","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"q-fin.TR","submitted_at":"2024-03-14T10:44:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"92e72e2bd6118c575598d9966c2bfdc1b743b22fa78699b0b5d0f8bdccfa5bfe","abstract_canon_sha256":"1aaabe43ab5e7723d6e39380146e1b74390c96815eef265a0837e8186e27ed79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:06.363058Z","signature_b64":"HE6kNZ0KG9GOnS8btsd10StIrD9grI/7pSM5iqjWc2aw9MamjWLzZ0nwSnyhaySSJSS+EVpGBOCT4gwO9Cw2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"508f5a47fc717e482bd3fbd923c2dcd22d0c7150667e2cb224a049178ebbca2b","last_reissued_at":"2026-07-05T08:27:06.362639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:06.362639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Limit Order Book Forecasting","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"q-fin.TR","authors_text":"Antonio Briola, Silvia Bartolucci, Tomaso Aste","submitted_at":"2024-03-14T10:44:10Z","abstract_excerpt":"We exploit cutting-edge deep learning methodologies to explore the predictability of high-frequency Limit Order Book mid-price changes for a heterogeneous set of stocks traded on the NASDAQ exchange. In so doing, we release `LOBFrame', an open-source code base to efficiently process large-scale Limit Order Book data and quantitatively assess state-of-the-art deep learning models' forecasting capabilities. Our results are twofold. We demonstrate that the stocks' microstructural characteristics influence the efficacy of deep learning methods and that their high forecasting power does not necessa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09267","kind":"arxiv","version":4},"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/2403.09267/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":"2403.09267","created_at":"2026-07-05T08:27:06.362694+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.09267v4","created_at":"2026-07-05T08:27:06.362694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09267","created_at":"2026-07-05T08:27:06.362694+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCHVUR74OF7E","created_at":"2026-07-05T08:27:06.362694+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCHVUR74OF7EQK6T","created_at":"2026-07-05T08:27:06.362694+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCHVUR74","created_at":"2026-07-05T08:27:06.362694+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":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KCHVUR74OF7EQK6T7PMSHQW42I","json":"https://pith.science/pith/KCHVUR74OF7EQK6T7PMSHQW42I.json","graph_json":"https://pith.science/api/pith-number/KCHVUR74OF7EQK6T7PMSHQW42I/graph.json","events_json":"https://pith.science/api/pith-number/KCHVUR74OF7EQK6T7PMSHQW42I/events.json","paper":"https://pith.science/paper/KCHVUR74"},"agent_actions":{"view_html":"https://pith.science/pith/KCHVUR74OF7EQK6T7PMSHQW42I","download_json":"https://pith.science/pith/KCHVUR74OF7EQK6T7PMSHQW42I.json","view_paper":"https://pith.science/paper/KCHVUR74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.09267&json=true","fetch_graph":"https://pith.science/api/pith-number/KCHVUR74OF7EQK6T7PMSHQW42I/graph.json","fetch_events":"https://pith.science/api/pith-number/KCHVUR74OF7EQK6T7PMSHQW42I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCHVUR74OF7EQK6T7PMSHQW42I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCHVUR74OF7EQK6T7PMSHQW42I/action/storage_attestation","attest_author":"https://pith.science/pith/KCHVUR74OF7EQK6T7PMSHQW42I/action/author_attestation","sign_citation":"https://pith.science/pith/KCHVUR74OF7EQK6T7PMSHQW42I/action/citation_signature","submit_replication":"https://pith.science/pith/KCHVUR74OF7EQK6T7PMSHQW42I/action/replication_record"}},"created_at":"2026-07-05T08:27:06.362694+00:00","updated_at":"2026-07-05T08:27:06.362694+00:00"}