{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YHJLDTTWYK3LDXEHNHRR5YHHHE","short_pith_number":"pith:YHJLDTTW","canonical_record":{"source":{"id":"1705.02704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T21:45:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ce87108fc72db4f4b7ee09f5cc4fd1a8da42a853dc48788c4e126bb622670d25","abstract_canon_sha256":"1187a68437271dfdc9d7b94c5dc9f31e0a632f40e5192c9628d38ec4a9a4d6bc"},"schema_version":"1.0"},"canonical_sha256":"c1d2b1ce76c2b6b1dc8769e31ee0e73909efc383e9f71ebaffa8716c961a35d1","source":{"kind":"arxiv","id":"1705.02704","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02704","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02704v2","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02704","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"pith_short_12","alias_value":"YHJLDTTWYK3L","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YHJLDTTWYK3LDXEH","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YHJLDTTW","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YHJLDTTWYK3LDXEHNHRR5YHHHE","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T21:45:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ce87108fc72db4f4b7ee09f5cc4fd1a8da42a853dc48788c4e126bb622670d25","abstract_canon_sha256":"1187a68437271dfdc9d7b94c5dc9f31e0a632f40e5192c9628d38ec4a9a4d6bc"},"schema_version":"1.0"},"canonical_sha256":"c1d2b1ce76c2b6b1dc8769e31ee0e73909efc383e9f71ebaffa8716c961a35d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:57.038381Z","signature_b64":"jnrdLii8r6e3/3tUKeBEyaZ2CF1OYReq/MGa551UDlLuwD7pNmP7EP2YMVImauT1fm0Znqv0TVvE3m2XaedqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1d2b1ce76c2b6b1dc8769e31ee0e73909efc383e9f71ebaffa8716c961a35d1","last_reissued_at":"2026-05-18T00:14:57.037805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:57.037805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02704","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-18T00:14:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fm/4HyG3UBTe3loyv9kjo//e9Mq1Uaaw2c45KPeYirZv73PhcnhLMKnxOrOhgY1LwnQMF1gspnzOj+6EFjAYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:43:20.001126Z"},"content_sha256":"c2568d2712dccd94e72362443659b8c4f2004a93fa77cf7cbba6a5f7619f092f","schema_version":"1.0","event_id":"sha256:c2568d2712dccd94e72362443659b8c4f2004a93fa77cf7cbba6a5f7619f092f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YHJLDTTWYK3LDXEHNHRR5YHHHE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Network Coding for Two-Unicast-$Z$ Networks: A Commutative Algebraic Perspective and Fundamental Limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Fahim, Viveck Cadambe","submitted_at":"2017-05-07T21:45:13Z","abstract_excerpt":"We consider a two-unicast-$Z$ network over a directed acyclic graph of unit capacitated edges; the two-unicast-$Z$ network is a special case of two-unicast networks where one of the destinations has apriori side information of the unwanted (interfering) message. In this paper, we settle open questions on the limits of network coding for two-unicast-$Z$ networks by showing that the generalized network sharing bound is not tight, vector linear codes outperform scalar linear codes, and non-linear codes outperform linear codes in general. We also develop a commutative algebraic approach to derivin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02704","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-18T00:14:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/9mHb79yrAYQAw07WIjx3pqAfLZw1BaeVDWEW8q7IOF7xQNDVX9Q9bx8i5szU5PHPBpiS98ol4H9Gs25XoxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:43:20.001774Z"},"content_sha256":"b44a54c3672622f3ae914fa4581c00bd1a2ff66ed62d0a1404f3f5f742bf32d2","schema_version":"1.0","event_id":"sha256:b44a54c3672622f3ae914fa4581c00bd1a2ff66ed62d0a1404f3f5f742bf32d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHJLDTTWYK3LDXEHNHRR5YHHHE/bundle.json","state_url":"https://pith.science/pith/YHJLDTTWYK3LDXEHNHRR5YHHHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHJLDTTWYK3LDXEHNHRR5YHHHE/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-29T15:43:20Z","links":{"resolver":"https://pith.science/pith/YHJLDTTWYK3LDXEHNHRR5YHHHE","bundle":"https://pith.science/pith/YHJLDTTWYK3LDXEHNHRR5YHHHE/bundle.json","state":"https://pith.science/pith/YHJLDTTWYK3LDXEHNHRR5YHHHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHJLDTTWYK3LDXEHNHRR5YHHHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YHJLDTTWYK3LDXEHNHRR5YHHHE","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":"1187a68437271dfdc9d7b94c5dc9f31e0a632f40e5192c9628d38ec4a9a4d6bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T21:45:13Z","title_canon_sha256":"ce87108fc72db4f4b7ee09f5cc4fd1a8da42a853dc48788c4e126bb622670d25"},"schema_version":"1.0","source":{"id":"1705.02704","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02704","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02704v2","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02704","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"pith_short_12","alias_value":"YHJLDTTWYK3L","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YHJLDTTWYK3LDXEH","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YHJLDTTW","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:b44a54c3672622f3ae914fa4581c00bd1a2ff66ed62d0a1404f3f5f742bf32d2","target":"graph","created_at":"2026-05-18T00:14:57Z","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 consider a two-unicast-$Z$ network over a directed acyclic graph of unit capacitated edges; the two-unicast-$Z$ network is a special case of two-unicast networks where one of the destinations has apriori side information of the unwanted (interfering) message. In this paper, we settle open questions on the limits of network coding for two-unicast-$Z$ networks by showing that the generalized network sharing bound is not tight, vector linear codes outperform scalar linear codes, and non-linear codes outperform linear codes in general. We also develop a commutative algebraic approach to derivin","authors_text":"Mohammad Fahim, Viveck Cadambe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T21:45:13Z","title":"Linear Network Coding for Two-Unicast-$Z$ Networks: A Commutative Algebraic Perspective and Fundamental Limits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02704","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:c2568d2712dccd94e72362443659b8c4f2004a93fa77cf7cbba6a5f7619f092f","target":"record","created_at":"2026-05-18T00:14:57Z","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":"1187a68437271dfdc9d7b94c5dc9f31e0a632f40e5192c9628d38ec4a9a4d6bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T21:45:13Z","title_canon_sha256":"ce87108fc72db4f4b7ee09f5cc4fd1a8da42a853dc48788c4e126bb622670d25"},"schema_version":"1.0","source":{"id":"1705.02704","kind":"arxiv","version":2}},"canonical_sha256":"c1d2b1ce76c2b6b1dc8769e31ee0e73909efc383e9f71ebaffa8716c961a35d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1d2b1ce76c2b6b1dc8769e31ee0e73909efc383e9f71ebaffa8716c961a35d1","first_computed_at":"2026-05-18T00:14:57.037805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:57.037805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jnrdLii8r6e3/3tUKeBEyaZ2CF1OYReq/MGa551UDlLuwD7pNmP7EP2YMVImauT1fm0Znqv0TVvE3m2XaedqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:57.038381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02704","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2568d2712dccd94e72362443659b8c4f2004a93fa77cf7cbba6a5f7619f092f","sha256:b44a54c3672622f3ae914fa4581c00bd1a2ff66ed62d0a1404f3f5f742bf32d2"],"state_sha256":"9101da51dc2ffc1f3948a592329007de9c30bd6040cc07e16660d26d4e0f9ac0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vp3wU4JdXjh3ErN4b56CIp8urkc97ORHiRN5r4tGja+uDjLYwUZ/XG+KOknuIt2iGa5MnF6u9D6UbCdxq9i5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:43:20.005234Z","bundle_sha256":"9333209ad7f416839264c9abdec11e822fe19e22e8bec0e0147f940ef10e5933"}}