{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7K2PZI5MPU43RQ3BZNJCG7EOMA","short_pith_number":"pith:7K2PZI5M","schema_version":"1.0","canonical_sha256":"fab4fca3ac7d39b8c361cb52237c8e6023a6cfc51df35b345cc24031a6617008","source":{"kind":"arxiv","id":"1502.00656","version":2},"attestation_state":"computed","paper":{"title":"Alignment based Network Coding for Two-Unicast-Z Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Muriel Medard, Viveck R. Cadambe, Weifei Zeng","submitted_at":"2015-02-02T21:41:02Z","abstract_excerpt":"In this paper, we study the wireline two-unicast-Z communication network over directed acyclic graphs. The two-unicast-Z network is a two-unicast network where the destination intending to decode the second message has apriori side information of the first message. We make three contributions in this paper:\n  1. We describe a new linear network coding algorithm for two-unicast-Z networks over directed acyclic graphs. Our approach includes the idea of interference alignment as one of its key ingredients. For graphs of a bounded degree, our algorithm has linear complexity in terms of the number "},"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":"1502.00656","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-02T21:41:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1f50f8f6e332369ac8957e0a8c8ca1bf8aaf6c52f9751b1d8bb45392e8ed0ac","abstract_canon_sha256":"9222ed59917367213b67db296b850498630b96c0c2395bb4f9ec967d9a6c4be0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:43.757526Z","signature_b64":"JBRy79Mj3EaQAs79Ah8B+nF/kXrI/alhAQpMNAdXD4hevqIh1nX+/5rvDVIMVdhMLVOF/meYbSWWvshQAdBfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fab4fca3ac7d39b8c361cb52237c8e6023a6cfc51df35b345cc24031a6617008","last_reissued_at":"2026-05-18T02:27:43.756979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:43.756979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alignment based Network Coding for Two-Unicast-Z Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Muriel Medard, Viveck R. Cadambe, Weifei Zeng","submitted_at":"2015-02-02T21:41:02Z","abstract_excerpt":"In this paper, we study the wireline two-unicast-Z communication network over directed acyclic graphs. The two-unicast-Z network is a two-unicast network where the destination intending to decode the second message has apriori side information of the first message. We make three contributions in this paper:\n  1. We describe a new linear network coding algorithm for two-unicast-Z networks over directed acyclic graphs. Our approach includes the idea of interference alignment as one of its key ingredients. For graphs of a bounded degree, our algorithm has linear complexity in terms of the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00656","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.00656","created_at":"2026-05-18T02:27:43.757059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00656v2","created_at":"2026-05-18T02:27:43.757059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00656","created_at":"2026-05-18T02:27:43.757059+00:00"},{"alias_kind":"pith_short_12","alias_value":"7K2PZI5MPU43","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7K2PZI5MPU43RQ3B","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7K2PZI5M","created_at":"2026-05-18T12:29:10.953037+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/7K2PZI5MPU43RQ3BZNJCG7EOMA","json":"https://pith.science/pith/7K2PZI5MPU43RQ3BZNJCG7EOMA.json","graph_json":"https://pith.science/api/pith-number/7K2PZI5MPU43RQ3BZNJCG7EOMA/graph.json","events_json":"https://pith.science/api/pith-number/7K2PZI5MPU43RQ3BZNJCG7EOMA/events.json","paper":"https://pith.science/paper/7K2PZI5M"},"agent_actions":{"view_html":"https://pith.science/pith/7K2PZI5MPU43RQ3BZNJCG7EOMA","download_json":"https://pith.science/pith/7K2PZI5MPU43RQ3BZNJCG7EOMA.json","view_paper":"https://pith.science/paper/7K2PZI5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00656&json=true","fetch_graph":"https://pith.science/api/pith-number/7K2PZI5MPU43RQ3BZNJCG7EOMA/graph.json","fetch_events":"https://pith.science/api/pith-number/7K2PZI5MPU43RQ3BZNJCG7EOMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7K2PZI5MPU43RQ3BZNJCG7EOMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7K2PZI5MPU43RQ3BZNJCG7EOMA/action/storage_attestation","attest_author":"https://pith.science/pith/7K2PZI5MPU43RQ3BZNJCG7EOMA/action/author_attestation","sign_citation":"https://pith.science/pith/7K2PZI5MPU43RQ3BZNJCG7EOMA/action/citation_signature","submit_replication":"https://pith.science/pith/7K2PZI5MPU43RQ3BZNJCG7EOMA/action/replication_record"}},"created_at":"2026-05-18T02:27:43.757059+00:00","updated_at":"2026-05-18T02:27:43.757059+00:00"}