{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MWSSZVSTNEUHS54F6GBULP663X","short_pith_number":"pith:MWSSZVST","canonical_record":{"source":{"id":"1303.6541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-26T16:17:07Z","cross_cats_sorted":[],"title_canon_sha256":"38232f2b9ccc9f3c085d53e73be02de4185c30051ca6218817d77dfe7eca23f1","abstract_canon_sha256":"36b328de0c3255da4fadf09f7c70ee6ba5bf106ba2dad82b080d1bf5703edf0a"},"schema_version":"1.0"},"canonical_sha256":"65a52cd6536928797785f18345bfdeddfa66e51541a33481ab6fd0ab45b9396e","source":{"kind":"arxiv","id":"1303.6541","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6541","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6541v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6541","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"MWSSZVSTNEUH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MWSSZVSTNEUHS54F","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MWSSZVST","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MWSSZVSTNEUHS54F6GBULP663X","target":"record","payload":{"canonical_record":{"source":{"id":"1303.6541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-26T16:17:07Z","cross_cats_sorted":[],"title_canon_sha256":"38232f2b9ccc9f3c085d53e73be02de4185c30051ca6218817d77dfe7eca23f1","abstract_canon_sha256":"36b328de0c3255da4fadf09f7c70ee6ba5bf106ba2dad82b080d1bf5703edf0a"},"schema_version":"1.0"},"canonical_sha256":"65a52cd6536928797785f18345bfdeddfa66e51541a33481ab6fd0ab45b9396e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:49.116644Z","signature_b64":"J6H/b5mtoeswfNOy7vmp98f9+bbKbn7rO9vitcjUV20kzbeAFqg71WdGZSZa0KrYRFC6QVukm+tfh/rH4YFDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65a52cd6536928797785f18345bfdeddfa66e51541a33481ab6fd0ab45b9396e","last_reissued_at":"2026-05-18T03:29:49.115931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:49.115931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.6541","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:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oOB4NL2ziOpkYmL0FzOhDS76BfEwuUbgvREXTHq9fsJixG6tfPEldQipGoG7X73QemU3/z95/Rdg1Xf2jshBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:25:29.960994Z"},"content_sha256":"b7514666076c588426d10d1eaf262c94f0009d15bcc89756520fcbc89d6f1479","schema_version":"1.0","event_id":"sha256:b7514666076c588426d10d1eaf262c94f0009d15bcc89756520fcbc89d6f1479"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MWSSZVSTNEUHS54F6GBULP663X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Radio Resource Management for Random Network Coding: Power Control and CSMA Backoff Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dan Zhang, Kai Su, Narayan B. Mandayam","submitted_at":"2013-03-26T16:17:07Z","abstract_excerpt":"Resource allocation in wireless networks typically occurs at PHY/MAC layers, while random network coding (RNC) is a network layer strategy. An interesting question is how resource allocation mechanisms can be tuned to improve RNC performance. By means of a differential equation framework which models RNC throughput in terms of lower layer parameters, we propose a gradient based approach that can dynamically allocate MAC and PHY layer resources with the goal of maximizing the minimum network coding throughput among all the destination nodes in a RNC multicast. We exemplify this general approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6541","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:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BnHzrwim1XAaU0H/A081aFwoIX2a6fzJyfA6ldHn6K07OVOErO2zCdnZ7M7ub49CXxfuL1BJqaZxgQAL02y2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:25:29.961350Z"},"content_sha256":"79231d7f434a6ec7b3ba2fec683194d415e573e8fd7ff1f10131d25842d26a1b","schema_version":"1.0","event_id":"sha256:79231d7f434a6ec7b3ba2fec683194d415e573e8fd7ff1f10131d25842d26a1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWSSZVSTNEUHS54F6GBULP663X/bundle.json","state_url":"https://pith.science/pith/MWSSZVSTNEUHS54F6GBULP663X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWSSZVSTNEUHS54F6GBULP663X/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-21T22:25:29Z","links":{"resolver":"https://pith.science/pith/MWSSZVSTNEUHS54F6GBULP663X","bundle":"https://pith.science/pith/MWSSZVSTNEUHS54F6GBULP663X/bundle.json","state":"https://pith.science/pith/MWSSZVSTNEUHS54F6GBULP663X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWSSZVSTNEUHS54F6GBULP663X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MWSSZVSTNEUHS54F6GBULP663X","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":"36b328de0c3255da4fadf09f7c70ee6ba5bf106ba2dad82b080d1bf5703edf0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-26T16:17:07Z","title_canon_sha256":"38232f2b9ccc9f3c085d53e73be02de4185c30051ca6218817d77dfe7eca23f1"},"schema_version":"1.0","source":{"id":"1303.6541","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6541","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6541v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6541","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"MWSSZVSTNEUH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MWSSZVSTNEUHS54F","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MWSSZVST","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:79231d7f434a6ec7b3ba2fec683194d415e573e8fd7ff1f10131d25842d26a1b","target":"graph","created_at":"2026-05-18T03:29:49Z","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":"Resource allocation in wireless networks typically occurs at PHY/MAC layers, while random network coding (RNC) is a network layer strategy. An interesting question is how resource allocation mechanisms can be tuned to improve RNC performance. By means of a differential equation framework which models RNC throughput in terms of lower layer parameters, we propose a gradient based approach that can dynamically allocate MAC and PHY layer resources with the goal of maximizing the minimum network coding throughput among all the destination nodes in a RNC multicast. We exemplify this general approach","authors_text":"Dan Zhang, Kai Su, Narayan B. Mandayam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-26T16:17:07Z","title":"Dynamic Radio Resource Management for Random Network Coding: Power Control and CSMA Backoff Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6541","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:b7514666076c588426d10d1eaf262c94f0009d15bcc89756520fcbc89d6f1479","target":"record","created_at":"2026-05-18T03:29:49Z","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":"36b328de0c3255da4fadf09f7c70ee6ba5bf106ba2dad82b080d1bf5703edf0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-26T16:17:07Z","title_canon_sha256":"38232f2b9ccc9f3c085d53e73be02de4185c30051ca6218817d77dfe7eca23f1"},"schema_version":"1.0","source":{"id":"1303.6541","kind":"arxiv","version":1}},"canonical_sha256":"65a52cd6536928797785f18345bfdeddfa66e51541a33481ab6fd0ab45b9396e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65a52cd6536928797785f18345bfdeddfa66e51541a33481ab6fd0ab45b9396e","first_computed_at":"2026-05-18T03:29:49.115931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:49.115931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J6H/b5mtoeswfNOy7vmp98f9+bbKbn7rO9vitcjUV20kzbeAFqg71WdGZSZa0KrYRFC6QVukm+tfh/rH4YFDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:49.116644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6541","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7514666076c588426d10d1eaf262c94f0009d15bcc89756520fcbc89d6f1479","sha256:79231d7f434a6ec7b3ba2fec683194d415e573e8fd7ff1f10131d25842d26a1b"],"state_sha256":"7391bbabf225f44f4f2dd10f5a2feb085e732971dcdd37f4fb5f53220c062650"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSnH1yES+hdI6U3WUUrKqv/aEuQhObs16AOqEIstu1nIRJSjXM2yKX9JtbQQpPdO/gORi+16BP04RnGvemKLAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T22:25:29.963474Z","bundle_sha256":"e6ca531bfe69768c3fbb3928b66a09ec94c41aca95245fab5b6bbadc5e22527c"}}