{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EW36GIKHMNBHLFAVS6LCUSDGO6","short_pith_number":"pith:EW36GIKH","canonical_record":{"source":{"id":"1301.6426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T01:47:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e0ee66f2c73dbe93f0f9f81c19906a7ddd1ede24164b6e2d8de26bcec87b26dc","abstract_canon_sha256":"14409a308f59b4fc8a6a5a6206763fff538f161fff5658278b139b34db65e723"},"schema_version":"1.0"},"canonical_sha256":"25b7e32147634275941597962a486677bdfaf71866de94428bc3add987a8f071","source":{"kind":"arxiv","id":"1301.6426","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6426","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6426v1","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6426","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"EW36GIKHMNBH","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EW36GIKHMNBHLFAV","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EW36GIKH","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EW36GIKHMNBHLFAVS6LCUSDGO6","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T01:47:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e0ee66f2c73dbe93f0f9f81c19906a7ddd1ede24164b6e2d8de26bcec87b26dc","abstract_canon_sha256":"14409a308f59b4fc8a6a5a6206763fff538f161fff5658278b139b34db65e723"},"schema_version":"1.0"},"canonical_sha256":"25b7e32147634275941597962a486677bdfaf71866de94428bc3add987a8f071","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:15.394696Z","signature_b64":"1TOkM6wG2BIP6gmj+dGfGnWsQoeGvxIcDwE89kBlIrLbyO/Q7jGmtpzvkHr/y5j73VDVElmYArdI30E7rZIjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25b7e32147634275941597962a486677bdfaf71866de94428bc3add987a8f071","last_reissued_at":"2026-05-18T03:35:15.393897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:15.393897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6426","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-18T03:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m41harhv5hCEUk7aO5UE7CpUCGgsAbNgRMwcIH6v/Rxqt16E7CpmBq6DTqCARIs2oIijQlX9twLUdlMbrsoGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:32:12.742207Z"},"content_sha256":"7576da9e4fccbcf7580d49c4102acc11e59001615708061ba5f1a60b43889b60","schema_version":"1.0","event_id":"sha256:7576da9e4fccbcf7580d49c4102acc11e59001615708061ba5f1a60b43889b60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EW36GIKHMNBHLFAVS6LCUSDGO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Design of Channel and Network Coding for Star Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Koller, Daniel J. Costello Jr, Joerg Kliewer, Martin Haenggi","submitted_at":"2013-01-28T01:47:44Z","abstract_excerpt":"Channel coding alone is not sufficient to reliably transmit a message of finite length $K$ from a source to one or more destinations as in, e.g., file transfer. To ensure that no data is lost, it must be combined with rateless erasure correcting schemes on a higher layer, such as a time-division multiple access (TDMA) system paired with automatic repeat request (ARQ) or random linear network coding (RLNC). We consider binary channel coding on a binary symmetric channel (BSC) and q-ary RLNC for erasure correction in a star network, where Y sources send messages to each other with the help of a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6426","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-18T03:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhwwfE/gXMk/7rD57xosiPv0jT5tf5DpUhYYBR8EQldwFzk6rzazVK9hDDEZasOwjMNWiy5W0/hqAi1QYg92BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:32:12.742593Z"},"content_sha256":"0a8a819a065785497e40298b075b5d41a2cb023a076878cbf76a2e1a70a8fd13","schema_version":"1.0","event_id":"sha256:0a8a819a065785497e40298b075b5d41a2cb023a076878cbf76a2e1a70a8fd13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EW36GIKHMNBHLFAVS6LCUSDGO6/bundle.json","state_url":"https://pith.science/pith/EW36GIKHMNBHLFAVS6LCUSDGO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EW36GIKHMNBHLFAVS6LCUSDGO6/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-04T11:32:12Z","links":{"resolver":"https://pith.science/pith/EW36GIKHMNBHLFAVS6LCUSDGO6","bundle":"https://pith.science/pith/EW36GIKHMNBHLFAVS6LCUSDGO6/bundle.json","state":"https://pith.science/pith/EW36GIKHMNBHLFAVS6LCUSDGO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EW36GIKHMNBHLFAVS6LCUSDGO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EW36GIKHMNBHLFAVS6LCUSDGO6","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":"14409a308f59b4fc8a6a5a6206763fff538f161fff5658278b139b34db65e723","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T01:47:44Z","title_canon_sha256":"e0ee66f2c73dbe93f0f9f81c19906a7ddd1ede24164b6e2d8de26bcec87b26dc"},"schema_version":"1.0","source":{"id":"1301.6426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6426","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6426v1","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6426","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"EW36GIKHMNBH","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EW36GIKHMNBHLFAV","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EW36GIKH","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:0a8a819a065785497e40298b075b5d41a2cb023a076878cbf76a2e1a70a8fd13","target":"graph","created_at":"2026-05-18T03:35:15Z","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":"Channel coding alone is not sufficient to reliably transmit a message of finite length $K$ from a source to one or more destinations as in, e.g., file transfer. To ensure that no data is lost, it must be combined with rateless erasure correcting schemes on a higher layer, such as a time-division multiple access (TDMA) system paired with automatic repeat request (ARQ) or random linear network coding (RLNC). We consider binary channel coding on a binary symmetric channel (BSC) and q-ary RLNC for erasure correction in a star network, where Y sources send messages to each other with the help of a ","authors_text":"Christian Koller, Daniel J. Costello Jr, Joerg Kliewer, Martin Haenggi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T01:47:44Z","title":"Joint Design of Channel and Network Coding for Star Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6426","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:7576da9e4fccbcf7580d49c4102acc11e59001615708061ba5f1a60b43889b60","target":"record","created_at":"2026-05-18T03:35:15Z","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":"14409a308f59b4fc8a6a5a6206763fff538f161fff5658278b139b34db65e723","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T01:47:44Z","title_canon_sha256":"e0ee66f2c73dbe93f0f9f81c19906a7ddd1ede24164b6e2d8de26bcec87b26dc"},"schema_version":"1.0","source":{"id":"1301.6426","kind":"arxiv","version":1}},"canonical_sha256":"25b7e32147634275941597962a486677bdfaf71866de94428bc3add987a8f071","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25b7e32147634275941597962a486677bdfaf71866de94428bc3add987a8f071","first_computed_at":"2026-05-18T03:35:15.393897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:15.393897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1TOkM6wG2BIP6gmj+dGfGnWsQoeGvxIcDwE89kBlIrLbyO/Q7jGmtpzvkHr/y5j73VDVElmYArdI30E7rZIjDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:15.394696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7576da9e4fccbcf7580d49c4102acc11e59001615708061ba5f1a60b43889b60","sha256:0a8a819a065785497e40298b075b5d41a2cb023a076878cbf76a2e1a70a8fd13"],"state_sha256":"02cb002c736acd4ef582822e43daff312cb97af83a41c21c788e76c4c5012371"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfgIoNS0E7tRRO1mWmRFC8BrcXmggU+61zW7GHeA4x5vBoIM0FH8moJK9H0xh73RuMnPEOl/tA7pCFxh8hmjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T11:32:12.744468Z","bundle_sha256":"94379d8af8272e3b67eb4bc876d03b608dc4f7aaa75dde20fe7ac80426fd5f5a"}}