{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HJORAIDSANTURZOX6HZSVGLZNW","short_pith_number":"pith:HJORAIDS","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"},"canonical_sha256":"3a5d102072036748e5d7f1f32a99796da607807db949ac42183632d1bca262a7","source":{"kind":"arxiv","id":"1603.09666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09666","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09666v1","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09666","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"HJORAIDSANTU","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJORAIDSANTURZOX","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJORAIDS","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HJORAIDSANTURZOX6HZSVGLZNW","target":"record","payload":{"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"},"canonical_sha256":"3a5d102072036748e5d7f1f32a99796da607807db949ac42183632d1bca262a7","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"},"source_kind":"arxiv","source_id":"1603.09666","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fwbnrDdA5oc7UKudFXwj+I7v7ey70KOw6ZmS4PyPe8pHMWugh3/2+VfzBWx+pc5QcVyqQdgeNqD16I+X5ENGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:56:25.865194Z"},"content_sha256":"4fbf963fc2706c1e597601247545ded3139310a65085c4ec8c63d417655fabd4","schema_version":"1.0","event_id":"sha256:4fbf963fc2706c1e597601247545ded3139310a65085c4ec8c63d417655fabd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HJORAIDSANTURZOX6HZSVGLZNW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nZ2C2cbWo33erP2eTb0KuxhS6+CQb86fR4EBTkfoLNyeG5tCMq9TKPygn6RYdaofYFyzloRxeCY5V37jvUOnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:56:25.865584Z"},"content_sha256":"fc2d945bc150eba76e0d0a2b956429676a571b0eb91b474e46a00f81ab9bda76","schema_version":"1.0","event_id":"sha256:fc2d945bc150eba76e0d0a2b956429676a571b0eb91b474e46a00f81ab9bda76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW/bundle.json","state_url":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJORAIDSANTURZOX6HZSVGLZNW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T17:56:25Z","links":{"resolver":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW","bundle":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW/bundle.json","state":"https://pith.science/pith/HJORAIDSANTURZOX6HZSVGLZNW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJORAIDSANTURZOX6HZSVGLZNW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HJORAIDSANTURZOX6HZSVGLZNW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"78313622615a7f297efe32cae66e54d9644c9b820bc439d2e8d29025ffcfe48a","cross_cats_sorted":["q-fin.TR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-31T16:25:32Z","title_canon_sha256":"3424c87c16c6749050e3e813c7fc389709d92cff8fb6ad0217eacda89c4f1f8f"},"schema_version":"1.0","source":{"id":"1603.09666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09666","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09666v1","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09666","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"HJORAIDSANTU","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJORAIDSANTURZOX","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJORAIDS","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:fc2d945bc150eba76e0d0a2b956429676a571b0eb91b474e46a00f81ab9bda76","target":"graph","created_at":"2026-05-18T00:41:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Enrico Scalas, Fabio Rapallo, Tijana Radivojevi\\'c","cross_cats":["q-fin.TR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-31T16:25:32Z","title":"Low-traffic limit and first-passage times for a simple model of the continuous double auction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09666","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4fbf963fc2706c1e597601247545ded3139310a65085c4ec8c63d417655fabd4","target":"record","created_at":"2026-05-18T00:41:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"78313622615a7f297efe32cae66e54d9644c9b820bc439d2e8d29025ffcfe48a","cross_cats_sorted":["q-fin.TR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-31T16:25:32Z","title_canon_sha256":"3424c87c16c6749050e3e813c7fc389709d92cff8fb6ad0217eacda89c4f1f8f"},"schema_version":"1.0","source":{"id":"1603.09666","kind":"arxiv","version":1}},"canonical_sha256":"3a5d102072036748e5d7f1f32a99796da607807db949ac42183632d1bca262a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a5d102072036748e5d7f1f32a99796da607807db949ac42183632d1bca262a7","first_computed_at":"2026-05-18T00:41:41.918898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:41.918898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"juEqO1TPgAhostuzzkewn+jCakS605lDQoCkahple2/DY+G6fxFPdZ6Bffiz422Ua9D00bapJBpenaBWZfqrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:41.919370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fbf963fc2706c1e597601247545ded3139310a65085c4ec8c63d417655fabd4","sha256:fc2d945bc150eba76e0d0a2b956429676a571b0eb91b474e46a00f81ab9bda76"],"state_sha256":"4f51a730cdc34f7b5ca5719da9fa42f4fc8a88daf5cc195cbcb57fe3efcf47cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKHa96jp2F7z2U4aTmqKPKUkMdJ4YzS+aiEy7i4LQQFWIgdHzMwTilSKx/UxwnTBTtsZoE2RnMkUdDaYna01Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:56:25.868276Z","bundle_sha256":"d1ea45a1970f63492c54041b296742a6f84dd5b3f09b18dfb405ca33a519b502"}}