{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:72U6ZC4PCQFUSTWHLCHDGMVVYX","short_pith_number":"pith:72U6ZC4P","schema_version":"1.0","canonical_sha256":"fea9ec8b8f140b494ec7588e3332b5c5fe557beab76224848d946f99a2e84768","source":{"kind":"arxiv","id":"1408.3641","version":1},"attestation_state":"computed","paper":{"title":"Convergence of tandem Brownian queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sergio I. L\\'opez","submitted_at":"2014-08-15T20:10:01Z","abstract_excerpt":"It is known that in a stationary Brownian queue with both arrival and service processes equal in law to Brownian motion, the departure process is a Brownian motion, that is, Burke's theorem in this context. In this short note we prove convergence to this invariant measure: if we have an arbitrary continuous process satisfying some mild conditions as initial arrival process and pass it through an infinite tandem network of queues, the resulting process weakly converges to a Brownian motion. We assume independent and exponential initial workloads for all queues."},"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":"1408.3641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-15T20:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"80db980d17b5071b8022d3ffa88060da09ab3a00388056a28e2da8f8673ebb6f","abstract_canon_sha256":"a2c86fa73b73e71431bb3fc3133118b2f8136881dfd25a5edaea13a2de4d6351"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:57.942421Z","signature_b64":"GvyMtjQHegHfuyLsvJmQCbXJzSDLu8tN+HrTp9T6mV0vvXAEtcIhWwT+zQhKNG20TFWlg99AOJdkBvcfBCPsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fea9ec8b8f140b494ec7588e3332b5c5fe557beab76224848d946f99a2e84768","last_reissued_at":"2026-05-18T01:11:57.941996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:57.941996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence of tandem Brownian queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sergio I. L\\'opez","submitted_at":"2014-08-15T20:10:01Z","abstract_excerpt":"It is known that in a stationary Brownian queue with both arrival and service processes equal in law to Brownian motion, the departure process is a Brownian motion, that is, Burke's theorem in this context. In this short note we prove convergence to this invariant measure: if we have an arbitrary continuous process satisfying some mild conditions as initial arrival process and pass it through an infinite tandem network of queues, the resulting process weakly converges to a Brownian motion. We assume independent and exponential initial workloads for all queues."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3641","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":"1408.3641","created_at":"2026-05-18T01:11:57.942072+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3641v1","created_at":"2026-05-18T01:11:57.942072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3641","created_at":"2026-05-18T01:11:57.942072+00:00"},{"alias_kind":"pith_short_12","alias_value":"72U6ZC4PCQFU","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"72U6ZC4PCQFUSTWH","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"72U6ZC4P","created_at":"2026-05-18T12:28:16.859392+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/72U6ZC4PCQFUSTWHLCHDGMVVYX","json":"https://pith.science/pith/72U6ZC4PCQFUSTWHLCHDGMVVYX.json","graph_json":"https://pith.science/api/pith-number/72U6ZC4PCQFUSTWHLCHDGMVVYX/graph.json","events_json":"https://pith.science/api/pith-number/72U6ZC4PCQFUSTWHLCHDGMVVYX/events.json","paper":"https://pith.science/paper/72U6ZC4P"},"agent_actions":{"view_html":"https://pith.science/pith/72U6ZC4PCQFUSTWHLCHDGMVVYX","download_json":"https://pith.science/pith/72U6ZC4PCQFUSTWHLCHDGMVVYX.json","view_paper":"https://pith.science/paper/72U6ZC4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3641&json=true","fetch_graph":"https://pith.science/api/pith-number/72U6ZC4PCQFUSTWHLCHDGMVVYX/graph.json","fetch_events":"https://pith.science/api/pith-number/72U6ZC4PCQFUSTWHLCHDGMVVYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72U6ZC4PCQFUSTWHLCHDGMVVYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72U6ZC4PCQFUSTWHLCHDGMVVYX/action/storage_attestation","attest_author":"https://pith.science/pith/72U6ZC4PCQFUSTWHLCHDGMVVYX/action/author_attestation","sign_citation":"https://pith.science/pith/72U6ZC4PCQFUSTWHLCHDGMVVYX/action/citation_signature","submit_replication":"https://pith.science/pith/72U6ZC4PCQFUSTWHLCHDGMVVYX/action/replication_record"}},"created_at":"2026-05-18T01:11:57.942072+00:00","updated_at":"2026-05-18T01:11:57.942072+00:00"}