{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LW2QRPQU3LHHAMAUTX4PQJP7E3","short_pith_number":"pith:LW2QRPQU","canonical_record":{"source":{"id":"1301.1917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-09T16:46:59Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"ff916d67062e0c45fabedf7d7189221945fac47a67d5a52d6b2fd332bdbc0393","abstract_canon_sha256":"5d087e57b294bc0be96755087513ecebd4f745d966cfe0b39f23b22df6466123"},"schema_version":"1.0"},"canonical_sha256":"5db508be14dace7030149df8f825ff26e53ed0d842da342d8ae2b8080ff19ea2","source":{"kind":"arxiv","id":"1301.1917","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1917","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1917v1","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1917","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"pith_short_12","alias_value":"LW2QRPQU3LHH","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LW2QRPQU3LHHAMAU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LW2QRPQU","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LW2QRPQU3LHHAMAUTX4PQJP7E3","target":"record","payload":{"canonical_record":{"source":{"id":"1301.1917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-09T16:46:59Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"ff916d67062e0c45fabedf7d7189221945fac47a67d5a52d6b2fd332bdbc0393","abstract_canon_sha256":"5d087e57b294bc0be96755087513ecebd4f745d966cfe0b39f23b22df6466123"},"schema_version":"1.0"},"canonical_sha256":"5db508be14dace7030149df8f825ff26e53ed0d842da342d8ae2b8080ff19ea2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:55.702136Z","signature_b64":"WzDHhuerWDxfwGZcuJB4Aa6KPWsdcnDlUYaoE2NJkJCtvgqJBuso8PRskiQFPtxAC4MyLprWIEK2x19GtgyzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5db508be14dace7030149df8f825ff26e53ed0d842da342d8ae2b8080ff19ea2","last_reissued_at":"2026-05-18T03:36:55.701646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:55.701646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.1917","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-18T03:36:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dANqYmPxcb05I7D00zjV00rYQsPPCAznyFhU9d2G06++XE1tQd2+Noa9Q+BInbgoYrkbpRdH5v/CnOmNV+ggDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:15:52.126690Z"},"content_sha256":"482c5b0c56bc417222199c99d91317accdc8ab7ee100bc6456d79199c5321fa4","schema_version":"1.0","event_id":"sha256:482c5b0c56bc417222199c99d91317accdc8ab7ee100bc6456d79199c5321fa4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LW2QRPQU3LHHAMAUTX4PQJP7E3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability and Cost Optimization in Controlled Random Walks Using Scheduling Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.SY","authors_text":"Chan Zhou, Gerhard Wunder, Martin Kasparick","submitted_at":"2013-01-09T16:46:59Z","abstract_excerpt":"The control of large queueing networks is a notoriously difficult problem. Recently, an interesting new policy design framework for the control problem called h-MaxWeight has been proposed: h-MaxWeight is a natural generalization of the famous MaxWeight policy where instead of the quadratic any other surrogate value function can be applied. Stability of the policy is then achieved through a perturbation technique. However, stability crucially depends on parameter choice which has to be adapted in simulations. In this paper we use a different technique where the required perturbations can be di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1917","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-18T03:36:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJnY9wJRvDtoAEph+F+DL99QUel56Zu4bztzg4hISBnVdvbGOSHSp2RwRDCc28F+cn8SC1nnwZIUaLILgnkIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:15:52.127034Z"},"content_sha256":"a9cbced38650849cc5ee2139dda352288a816f009ad814fddd9a2900c6316e43","schema_version":"1.0","event_id":"sha256:a9cbced38650849cc5ee2139dda352288a816f009ad814fddd9a2900c6316e43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LW2QRPQU3LHHAMAUTX4PQJP7E3/bundle.json","state_url":"https://pith.science/pith/LW2QRPQU3LHHAMAUTX4PQJP7E3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LW2QRPQU3LHHAMAUTX4PQJP7E3/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-01T17:15:52Z","links":{"resolver":"https://pith.science/pith/LW2QRPQU3LHHAMAUTX4PQJP7E3","bundle":"https://pith.science/pith/LW2QRPQU3LHHAMAUTX4PQJP7E3/bundle.json","state":"https://pith.science/pith/LW2QRPQU3LHHAMAUTX4PQJP7E3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LW2QRPQU3LHHAMAUTX4PQJP7E3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LW2QRPQU3LHHAMAUTX4PQJP7E3","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":"5d087e57b294bc0be96755087513ecebd4f745d966cfe0b39f23b22df6466123","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-09T16:46:59Z","title_canon_sha256":"ff916d67062e0c45fabedf7d7189221945fac47a67d5a52d6b2fd332bdbc0393"},"schema_version":"1.0","source":{"id":"1301.1917","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1917","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1917v1","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1917","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"pith_short_12","alias_value":"LW2QRPQU3LHH","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LW2QRPQU3LHHAMAU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LW2QRPQU","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:a9cbced38650849cc5ee2139dda352288a816f009ad814fddd9a2900c6316e43","target":"graph","created_at":"2026-05-18T03:36:55Z","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":"The control of large queueing networks is a notoriously difficult problem. Recently, an interesting new policy design framework for the control problem called h-MaxWeight has been proposed: h-MaxWeight is a natural generalization of the famous MaxWeight policy where instead of the quadratic any other surrogate value function can be applied. Stability of the policy is then achieved through a perturbation technique. However, stability crucially depends on parameter choice which has to be adapted in simulations. In this paper we use a different technique where the required perturbations can be di","authors_text":"Chan Zhou, Gerhard Wunder, Martin Kasparick","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-09T16:46:59Z","title":"Stability and Cost Optimization in Controlled Random Walks Using Scheduling Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1917","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:482c5b0c56bc417222199c99d91317accdc8ab7ee100bc6456d79199c5321fa4","target":"record","created_at":"2026-05-18T03:36:55Z","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":"5d087e57b294bc0be96755087513ecebd4f745d966cfe0b39f23b22df6466123","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-09T16:46:59Z","title_canon_sha256":"ff916d67062e0c45fabedf7d7189221945fac47a67d5a52d6b2fd332bdbc0393"},"schema_version":"1.0","source":{"id":"1301.1917","kind":"arxiv","version":1}},"canonical_sha256":"5db508be14dace7030149df8f825ff26e53ed0d842da342d8ae2b8080ff19ea2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5db508be14dace7030149df8f825ff26e53ed0d842da342d8ae2b8080ff19ea2","first_computed_at":"2026-05-18T03:36:55.701646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:55.701646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WzDHhuerWDxfwGZcuJB4Aa6KPWsdcnDlUYaoE2NJkJCtvgqJBuso8PRskiQFPtxAC4MyLprWIEK2x19GtgyzDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:55.702136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1917","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:482c5b0c56bc417222199c99d91317accdc8ab7ee100bc6456d79199c5321fa4","sha256:a9cbced38650849cc5ee2139dda352288a816f009ad814fddd9a2900c6316e43"],"state_sha256":"3c2b36e215fee8a926f15441bb6e526a5b60fea53229abaf034b6e1bbac39f6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h3KgcG6l/CZIHXn1jN9q3fxIjUb+DwEmoMOg6nnDz91x8a/C5cETJry6DI5se6IRc/mPhmPLGzEVaZym+yXjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:15:52.129334Z","bundle_sha256":"1fe777acc853bd33069b6a652aa6a9b717603f9544b90e9d38129abeccc95e93"}}