{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YYA6GNFWYORNO46TNDKRLYSX3N","short_pith_number":"pith:YYA6GNFW","schema_version":"1.0","canonical_sha256":"c601e334b6c3a2d773d368d515e257db471548a4bbd27766fece0234782bc7fb","source":{"kind":"arxiv","id":"1012.0599","version":1},"attestation_state":"computed","paper":{"title":"Towards a Low-Complexity Dynamic Decode-and-Forward Relay Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charlotte Hucher, Parastoo Sadeghi","submitted_at":"2010-12-02T22:50:14Z","abstract_excerpt":"The dynamic decode-and-forward (DDF) relaying protocol is a relatively new cooperative scheme which has been shown to achieve promising theoretical results in terms of diversity-multiplexing gain tradeoff and error rates. The case of a single relay has been extensively studied in the literature and several techniques to approach the optimum performance have been proposed. Until recently, however, a practical implementation for the case of several relays had been considered to be much more challenging. A rotation-based DDF technique, suitable for any number of relays, has been recently proposed"},"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":"1012.0599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T22:50:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59ede1758a63f776dd32a11b6c9ac213e08367ed5bf1fed86add8e125f8fdfb3","abstract_canon_sha256":"b834b4582ee51cc7e607ed9bb4a74fde6db73087fcf23ace57400d746953b7d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:16.423744Z","signature_b64":"yBTGrOfj+rxeC7LgxaN9CoVJGcaZ7LsX0UZBWF9z+gWBBAwKKe01lv3x0HZk//2iWhJTyOGmRMqoyOq4mPuGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c601e334b6c3a2d773d368d515e257db471548a4bbd27766fece0234782bc7fb","last_reissued_at":"2026-05-18T02:23:16.423103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:16.423103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a Low-Complexity Dynamic Decode-and-Forward Relay Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charlotte Hucher, Parastoo Sadeghi","submitted_at":"2010-12-02T22:50:14Z","abstract_excerpt":"The dynamic decode-and-forward (DDF) relaying protocol is a relatively new cooperative scheme which has been shown to achieve promising theoretical results in terms of diversity-multiplexing gain tradeoff and error rates. The case of a single relay has been extensively studied in the literature and several techniques to approach the optimum performance have been proposed. Until recently, however, a practical implementation for the case of several relays had been considered to be much more challenging. A rotation-based DDF technique, suitable for any number of relays, has been recently proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0599","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":"1012.0599","created_at":"2026-05-18T02:23:16.423203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.0599v1","created_at":"2026-05-18T02:23:16.423203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0599","created_at":"2026-05-18T02:23:16.423203+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYA6GNFWYORN","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYA6GNFWYORNO46T","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYA6GNFW","created_at":"2026-05-18T12:26:17.028572+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/YYA6GNFWYORNO46TNDKRLYSX3N","json":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N.json","graph_json":"https://pith.science/api/pith-number/YYA6GNFWYORNO46TNDKRLYSX3N/graph.json","events_json":"https://pith.science/api/pith-number/YYA6GNFWYORNO46TNDKRLYSX3N/events.json","paper":"https://pith.science/paper/YYA6GNFW"},"agent_actions":{"view_html":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N","download_json":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N.json","view_paper":"https://pith.science/paper/YYA6GNFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.0599&json=true","fetch_graph":"https://pith.science/api/pith-number/YYA6GNFWYORNO46TNDKRLYSX3N/graph.json","fetch_events":"https://pith.science/api/pith-number/YYA6GNFWYORNO46TNDKRLYSX3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N/action/storage_attestation","attest_author":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N/action/author_attestation","sign_citation":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N/action/citation_signature","submit_replication":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N/action/replication_record"}},"created_at":"2026-05-18T02:23:16.423203+00:00","updated_at":"2026-05-18T02:23:16.423203+00:00"}