{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PJREVQID2YQ42S7GIGSD7EY3WV","short_pith_number":"pith:PJREVQID","canonical_record":{"source":{"id":"1208.2972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-08-14T20:37:40Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"7595b060329119ef51450967cabec398b6c596910ab4a21ac7d9e292f48ac970","abstract_canon_sha256":"3a9bf4c8bf9e86c40f49d07a874e4c64189f7f39c0aa3a078c11e7d56928411e"},"schema_version":"1.0"},"canonical_sha256":"7a624ac103d621cd4be641a43f931bb5716ad6b498292e029ead0183c59f1fec","source":{"kind":"arxiv","id":"1208.2972","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2972","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2972v1","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2972","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"PJREVQID2YQ4","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PJREVQID2YQ42S7G","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PJREVQID","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PJREVQID2YQ42S7GIGSD7EY3WV","target":"record","payload":{"canonical_record":{"source":{"id":"1208.2972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-08-14T20:37:40Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"7595b060329119ef51450967cabec398b6c596910ab4a21ac7d9e292f48ac970","abstract_canon_sha256":"3a9bf4c8bf9e86c40f49d07a874e4c64189f7f39c0aa3a078c11e7d56928411e"},"schema_version":"1.0"},"canonical_sha256":"7a624ac103d621cd4be641a43f931bb5716ad6b498292e029ead0183c59f1fec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:01.140172Z","signature_b64":"PAO2GEmp9by4RpcLr5OzAZIX0PVippYteM3jcRrElS2n0PGz7xZs1bo8gBb9SOEdhUGCda2KggP0taCDvL5uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a624ac103d621cd4be641a43f931bb5716ad6b498292e029ead0183c59f1fec","last_reissued_at":"2026-05-18T02:21:01.139588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:01.139588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.2972","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-18T02:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2fiaHecNjNgT/vmZjWVlTcljxNzYIH4pMjSX+H96L/VJ22ZHmf66hzPHKgHGsES9OuH/dY6/+rMW21Z4OhYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:13:52.012635Z"},"content_sha256":"25c8f4c90f986e3e358c269a0573732ec4973c8097013985f4c4a0983ccacc22","schema_version":"1.0","event_id":"sha256:25c8f4c90f986e3e358c269a0573732ec4973c8097013985f4c4a0983ccacc22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PJREVQID2YQ42S7GIGSD7EY3WV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wireless Network Design Under Service Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.SY","authors_text":"Gerhard Wunder, Martin Kasparick","submitted_at":"2012-08-14T20:37:40Z","abstract_excerpt":"In this paper we consider the design of wireless queueing network control policies with special focus on application-dependent service constraints. In particular we consider streaming traffic induced requirements such as avoiding buffer underflows, which significantly complicate the control problem compared to guaranteeing throughput optimality only. Since state-of-the-art approaches for enforcing minimum buffer constraints in broadcast networks are not suitable for application in general networks we argue for a cost function based approach, which combines throughput optimality with flexibilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2972","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-18T02:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5/3Yrpd4lvhkP9GDxvkKAp92DzDaJZc+6J4ACJG5fCcIqbjKqA1eit92hdD4I6PSJ7Uybgd17q8jOqzzTojeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:13:52.012998Z"},"content_sha256":"0a644e5dec0bc54b32db28769f12ff0c690c3e56b0c88c9432f6fb5fdd82cec9","schema_version":"1.0","event_id":"sha256:0a644e5dec0bc54b32db28769f12ff0c690c3e56b0c88c9432f6fb5fdd82cec9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJREVQID2YQ42S7GIGSD7EY3WV/bundle.json","state_url":"https://pith.science/pith/PJREVQID2YQ42S7GIGSD7EY3WV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJREVQID2YQ42S7GIGSD7EY3WV/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-01T01:13:52Z","links":{"resolver":"https://pith.science/pith/PJREVQID2YQ42S7GIGSD7EY3WV","bundle":"https://pith.science/pith/PJREVQID2YQ42S7GIGSD7EY3WV/bundle.json","state":"https://pith.science/pith/PJREVQID2YQ42S7GIGSD7EY3WV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJREVQID2YQ42S7GIGSD7EY3WV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PJREVQID2YQ42S7GIGSD7EY3WV","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":"3a9bf4c8bf9e86c40f49d07a874e4c64189f7f39c0aa3a078c11e7d56928411e","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-08-14T20:37:40Z","title_canon_sha256":"7595b060329119ef51450967cabec398b6c596910ab4a21ac7d9e292f48ac970"},"schema_version":"1.0","source":{"id":"1208.2972","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2972","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2972v1","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2972","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"PJREVQID2YQ4","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PJREVQID2YQ42S7G","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PJREVQID","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:0a644e5dec0bc54b32db28769f12ff0c690c3e56b0c88c9432f6fb5fdd82cec9","target":"graph","created_at":"2026-05-18T02:21:01Z","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":"In this paper we consider the design of wireless queueing network control policies with special focus on application-dependent service constraints. In particular we consider streaming traffic induced requirements such as avoiding buffer underflows, which significantly complicate the control problem compared to guaranteeing throughput optimality only. Since state-of-the-art approaches for enforcing minimum buffer constraints in broadcast networks are not suitable for application in general networks we argue for a cost function based approach, which combines throughput optimality with flexibilit","authors_text":"Gerhard Wunder, Martin Kasparick","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-08-14T20:37:40Z","title":"Wireless Network Design Under Service Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2972","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:25c8f4c90f986e3e358c269a0573732ec4973c8097013985f4c4a0983ccacc22","target":"record","created_at":"2026-05-18T02:21:01Z","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":"3a9bf4c8bf9e86c40f49d07a874e4c64189f7f39c0aa3a078c11e7d56928411e","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-08-14T20:37:40Z","title_canon_sha256":"7595b060329119ef51450967cabec398b6c596910ab4a21ac7d9e292f48ac970"},"schema_version":"1.0","source":{"id":"1208.2972","kind":"arxiv","version":1}},"canonical_sha256":"7a624ac103d621cd4be641a43f931bb5716ad6b498292e029ead0183c59f1fec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a624ac103d621cd4be641a43f931bb5716ad6b498292e029ead0183c59f1fec","first_computed_at":"2026-05-18T02:21:01.139588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:01.139588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PAO2GEmp9by4RpcLr5OzAZIX0PVippYteM3jcRrElS2n0PGz7xZs1bo8gBb9SOEdhUGCda2KggP0taCDvL5uBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:01.140172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2972","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25c8f4c90f986e3e358c269a0573732ec4973c8097013985f4c4a0983ccacc22","sha256:0a644e5dec0bc54b32db28769f12ff0c690c3e56b0c88c9432f6fb5fdd82cec9"],"state_sha256":"2354817268050ec5684d10e1f750d9e7aa29dcd2566aca3ad66747e80c13e226"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w3zSsacfbpKaShgOGQLxR7vOA+SHDmYBqVr7NyC688uE0X9Ya4eTg3HdLROjmvRPIKUDwMuFnKg3c1OSG5c+AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:13:52.016260Z","bundle_sha256":"27e00b9116ccbf6c78e66964098c7cd7444918f2afc52c92dad1013a039f6b75"}}