{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DNJ3OUGYMPM4BWVMA4YHQF3V2N","short_pith_number":"pith:DNJ3OUGY","canonical_record":{"source":{"id":"1707.06333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T01:19:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d42f0fee6db94b5ae631ffe3008f244099a7ba1ff914f599e7747844ae472ead","abstract_canon_sha256":"8b3854a1da1b42e39fa49d0fdad7955f66efd327563ccf7f0a8c22e8b2baf7cd"},"schema_version":"1.0"},"canonical_sha256":"1b53b750d863d9c0daac0730781775d361b8f2df468098d98e70a3a8221d61c6","source":{"kind":"arxiv","id":"1707.06333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06333","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06333v1","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06333","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"DNJ3OUGYMPM4","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DNJ3OUGYMPM4BWVM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DNJ3OUGY","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DNJ3OUGYMPM4BWVMA4YHQF3V2N","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T01:19:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d42f0fee6db94b5ae631ffe3008f244099a7ba1ff914f599e7747844ae472ead","abstract_canon_sha256":"8b3854a1da1b42e39fa49d0fdad7955f66efd327563ccf7f0a8c22e8b2baf7cd"},"schema_version":"1.0"},"canonical_sha256":"1b53b750d863d9c0daac0730781775d361b8f2df468098d98e70a3a8221d61c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:54.129133Z","signature_b64":"gOBlRPdEs4fVDGlwlKwEBldvBTZDdONHeEMhIxwLqycXJ2ZnPkXLOM3JOFFXTXd61JSmYtbVIETmNhtto2eBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b53b750d863d9c0daac0730781775d361b8f2df468098d98e70a3a8221d61c6","last_reissued_at":"2026-05-18T00:39:54.128505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:54.128505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06333","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-18T00:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9uW27NMPOGNrCQsVUtbN683ZL1CelwTJzGekoh+ljDIn9+npTaAnSKG8/iIwiB9zQoO1jVKfsCdjj+OZ9kfzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:20:57.461304Z"},"content_sha256":"febee7e42eb1cb249dd8936cc5d95ac1e2f0dacce68f07f6c653731478be5a22","schema_version":"1.0","event_id":"sha256:febee7e42eb1cb249dd8936cc5d95ac1e2f0dacce68f07f6c653731478be5a22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DNJ3OUGYMPM4BWVMA4YHQF3V2N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Study of Buffer-aided physical-layer network coding with ML and MMSE linear code designs 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":"Jiaqi Gu, Mario Huemer, Rodrigo C. de Lamare","submitted_at":"2017-07-20T01:19:39Z","abstract_excerpt":"In this work, we propose buffer-aided physical-layer network coding (PLNC) techniques for cooperative direct-sequence code-division multiple access systems. In the proposed buffer-aided PLNC schemes, a relay pair selection algorithm is employed to obtain the relay pair and the packets in the buffer entries with the best performance and the associated link combinations used for data transmission. We also devise PLNC schemes based on the design of linear network coding matrices using maximum likelihood and minimum mean-square error criteria to generate the network coded symbols that are sent to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06333","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-18T00:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UzqFslQ26RnKDS+QI2mhzfaCusgemTiDSS4zfP0fWhEkQPGv37Jm2kxKO5D/Wlhlqs6b1jaWPFozOMrwIXHJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:20:57.461669Z"},"content_sha256":"2029241121b3f50af42dff66a011bbccfe9afc94dda3f1940466a2932d20a336","schema_version":"1.0","event_id":"sha256:2029241121b3f50af42dff66a011bbccfe9afc94dda3f1940466a2932d20a336"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNJ3OUGYMPM4BWVMA4YHQF3V2N/bundle.json","state_url":"https://pith.science/pith/DNJ3OUGYMPM4BWVMA4YHQF3V2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNJ3OUGYMPM4BWVMA4YHQF3V2N/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-02T16:20:57Z","links":{"resolver":"https://pith.science/pith/DNJ3OUGYMPM4BWVMA4YHQF3V2N","bundle":"https://pith.science/pith/DNJ3OUGYMPM4BWVMA4YHQF3V2N/bundle.json","state":"https://pith.science/pith/DNJ3OUGYMPM4BWVMA4YHQF3V2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNJ3OUGYMPM4BWVMA4YHQF3V2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DNJ3OUGYMPM4BWVMA4YHQF3V2N","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":"8b3854a1da1b42e39fa49d0fdad7955f66efd327563ccf7f0a8c22e8b2baf7cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T01:19:39Z","title_canon_sha256":"d42f0fee6db94b5ae631ffe3008f244099a7ba1ff914f599e7747844ae472ead"},"schema_version":"1.0","source":{"id":"1707.06333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06333","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06333v1","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06333","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"DNJ3OUGYMPM4","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DNJ3OUGYMPM4BWVM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DNJ3OUGY","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:2029241121b3f50af42dff66a011bbccfe9afc94dda3f1940466a2932d20a336","target":"graph","created_at":"2026-05-18T00:39:54Z","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 buffer-aided physical-layer network coding (PLNC) techniques for cooperative direct-sequence code-division multiple access systems. In the proposed buffer-aided PLNC schemes, a relay pair selection algorithm is employed to obtain the relay pair and the packets in the buffer entries with the best performance and the associated link combinations used for data transmission. We also devise PLNC schemes based on the design of linear network coding matrices using maximum likelihood and minimum mean-square error criteria to generate the network coded symbols that are sent to ","authors_text":"Jiaqi Gu, Mario Huemer, Rodrigo C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T01:19:39Z","title":"Study of Buffer-aided physical-layer network coding with ML and MMSE linear code designs for cooperative DS-CDMA systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06333","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:febee7e42eb1cb249dd8936cc5d95ac1e2f0dacce68f07f6c653731478be5a22","target":"record","created_at":"2026-05-18T00:39:54Z","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":"8b3854a1da1b42e39fa49d0fdad7955f66efd327563ccf7f0a8c22e8b2baf7cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T01:19:39Z","title_canon_sha256":"d42f0fee6db94b5ae631ffe3008f244099a7ba1ff914f599e7747844ae472ead"},"schema_version":"1.0","source":{"id":"1707.06333","kind":"arxiv","version":1}},"canonical_sha256":"1b53b750d863d9c0daac0730781775d361b8f2df468098d98e70a3a8221d61c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b53b750d863d9c0daac0730781775d361b8f2df468098d98e70a3a8221d61c6","first_computed_at":"2026-05-18T00:39:54.128505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:54.128505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gOBlRPdEs4fVDGlwlKwEBldvBTZDdONHeEMhIxwLqycXJ2ZnPkXLOM3JOFFXTXd61JSmYtbVIETmNhtto2eBBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:54.129133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:febee7e42eb1cb249dd8936cc5d95ac1e2f0dacce68f07f6c653731478be5a22","sha256:2029241121b3f50af42dff66a011bbccfe9afc94dda3f1940466a2932d20a336"],"state_sha256":"77c0ef6513e9e43d9ed5442f0ab0fb32c0aba51367b9c01e92f0e89725598558"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2x0we1yJjVgAlQakq1KVjoQ4sbMN8GH2hTfzBrvZscix4NB3uFQtCuLmtmAoUBbC2kXlc63uGnkhnd03N8tDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:20:57.464551Z","bundle_sha256":"9f9bc7537e1c4ac899282860a05f1db2d8cbb53a3655156ffbb99072d35c403f"}}