{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JJJJSUUV4WCZUVBI3D5OYAEKQH","short_pith_number":"pith:JJJJSUUV","schema_version":"1.0","canonical_sha256":"4a52995295e5859a5428d8faec008a81f961a4750a04f96ea935150eca30255e","source":{"kind":"arxiv","id":"1308.5045","version":1},"attestation_state":"computed","paper":{"title":"Network Coding meets Decentralized Control: Network Linearization and Capacity-Stabilizablilty Equivalence","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Anant Sahai, Se Yong Park","submitted_at":"2013-08-23T04:16:58Z","abstract_excerpt":"We take a unified view of network coding and decentralized control. Precisely speaking, we consider both as linear time-invariant systems by appropriately restricting channels and coding schemes of network coding to be linear time-invariant, and the plant and controllers of decentralized control to be linear time-invariant as well. First, we apply linear system theory to network coding. This gives a novel way of converting an arbitrary relay network to an equivalent acyclic single-hop relay network, which we call Network Linearization. Based on network linearization, we prove that the fundamen"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1308.5045","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.OC","submitted_at":"2013-08-23T04:16:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5e45b783709f035f2ac329ebfbcb82c40a8ca3fb185c10cfdae3db46c95d84a3","abstract_canon_sha256":"2782b4db90603504a0ad1eac29d8e1879ff93caebddcc8f6cb5364eb18be03fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:17.498739Z","signature_b64":"slEaBIZeFoUCGwydEZrroPAJiCAYyzxts4neKhmfuvhIRV4Rpw9GjWPVseVLTUakn7vyVkD6cNwCzlhIe8rzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a52995295e5859a5428d8faec008a81f961a4750a04f96ea935150eca30255e","last_reissued_at":"2026-05-18T03:15:17.497118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:17.497118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Coding meets Decentralized Control: Network Linearization and Capacity-Stabilizablilty Equivalence","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Anant Sahai, Se Yong Park","submitted_at":"2013-08-23T04:16:58Z","abstract_excerpt":"We take a unified view of network coding and decentralized control. Precisely speaking, we consider both as linear time-invariant systems by appropriately restricting channels and coding schemes of network coding to be linear time-invariant, and the plant and controllers of decentralized control to be linear time-invariant as well. First, we apply linear system theory to network coding. This gives a novel way of converting an arbitrary relay network to an equivalent acyclic single-hop relay network, which we call Network Linearization. Based on network linearization, we prove that the fundamen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5045","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.5045","created_at":"2026-05-18T03:15:17.497238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5045v1","created_at":"2026-05-18T03:15:17.497238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5045","created_at":"2026-05-18T03:15:17.497238+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJJJSUUV4WCZ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJJJSUUV4WCZUVBI","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJJJSUUV","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH","json":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH.json","graph_json":"https://pith.science/api/pith-number/JJJJSUUV4WCZUVBI3D5OYAEKQH/graph.json","events_json":"https://pith.science/api/pith-number/JJJJSUUV4WCZUVBI3D5OYAEKQH/events.json","paper":"https://pith.science/paper/JJJJSUUV"},"agent_actions":{"view_html":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH","download_json":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH.json","view_paper":"https://pith.science/paper/JJJJSUUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5045&json=true","fetch_graph":"https://pith.science/api/pith-number/JJJJSUUV4WCZUVBI3D5OYAEKQH/graph.json","fetch_events":"https://pith.science/api/pith-number/JJJJSUUV4WCZUVBI3D5OYAEKQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH/action/storage_attestation","attest_author":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH/action/author_attestation","sign_citation":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH/action/citation_signature","submit_replication":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH/action/replication_record"}},"created_at":"2026-05-18T03:15:17.497238+00:00","updated_at":"2026-05-18T03:15:17.497238+00:00"}