{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4G5OXS3NW5RRBUHBQRZ7XZT67I","short_pith_number":"pith:4G5OXS3N","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"},"canonical_sha256":"e1baebcb6db76310d0e18473fbe67efa20e638cf2b38b451bc6dda48c5ff8a1c","source":{"kind":"arxiv","id":"1407.3694","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3694","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3694v2","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3694","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"4G5OXS3NW5RR","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4G5OXS3NW5RRBUHB","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4G5OXS3N","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4G5OXS3NW5RRBUHBQRZ7XZT67I","target":"record","payload":{"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"},"canonical_sha256":"e1baebcb6db76310d0e18473fbe67efa20e638cf2b38b451bc6dda48c5ff8a1c","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"},"source_kind":"arxiv","source_id":"1407.3694","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Ftw0FAdX0ZpuEjVU2PsjNeGraRTLF9RAZk2wtU4jnuILMzEFWQsAvJ3D+IrAvwhf5MY55f79SDcbSOZkXLtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:18:47.529919Z"},"content_sha256":"04c0ac92e3ddb9fdeff3bcfcea4ca0cee507119ee08453104b8dfc7644bf587e","schema_version":"1.0","event_id":"sha256:04c0ac92e3ddb9fdeff3bcfcea4ca0cee507119ee08453104b8dfc7644bf587e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4G5OXS3NW5RRBUHBQRZ7XZT67I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KLCcVLnM7n2KNPAKngvmmMysMP67OLfBImD711ZLuhjhW9gc6uUdPqZGQJq3YG4tZc6ZMG54o9NkfhDeB279Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:18:47.530256Z"},"content_sha256":"c711ee27d0447e6f8ac96149d6aeab26cbedd1d2e5ec68e720e872628aeee634","schema_version":"1.0","event_id":"sha256:c711ee27d0447e6f8ac96149d6aeab26cbedd1d2e5ec68e720e872628aeee634"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I/bundle.json","state_url":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T10:18:47Z","links":{"resolver":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I","bundle":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I/bundle.json","state":"https://pith.science/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4G5OXS3NW5RRBUHBQRZ7XZT67I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4G5OXS3NW5RRBUHBQRZ7XZT67I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"00c3ed60ab8e71d0e43dbd23b7cdebc06a3436cb52edc3e19edb6bf5e63e0b8f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-14T15:19:44Z","title_canon_sha256":"2f8f8fdd35d384cf9d605cccf13d02a088d2b793914b4df7302d8f9ed85c5daf"},"schema_version":"1.0","source":{"id":"1407.3694","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3694","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3694v2","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3694","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"4G5OXS3NW5RR","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4G5OXS3NW5RRBUHB","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4G5OXS3N","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:c711ee27d0447e6f8ac96149d6aeab26cbedd1d2e5ec68e720e872628aeee634","target":"graph","created_at":"2026-05-18T01:09:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Jinwoo Shin, Tonghoon Suk","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-14T15:19:44Z","title":"Scheduling using Interactive Optimization Oracles for Constrained Queueing Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3694","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:04c0ac92e3ddb9fdeff3bcfcea4ca0cee507119ee08453104b8dfc7644bf587e","target":"record","created_at":"2026-05-18T01:09:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"00c3ed60ab8e71d0e43dbd23b7cdebc06a3436cb52edc3e19edb6bf5e63e0b8f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-14T15:19:44Z","title_canon_sha256":"2f8f8fdd35d384cf9d605cccf13d02a088d2b793914b4df7302d8f9ed85c5daf"},"schema_version":"1.0","source":{"id":"1407.3694","kind":"arxiv","version":2}},"canonical_sha256":"e1baebcb6db76310d0e18473fbe67efa20e638cf2b38b451bc6dda48c5ff8a1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1baebcb6db76310d0e18473fbe67efa20e638cf2b38b451bc6dda48c5ff8a1c","first_computed_at":"2026-05-18T01:09:49.780811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:49.780811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WAvSjPavQgcbNAJZmbYyoSZHIwWr3oWF0p5Xpq14XBRH+AUP2RhJGgEJqU33JxlxOjdEfTbfQB67kcAESEanBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:49.781443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3694","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04c0ac92e3ddb9fdeff3bcfcea4ca0cee507119ee08453104b8dfc7644bf587e","sha256:c711ee27d0447e6f8ac96149d6aeab26cbedd1d2e5ec68e720e872628aeee634"],"state_sha256":"36325a97294dcc98c8c737e8b6850d5a71a4211d3f9dc9381e85e58d084e6da1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2AMY/kTF8c9WpfW1HUkhKBvuDayw+TKSk+PRsIdn8UiqE361nNU3gec2Mmpdo2mjeni2oxdc/qt3I5cFXOOOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:18:47.532194Z","bundle_sha256":"097c6a05bcd7a6908cc3cccfdad25971e5fde74cde1d8c4dafd7ecdd7ee05c3b"}}