{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:S3TOTXIJ475VACREMWWXW2RFWP","short_pith_number":"pith:S3TOTXIJ","canonical_record":{"source":{"id":"1307.4463","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T01:35:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"753cd92816a6fa4ea08285966c2e372d185b7f3d3ffa5f898b1c54efeed9fd85","abstract_canon_sha256":"ab1e3cedb6d8404ba0040f854108e8ccf3aad769e2497a3d95f3eb39b16c76e5"},"schema_version":"1.0"},"canonical_sha256":"96e6e9dd09e7fb500a2465ad7b6a25b3cc13aa4069ff7fe4fce624ceb4c2816b","source":{"kind":"arxiv","id":"1307.4463","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4463","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4463v2","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4463","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"S3TOTXIJ475V","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S3TOTXIJ475VACRE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S3TOTXIJ","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:S3TOTXIJ475VACREMWWXW2RFWP","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4463","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T01:35:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"753cd92816a6fa4ea08285966c2e372d185b7f3d3ffa5f898b1c54efeed9fd85","abstract_canon_sha256":"ab1e3cedb6d8404ba0040f854108e8ccf3aad769e2497a3d95f3eb39b16c76e5"},"schema_version":"1.0"},"canonical_sha256":"96e6e9dd09e7fb500a2465ad7b6a25b3cc13aa4069ff7fe4fce624ceb4c2816b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.955404Z","signature_b64":"njGJWbXP+NnzskSjE7Yma61tVAB+eqOVsh3jy2qf3FZ3LhB2r4w0byo4GyXW01Ev2aWERAjViGYwjNRjkIsCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96e6e9dd09e7fb500a2465ad7b6a25b3cc13aa4069ff7fe4fce624ceb4c2816b","last_reissued_at":"2026-05-18T00:59:03.954916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.954916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4463","source_version":2,"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-18T00:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QfJWIuPy5pbd7sIGqebpnVCOTlvssdSjmGxkxVegcaqwsO6VyF4nVHA8XDwI/wL2LR0FjwzH14JFa9Rf3uDZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:38:41.329572Z"},"content_sha256":"e03ddac7e963d2d898943bae021acf497b586e334166baa7c88e751ed3c9012e","schema_version":"1.0","event_id":"sha256:e03ddac7e963d2d898943bae021acf497b586e334166baa7c88e751ed3c9012e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:S3TOTXIJ475VACREMWWXW2RFWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Raptor Coding for Erasure Channels: Partially and Fully Coded Cooperation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Mahyar Shirvanimoghaddam, Shuang Tian, Yonghui Li","submitted_at":"2013-07-17T01:35:02Z","abstract_excerpt":"In this paper, we propose a new rateless coded cooperation scheme for a general multi-user cooperative wireless system. We develop cooperation methods based on Raptor codes with the assumption that the channels face erasure with specific erasure probabilities and transmitters have no channel state information. A fully coded cooperation (FCC) and a partially coded cooperation (PCC) strategy are developed to maximize the average system throughput. Both PCC and FCC schemes have been analyzed through AND-OR tree analysis and a linear programming optimization problem is then formulated to find the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4463","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"},"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-18T00:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LoYr/oYe0XrNpC/ZafhI9Dy2C9epJRVxSNA2zwkY6hq1MdaPSwNm2KEbZLEB9HOq0RvAk8Zl9HtM6A3PZdXZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:38:41.330061Z"},"content_sha256":"1bc216e930ebc36427fff7b1cc80c3459f2ff710792195e005573776fc04d83f","schema_version":"1.0","event_id":"sha256:1bc216e930ebc36427fff7b1cc80c3459f2ff710792195e005573776fc04d83f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3TOTXIJ475VACREMWWXW2RFWP/bundle.json","state_url":"https://pith.science/pith/S3TOTXIJ475VACREMWWXW2RFWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3TOTXIJ475VACREMWWXW2RFWP/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-05-26T03:38:41Z","links":{"resolver":"https://pith.science/pith/S3TOTXIJ475VACREMWWXW2RFWP","bundle":"https://pith.science/pith/S3TOTXIJ475VACREMWWXW2RFWP/bundle.json","state":"https://pith.science/pith/S3TOTXIJ475VACREMWWXW2RFWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3TOTXIJ475VACREMWWXW2RFWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:S3TOTXIJ475VACREMWWXW2RFWP","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":"ab1e3cedb6d8404ba0040f854108e8ccf3aad769e2497a3d95f3eb39b16c76e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T01:35:02Z","title_canon_sha256":"753cd92816a6fa4ea08285966c2e372d185b7f3d3ffa5f898b1c54efeed9fd85"},"schema_version":"1.0","source":{"id":"1307.4463","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4463","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4463v2","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4463","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"S3TOTXIJ475V","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S3TOTXIJ475VACRE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S3TOTXIJ","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:1bc216e930ebc36427fff7b1cc80c3459f2ff710792195e005573776fc04d83f","target":"graph","created_at":"2026-05-18T00:59:03Z","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":"In this paper, we propose a new rateless coded cooperation scheme for a general multi-user cooperative wireless system. We develop cooperation methods based on Raptor codes with the assumption that the channels face erasure with specific erasure probabilities and transmitters have no channel state information. A fully coded cooperation (FCC) and a partially coded cooperation (PCC) strategy are developed to maximize the average system throughput. Both PCC and FCC schemes have been analyzed through AND-OR tree analysis and a linear programming optimization problem is then formulated to find the ","authors_text":"Branka Vucetic, Mahyar Shirvanimoghaddam, Shuang Tian, Yonghui Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T01:35:02Z","title":"Distributed Raptor Coding for Erasure Channels: Partially and Fully Coded Cooperation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4463","kind":"arxiv","version":2},"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:e03ddac7e963d2d898943bae021acf497b586e334166baa7c88e751ed3c9012e","target":"record","created_at":"2026-05-18T00:59:03Z","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":"ab1e3cedb6d8404ba0040f854108e8ccf3aad769e2497a3d95f3eb39b16c76e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T01:35:02Z","title_canon_sha256":"753cd92816a6fa4ea08285966c2e372d185b7f3d3ffa5f898b1c54efeed9fd85"},"schema_version":"1.0","source":{"id":"1307.4463","kind":"arxiv","version":2}},"canonical_sha256":"96e6e9dd09e7fb500a2465ad7b6a25b3cc13aa4069ff7fe4fce624ceb4c2816b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96e6e9dd09e7fb500a2465ad7b6a25b3cc13aa4069ff7fe4fce624ceb4c2816b","first_computed_at":"2026-05-18T00:59:03.954916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:03.954916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"njGJWbXP+NnzskSjE7Yma61tVAB+eqOVsh3jy2qf3FZ3LhB2r4w0byo4GyXW01Ev2aWERAjViGYwjNRjkIsCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:03.955404Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4463","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e03ddac7e963d2d898943bae021acf497b586e334166baa7c88e751ed3c9012e","sha256:1bc216e930ebc36427fff7b1cc80c3459f2ff710792195e005573776fc04d83f"],"state_sha256":"9e38f3666de123c4eaeb09bad7709707cb3fc3d09a044e565f326eeacdf27f8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+3225f+WLe1Ndr12PwEBblDbeU3bqUJxIPUIIlq7Ida3fgo5LOAghtb9ss/0Tpc3oGFPpbpKeG+41aIuSqRPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:38:41.333526Z","bundle_sha256":"107a8b44a6dfa936378801f15e3a9fa61a13798a0963e23d35f9dbc124bcbdf2"}}