{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HVPDJ2TEFCEAUPRZMKZPQJGERJ","short_pith_number":"pith:HVPDJ2TE","canonical_record":{"source":{"id":"1203.4008","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-18T23:45:00Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"bf059df87334cf3b7e788c9d584fc01c17595b3798aadb151c2c9bfcc6b1ca3a","abstract_canon_sha256":"88956c0dcd6676b7198b386d7fcdcce0899909861e9485fbcabf0be6e8217f8f"},"schema_version":"1.0"},"canonical_sha256":"3d5e34ea6428880a3e3962b2f824c48a65b55f34baea7334bace92a6e9841fd1","source":{"kind":"arxiv","id":"1203.4008","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4008","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4008v4","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4008","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"pith_short_12","alias_value":"HVPDJ2TEFCEA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HVPDJ2TEFCEAUPRZ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HVPDJ2TE","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HVPDJ2TEFCEAUPRZMKZPQJGERJ","target":"record","payload":{"canonical_record":{"source":{"id":"1203.4008","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-18T23:45:00Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"bf059df87334cf3b7e788c9d584fc01c17595b3798aadb151c2c9bfcc6b1ca3a","abstract_canon_sha256":"88956c0dcd6676b7198b386d7fcdcce0899909861e9485fbcabf0be6e8217f8f"},"schema_version":"1.0"},"canonical_sha256":"3d5e34ea6428880a3e3962b2f824c48a65b55f34baea7334bace92a6e9841fd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:05.044291Z","signature_b64":"RV0BYIQA/ErPNk1Tlt6A8nGbrtSUpUQjxL+LfI/EwzLenNFD71I+VDCrApA+plw7O2SuiHAPVqhWW5imOweCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d5e34ea6428880a3e3962b2f824c48a65b55f34baea7334bace92a6e9841fd1","last_reissued_at":"2026-05-18T03:58:05.043859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:05.043859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.4008","source_version":4,"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:58:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NV2XRV1R5sMjWBEioVFODkPOuRx9x+g6fLIES1oqLyoHe3jsSTZzIiEvrDMswJf5qBzhRO7dKlJMfJTq/KW0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:33:25.380617Z"},"content_sha256":"c72c6f6cbc46d900b7a63b88c682ace0b58c2a904a52d1c493f9f4d68fc91f24","schema_version":"1.0","event_id":"sha256:c72c6f6cbc46d900b7a63b88c682ace0b58c2a904a52d1c493f9f4d68fc91f24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HVPDJ2TEFCEAUPRZMKZPQJGERJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Network Coding for Scheduling Real-time Traffic with Hard Deadlines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.SY","authors_text":"Jason Hongjun Li, Junshan Zhang, Lei Yang, Yalin Evren Sagduyu","submitted_at":"2012-03-18T23:45:00Z","abstract_excerpt":"We study adaptive network coding (NC) for scheduling real-time traffic over a single-hop wireless network. To meet the hard deadlines of real-time traffic, it is critical to strike a balance between maximizing the throughput and minimizing the risk that the entire block of coded packets may not be decodable by the deadline. Thus motivated, we explore adaptive NC, where the block size is adapted based on the remaining time to the deadline, by casting this sequential block size adaptation problem as a finite-horizon Markov decision process. One interesting finding is that the optimal block size "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4008","kind":"arxiv","version":4},"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:58:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wxw35GNkpOUEpAp8KkMZUfPZPDS7soF6reXgzDnLwcKyOUqoP4s7KArh9/cwTiTr+kBhQTiUntD6++bW7OR2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:33:25.381205Z"},"content_sha256":"4a0de2d9dc03fe6aa3fe802e102688a9be3faa22a42983cd4edccf6f784e0f94","schema_version":"1.0","event_id":"sha256:4a0de2d9dc03fe6aa3fe802e102688a9be3faa22a42983cd4edccf6f784e0f94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVPDJ2TEFCEAUPRZMKZPQJGERJ/bundle.json","state_url":"https://pith.science/pith/HVPDJ2TEFCEAUPRZMKZPQJGERJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVPDJ2TEFCEAUPRZMKZPQJGERJ/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-10T23:33:25Z","links":{"resolver":"https://pith.science/pith/HVPDJ2TEFCEAUPRZMKZPQJGERJ","bundle":"https://pith.science/pith/HVPDJ2TEFCEAUPRZMKZPQJGERJ/bundle.json","state":"https://pith.science/pith/HVPDJ2TEFCEAUPRZMKZPQJGERJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVPDJ2TEFCEAUPRZMKZPQJGERJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HVPDJ2TEFCEAUPRZMKZPQJGERJ","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":"88956c0dcd6676b7198b386d7fcdcce0899909861e9485fbcabf0be6e8217f8f","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-18T23:45:00Z","title_canon_sha256":"bf059df87334cf3b7e788c9d584fc01c17595b3798aadb151c2c9bfcc6b1ca3a"},"schema_version":"1.0","source":{"id":"1203.4008","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4008","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4008v4","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4008","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"pith_short_12","alias_value":"HVPDJ2TEFCEA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HVPDJ2TEFCEAUPRZ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HVPDJ2TE","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:4a0de2d9dc03fe6aa3fe802e102688a9be3faa22a42983cd4edccf6f784e0f94","target":"graph","created_at":"2026-05-18T03:58:05Z","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 study adaptive network coding (NC) for scheduling real-time traffic over a single-hop wireless network. To meet the hard deadlines of real-time traffic, it is critical to strike a balance between maximizing the throughput and minimizing the risk that the entire block of coded packets may not be decodable by the deadline. Thus motivated, we explore adaptive NC, where the block size is adapted based on the remaining time to the deadline, by casting this sequential block size adaptation problem as a finite-horizon Markov decision process. One interesting finding is that the optimal block size ","authors_text":"Jason Hongjun Li, Junshan Zhang, Lei Yang, Yalin Evren Sagduyu","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-18T23:45:00Z","title":"Adaptive Network Coding for Scheduling Real-time Traffic with Hard Deadlines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4008","kind":"arxiv","version":4},"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:c72c6f6cbc46d900b7a63b88c682ace0b58c2a904a52d1c493f9f4d68fc91f24","target":"record","created_at":"2026-05-18T03:58:05Z","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":"88956c0dcd6676b7198b386d7fcdcce0899909861e9485fbcabf0be6e8217f8f","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-18T23:45:00Z","title_canon_sha256":"bf059df87334cf3b7e788c9d584fc01c17595b3798aadb151c2c9bfcc6b1ca3a"},"schema_version":"1.0","source":{"id":"1203.4008","kind":"arxiv","version":4}},"canonical_sha256":"3d5e34ea6428880a3e3962b2f824c48a65b55f34baea7334bace92a6e9841fd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d5e34ea6428880a3e3962b2f824c48a65b55f34baea7334bace92a6e9841fd1","first_computed_at":"2026-05-18T03:58:05.043859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:05.043859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RV0BYIQA/ErPNk1Tlt6A8nGbrtSUpUQjxL+LfI/EwzLenNFD71I+VDCrApA+plw7O2SuiHAPVqhWW5imOweCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:05.044291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.4008","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c72c6f6cbc46d900b7a63b88c682ace0b58c2a904a52d1c493f9f4d68fc91f24","sha256:4a0de2d9dc03fe6aa3fe802e102688a9be3faa22a42983cd4edccf6f784e0f94"],"state_sha256":"ddb27e964fd006fbbc3b7dd3db89009cde45d8ad9bccb23099328a474ad766ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkztzUciDes/qs6ksi8wf9xpcTBft94R/Oj9eSMcOkJn561wTIsVKy1I+bUNMRP240zz2SYt7EQqLcD6TuIuAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:33:25.384242Z","bundle_sha256":"dc9118e6b54e513db98f23d1a136eb83fec7676aa0b247f35e2dce610c6bbf77"}}