{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MDH34QE4BS4E7ZDRTUNIRKTHQY","short_pith_number":"pith:MDH34QE4","schema_version":"1.0","canonical_sha256":"60cfbe409c0cb84fe4719d1a88aa67863826abcbd522e3a191c1d0d5b3365902","source":{"kind":"arxiv","id":"2502.15757","version":3},"attestation_state":"computed","paper":{"title":"TLOB: A Novel Transformer Model with Dual Attention for Price Trend Prediction with Limit Order Book Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","q-fin.TR"],"primary_cat":"q-fin.ST","authors_text":"Gjergji Kasneci, Leonardo Berti","submitted_at":"2025-02-12T12:41:10Z","abstract_excerpt":"Price Trend Prediction (PTP) based on Limit Order Book (LOB) data is a fundamental challenge in financial markets. Despite advances in deep learning, existing models fail to generalize across different market conditions and assets. Surprisingly, by adapting a simple MLP-based architecture to LOB, we show that we surpass SoTA performance; thus, challenging the necessity of complex architectures. Unlike past work that shows robustness issues, we propose TLOB, a transformer-based model that uses a dual attention mechanism to capture spatial and temporal dependencies in LOB data. This allows it to"},"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":"2502.15757","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"q-fin.ST","submitted_at":"2025-02-12T12:41:10Z","cross_cats_sorted":["cs.AI","cs.LG","q-fin.TR"],"title_canon_sha256":"8cc8ffa1afff8ea8becd8bd00016ff8ae2f247a5b7649f9c859aaaf5fc5bfc13","abstract_canon_sha256":"ecb6d2aaabb439db558a81a62960a4fa3aade19ec9f2cdb2aa2572ce2ee0385b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:04.914866Z","signature_b64":"fMTlGlgtVYg2G15fzFy0IwXDlkBpJUuNzX2X9l2FhI3EjyBADvewIMVSWRY4ImFyJ4wbbJIS97klShXaSH3kBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60cfbe409c0cb84fe4719d1a88aa67863826abcbd522e3a191c1d0d5b3365902","last_reissued_at":"2026-07-05T11:00:04.914385Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:04.914385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TLOB: A Novel Transformer Model with Dual Attention for Price Trend Prediction with Limit Order Book Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","q-fin.TR"],"primary_cat":"q-fin.ST","authors_text":"Gjergji Kasneci, Leonardo Berti","submitted_at":"2025-02-12T12:41:10Z","abstract_excerpt":"Price Trend Prediction (PTP) based on Limit Order Book (LOB) data is a fundamental challenge in financial markets. Despite advances in deep learning, existing models fail to generalize across different market conditions and assets. Surprisingly, by adapting a simple MLP-based architecture to LOB, we show that we surpass SoTA performance; thus, challenging the necessity of complex architectures. Unlike past work that shows robustness issues, we propose TLOB, a transformer-based model that uses a dual attention mechanism to capture spatial and temporal dependencies in LOB data. This allows it to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.15757","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/2502.15757/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":"2502.15757","created_at":"2026-07-05T11:00:04.914445+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.15757v3","created_at":"2026-07-05T11:00:04.914445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.15757","created_at":"2026-07-05T11:00:04.914445+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDH34QE4BS4E","created_at":"2026-07-05T11:00:04.914445+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDH34QE4BS4E7ZDR","created_at":"2026-07-05T11:00:04.914445+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDH34QE4","created_at":"2026-07-05T11:00:04.914445+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":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MDH34QE4BS4E7ZDRTUNIRKTHQY","json":"https://pith.science/pith/MDH34QE4BS4E7ZDRTUNIRKTHQY.json","graph_json":"https://pith.science/api/pith-number/MDH34QE4BS4E7ZDRTUNIRKTHQY/graph.json","events_json":"https://pith.science/api/pith-number/MDH34QE4BS4E7ZDRTUNIRKTHQY/events.json","paper":"https://pith.science/paper/MDH34QE4"},"agent_actions":{"view_html":"https://pith.science/pith/MDH34QE4BS4E7ZDRTUNIRKTHQY","download_json":"https://pith.science/pith/MDH34QE4BS4E7ZDRTUNIRKTHQY.json","view_paper":"https://pith.science/paper/MDH34QE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.15757&json=true","fetch_graph":"https://pith.science/api/pith-number/MDH34QE4BS4E7ZDRTUNIRKTHQY/graph.json","fetch_events":"https://pith.science/api/pith-number/MDH34QE4BS4E7ZDRTUNIRKTHQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDH34QE4BS4E7ZDRTUNIRKTHQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDH34QE4BS4E7ZDRTUNIRKTHQY/action/storage_attestation","attest_author":"https://pith.science/pith/MDH34QE4BS4E7ZDRTUNIRKTHQY/action/author_attestation","sign_citation":"https://pith.science/pith/MDH34QE4BS4E7ZDRTUNIRKTHQY/action/citation_signature","submit_replication":"https://pith.science/pith/MDH34QE4BS4E7ZDRTUNIRKTHQY/action/replication_record"}},"created_at":"2026-07-05T11:00:04.914445+00:00","updated_at":"2026-07-05T11:00:04.914445+00:00"}