{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4G5OXS3NW5RRBUHBQRZ7XZT67I","short_pith_number":"pith:4G5OXS3N","schema_version":"1.0","canonical_sha256":"e1baebcb6db76310d0e18473fbe67efa20e638cf2b38b451bc6dda48c5ff8a1c","source":{"kind":"arxiv","id":"1407.3694","version":2},"attestation_state":"computed","paper":{"title":"Scheduling using Interactive Optimization Oracles for Constrained Queueing Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Jinwoo Shin, Tonghoon Suk","submitted_at":"2014-07-14T15:19:44Z","abstract_excerpt":"Ever since Tassiulas and Ephremides (1992) proposed the maximum weight scheduling algorithm of throughput-optimality for constrained queueing networks that arise in the context of communication networks, extensive efforts have been devoted to resolving its most important drawback: high complexity. This paper proposes a generic framework for designing throughput- optimal and low-complexity scheduling algorithms for constrained queueing networks. Under our framework, a scheduling algorithm updates current schedules by interacting with a given oracle system that generates an approximate solution "},"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":"1407.3694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-14T15:19:44Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2f8f8fdd35d384cf9d605cccf13d02a088d2b793914b4df7302d8f9ed85c5daf","abstract_canon_sha256":"00c3ed60ab8e71d0e43dbd23b7cdebc06a3436cb52edc3e19edb6bf5e63e0b8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:49.781443Z","signature_b64":"WAvSjPavQgcbNAJZmbYyoSZHIwWr3oWF0p5Xpq14XBRH+AUP2RhJGgEJqU33JxlxOjdEfTbfQB67kcAESEanBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1baebcb6db76310d0e18473fbe67efa20e638cf2b38b451bc6dda48c5ff8a1c","last_reissued_at":"2026-05-18T01:09:49.780811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:49.780811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling using Interactive Optimization Oracles for Constrained Queueing Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Jinwoo Shin, Tonghoon Suk","submitted_at":"2014-07-14T15:19:44Z","abstract_excerpt":"Ever since Tassiulas and Ephremides (1992) proposed the maximum weight scheduling algorithm of throughput-optimality for constrained queueing networks that arise in the context of communication networks, extensive efforts have been devoted to resolving its most important drawback: high complexity. This paper proposes a generic framework for designing throughput- optimal and low-complexity scheduling algorithms for constrained queueing networks. Under our framework, a scheduling algorithm updates current schedules by interacting with a given oracle system that generates an approximate solution "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3694","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":""},"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":"1407.3694","created_at":"2026-05-18T01:09:49.780910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3694v2","created_at":"2026-05-18T01:09:49.780910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3694","created_at":"2026-05-18T01:09:49.780910+00:00"},{"alias_kind":"pith_short_12","alias_value":"4G5OXS3NW5RR","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4G5OXS3NW5RRBUHB","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4G5OXS3N","created_at":"2026-05-18T12:28:14.216126+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/4G5OXS3NW5RRBUHBQRZ7XZT67I","json":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I.json","graph_json":"https://pith.science/api/pith-number/4G5OXS3NW5RRBUHBQRZ7XZT67I/graph.json","events_json":"https://pith.science/api/pith-number/4G5OXS3NW5RRBUHBQRZ7XZT67I/events.json","paper":"https://pith.science/paper/4G5OXS3N"},"agent_actions":{"view_html":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I","download_json":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I.json","view_paper":"https://pith.science/paper/4G5OXS3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3694&json=true","fetch_graph":"https://pith.science/api/pith-number/4G5OXS3NW5RRBUHBQRZ7XZT67I/graph.json","fetch_events":"https://pith.science/api/pith-number/4G5OXS3NW5RRBUHBQRZ7XZT67I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I/action/storage_attestation","attest_author":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I/action/author_attestation","sign_citation":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I/action/citation_signature","submit_replication":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I/action/replication_record"}},"created_at":"2026-05-18T01:09:49.780910+00:00","updated_at":"2026-05-18T01:09:49.780910+00:00"}