{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:UNLYDFDYQTIKECU3J2IODNJUEJ","short_pith_number":"pith:UNLYDFDY","canonical_record":{"source":{"id":"0903.4594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-26T14:19:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b652aa098f355b1db8f8ccb8d75462a5d3071d44fc48ff22f091ade747749b73","abstract_canon_sha256":"0575c57a805e9b8f67f13bf9c0c933400ef1346d30067123d957abdae03a9f23"},"schema_version":"1.0"},"canonical_sha256":"a35781947884d0a20a9b4e90e1b534224760bc9d65dfc628797ea3dba630edfd","source":{"kind":"arxiv","id":"0903.4594","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4594","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4594v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4594","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"UNLYDFDYQTIK","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"UNLYDFDYQTIKECU3","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"UNLYDFDY","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:UNLYDFDYQTIKECU3J2IODNJUEJ","target":"record","payload":{"canonical_record":{"source":{"id":"0903.4594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-26T14:19:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b652aa098f355b1db8f8ccb8d75462a5d3071d44fc48ff22f091ade747749b73","abstract_canon_sha256":"0575c57a805e9b8f67f13bf9c0c933400ef1346d30067123d957abdae03a9f23"},"schema_version":"1.0"},"canonical_sha256":"a35781947884d0a20a9b4e90e1b534224760bc9d65dfc628797ea3dba630edfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.244178Z","signature_b64":"7udoHeF97CEUBqAQyVOd1lLYoqDcJGsGs6Iqlq312TEg6Su43vFqZ8awDPN0VW+CnsHuL+kPPigTEe4gTMRoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a35781947884d0a20a9b4e90e1b534224760bc9d65dfc628797ea3dba630edfd","last_reissued_at":"2026-05-18T00:57:58.243682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.243682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.4594","source_version":1,"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:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDOoSfpYkVYRRRusGTIsbGS+5q4cAY5YlsZHcDXneRs7O8lGCvIMyhqKEHxTU/TWZHGFqDrkO8OspJgpGzlVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:45:48.034265Z"},"content_sha256":"b413ebbbc1dc6908162cae9100d988f27e871569113e330782e4fc09919f0a23","schema_version":"1.0","event_id":"sha256:b413ebbbc1dc6908162cae9100d988f27e871569113e330782e4fc09919f0a23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:UNLYDFDYQTIKECU3J2IODNJUEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Control of Tunable Sub-optimal Algorithms for Scheduling of Time-varying Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ben Liang, Elvino S. Sousa, Mahdi Lotfinezhad","submitted_at":"2009-03-26T14:19:11Z","abstract_excerpt":"It is well known that for ergodic channel processes the Generalized Max-Weight Matching (GMWM) scheduling policy stabilizes the network for any supportable arrival rate vector within the network capacity region. This policy, however, often requires the solution of an NP-hard optimization problem. This has motivated many researchers to develop sub-optimal algorithms that approximate the GMWM policy in selecting schedule vectors. One implicit assumption commonly shared in this context is that during the algorithm runtime, the channel states remain effectively unchanged. This assumption may not h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4594","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"},"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:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mTDyWpkKfAVj/W6eLiV4zanNUQ3q42/nFwYrK79mmdyA9p7+J5HzngI76km0nRJmi3RGsgYQNlpwAH3YOfWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:45:48.035012Z"},"content_sha256":"af745a4a805cf38c8aa29b7f1ddd6ed164096c8d32e59e412babf44257f3f2e4","schema_version":"1.0","event_id":"sha256:af745a4a805cf38c8aa29b7f1ddd6ed164096c8d32e59e412babf44257f3f2e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNLYDFDYQTIKECU3J2IODNJUEJ/bundle.json","state_url":"https://pith.science/pith/UNLYDFDYQTIKECU3J2IODNJUEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNLYDFDYQTIKECU3J2IODNJUEJ/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-09T07:45:48Z","links":{"resolver":"https://pith.science/pith/UNLYDFDYQTIKECU3J2IODNJUEJ","bundle":"https://pith.science/pith/UNLYDFDYQTIKECU3J2IODNJUEJ/bundle.json","state":"https://pith.science/pith/UNLYDFDYQTIKECU3J2IODNJUEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNLYDFDYQTIKECU3J2IODNJUEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:UNLYDFDYQTIKECU3J2IODNJUEJ","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":"0575c57a805e9b8f67f13bf9c0c933400ef1346d30067123d957abdae03a9f23","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-26T14:19:11Z","title_canon_sha256":"b652aa098f355b1db8f8ccb8d75462a5d3071d44fc48ff22f091ade747749b73"},"schema_version":"1.0","source":{"id":"0903.4594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4594","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4594v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4594","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"UNLYDFDYQTIK","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"UNLYDFDYQTIKECU3","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"UNLYDFDY","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:af745a4a805cf38c8aa29b7f1ddd6ed164096c8d32e59e412babf44257f3f2e4","target":"graph","created_at":"2026-05-18T00:57:58Z","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":"It is well known that for ergodic channel processes the Generalized Max-Weight Matching (GMWM) scheduling policy stabilizes the network for any supportable arrival rate vector within the network capacity region. This policy, however, often requires the solution of an NP-hard optimization problem. This has motivated many researchers to develop sub-optimal algorithms that approximate the GMWM policy in selecting schedule vectors. One implicit assumption commonly shared in this context is that during the algorithm runtime, the channel states remain effectively unchanged. This assumption may not h","authors_text":"Ben Liang, Elvino S. Sousa, Mahdi Lotfinezhad","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-26T14:19:11Z","title":"Dynamic Control of Tunable Sub-optimal Algorithms for Scheduling of Time-varying Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4594","kind":"arxiv","version":1},"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:b413ebbbc1dc6908162cae9100d988f27e871569113e330782e4fc09919f0a23","target":"record","created_at":"2026-05-18T00:57:58Z","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":"0575c57a805e9b8f67f13bf9c0c933400ef1346d30067123d957abdae03a9f23","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-26T14:19:11Z","title_canon_sha256":"b652aa098f355b1db8f8ccb8d75462a5d3071d44fc48ff22f091ade747749b73"},"schema_version":"1.0","source":{"id":"0903.4594","kind":"arxiv","version":1}},"canonical_sha256":"a35781947884d0a20a9b4e90e1b534224760bc9d65dfc628797ea3dba630edfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a35781947884d0a20a9b4e90e1b534224760bc9d65dfc628797ea3dba630edfd","first_computed_at":"2026-05-18T00:57:58.243682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.243682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7udoHeF97CEUBqAQyVOd1lLYoqDcJGsGs6Iqlq312TEg6Su43vFqZ8awDPN0VW+CnsHuL+kPPigTEe4gTMRoBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.244178Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.4594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b413ebbbc1dc6908162cae9100d988f27e871569113e330782e4fc09919f0a23","sha256:af745a4a805cf38c8aa29b7f1ddd6ed164096c8d32e59e412babf44257f3f2e4"],"state_sha256":"af36e62e0a8e8f4980e8788c354e845950a420c0b381ecbfe5c80657e887fa2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99InlJ4hZGdzY7bQrg/Guh3p/5llwjCAcGTZ7q4nAf5C0NTQO4bn/LJ18BxMtBs9V3YrZMqIeub/BxCVxOTmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:45:48.039292Z","bundle_sha256":"30fdf248e16b1241e7eec3cf2ad2878e30516deb46ef5237b8ea8355007ef3c4"}}