{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ODU6BVHG5BHPLMIWMUIX3G7RIK","short_pith_number":"pith:ODU6BVHG","schema_version":"1.0","canonical_sha256":"70e9e0d4e6e84ef5b11665117d9bf142aaed3ee49dcc5c2f8f91501f1d3209f8","source":{"kind":"arxiv","id":"2306.12806","version":1},"attestation_state":"computed","paper":{"title":"Conditional Generators for Limit Order Book Environments: Explainability, Challenges, and Robustness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CE","cs.LG"],"primary_cat":"q-fin.TR","authors_text":"Andrea Coletta, Joseph Jerome, Rahul Savani, Svitlana Vyetrenko","submitted_at":"2023-06-22T11:06:04Z","abstract_excerpt":"Limit order books are a fundamental and widespread market mechanism. This paper investigates the use of conditional generative models for order book simulation. For developing a trading agent, this approach has drawn recent attention as an alternative to traditional backtesting due to its ability to react to the presence of the trading agent. Using a state-of-the-art CGAN (from Coletta et al. (2022)), we explore its dependence upon input features, which highlights both strengths and weaknesses. To do this, we use \"adversarial attacks\" on the model's features and its mechanism. We then show how"},"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":"2306.12806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.TR","submitted_at":"2023-06-22T11:06:04Z","cross_cats_sorted":["cs.AI","cs.CE","cs.LG"],"title_canon_sha256":"7cde6afcd94d0e375cac868326b47043787a613ab5d541964ddaec1785bbc5d7","abstract_canon_sha256":"3cc1d6ecb3d02dde59e1f34b9ccded7bb05c35ce9e14a062b6b9bf95c4dc7a41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:48.179362Z","signature_b64":"IfBgLtBdyrCfGKTm8EVTBTx6f6UtkUQNwpRp7zHi6gnr2zhH2ISOAao8IAC8Qt+WJ9N3Qof4fjMRofviEOtFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70e9e0d4e6e84ef5b11665117d9bf142aaed3ee49dcc5c2f8f91501f1d3209f8","last_reissued_at":"2026-07-05T06:23:48.178957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:48.178957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional Generators for Limit Order Book Environments: Explainability, Challenges, and Robustness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CE","cs.LG"],"primary_cat":"q-fin.TR","authors_text":"Andrea Coletta, Joseph Jerome, Rahul Savani, Svitlana Vyetrenko","submitted_at":"2023-06-22T11:06:04Z","abstract_excerpt":"Limit order books are a fundamental and widespread market mechanism. This paper investigates the use of conditional generative models for order book simulation. For developing a trading agent, this approach has drawn recent attention as an alternative to traditional backtesting due to its ability to react to the presence of the trading agent. Using a state-of-the-art CGAN (from Coletta et al. (2022)), we explore its dependence upon input features, which highlights both strengths and weaknesses. To do this, we use \"adversarial attacks\" on the model's features and its mechanism. We then show how"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.12806","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.12806/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":"2306.12806","created_at":"2026-07-05T06:23:48.179021+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.12806v1","created_at":"2026-07-05T06:23:48.179021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.12806","created_at":"2026-07-05T06:23:48.179021+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODU6BVHG5BHP","created_at":"2026-07-05T06:23:48.179021+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODU6BVHG5BHPLMIW","created_at":"2026-07-05T06:23:48.179021+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODU6BVHG","created_at":"2026-07-05T06:23:48.179021+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.08822","citing_title":"Deep Learning Meets Queue-Reactive: A Framework for Realistic Limit Order Book Simulation","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODU6BVHG5BHPLMIWMUIX3G7RIK","json":"https://pith.science/pith/ODU6BVHG5BHPLMIWMUIX3G7RIK.json","graph_json":"https://pith.science/api/pith-number/ODU6BVHG5BHPLMIWMUIX3G7RIK/graph.json","events_json":"https://pith.science/api/pith-number/ODU6BVHG5BHPLMIWMUIX3G7RIK/events.json","paper":"https://pith.science/paper/ODU6BVHG"},"agent_actions":{"view_html":"https://pith.science/pith/ODU6BVHG5BHPLMIWMUIX3G7RIK","download_json":"https://pith.science/pith/ODU6BVHG5BHPLMIWMUIX3G7RIK.json","view_paper":"https://pith.science/paper/ODU6BVHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.12806&json=true","fetch_graph":"https://pith.science/api/pith-number/ODU6BVHG5BHPLMIWMUIX3G7RIK/graph.json","fetch_events":"https://pith.science/api/pith-number/ODU6BVHG5BHPLMIWMUIX3G7RIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODU6BVHG5BHPLMIWMUIX3G7RIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODU6BVHG5BHPLMIWMUIX3G7RIK/action/storage_attestation","attest_author":"https://pith.science/pith/ODU6BVHG5BHPLMIWMUIX3G7RIK/action/author_attestation","sign_citation":"https://pith.science/pith/ODU6BVHG5BHPLMIWMUIX3G7RIK/action/citation_signature","submit_replication":"https://pith.science/pith/ODU6BVHG5BHPLMIWMUIX3G7RIK/action/replication_record"}},"created_at":"2026-07-05T06:23:48.179021+00:00","updated_at":"2026-07-05T06:23:48.179021+00:00"}