{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KOEUO2GSG5M5Z3C3D32EXO4NC2","short_pith_number":"pith:KOEUO2GS","schema_version":"1.0","canonical_sha256":"53894768d23759dcec5b1ef44bbb8d16854cbc63093ab3e3a0f079ceabd744ca","source":{"kind":"arxiv","id":"1105.0417","version":1},"attestation_state":"computed","paper":{"title":"Cone Schedules for Processing Systems in Fluctuating Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.NI","authors_text":"George Michailidis, Kevin Ross, Nicholas Bambos","submitted_at":"2011-05-02T19:33:33Z","abstract_excerpt":"We consider a generalized processing system having several queues, where the available service rate combinations are fluctuating over time due to reliability and availability variations. The objective is to allocate the available resources, and corresponding service rates, in response to both workload and service capacity considerations, in order to maintain the long term stability of the system. The service configurations are completely arbitrary, including negative service rates which represent forwarding and service-induced cross traffic. We employ a trace-based trajectory asymptotic techni"},"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":"1105.0417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-05-02T19:33:33Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"e7502f9950d1ae85a8e02dbbabdfc2c506254140d4c7fe59cd4e8843dce60f64","abstract_canon_sha256":"aae4aa8a98e9def08169fc0440a5aec2996bf7d872c12f24934217cd17f3808d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.315588Z","signature_b64":"rXy2HGKJjnvO4qRKTmzPrAtMBs8KdxlIPj56v1ywoO3u2xGkSVDwdo1Xj6yPzganFw/AMaflJEw6bzu8Z7IsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53894768d23759dcec5b1ef44bbb8d16854cbc63093ab3e3a0f079ceabd744ca","last_reissued_at":"2026-05-18T04:23:11.315151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.315151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cone Schedules for Processing Systems in Fluctuating Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.NI","authors_text":"George Michailidis, Kevin Ross, Nicholas Bambos","submitted_at":"2011-05-02T19:33:33Z","abstract_excerpt":"We consider a generalized processing system having several queues, where the available service rate combinations are fluctuating over time due to reliability and availability variations. The objective is to allocate the available resources, and corresponding service rates, in response to both workload and service capacity considerations, in order to maintain the long term stability of the system. The service configurations are completely arbitrary, including negative service rates which represent forwarding and service-induced cross traffic. We employ a trace-based trajectory asymptotic techni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0417","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":"1105.0417","created_at":"2026-05-18T04:23:11.315217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0417v1","created_at":"2026-05-18T04:23:11.315217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0417","created_at":"2026-05-18T04:23:11.315217+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOEUO2GSG5M5","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOEUO2GSG5M5Z3C3","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOEUO2GS","created_at":"2026-05-18T12:26:32.869790+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/KOEUO2GSG5M5Z3C3D32EXO4NC2","json":"https://pith.science/pith/KOEUO2GSG5M5Z3C3D32EXO4NC2.json","graph_json":"https://pith.science/api/pith-number/KOEUO2GSG5M5Z3C3D32EXO4NC2/graph.json","events_json":"https://pith.science/api/pith-number/KOEUO2GSG5M5Z3C3D32EXO4NC2/events.json","paper":"https://pith.science/paper/KOEUO2GS"},"agent_actions":{"view_html":"https://pith.science/pith/KOEUO2GSG5M5Z3C3D32EXO4NC2","download_json":"https://pith.science/pith/KOEUO2GSG5M5Z3C3D32EXO4NC2.json","view_paper":"https://pith.science/paper/KOEUO2GS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0417&json=true","fetch_graph":"https://pith.science/api/pith-number/KOEUO2GSG5M5Z3C3D32EXO4NC2/graph.json","fetch_events":"https://pith.science/api/pith-number/KOEUO2GSG5M5Z3C3D32EXO4NC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOEUO2GSG5M5Z3C3D32EXO4NC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOEUO2GSG5M5Z3C3D32EXO4NC2/action/storage_attestation","attest_author":"https://pith.science/pith/KOEUO2GSG5M5Z3C3D32EXO4NC2/action/author_attestation","sign_citation":"https://pith.science/pith/KOEUO2GSG5M5Z3C3D32EXO4NC2/action/citation_signature","submit_replication":"https://pith.science/pith/KOEUO2GSG5M5Z3C3D32EXO4NC2/action/replication_record"}},"created_at":"2026-05-18T04:23:11.315217+00:00","updated_at":"2026-05-18T04:23:11.315217+00:00"}