{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CWAO56LPFY2GO6NS5UENX54IE2","short_pith_number":"pith:CWAO56LP","schema_version":"1.0","canonical_sha256":"1580eef96f2e346779b2ed08dbf78826b3a9fd6bf0b0f497f4327c24968f64f9","source":{"kind":"arxiv","id":"1807.02882","version":1},"attestation_state":"computed","paper":{"title":"A lower bound on the queueing delay in resource constrained load balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Gamarnik, John N. Tsitsiklis, Martin Zubeldia","submitted_at":"2018-07-08T20:53:45Z","abstract_excerpt":"We consider the following distributed service model: jobs with unit mean, general distribution, and independent processing times arrive as a renewal process of rate $\\lambda n$, with $0<\\lambda<1$, and are immediately dispatched to one of several queues associated with $n$ identical servers with unit processing rate. We assume that the dispatching decisions are made by a central dispatcher endowed with a finite memory, and with the ability to exchange messages with the servers.\n  We study the fundamental resource requirements (memory bits and message exchange rate), in order to drive the expec"},"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":"1807.02882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-08T20:53:45Z","cross_cats_sorted":[],"title_canon_sha256":"3a54732c8ec54991fd9daf9ee67b25a690a3c0b864c230b622cd622aec66316d","abstract_canon_sha256":"b8bde23ce147f3a0d23fbef7c30ef98a6787a9e72343c81eaac0514e3c781a1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:13.466015Z","signature_b64":"pcdZSqsj7az3ie7qog6Z3mdICtvnVT3iDe8GgAMUtQDHHF6AG2grkqsxEP8kRUI4/rzInl1KdErZBx/1k7eqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1580eef96f2e346779b2ed08dbf78826b3a9fd6bf0b0f497f4327c24968f64f9","last_reissued_at":"2026-05-18T00:11:13.465287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:13.465287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound on the queueing delay in resource constrained load balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Gamarnik, John N. Tsitsiklis, Martin Zubeldia","submitted_at":"2018-07-08T20:53:45Z","abstract_excerpt":"We consider the following distributed service model: jobs with unit mean, general distribution, and independent processing times arrive as a renewal process of rate $\\lambda n$, with $0<\\lambda<1$, and are immediately dispatched to one of several queues associated with $n$ identical servers with unit processing rate. We assume that the dispatching decisions are made by a central dispatcher endowed with a finite memory, and with the ability to exchange messages with the servers.\n  We study the fundamental resource requirements (memory bits and message exchange rate), in order to drive the expec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02882","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":"1807.02882","created_at":"2026-05-18T00:11:13.465403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02882v1","created_at":"2026-05-18T00:11:13.465403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02882","created_at":"2026-05-18T00:11:13.465403+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWAO56LPFY2G","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWAO56LPFY2GO6NS","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWAO56LP","created_at":"2026-05-18T12:32:19.392346+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/CWAO56LPFY2GO6NS5UENX54IE2","json":"https://pith.science/pith/CWAO56LPFY2GO6NS5UENX54IE2.json","graph_json":"https://pith.science/api/pith-number/CWAO56LPFY2GO6NS5UENX54IE2/graph.json","events_json":"https://pith.science/api/pith-number/CWAO56LPFY2GO6NS5UENX54IE2/events.json","paper":"https://pith.science/paper/CWAO56LP"},"agent_actions":{"view_html":"https://pith.science/pith/CWAO56LPFY2GO6NS5UENX54IE2","download_json":"https://pith.science/pith/CWAO56LPFY2GO6NS5UENX54IE2.json","view_paper":"https://pith.science/paper/CWAO56LP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02882&json=true","fetch_graph":"https://pith.science/api/pith-number/CWAO56LPFY2GO6NS5UENX54IE2/graph.json","fetch_events":"https://pith.science/api/pith-number/CWAO56LPFY2GO6NS5UENX54IE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWAO56LPFY2GO6NS5UENX54IE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWAO56LPFY2GO6NS5UENX54IE2/action/storage_attestation","attest_author":"https://pith.science/pith/CWAO56LPFY2GO6NS5UENX54IE2/action/author_attestation","sign_citation":"https://pith.science/pith/CWAO56LPFY2GO6NS5UENX54IE2/action/citation_signature","submit_replication":"https://pith.science/pith/CWAO56LPFY2GO6NS5UENX54IE2/action/replication_record"}},"created_at":"2026-05-18T00:11:13.465403+00:00","updated_at":"2026-05-18T00:11:13.465403+00:00"}