{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YBVWWFEOHXMYTH3JJAQTVNQOLP","short_pith_number":"pith:YBVWWFEO","schema_version":"1.0","canonical_sha256":"c06b6b148e3dd9899f6948213ab60e5bebda74391f691f851626b870674f743d","source":{"kind":"arxiv","id":"1602.03117","version":1},"attestation_state":"computed","paper":{"title":"Layering of Communication Networks and a Forward-Backward Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birgit Schotsch, Johannes B. Huber, Michael Cyran, Robert F.H. Fischer, Vahid Forutan","submitted_at":"2016-02-09T18:56:21Z","abstract_excerpt":"In layered communication networks there are only connections between intermediate nodes in adjacent layers. Applying network coding to such networks provides a number of benefits in theory as well as in practice. We propose a \"layering procedure\" to transform an arbitrary network into a layered structure. Furthermore, we derive a \"forward-backward duality\" for linear network codes, which can be seen as an analogon to the \"uplink-downlink duality\" in MIMO communication systems."},"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":"1602.03117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-09T18:56:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b501f80fc5754b07694102e10d94fc1fa237d4de8dac0d5f5e836375e1e3194e","abstract_canon_sha256":"7a41414154f24841b7805847627b44a6938e37516736df390a89312f62728ba1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:03.376883Z","signature_b64":"HmOjeHHGKeSKSGJ4KHVniGXzJMGswfae7cxHch0B0vgdSNFZNk7pSQmwo4YqV3CGkPT4k1rhZ8Jj9elu7nOqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c06b6b148e3dd9899f6948213ab60e5bebda74391f691f851626b870674f743d","last_reissued_at":"2026-05-18T01:21:03.376128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:03.376128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layering of Communication Networks and a Forward-Backward Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birgit Schotsch, Johannes B. Huber, Michael Cyran, Robert F.H. Fischer, Vahid Forutan","submitted_at":"2016-02-09T18:56:21Z","abstract_excerpt":"In layered communication networks there are only connections between intermediate nodes in adjacent layers. Applying network coding to such networks provides a number of benefits in theory as well as in practice. We propose a \"layering procedure\" to transform an arbitrary network into a layered structure. Furthermore, we derive a \"forward-backward duality\" for linear network codes, which can be seen as an analogon to the \"uplink-downlink duality\" in MIMO communication systems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03117","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":"1602.03117","created_at":"2026-05-18T01:21:03.376237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03117v1","created_at":"2026-05-18T01:21:03.376237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03117","created_at":"2026-05-18T01:21:03.376237+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBVWWFEOHXMY","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBVWWFEOHXMYTH3J","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBVWWFEO","created_at":"2026-05-18T12:30:53.716459+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/YBVWWFEOHXMYTH3JJAQTVNQOLP","json":"https://pith.science/pith/YBVWWFEOHXMYTH3JJAQTVNQOLP.json","graph_json":"https://pith.science/api/pith-number/YBVWWFEOHXMYTH3JJAQTVNQOLP/graph.json","events_json":"https://pith.science/api/pith-number/YBVWWFEOHXMYTH3JJAQTVNQOLP/events.json","paper":"https://pith.science/paper/YBVWWFEO"},"agent_actions":{"view_html":"https://pith.science/pith/YBVWWFEOHXMYTH3JJAQTVNQOLP","download_json":"https://pith.science/pith/YBVWWFEOHXMYTH3JJAQTVNQOLP.json","view_paper":"https://pith.science/paper/YBVWWFEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03117&json=true","fetch_graph":"https://pith.science/api/pith-number/YBVWWFEOHXMYTH3JJAQTVNQOLP/graph.json","fetch_events":"https://pith.science/api/pith-number/YBVWWFEOHXMYTH3JJAQTVNQOLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBVWWFEOHXMYTH3JJAQTVNQOLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBVWWFEOHXMYTH3JJAQTVNQOLP/action/storage_attestation","attest_author":"https://pith.science/pith/YBVWWFEOHXMYTH3JJAQTVNQOLP/action/author_attestation","sign_citation":"https://pith.science/pith/YBVWWFEOHXMYTH3JJAQTVNQOLP/action/citation_signature","submit_replication":"https://pith.science/pith/YBVWWFEOHXMYTH3JJAQTVNQOLP/action/replication_record"}},"created_at":"2026-05-18T01:21:03.376237+00:00","updated_at":"2026-05-18T01:21:03.376237+00:00"}