{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZGBOB65AITF2N5J6H67KHUGS4M","short_pith_number":"pith:ZGBOB65A","schema_version":"1.0","canonical_sha256":"c982e0fba044cba6f53e3fbea3d0d2e322c0ea0cad9a934494a02708613fc4fc","source":{"kind":"arxiv","id":"2108.13167","version":2},"attestation_state":"computed","paper":{"title":"Transportation Polytope and its Applications in Parallel Server Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.NI","authors_text":"Siva Theja Maguluri, Sushil Mahavir Varma","submitted_at":"2021-08-11T16:16:01Z","abstract_excerpt":"A parallel server system is a stochastic processing network with applications in manufacturing, supply chain, ride-hailing, call centers, etc. Heterogeneous customers arrive in the system, and only a subset of servers can serve any customer type given by the flexibility graph. The goal of the system operator is to minimize the delay that depends on the scheduling policy and the flexibility graph. A long line of literature focuses on designing near-optimal scheduling policies given a flexibility graph. On the contrary, we fix the scheduling policy to be the so-called MaxWeight scheduling given "},"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":"2108.13167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2021-08-11T16:16:01Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"e0cf8b23ff0c780064becfd01701655ca4095a5029136f6d9ec2d9b1455086e9","abstract_canon_sha256":"a1013f4c65b5e5a8668927f37e712412716d492ea178a5cb87df80acdb49b551"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:31:11.043812Z","signature_b64":"oufNArxwF7ZazWYY9dWhmv5tamaRBJIcqv+LYfQV6csKmZ23Ek4lupFvpq/1soT2+eV3ONb02j5bKRmqB2wmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c982e0fba044cba6f53e3fbea3d0d2e322c0ea0cad9a934494a02708613fc4fc","last_reissued_at":"2026-07-05T05:31:11.043324Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:31:11.043324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transportation Polytope and its Applications in Parallel Server Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.NI","authors_text":"Siva Theja Maguluri, Sushil Mahavir Varma","submitted_at":"2021-08-11T16:16:01Z","abstract_excerpt":"A parallel server system is a stochastic processing network with applications in manufacturing, supply chain, ride-hailing, call centers, etc. Heterogeneous customers arrive in the system, and only a subset of servers can serve any customer type given by the flexibility graph. The goal of the system operator is to minimize the delay that depends on the scheduling policy and the flexibility graph. A long line of literature focuses on designing near-optimal scheduling policies given a flexibility graph. On the contrary, we fix the scheduling policy to be the so-called MaxWeight scheduling given "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.13167","kind":"arxiv","version":2},"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/2108.13167/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":"2108.13167","created_at":"2026-07-05T05:31:11.043387+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.13167v2","created_at":"2026-07-05T05:31:11.043387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.13167","created_at":"2026-07-05T05:31:11.043387+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGBOB65AITF2","created_at":"2026-07-05T05:31:11.043387+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGBOB65AITF2N5J6","created_at":"2026-07-05T05:31:11.043387+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGBOB65A","created_at":"2026-07-05T05:31:11.043387+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.08218","citing_title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZGBOB65AITF2N5J6H67KHUGS4M","json":"https://pith.science/pith/ZGBOB65AITF2N5J6H67KHUGS4M.json","graph_json":"https://pith.science/api/pith-number/ZGBOB65AITF2N5J6H67KHUGS4M/graph.json","events_json":"https://pith.science/api/pith-number/ZGBOB65AITF2N5J6H67KHUGS4M/events.json","paper":"https://pith.science/paper/ZGBOB65A"},"agent_actions":{"view_html":"https://pith.science/pith/ZGBOB65AITF2N5J6H67KHUGS4M","download_json":"https://pith.science/pith/ZGBOB65AITF2N5J6H67KHUGS4M.json","view_paper":"https://pith.science/paper/ZGBOB65A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.13167&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGBOB65AITF2N5J6H67KHUGS4M/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGBOB65AITF2N5J6H67KHUGS4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGBOB65AITF2N5J6H67KHUGS4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGBOB65AITF2N5J6H67KHUGS4M/action/storage_attestation","attest_author":"https://pith.science/pith/ZGBOB65AITF2N5J6H67KHUGS4M/action/author_attestation","sign_citation":"https://pith.science/pith/ZGBOB65AITF2N5J6H67KHUGS4M/action/citation_signature","submit_replication":"https://pith.science/pith/ZGBOB65AITF2N5J6H67KHUGS4M/action/replication_record"}},"created_at":"2026-07-05T05:31:11.043387+00:00","updated_at":"2026-07-05T05:31:11.043387+00:00"}