{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VOIIP4ADARL22U2LHIV2GKINDF","short_pith_number":"pith:VOIIP4AD","schema_version":"1.0","canonical_sha256":"ab9087f0030457ad534b3a2ba3290d1967eb513db5e079a102fad8253bfc2a4d","source":{"kind":"arxiv","id":"1709.04102","version":1},"attestation_state":"computed","paper":{"title":"Delay, memory, and messaging tradeoffs in distributed service systems","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":"2017-09-13T01:33:49Z","abstract_excerpt":"We consider the following distributed service model: jobs with unit mean, exponentially distributed, and independent processing times arrive as a Poisson process of rate $\\lambda n$, with $0<\\lambda<1$, and are immediately dispatched by a centralized dispatcher to one of $n$ First-In-First-Out queues associated with $n$ identical servers. The dispatcher is endowed with a finite memory, and with the ability to exchange messages with the servers.\n  We propose and study a resource-constrained \"pull-based\" dispatching policy that involves two parameters: (i) the number of memory bits available at "},"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":"1709.04102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-09-13T01:33:49Z","cross_cats_sorted":[],"title_canon_sha256":"a2b77fa391b1cd6e560f3e14bcb01adc0590d2fed4dbf19efd002594cf5687e7","abstract_canon_sha256":"e61208a232f43d515648732fa69dd510871d4d749106fd777e73cc768dc6b5eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:15.458037Z","signature_b64":"5ZBSJ05wuwGv6vYGZLY6YoO+1z+7j/f4MSbTpKpYlNmKykOviLs4m+iYS2pI9uGqJjkoEAOyXwQBLvj1rScYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab9087f0030457ad534b3a2ba3290d1967eb513db5e079a102fad8253bfc2a4d","last_reissued_at":"2026-05-18T00:35:15.457441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:15.457441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delay, memory, and messaging tradeoffs in distributed service systems","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":"2017-09-13T01:33:49Z","abstract_excerpt":"We consider the following distributed service model: jobs with unit mean, exponentially distributed, and independent processing times arrive as a Poisson process of rate $\\lambda n$, with $0<\\lambda<1$, and are immediately dispatched by a centralized dispatcher to one of $n$ First-In-First-Out queues associated with $n$ identical servers. The dispatcher is endowed with a finite memory, and with the ability to exchange messages with the servers.\n  We propose and study a resource-constrained \"pull-based\" dispatching policy that involves two parameters: (i) the number of memory bits available at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04102","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":"1709.04102","created_at":"2026-05-18T00:35:15.457548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04102v1","created_at":"2026-05-18T00:35:15.457548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04102","created_at":"2026-05-18T00:35:15.457548+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOIIP4ADARL2","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOIIP4ADARL22U2L","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOIIP4AD","created_at":"2026-05-18T12:31:49.984773+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/VOIIP4ADARL22U2LHIV2GKINDF","json":"https://pith.science/pith/VOIIP4ADARL22U2LHIV2GKINDF.json","graph_json":"https://pith.science/api/pith-number/VOIIP4ADARL22U2LHIV2GKINDF/graph.json","events_json":"https://pith.science/api/pith-number/VOIIP4ADARL22U2LHIV2GKINDF/events.json","paper":"https://pith.science/paper/VOIIP4AD"},"agent_actions":{"view_html":"https://pith.science/pith/VOIIP4ADARL22U2LHIV2GKINDF","download_json":"https://pith.science/pith/VOIIP4ADARL22U2LHIV2GKINDF.json","view_paper":"https://pith.science/paper/VOIIP4AD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04102&json=true","fetch_graph":"https://pith.science/api/pith-number/VOIIP4ADARL22U2LHIV2GKINDF/graph.json","fetch_events":"https://pith.science/api/pith-number/VOIIP4ADARL22U2LHIV2GKINDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOIIP4ADARL22U2LHIV2GKINDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOIIP4ADARL22U2LHIV2GKINDF/action/storage_attestation","attest_author":"https://pith.science/pith/VOIIP4ADARL22U2LHIV2GKINDF/action/author_attestation","sign_citation":"https://pith.science/pith/VOIIP4ADARL22U2LHIV2GKINDF/action/citation_signature","submit_replication":"https://pith.science/pith/VOIIP4ADARL22U2LHIV2GKINDF/action/replication_record"}},"created_at":"2026-05-18T00:35:15.457548+00:00","updated_at":"2026-05-18T00:35:15.457548+00:00"}