{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YYA6GNFWYORNO46TNDKRLYSX3N","short_pith_number":"pith:YYA6GNFW","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"},"canonical_sha256":"c601e334b6c3a2d773d368d515e257db471548a4bbd27766fece0234782bc7fb","source":{"kind":"arxiv","id":"1012.0599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0599","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0599v1","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0599","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"YYA6GNFWYORN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YYA6GNFWYORNO46T","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YYA6GNFW","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YYA6GNFWYORNO46TNDKRLYSX3N","target":"record","payload":{"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"},"canonical_sha256":"c601e334b6c3a2d773d368d515e257db471548a4bbd27766fece0234782bc7fb","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"},"source_kind":"arxiv","source_id":"1012.0599","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:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oy/zWUnFxWmOu+7o6JQKP8Kw+OPZZDXQbNZNXfh34qJvIBNP4jGmHFsup4KVbNk0Z3yhDXVVdF2FsfL2JAQZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:34:13.805753Z"},"content_sha256":"53d75d07fc4b6188e0315b47e85c8b5200b160b3cfa9eb270ef100a459223317","schema_version":"1.0","event_id":"sha256:53d75d07fc4b6188e0315b47e85c8b5200b160b3cfa9eb270ef100a459223317"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YYA6GNFWYORNO46TNDKRLYSX3N","target":"graph","payload":{"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"},"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:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWKAXCpton6HDQiS/tdwK1jQwd04ygrnIiYriGcWPKHTn4aLMCdO460SNsYPIssREFqkLDu6C8JBOehhyXvpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:34:13.806093Z"},"content_sha256":"cf478739c25035bd4b0122afeb73f23ef75e3bac2adbaeecd19f1abec072dd5b","schema_version":"1.0","event_id":"sha256:cf478739c25035bd4b0122afeb73f23ef75e3bac2adbaeecd19f1abec072dd5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N/bundle.json","state_url":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYA6GNFWYORNO46TNDKRLYSX3N/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-07-02T12:34:13Z","links":{"resolver":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N","bundle":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N/bundle.json","state":"https://pith.science/pith/YYA6GNFWYORNO46TNDKRLYSX3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYA6GNFWYORNO46TNDKRLYSX3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YYA6GNFWYORNO46TNDKRLYSX3N","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":"b834b4582ee51cc7e607ed9bb4a74fde6db73087fcf23ace57400d746953b7d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T22:50:14Z","title_canon_sha256":"59ede1758a63f776dd32a11b6c9ac213e08367ed5bf1fed86add8e125f8fdfb3"},"schema_version":"1.0","source":{"id":"1012.0599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0599","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0599v1","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0599","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"YYA6GNFWYORN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YYA6GNFWYORNO46T","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YYA6GNFW","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:cf478739c25035bd4b0122afeb73f23ef75e3bac2adbaeecd19f1abec072dd5b","target":"graph","created_at":"2026-05-18T02:23:16Z","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":"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","authors_text":"Charlotte Hucher, Parastoo Sadeghi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T22:50:14Z","title":"Towards a Low-Complexity Dynamic Decode-and-Forward Relay Protocol"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0599","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:53d75d07fc4b6188e0315b47e85c8b5200b160b3cfa9eb270ef100a459223317","target":"record","created_at":"2026-05-18T02:23:16Z","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":"b834b4582ee51cc7e607ed9bb4a74fde6db73087fcf23ace57400d746953b7d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T22:50:14Z","title_canon_sha256":"59ede1758a63f776dd32a11b6c9ac213e08367ed5bf1fed86add8e125f8fdfb3"},"schema_version":"1.0","source":{"id":"1012.0599","kind":"arxiv","version":1}},"canonical_sha256":"c601e334b6c3a2d773d368d515e257db471548a4bbd27766fece0234782bc7fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c601e334b6c3a2d773d368d515e257db471548a4bbd27766fece0234782bc7fb","first_computed_at":"2026-05-18T02:23:16.423103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:16.423103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yBTGrOfj+rxeC7LgxaN9CoVJGcaZ7LsX0UZBWF9z+gWBBAwKKe01lv3x0HZk//2iWhJTyOGmRMqoyOq4mPuGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:16.423744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.0599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53d75d07fc4b6188e0315b47e85c8b5200b160b3cfa9eb270ef100a459223317","sha256:cf478739c25035bd4b0122afeb73f23ef75e3bac2adbaeecd19f1abec072dd5b"],"state_sha256":"14447ec70f7cde17cee71683dc434e96e7c2b6b585d94f302a9b72f5f313bfe8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ywVErupbwfQhgR4uuO8nDPl7YvE8NgTldFwMQ5DqY5Owi32zDgZB4ctPMWC1kfSp67IUfg7PMbLCf4TazYyeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T12:34:13.807999Z","bundle_sha256":"4bb6492e17f2ff62694ea9e4356f51d0be3e6ee556d44f05673c8da3cadd7a35"}}