{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JJJJSUUV4WCZUVBI3D5OYAEKQH","short_pith_number":"pith:JJJJSUUV","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"},"canonical_sha256":"4a52995295e5859a5428d8faec008a81f961a4750a04f96ea935150eca30255e","source":{"kind":"arxiv","id":"1308.5045","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5045","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5045v1","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5045","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"pith_short_12","alias_value":"JJJJSUUV4WCZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JJJJSUUV4WCZUVBI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JJJJSUUV","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JJJJSUUV4WCZUVBI3D5OYAEKQH","target":"record","payload":{"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"},"canonical_sha256":"4a52995295e5859a5428d8faec008a81f961a4750a04f96ea935150eca30255e","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"},"source_kind":"arxiv","source_id":"1308.5045","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:15:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHhRLlNDZxHiv+Fjk1zr9arJBd6nnxvVq7sXSjQXm8sHLQAk4YXJO+mRhW12PVRceuGhYNpemZSqxTGn5hTSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:44:24.583616Z"},"content_sha256":"ad1c857384beb4ff224c0999e688ea64183de4cfa6b27d50f5dd05db7a359cfd","schema_version":"1.0","event_id":"sha256:ad1c857384beb4ff224c0999e688ea64183de4cfa6b27d50f5dd05db7a359cfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JJJJSUUV4WCZUVBI3D5OYAEKQH","target":"graph","payload":{"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"},"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:15:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+enWBHOXct+IMgJhRS/m7MFXReWtJy7RB767Kc4M1km3yUD30tgwAf3n6DtEck1OrGS0DkEGIi+sYUq5XZUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:44:24.583965Z"},"content_sha256":"093295c559f42b1c742ef3395be406796a9e5fa42bc75dac4ba45127cf6080cd","schema_version":"1.0","event_id":"sha256:093295c559f42b1c742ef3395be406796a9e5fa42bc75dac4ba45127cf6080cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH/bundle.json","state_url":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH/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-07-01T12:44:24Z","links":{"resolver":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH","bundle":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH/bundle.json","state":"https://pith.science/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJJJSUUV4WCZUVBI3D5OYAEKQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JJJJSUUV4WCZUVBI3D5OYAEKQH","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":"2782b4db90603504a0ad1eac29d8e1879ff93caebddcc8f6cb5364eb18be03fc","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.OC","submitted_at":"2013-08-23T04:16:58Z","title_canon_sha256":"5e45b783709f035f2ac329ebfbcb82c40a8ca3fb185c10cfdae3db46c95d84a3"},"schema_version":"1.0","source":{"id":"1308.5045","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5045","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5045v1","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5045","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"pith_short_12","alias_value":"JJJJSUUV4WCZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JJJJSUUV4WCZUVBI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JJJJSUUV","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:093295c559f42b1c742ef3395be406796a9e5fa42bc75dac4ba45127cf6080cd","target":"graph","created_at":"2026-05-18T03:15:17Z","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 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","authors_text":"Anant Sahai, Se Yong Park","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.OC","submitted_at":"2013-08-23T04:16:58Z","title":"Network Coding meets Decentralized Control: Network Linearization and Capacity-Stabilizablilty Equivalence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5045","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:ad1c857384beb4ff224c0999e688ea64183de4cfa6b27d50f5dd05db7a359cfd","target":"record","created_at":"2026-05-18T03:15:17Z","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":"2782b4db90603504a0ad1eac29d8e1879ff93caebddcc8f6cb5364eb18be03fc","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.OC","submitted_at":"2013-08-23T04:16:58Z","title_canon_sha256":"5e45b783709f035f2ac329ebfbcb82c40a8ca3fb185c10cfdae3db46c95d84a3"},"schema_version":"1.0","source":{"id":"1308.5045","kind":"arxiv","version":1}},"canonical_sha256":"4a52995295e5859a5428d8faec008a81f961a4750a04f96ea935150eca30255e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a52995295e5859a5428d8faec008a81f961a4750a04f96ea935150eca30255e","first_computed_at":"2026-05-18T03:15:17.497118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:17.497118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"slEaBIZeFoUCGwydEZrroPAJiCAYyzxts4neKhmfuvhIRV4Rpw9GjWPVseVLTUakn7vyVkD6cNwCzlhIe8rzAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:17.498739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5045","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad1c857384beb4ff224c0999e688ea64183de4cfa6b27d50f5dd05db7a359cfd","sha256:093295c559f42b1c742ef3395be406796a9e5fa42bc75dac4ba45127cf6080cd"],"state_sha256":"b2683e1ac3a02324315aab3f0e47946c728041f51fb59bf75730a1a0cc53b66a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UeXoWFPl9MabQPX8qd0SjRxzC97jHvBgJ4QlAvVYGonwW/E0aMVlxWTMplq5pGiyomAyy5hKuQ+v2ELO46MNBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T12:44:24.586101Z","bundle_sha256":"f656df977a10adc7cf5e274fe607e802b75c48f41981e9f46dbb2e73a175dbac"}}