{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2IA7A4UWMFOAT6JXZKS7RAH7S4","short_pith_number":"pith:2IA7A4UW","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"},"canonical_sha256":"d201f07296615c09f937caa5f880ff9703e778e60247264bd225010df0caa7e6","source":{"kind":"arxiv","id":"1101.2937","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2937","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2937v1","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2937","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"pith_short_12","alias_value":"2IA7A4UWMFOA","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2IA7A4UWMFOAT6JX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2IA7A4UW","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2IA7A4UWMFOAT6JXZKS7RAH7S4","target":"record","payload":{"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"},"canonical_sha256":"d201f07296615c09f937caa5f880ff9703e778e60247264bd225010df0caa7e6","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"},"source_kind":"arxiv","source_id":"1101.2937","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-18T02:22:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MZxc42iR3ncEVJiSN+QlD78uV8ioamO0lpt21mWEaz7pwP0sVNeUoZ+Qhx2piRz3iSJFhoFe4jPZ72PPvUlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:38:44.062360Z"},"content_sha256":"49919536ff809a72949d9201a3ccc906236c33013ee23fd2ed003bba936434c9","schema_version":"1.0","event_id":"sha256:49919536ff809a72949d9201a3ccc906236c33013ee23fd2ed003bba936434c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2IA7A4UWMFOAT6JXZKS7RAH7S4","target":"graph","payload":{"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"},"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-18T02:22:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/q4mAcuz0gtqBAWuHBptppNqEqI22grSPsD4jwbcxiWJxI0/6p7ZFVQT7YgPTNNoDd41+slug0cNUXAuIoISBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:38:44.062717Z"},"content_sha256":"0a26b572cc753f1f5c8f450c4d94cbd5233e9df89c5be21c3239261efee8a60d","schema_version":"1.0","event_id":"sha256:0a26b572cc753f1f5c8f450c4d94cbd5233e9df89c5be21c3239261efee8a60d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4/bundle.json","state_url":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4/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-06-26T02:38:44Z","links":{"resolver":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4","bundle":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4/bundle.json","state":"https://pith.science/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IA7A4UWMFOAT6JXZKS7RAH7S4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2IA7A4UWMFOAT6JXZKS7RAH7S4","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":"c451a02fe2b4f2883cb1c45b57c342e568ef84495c8a5cec63d159fc55f40f05","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-15T01:27:50Z","title_canon_sha256":"294c4e5113cdf1b786a46c4db36048758436b41db6ece610986e226d8ebc3ceb"},"schema_version":"1.0","source":{"id":"1101.2937","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2937","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2937v1","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2937","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"pith_short_12","alias_value":"2IA7A4UWMFOA","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2IA7A4UWMFOAT6JX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2IA7A4UW","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:0a26b572cc753f1f5c8f450c4d94cbd5233e9df89c5be21c3239261efee8a60d","target":"graph","created_at":"2026-05-18T02:22: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 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 ","authors_text":"Serap A. Savari, S. M. Sadegh Tabatabaei Yazdi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-15T01:27:50Z","title":"A Deterministic Polynomial--Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2937","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:49919536ff809a72949d9201a3ccc906236c33013ee23fd2ed003bba936434c9","target":"record","created_at":"2026-05-18T02:22: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":"c451a02fe2b4f2883cb1c45b57c342e568ef84495c8a5cec63d159fc55f40f05","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-15T01:27:50Z","title_canon_sha256":"294c4e5113cdf1b786a46c4db36048758436b41db6ece610986e226d8ebc3ceb"},"schema_version":"1.0","source":{"id":"1101.2937","kind":"arxiv","version":1}},"canonical_sha256":"d201f07296615c09f937caa5f880ff9703e778e60247264bd225010df0caa7e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d201f07296615c09f937caa5f880ff9703e778e60247264bd225010df0caa7e6","first_computed_at":"2026-05-18T02:22:57.228759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:57.228759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J4QIjEzvkSuDGsy+pAi8hJYDy8OYC16ZRAyUIIswAbbVGYc2ZdUwmHqarAVzdLLGQa0VQfEbC5BlVzOF149RCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:57.229346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2937","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49919536ff809a72949d9201a3ccc906236c33013ee23fd2ed003bba936434c9","sha256:0a26b572cc753f1f5c8f450c4d94cbd5233e9df89c5be21c3239261efee8a60d"],"state_sha256":"7c9e3c49b992dfe921d38fe9f60fa23223e1361a32ddc4cc013755bac290fd95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5m48+lU0S4Ldmp2SLGqFuEFGuIpRZgIds+5Ff5/+FDxeuTdteUCm1FHIYQWDCmYMe6Rt+FUpWu83fsSWd/QAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:38:44.064694Z","bundle_sha256":"fddd69adbabd5032bb948e034a387ad5adbbdbed27896877ec666852453af9dc"}}