{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:EQ5GYDYWNKH7J7OQ7JMISMDLXT","short_pith_number":"pith:EQ5GYDYW","canonical_record":{"source":{"id":"0808.2530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-19T05:33:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"da157fcc66d73b84f8886a65e52a99db6bfeaf07ec740f36b451244bb66c70fb","abstract_canon_sha256":"faef807c0533a7a376803a9ec02a3c70851342a6cb1bd555b508e6ede301bdbb"},"schema_version":"1.0"},"canonical_sha256":"243a6c0f166a8ff4fdd0fa5889306bbcefbeaf1dbeb493fc32f6a548ff108005","source":{"kind":"arxiv","id":"0808.2530","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.2530","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0808.2530v2","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.2530","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"EQ5GYDYWNKH7","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"EQ5GYDYWNKH7J7OQ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"EQ5GYDYW","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:EQ5GYDYWNKH7J7OQ7JMISMDLXT","target":"record","payload":{"canonical_record":{"source":{"id":"0808.2530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-19T05:33:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"da157fcc66d73b84f8886a65e52a99db6bfeaf07ec740f36b451244bb66c70fb","abstract_canon_sha256":"faef807c0533a7a376803a9ec02a3c70851342a6cb1bd555b508e6ede301bdbb"},"schema_version":"1.0"},"canonical_sha256":"243a6c0f166a8ff4fdd0fa5889306bbcefbeaf1dbeb493fc32f6a548ff108005","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.472449Z","signature_b64":"7e9FmzA2g5+Jf002O51CFiNdfIRC/qB7PcEy/z6AXmnJHOVWoNy8S3mGjTiGzOAgcbgCzPkIHRMbBAaDjkBuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"243a6c0f166a8ff4fdd0fa5889306bbcefbeaf1dbeb493fc32f6a548ff108005","last_reissued_at":"2026-05-18T00:58:48.471955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.471955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0808.2530","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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIJ1w8tJ1gXp+Agu1M8d+MXqYQR6NryPXgvO0r1VcPRsKxvFC1kl3BP+C/f9SvzlgvXkOTDLV+NHG69oBeoNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:41:52.417625Z"},"content_sha256":"c1fc4c65853e2322baee30e87941fb2042e7f456a0626ff1c7e90f736a7b1bd9","schema_version":"1.0","event_id":"sha256:c1fc4c65853e2322baee30e87941fb2042e7f456a0626ff1c7e90f736a7b1bd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:EQ5GYDYWNKH7J7OQ7JMISMDLXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fair Scheduling in Networks Through Packet Election","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Devavrat Shah, Srikanth Jagabathula","submitted_at":"2008-08-19T05:33:35Z","abstract_excerpt":"We consider the problem of designing a fair scheduling algorithm for discrete-time constrained queuing networks. Each queue has dedicated exogenous packet arrivals. There are constraints on which queues can be served simultaneously. This model effectively describes important special instances like network switches, interference in wireless networks, bandwidth sharing for congestion control and traffic scheduling in road roundabouts. Fair scheduling is required because it provides isolation to different traffic flows; isolation makes the system more robust and enables providing quality of servi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.2530","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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LPDOoAgYKonQVJKAOBDW7nzGv6dFtl2fh5yMV8mnTibJjnd/aVDgCJhpgDOd7kQ/XkboYejn/2V83m3DhD4vDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:41:52.417964Z"},"content_sha256":"132849e2182b6b7183ccc05871e306561c0ef63bed1f0c42493a7d32d50991bc","schema_version":"1.0","event_id":"sha256:132849e2182b6b7183ccc05871e306561c0ef63bed1f0c42493a7d32d50991bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQ5GYDYWNKH7J7OQ7JMISMDLXT/bundle.json","state_url":"https://pith.science/pith/EQ5GYDYWNKH7J7OQ7JMISMDLXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQ5GYDYWNKH7J7OQ7JMISMDLXT/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-05-28T04:41:52Z","links":{"resolver":"https://pith.science/pith/EQ5GYDYWNKH7J7OQ7JMISMDLXT","bundle":"https://pith.science/pith/EQ5GYDYWNKH7J7OQ7JMISMDLXT/bundle.json","state":"https://pith.science/pith/EQ5GYDYWNKH7J7OQ7JMISMDLXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQ5GYDYWNKH7J7OQ7JMISMDLXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:EQ5GYDYWNKH7J7OQ7JMISMDLXT","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":"faef807c0533a7a376803a9ec02a3c70851342a6cb1bd555b508e6ede301bdbb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-19T05:33:35Z","title_canon_sha256":"da157fcc66d73b84f8886a65e52a99db6bfeaf07ec740f36b451244bb66c70fb"},"schema_version":"1.0","source":{"id":"0808.2530","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.2530","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0808.2530v2","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.2530","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"EQ5GYDYWNKH7","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"EQ5GYDYWNKH7J7OQ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"EQ5GYDYW","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:132849e2182b6b7183ccc05871e306561c0ef63bed1f0c42493a7d32d50991bc","target":"graph","created_at":"2026-05-18T00:58:48Z","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":"We consider the problem of designing a fair scheduling algorithm for discrete-time constrained queuing networks. Each queue has dedicated exogenous packet arrivals. There are constraints on which queues can be served simultaneously. This model effectively describes important special instances like network switches, interference in wireless networks, bandwidth sharing for congestion control and traffic scheduling in road roundabouts. Fair scheduling is required because it provides isolation to different traffic flows; isolation makes the system more robust and enables providing quality of servi","authors_text":"Devavrat Shah, Srikanth Jagabathula","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-19T05:33:35Z","title":"Fair Scheduling in Networks Through Packet Election"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.2530","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:c1fc4c65853e2322baee30e87941fb2042e7f456a0626ff1c7e90f736a7b1bd9","target":"record","created_at":"2026-05-18T00:58:48Z","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":"faef807c0533a7a376803a9ec02a3c70851342a6cb1bd555b508e6ede301bdbb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-19T05:33:35Z","title_canon_sha256":"da157fcc66d73b84f8886a65e52a99db6bfeaf07ec740f36b451244bb66c70fb"},"schema_version":"1.0","source":{"id":"0808.2530","kind":"arxiv","version":2}},"canonical_sha256":"243a6c0f166a8ff4fdd0fa5889306bbcefbeaf1dbeb493fc32f6a548ff108005","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"243a6c0f166a8ff4fdd0fa5889306bbcefbeaf1dbeb493fc32f6a548ff108005","first_computed_at":"2026-05-18T00:58:48.471955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.471955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7e9FmzA2g5+Jf002O51CFiNdfIRC/qB7PcEy/z6AXmnJHOVWoNy8S3mGjTiGzOAgcbgCzPkIHRMbBAaDjkBuAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.472449Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.2530","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1fc4c65853e2322baee30e87941fb2042e7f456a0626ff1c7e90f736a7b1bd9","sha256:132849e2182b6b7183ccc05871e306561c0ef63bed1f0c42493a7d32d50991bc"],"state_sha256":"46d2b31c97969f107aa86574514ca58f51ac23347620a6e02e8a0b2f770ab75d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D1NOFTow3QcEDmlhDg3dImO8YvAUMKEYTOaYOfJz3Hshj/26qyUi5xM5RqcEELVxGgFyiJUNvyRqDoNnkuhcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:41:52.419913Z","bundle_sha256":"ec75064544f48a43f47eab448dcbbd7bf0a7285fec3bed48327d27f2695afaca"}}