{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HJORAIDSANTURZOX6HZSVGLZNW","short_pith_number":"pith:HJORAIDS","schema_version":"1.0","canonical_sha256":"3a5d102072036748e5d7f1f32a99796da607807db949ac42183632d1bca262a7","source":{"kind":"arxiv","id":"1603.09666","version":1},"attestation_state":"computed","paper":{"title":"Low-traffic limit and first-passage times for a simple model of the continuous double auction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.TR"],"primary_cat":"math.PR","authors_text":"Enrico Scalas, Fabio Rapallo, Tijana Radivojevi\\'c","submitted_at":"2016-03-31T16:25:32Z","abstract_excerpt":"We consider a simplified model of the continuous double auction where prices are integers varying from $1$ to $N$ with limit orders and market orders, but quantity per order limited to a single share. For this model, the order process is equivalent to two $M/M/1$ queues. We study the behaviour of the auction in the low-traffic limit where limit orders are immediately transformed into market orders. In this limit, the distribution of prices can be computed exactly and gives a reasonable approximation of the price distribution when the ratio between the rate of order arrivals and the rate of ord"},"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":"1603.09666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-31T16:25:32Z","cross_cats_sorted":["q-fin.TR"],"title_canon_sha256":"3424c87c16c6749050e3e813c7fc389709d92cff8fb6ad0217eacda89c4f1f8f","abstract_canon_sha256":"78313622615a7f297efe32cae66e54d9644c9b820bc439d2e8d29025ffcfe48a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:41.919370Z","signature_b64":"juEqO1TPgAhostuzzkewn+jCakS605lDQoCkahple2/DY+G6fxFPdZ6Bffiz422Ua9D00bapJBpenaBWZfqrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a5d102072036748e5d7f1f32a99796da607807db949ac42183632d1bca262a7","last_reissued_at":"2026-05-18T00:41:41.918898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:41.918898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-traffic limit and first-passage times for a simple model of the continuous double auction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.TR"],"primary_cat":"math.PR","authors_text":"Enrico Scalas, Fabio Rapallo, Tijana Radivojevi\\'c","submitted_at":"2016-03-31T16:25:32Z","abstract_excerpt":"We consider a simplified model of the continuous double auction where prices are integers varying from $1$ to $N$ with limit orders and market orders, but quantity per order limited to a single share. For this model, the order process is equivalent to two $M/M/1$ queues. We study the behaviour of the auction in the low-traffic limit where limit orders are immediately transformed into market orders. In this limit, the distribution of prices can be computed exactly and gives a reasonable approximation of the price distribution when the ratio between the rate of order arrivals and the rate of ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09666","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":"1603.09666","created_at":"2026-05-18T00:41:41.918967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09666v1","created_at":"2026-05-18T00:41:41.918967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09666","created_at":"2026-05-18T00:41:41.918967+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJORAIDSANTU","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJORAIDSANTURZOX","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJORAIDS","created_at":"2026-05-18T12:30:19.053100+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/HJORAIDSANTURZOX6HZSVGLZNW","json":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW.json","graph_json":"https://pith.science/api/pith-number/HJORAIDSANTURZOX6HZSVGLZNW/graph.json","events_json":"https://pith.science/api/pith-number/HJORAIDSANTURZOX6HZSVGLZNW/events.json","paper":"https://pith.science/paper/HJORAIDS"},"agent_actions":{"view_html":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW","download_json":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW.json","view_paper":"https://pith.science/paper/HJORAIDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09666&json=true","fetch_graph":"https://pith.science/api/pith-number/HJORAIDSANTURZOX6HZSVGLZNW/graph.json","fetch_events":"https://pith.science/api/pith-number/HJORAIDSANTURZOX6HZSVGLZNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW/action/storage_attestation","attest_author":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW/action/author_attestation","sign_citation":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW/action/citation_signature","submit_replication":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW/action/replication_record"}},"created_at":"2026-05-18T00:41:41.918967+00:00","updated_at":"2026-05-18T00:41:41.918967+00:00"}