{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NEAJ3LNR2UEPVI5DAJV5E7BPYA","short_pith_number":"pith:NEAJ3LNR","canonical_record":{"source":{"id":"1202.0784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-02-03T17:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"686f9e11589bf9d6ea95ae00a116372f45a05ab37dd64c62269a3ab6c2dc6029","abstract_canon_sha256":"57f8034ef1160ba69235e5d4352f786533cc3d70471a10f74e890965228f2428"},"schema_version":"1.0"},"canonical_sha256":"69009dadb1d508faa3a3026bd27c2fc03635784f70b5aff21776a5a949e23360","source":{"kind":"arxiv","id":"1202.0784","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0784","created_at":"2026-05-18T04:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0784v1","created_at":"2026-05-18T04:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0784","created_at":"2026-05-18T04:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"NEAJ3LNR2UEP","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NEAJ3LNR2UEPVI5D","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NEAJ3LNR","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NEAJ3LNR2UEPVI5DAJV5E7BPYA","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-02-03T17:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"686f9e11589bf9d6ea95ae00a116372f45a05ab37dd64c62269a3ab6c2dc6029","abstract_canon_sha256":"57f8034ef1160ba69235e5d4352f786533cc3d70471a10f74e890965228f2428"},"schema_version":"1.0"},"canonical_sha256":"69009dadb1d508faa3a3026bd27c2fc03635784f70b5aff21776a5a949e23360","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:07.920346Z","signature_b64":"3mW5y5MPi5gjN3trTOM1U/mwlhCgA/VhjtKiI5nO+ezBshkauf7neS6mei32DUdM6WN/VO8K6uh11/7v0kOXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69009dadb1d508faa3a3026bd27c2fc03635784f70b5aff21776a5a949e23360","last_reissued_at":"2026-05-18T04:03:07.919576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:07.919576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0784","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-18T04:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iY79hfxZ2x8U+DN/Gstb/Oujx1p9Ui1LXQKdpkcKgUX4qSYjIB0lqmLdx6G1V/x26ihBehdPNZDIlcGp41nDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:40:41.686458Z"},"content_sha256":"6b93d6150da11e4b2af869d475bae7e402cd35ccaa3da819d27eb51fc7b13fe1","schema_version":"1.0","event_id":"sha256:6b93d6150da11e4b2af869d475bae7e402cd35ccaa3da819d27eb51fc7b13fe1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NEAJ3LNR2UEPVI5DAJV5E7BPYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Coding and Scheduling Optimization in Wireless Systems with Varying Delay Sensitivities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chris T. K. Ng, Muriel Medard, Weifei Zeng","submitted_at":"2012-02-03T17:31:33Z","abstract_excerpt":"Throughput and per-packet delay can present strong trade-offs that are important in the cases of delay sensitive applications.We investigate such trade-offs using a random linear network coding scheme for one or more receivers in single hop wireless packet erasure broadcast channels. We capture the delay sensitivities across different types of network applications using a class of delay metrics based on the norms of packet arrival times. With these delay metrics, we establish a unified framework to characterize the rate and delay requirements of applications and optimize system parameters. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0784","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-18T04:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xYNQbPXfLxO0Slo0Y1AOvlrqdzjwFdpgu4kswYpgY6VWzpe5QI/BwakID5AoyeuGuhX1Qt8lB+CukeEm0op2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:40:41.687114Z"},"content_sha256":"bf4bb832d79778ebdba1ee78eb56804d4e1d6686546135b7e24d84ba913e0e98","schema_version":"1.0","event_id":"sha256:bf4bb832d79778ebdba1ee78eb56804d4e1d6686546135b7e24d84ba913e0e98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEAJ3LNR2UEPVI5DAJV5E7BPYA/bundle.json","state_url":"https://pith.science/pith/NEAJ3LNR2UEPVI5DAJV5E7BPYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEAJ3LNR2UEPVI5DAJV5E7BPYA/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-24T21:40:41Z","links":{"resolver":"https://pith.science/pith/NEAJ3LNR2UEPVI5DAJV5E7BPYA","bundle":"https://pith.science/pith/NEAJ3LNR2UEPVI5DAJV5E7BPYA/bundle.json","state":"https://pith.science/pith/NEAJ3LNR2UEPVI5DAJV5E7BPYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEAJ3LNR2UEPVI5DAJV5E7BPYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NEAJ3LNR2UEPVI5DAJV5E7BPYA","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":"57f8034ef1160ba69235e5d4352f786533cc3d70471a10f74e890965228f2428","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-02-03T17:31:33Z","title_canon_sha256":"686f9e11589bf9d6ea95ae00a116372f45a05ab37dd64c62269a3ab6c2dc6029"},"schema_version":"1.0","source":{"id":"1202.0784","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0784","created_at":"2026-05-18T04:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0784v1","created_at":"2026-05-18T04:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0784","created_at":"2026-05-18T04:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"NEAJ3LNR2UEP","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NEAJ3LNR2UEPVI5D","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NEAJ3LNR","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:bf4bb832d79778ebdba1ee78eb56804d4e1d6686546135b7e24d84ba913e0e98","target":"graph","created_at":"2026-05-18T04:03:07Z","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":"Throughput and per-packet delay can present strong trade-offs that are important in the cases of delay sensitive applications.We investigate such trade-offs using a random linear network coding scheme for one or more receivers in single hop wireless packet erasure broadcast channels. We capture the delay sensitivities across different types of network applications using a class of delay metrics based on the norms of packet arrival times. With these delay metrics, we establish a unified framework to characterize the rate and delay requirements of applications and optimize system parameters. In ","authors_text":"Chris T. K. Ng, Muriel Medard, Weifei Zeng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-02-03T17:31:33Z","title":"Joint Coding and Scheduling Optimization in Wireless Systems with Varying Delay Sensitivities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0784","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:6b93d6150da11e4b2af869d475bae7e402cd35ccaa3da819d27eb51fc7b13fe1","target":"record","created_at":"2026-05-18T04:03:07Z","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":"57f8034ef1160ba69235e5d4352f786533cc3d70471a10f74e890965228f2428","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-02-03T17:31:33Z","title_canon_sha256":"686f9e11589bf9d6ea95ae00a116372f45a05ab37dd64c62269a3ab6c2dc6029"},"schema_version":"1.0","source":{"id":"1202.0784","kind":"arxiv","version":1}},"canonical_sha256":"69009dadb1d508faa3a3026bd27c2fc03635784f70b5aff21776a5a949e23360","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69009dadb1d508faa3a3026bd27c2fc03635784f70b5aff21776a5a949e23360","first_computed_at":"2026-05-18T04:03:07.919576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:07.919576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3mW5y5MPi5gjN3trTOM1U/mwlhCgA/VhjtKiI5nO+ezBshkauf7neS6mei32DUdM6WN/VO8K6uh11/7v0kOXCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:07.920346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0784","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b93d6150da11e4b2af869d475bae7e402cd35ccaa3da819d27eb51fc7b13fe1","sha256:bf4bb832d79778ebdba1ee78eb56804d4e1d6686546135b7e24d84ba913e0e98"],"state_sha256":"efadba7ec605f836ad4e454e9c7c6423fbbae659b76879643b9c0b39efb12c4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ek46KXRc02U9pIo/t9iDbeRat150CC0Q59jIG/n42AA2VYykRln69E7Nc3WBwoEjIs4noTYtWaulEfDSQH3QAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T21:40:41.690770Z","bundle_sha256":"e36d91af82861e5f853b9d5fc77c9d3664a5caac8a9e4c01842fb66d4fab263f"}}