{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:34Q763JACNZSKR6TEIJTEJ6YET","short_pith_number":"pith:34Q763JA","canonical_record":{"source":{"id":"1003.5239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-03-26T21:39:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"384ea498c83742e5225ea604491bb40e92f62816afb9cdd1a3b72b3e91763efa","abstract_canon_sha256":"db2c1d89f44827464ea4c68f97faaa0964881efa8c505c2eab84423e34e28f5a"},"schema_version":"1.0"},"canonical_sha256":"df21ff6d2013732547d322133227d824cd3312d44a420f4bb84dc752b135fb56","source":{"kind":"arxiv","id":"1003.5239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.5239","created_at":"2026-05-18T04:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1003.5239v2","created_at":"2026-05-18T04:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5239","created_at":"2026-05-18T04:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"34Q763JACNZS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"34Q763JACNZSKR6T","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"34Q763JA","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:34Q763JACNZSKR6TEIJTEJ6YET","target":"record","payload":{"canonical_record":{"source":{"id":"1003.5239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-03-26T21:39:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"384ea498c83742e5225ea604491bb40e92f62816afb9cdd1a3b72b3e91763efa","abstract_canon_sha256":"db2c1d89f44827464ea4c68f97faaa0964881efa8c505c2eab84423e34e28f5a"},"schema_version":"1.0"},"canonical_sha256":"df21ff6d2013732547d322133227d824cd3312d44a420f4bb84dc752b135fb56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:50.125537Z","signature_b64":"TRiZcpnpHc1VuMimRUxPN5xWmZkkZ1how1XdWtOobZDzPWFro+E7yue+69bNfXb6iQFnoOoiLBRNzPw2Tz+hDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df21ff6d2013732547d322133227d824cd3312d44a420f4bb84dc752b135fb56","last_reissued_at":"2026-05-18T04:22:50.125086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:50.125086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.5239","source_version":2,"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:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iB1NNcpMFe+9wC6nBynHLS+6uQbUnEulwmxbw/9uM2LenAP3CWq1XF87eQfcHCGfYu7kKTTx5jq9M2wSmHe/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T19:32:54.908205Z"},"content_sha256":"c48a45761539eacae75db8856acddc79c9c28ba92ecfdfbe160746903adea5f7","schema_version":"1.0","event_id":"sha256:c48a45761539eacae75db8856acddc79c9c28ba92ecfdfbe160746903adea5f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:34Q763JACNZSKR6TEIJTEJ6YET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cross-Layer Designs in Coded Wireless Fading Networks with Multicast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NI","authors_text":"Georgios B. Giannakis, Ketan Rajawat, Nikolaos Gatsis","submitted_at":"2010-03-26T21:39:01Z","abstract_excerpt":"A cross-layer design along with an optimal resource allocation framework is formulated for wireless fading networks, where the nodes are allowed to perform network coding. The aim is to jointly optimize end-to-end transport layer rates, network code design variables, broadcast link flows, link capacities, average power consumption, and short-term power allocation policies. As in the routing paradigm where nodes simply forward packets, the cross-layer optimization problem with network coding is non-convex in general. It is proved however, that with network coding, dual decomposition for multica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5239","kind":"arxiv","version":2},"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:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UD9me/d/a557d7Wgg4KgfuPc0z5gyU3zE8YEr2+2Dw7IoGosUwgledLgBSmeupjkIGZmK6bzmqXR27dF0V2qBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T19:32:54.908580Z"},"content_sha256":"b8938dc8068038c44a9e05bfd3e70ae0c3f32f32954d346bc9247330390f8035","schema_version":"1.0","event_id":"sha256:b8938dc8068038c44a9e05bfd3e70ae0c3f32f32954d346bc9247330390f8035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34Q763JACNZSKR6TEIJTEJ6YET/bundle.json","state_url":"https://pith.science/pith/34Q763JACNZSKR6TEIJTEJ6YET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34Q763JACNZSKR6TEIJTEJ6YET/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-22T19:32:54Z","links":{"resolver":"https://pith.science/pith/34Q763JACNZSKR6TEIJTEJ6YET","bundle":"https://pith.science/pith/34Q763JACNZSKR6TEIJTEJ6YET/bundle.json","state":"https://pith.science/pith/34Q763JACNZSKR6TEIJTEJ6YET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34Q763JACNZSKR6TEIJTEJ6YET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:34Q763JACNZSKR6TEIJTEJ6YET","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":"db2c1d89f44827464ea4c68f97faaa0964881efa8c505c2eab84423e34e28f5a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-03-26T21:39:01Z","title_canon_sha256":"384ea498c83742e5225ea604491bb40e92f62816afb9cdd1a3b72b3e91763efa"},"schema_version":"1.0","source":{"id":"1003.5239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.5239","created_at":"2026-05-18T04:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1003.5239v2","created_at":"2026-05-18T04:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5239","created_at":"2026-05-18T04:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"34Q763JACNZS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"34Q763JACNZSKR6T","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"34Q763JA","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:b8938dc8068038c44a9e05bfd3e70ae0c3f32f32954d346bc9247330390f8035","target":"graph","created_at":"2026-05-18T04:22:50Z","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":"A cross-layer design along with an optimal resource allocation framework is formulated for wireless fading networks, where the nodes are allowed to perform network coding. The aim is to jointly optimize end-to-end transport layer rates, network code design variables, broadcast link flows, link capacities, average power consumption, and short-term power allocation policies. As in the routing paradigm where nodes simply forward packets, the cross-layer optimization problem with network coding is non-convex in general. It is proved however, that with network coding, dual decomposition for multica","authors_text":"Georgios B. Giannakis, Ketan Rajawat, Nikolaos Gatsis","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-03-26T21:39:01Z","title":"Cross-Layer Designs in Coded Wireless Fading Networks with Multicast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5239","kind":"arxiv","version":2},"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:c48a45761539eacae75db8856acddc79c9c28ba92ecfdfbe160746903adea5f7","target":"record","created_at":"2026-05-18T04:22:50Z","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":"db2c1d89f44827464ea4c68f97faaa0964881efa8c505c2eab84423e34e28f5a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-03-26T21:39:01Z","title_canon_sha256":"384ea498c83742e5225ea604491bb40e92f62816afb9cdd1a3b72b3e91763efa"},"schema_version":"1.0","source":{"id":"1003.5239","kind":"arxiv","version":2}},"canonical_sha256":"df21ff6d2013732547d322133227d824cd3312d44a420f4bb84dc752b135fb56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df21ff6d2013732547d322133227d824cd3312d44a420f4bb84dc752b135fb56","first_computed_at":"2026-05-18T04:22:50.125086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:50.125086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TRiZcpnpHc1VuMimRUxPN5xWmZkkZ1how1XdWtOobZDzPWFro+E7yue+69bNfXb6iQFnoOoiLBRNzPw2Tz+hDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:50.125537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.5239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c48a45761539eacae75db8856acddc79c9c28ba92ecfdfbe160746903adea5f7","sha256:b8938dc8068038c44a9e05bfd3e70ae0c3f32f32954d346bc9247330390f8035"],"state_sha256":"3329c1de87521d334120159ec27898df5b8e7379e9746c8bf4720c5c7866c939"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAA1hXgbqH0JFsb/tToCpecUXymuro0JEk4AW5C15kPw8NfHuWF+y9bu6szahpnVOvopAsIdX0STQ2rkiBdoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T19:32:54.910544Z","bundle_sha256":"853a624f6ba4ca09b44f09d6d78f2e2c0e09fe659ac393d9105bd1396890f459"}}