{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PXHAKVNOWXPOMSOPMPTRJXTFV7","short_pith_number":"pith:PXHAKVNO","schema_version":"1.0","canonical_sha256":"7dce0555aeb5dee649cf63e714de65aff39c13938c178be651b76c981b85c6a9","source":{"kind":"arxiv","id":"2407.12716","version":4},"attestation_state":"computed","paper":{"title":"Diffusion approximation error for queueing systems with general primitives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anton Braverman, Ziv Scully","submitted_at":"2024-07-17T16:37:48Z","abstract_excerpt":"We investigate the steady-state diffusion-approximation error for continuous-time queueing systems with generally distributed primitives. A common picture emerges after analyzing a number of canonical systems: the error decomposes into interior and boundary terms. The former are simpler to handle and can be bounded using only low-order moments of the system's primitives -- when the approximation error is measured using the Wasserstein distance, three moments suffice. The boundary terms are inherently more delicate: while crude bounds are easy to obtain, sharper (e.g., order optimal) bounds req"},"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":"2407.12716","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2024-07-17T16:37:48Z","cross_cats_sorted":[],"title_canon_sha256":"3b24e11cd24b17711c640d19afac44c98746e3feaedf794ff270367b33a06bb8","abstract_canon_sha256":"8d14a6da94835fb6f54fd32d67f7f5e269fbd040ef9c2c41e48fdc6987954e03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:23.615785Z","signature_b64":"3YQcPDwfdF64D2R/iIe62KgRRTbLEbeoBhe22M3ntY/b0KRK6cu/G8RPbPpEW2xg/+8CfajbPIyw/O/32XJmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dce0555aeb5dee649cf63e714de65aff39c13938c178be651b76c981b85c6a9","last_reissued_at":"2026-07-01T01:18:23.615035Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:23.615035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diffusion approximation error for queueing systems with general primitives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anton Braverman, Ziv Scully","submitted_at":"2024-07-17T16:37:48Z","abstract_excerpt":"We investigate the steady-state diffusion-approximation error for continuous-time queueing systems with generally distributed primitives. A common picture emerges after analyzing a number of canonical systems: the error decomposes into interior and boundary terms. The former are simpler to handle and can be bounded using only low-order moments of the system's primitives -- when the approximation error is measured using the Wasserstein distance, three moments suffice. The boundary terms are inherently more delicate: while crude bounds are easy to obtain, sharper (e.g., order optimal) bounds req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.12716","kind":"arxiv","version":4},"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/2407.12716/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":"2407.12716","created_at":"2026-07-01T01:18:23.615114+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.12716v4","created_at":"2026-07-01T01:18:23.615114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.12716","created_at":"2026-07-01T01:18:23.615114+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXHAKVNOWXPO","created_at":"2026-07-01T01:18:23.615114+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXHAKVNOWXPOMSOP","created_at":"2026-07-01T01:18:23.615114+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXHAKVNO","created_at":"2026-07-01T01:18:23.615114+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.11015","citing_title":"A new $1/(1-\\rho)$-scaling bound for multiserver queues via a leave-one-out technique","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PXHAKVNOWXPOMSOPMPTRJXTFV7","json":"https://pith.science/pith/PXHAKVNOWXPOMSOPMPTRJXTFV7.json","graph_json":"https://pith.science/api/pith-number/PXHAKVNOWXPOMSOPMPTRJXTFV7/graph.json","events_json":"https://pith.science/api/pith-number/PXHAKVNOWXPOMSOPMPTRJXTFV7/events.json","paper":"https://pith.science/paper/PXHAKVNO"},"agent_actions":{"view_html":"https://pith.science/pith/PXHAKVNOWXPOMSOPMPTRJXTFV7","download_json":"https://pith.science/pith/PXHAKVNOWXPOMSOPMPTRJXTFV7.json","view_paper":"https://pith.science/paper/PXHAKVNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.12716&json=true","fetch_graph":"https://pith.science/api/pith-number/PXHAKVNOWXPOMSOPMPTRJXTFV7/graph.json","fetch_events":"https://pith.science/api/pith-number/PXHAKVNOWXPOMSOPMPTRJXTFV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXHAKVNOWXPOMSOPMPTRJXTFV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXHAKVNOWXPOMSOPMPTRJXTFV7/action/storage_attestation","attest_author":"https://pith.science/pith/PXHAKVNOWXPOMSOPMPTRJXTFV7/action/author_attestation","sign_citation":"https://pith.science/pith/PXHAKVNOWXPOMSOPMPTRJXTFV7/action/citation_signature","submit_replication":"https://pith.science/pith/PXHAKVNOWXPOMSOPMPTRJXTFV7/action/replication_record"}},"created_at":"2026-07-01T01:18:23.615114+00:00","updated_at":"2026-07-01T01:18:23.615114+00:00"}