{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2IA7A4UWMFOAT6JXZKS7RAH7S4","short_pith_number":"pith:2IA7A4UW","schema_version":"1.0","canonical_sha256":"d201f07296615c09f937caa5f880ff9703e778e60247264bd225010df0caa7e6","source":{"kind":"arxiv","id":"1101.2937","version":1},"attestation_state":"computed","paper":{"title":"A Deterministic Polynomial--Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Serap A. Savari, S. M. Sadegh Tabatabaei Yazdi","submitted_at":"2011-01-15T01:27:50Z","abstract_excerpt":"We propose a new way to construct a multicast coding scheme for linear deterministic relay networks. Our construction can be regarded as a generalization of the well-known multicast network coding scheme of Jaggi et al. to linear deterministic relay networks and is based on the notion of flow for a unicast session that was introduced by the authors in earlier work. We present randomized and deterministic polynomial--time versions of our algorithm and show that for a network with $g$ destinations, our deterministic algorithm can achieve the capacity in $\\left\\lceil \\log(g+1)\\right\\rceil $ uses "},"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":"1101.2937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-15T01:27:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"294c4e5113cdf1b786a46c4db36048758436b41db6ece610986e226d8ebc3ceb","abstract_canon_sha256":"c451a02fe2b4f2883cb1c45b57c342e568ef84495c8a5cec63d159fc55f40f05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:57.229346Z","signature_b64":"J4QIjEzvkSuDGsy+pAi8hJYDy8OYC16ZRAyUIIswAbbVGYc2ZdUwmHqarAVzdLLGQa0VQfEbC5BlVzOF149RCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d201f07296615c09f937caa5f880ff9703e778e60247264bd225010df0caa7e6","last_reissued_at":"2026-05-18T02:22:57.228759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:57.228759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deterministic Polynomial--Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Serap A. Savari, S. M. Sadegh Tabatabaei Yazdi","submitted_at":"2011-01-15T01:27:50Z","abstract_excerpt":"We propose a new way to construct a multicast coding scheme for linear deterministic relay networks. Our construction can be regarded as a generalization of the well-known multicast network coding scheme of Jaggi et al. to linear deterministic relay networks and is based on the notion of flow for a unicast session that was introduced by the authors in earlier work. We present randomized and deterministic polynomial--time versions of our algorithm and show that for a network with $g$ destinations, our deterministic algorithm can achieve the capacity in $\\left\\lceil \\log(g+1)\\right\\rceil $ uses "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2937","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":"1101.2937","created_at":"2026-05-18T02:22:57.228878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2937v1","created_at":"2026-05-18T02:22:57.228878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2937","created_at":"2026-05-18T02:22:57.228878+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IA7A4UWMFOA","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IA7A4UWMFOAT6JX","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IA7A4UW","created_at":"2026-05-18T12:26:18.847500+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/2IA7A4UWMFOAT6JXZKS7RAH7S4","json":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4.json","graph_json":"https://pith.science/api/pith-number/2IA7A4UWMFOAT6JXZKS7RAH7S4/graph.json","events_json":"https://pith.science/api/pith-number/2IA7A4UWMFOAT6JXZKS7RAH7S4/events.json","paper":"https://pith.science/paper/2IA7A4UW"},"agent_actions":{"view_html":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4","download_json":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4.json","view_paper":"https://pith.science/paper/2IA7A4UW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2937&json=true","fetch_graph":"https://pith.science/api/pith-number/2IA7A4UWMFOAT6JXZKS7RAH7S4/graph.json","fetch_events":"https://pith.science/api/pith-number/2IA7A4UWMFOAT6JXZKS7RAH7S4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4/action/storage_attestation","attest_author":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4/action/author_attestation","sign_citation":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4/action/citation_signature","submit_replication":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4/action/replication_record"}},"created_at":"2026-05-18T02:22:57.228878+00:00","updated_at":"2026-05-18T02:22:57.228878+00:00"}