{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J2X6R4DPJFM7HJJHFNCFL6ZW5X","short_pith_number":"pith:J2X6R4DP","canonical_record":{"source":{"id":"1608.04439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-15T23:38:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0015fa5085e34dd85f49d4427471a7f2a43f69464ec6851f650ec1ad2d1ff4f3","abstract_canon_sha256":"4a08f60d5d3b72fd2205dbe75446d4fffda07788a78dad25aff4f66e721a0b34"},"schema_version":"1.0"},"canonical_sha256":"4eafe8f06f4959f3a5272b4455fb36ede136c37f5ebe6bb9fffc64009b31ddf9","source":{"kind":"arxiv","id":"1608.04439","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04439","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04439v1","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04439","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"J2X6R4DPJFM7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2X6R4DPJFM7HJJH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2X6R4DP","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J2X6R4DPJFM7HJJHFNCFL6ZW5X","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-15T23:38:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0015fa5085e34dd85f49d4427471a7f2a43f69464ec6851f650ec1ad2d1ff4f3","abstract_canon_sha256":"4a08f60d5d3b72fd2205dbe75446d4fffda07788a78dad25aff4f66e721a0b34"},"schema_version":"1.0"},"canonical_sha256":"4eafe8f06f4959f3a5272b4455fb36ede136c37f5ebe6bb9fffc64009b31ddf9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:45.152888Z","signature_b64":"Hw62kvqf1/mov8nELMaiLojqRzGgNDRuel+c8SKVmAUxfoT6tiC7n3G+WXa5X/o/PGGqGfpLjQ9bj9qFROfFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eafe8f06f4959f3a5272b4455fb36ede136c37f5ebe6bb9fffc64009b31ddf9","last_reissued_at":"2026-05-18T01:08:45.152521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:45.152521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04439","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-18T01:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1s5Y6c8Gc3Pmx03jvKSNjlOGi4E/VyP4kqGlo3fiJYMlKSuBruK4EAOxDO72dhiDwy6/SqdRic6jP/lq1csBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:43:53.995056Z"},"content_sha256":"e5b7c171b1b55643fa7e27fbe2f81c73dc69bd78d7f08d45d82ebaea2aec2082","schema_version":"1.0","event_id":"sha256:e5b7c171b1b55643fa7e27fbe2f81c73dc69bd78d7f08d45d82ebaea2aec2082"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J2X6R4DPJFM7HJJHFNCFL6ZW5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Space-Time Coding Techniques with Dynamic Buffers for Cooperative DS-CDMA Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J. Gu, R. C. de Lamare","submitted_at":"2016-08-15T23:38:13Z","abstract_excerpt":"In this work, we propose a dynamic buffer-aided distributed space-time coding (DSTC) scheme for cooperative direct-sequence code-division multiple access systems. We first devise a relay selection algorithm that can automatically select the optimum set of relays among both the source-relay phase and the relay-destination phase for DSTC transmission according to the signal-to-interference-plus-noise ratio (SINR) criterion. Multiple relays equipped with dynamic buffers are introduced in the network, which allows the relays to store data received from the sources and wait until the most appropria"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04439","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-18T01:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"as6oHTJkRGr7WPAUKpJiTnJ2Oqt9GlSLUm4mYqYu4007ljZQW25iWEyuhnptTSXFkI76S7UfqQMrykbK1xZUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:43:53.995728Z"},"content_sha256":"5338fc050b32819356e93271848439f8b84e625c0f9aadeae655b0ee33695970","schema_version":"1.0","event_id":"sha256:5338fc050b32819356e93271848439f8b84e625c0f9aadeae655b0ee33695970"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2X6R4DPJFM7HJJHFNCFL6ZW5X/bundle.json","state_url":"https://pith.science/pith/J2X6R4DPJFM7HJJHFNCFL6ZW5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2X6R4DPJFM7HJJHFNCFL6ZW5X/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-09T02:43:53Z","links":{"resolver":"https://pith.science/pith/J2X6R4DPJFM7HJJHFNCFL6ZW5X","bundle":"https://pith.science/pith/J2X6R4DPJFM7HJJHFNCFL6ZW5X/bundle.json","state":"https://pith.science/pith/J2X6R4DPJFM7HJJHFNCFL6ZW5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2X6R4DPJFM7HJJHFNCFL6ZW5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J2X6R4DPJFM7HJJHFNCFL6ZW5X","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":"4a08f60d5d3b72fd2205dbe75446d4fffda07788a78dad25aff4f66e721a0b34","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-15T23:38:13Z","title_canon_sha256":"0015fa5085e34dd85f49d4427471a7f2a43f69464ec6851f650ec1ad2d1ff4f3"},"schema_version":"1.0","source":{"id":"1608.04439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04439","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04439v1","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04439","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"J2X6R4DPJFM7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2X6R4DPJFM7HJJH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2X6R4DP","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:5338fc050b32819356e93271848439f8b84e625c0f9aadeae655b0ee33695970","target":"graph","created_at":"2026-05-18T01:08:45Z","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 work, we propose a dynamic buffer-aided distributed space-time coding (DSTC) scheme for cooperative direct-sequence code-division multiple access systems. We first devise a relay selection algorithm that can automatically select the optimum set of relays among both the source-relay phase and the relay-destination phase for DSTC transmission according to the signal-to-interference-plus-noise ratio (SINR) criterion. Multiple relays equipped with dynamic buffers are introduced in the network, which allows the relays to store data received from the sources and wait until the most appropria","authors_text":"J. Gu, R. C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-15T23:38:13Z","title":"Distributed Space-Time Coding Techniques with Dynamic Buffers for Cooperative DS-CDMA Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04439","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:e5b7c171b1b55643fa7e27fbe2f81c73dc69bd78d7f08d45d82ebaea2aec2082","target":"record","created_at":"2026-05-18T01:08:45Z","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":"4a08f60d5d3b72fd2205dbe75446d4fffda07788a78dad25aff4f66e721a0b34","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-15T23:38:13Z","title_canon_sha256":"0015fa5085e34dd85f49d4427471a7f2a43f69464ec6851f650ec1ad2d1ff4f3"},"schema_version":"1.0","source":{"id":"1608.04439","kind":"arxiv","version":1}},"canonical_sha256":"4eafe8f06f4959f3a5272b4455fb36ede136c37f5ebe6bb9fffc64009b31ddf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4eafe8f06f4959f3a5272b4455fb36ede136c37f5ebe6bb9fffc64009b31ddf9","first_computed_at":"2026-05-18T01:08:45.152521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:45.152521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hw62kvqf1/mov8nELMaiLojqRzGgNDRuel+c8SKVmAUxfoT6tiC7n3G+WXa5X/o/PGGqGfpLjQ9bj9qFROfFAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:45.152888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5b7c171b1b55643fa7e27fbe2f81c73dc69bd78d7f08d45d82ebaea2aec2082","sha256:5338fc050b32819356e93271848439f8b84e625c0f9aadeae655b0ee33695970"],"state_sha256":"a552a489ca54c4db5f0a507c4a2da276c1f88026e01e750f4196fb736deb78ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EYLaCibXM5XOazxhlvlZYGHxq3E7cQo+nMtUQphIGdFS2ZkkJUb53Zwwn9/BSDjw/rqvaFL4G4TU6SrC5eZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:43:53.999355Z","bundle_sha256":"7dde15a5d335e5458bca0461789475d8a340c3a6af97a6e90c1cfab86f120f5a"}}