{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JDCJWYMT4ETGEY5EBCTS5LRQIS","short_pith_number":"pith:JDCJWYMT","canonical_record":{"source":{"id":"1412.6680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-20T19:03:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dfb12247abbc4be977cfb131a0d6ccf4c054daf62effbd7b8f0a49a66f7d1d78","abstract_canon_sha256":"81779dd0b739efb8b782d48fc081058f6d8bae89a3451d5f35a6c11e88953082"},"schema_version":"1.0"},"canonical_sha256":"48c49b6193e1266263a408a72eae3044823f8608fff2ff4a89aba128e6a7664e","source":{"kind":"arxiv","id":"1412.6680","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6680","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6680v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6680","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"JDCJWYMT4ETG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JDCJWYMT4ETGEY5E","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JDCJWYMT","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JDCJWYMT4ETGEY5EBCTS5LRQIS","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-20T19:03:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dfb12247abbc4be977cfb131a0d6ccf4c054daf62effbd7b8f0a49a66f7d1d78","abstract_canon_sha256":"81779dd0b739efb8b782d48fc081058f6d8bae89a3451d5f35a6c11e88953082"},"schema_version":"1.0"},"canonical_sha256":"48c49b6193e1266263a408a72eae3044823f8608fff2ff4a89aba128e6a7664e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:46.445725Z","signature_b64":"oHxCeCsB9YiYCEGYk2YmmBZkpcqODqZqyvBB7G8QNI2bvv5uMDcrXbzPQ3aTybivilsPSHBynMJl0v0KgAEdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48c49b6193e1266263a408a72eae3044823f8608fff2ff4a89aba128e6a7664e","last_reissued_at":"2026-05-18T02:30:46.445304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:46.445304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6680","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:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjlDnOMM1pLAIMFug6bo0TDV3jZPaL6SCcjz2tLD23RkRdVu1NUV5vSKm50IGzCD9JWBUJ1Vh+tTEGlqnOOABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:21:57.476117Z"},"content_sha256":"4e0b78745f1c034ea716eba92d3aa0c5496af8a906019021a814929db9e65528","schema_version":"1.0","event_id":"sha256:4e0b78745f1c034ea716eba92d3aa0c5496af8a906019021a814929db9e65528"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JDCJWYMT4ETGEY5EBCTS5LRQIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Coded Multi-Hop Wireless Communication Networks: Channel Estimation and Training Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"H. Vincent Poor, Mugen Peng, Qiang Hu, Xinqian Xie, Zhongyuan Zhao","submitted_at":"2014-12-20T19:03:16Z","abstract_excerpt":"User cooperation based multi-hop wireless communication networks (MH-WCNs) as the key communication technological component of mobile social networks (MSNs) should be exploited to enhance the capability of accumulating data rates and extending coverage flexibly. As one of the most promising and efficient user cooperation techniques, network coding can increase the potential cooperation performance gains among selfishly driven users in MSNs. To take full advantages of network coding in MH-WCNs, a network coding transmission strategy and its corresponding channel estimation technique are studied"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6680","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:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LNWACK7ZgZlZxxbUoJOmYZt7jqiFehfrF+vzedrGPGYbw2gyuOc7zBE6AsYMDZ+5czSltv6gQUwxb9/8leQFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:21:57.476830Z"},"content_sha256":"34503fb3a5c3763e9c268bd3878d76e349a76f1b7bf8ac112809af6811d9cfc5","schema_version":"1.0","event_id":"sha256:34503fb3a5c3763e9c268bd3878d76e349a76f1b7bf8ac112809af6811d9cfc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDCJWYMT4ETGEY5EBCTS5LRQIS/bundle.json","state_url":"https://pith.science/pith/JDCJWYMT4ETGEY5EBCTS5LRQIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDCJWYMT4ETGEY5EBCTS5LRQIS/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-25T22:21:57Z","links":{"resolver":"https://pith.science/pith/JDCJWYMT4ETGEY5EBCTS5LRQIS","bundle":"https://pith.science/pith/JDCJWYMT4ETGEY5EBCTS5LRQIS/bundle.json","state":"https://pith.science/pith/JDCJWYMT4ETGEY5EBCTS5LRQIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDCJWYMT4ETGEY5EBCTS5LRQIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JDCJWYMT4ETGEY5EBCTS5LRQIS","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":"81779dd0b739efb8b782d48fc081058f6d8bae89a3451d5f35a6c11e88953082","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-20T19:03:16Z","title_canon_sha256":"dfb12247abbc4be977cfb131a0d6ccf4c054daf62effbd7b8f0a49a66f7d1d78"},"schema_version":"1.0","source":{"id":"1412.6680","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6680","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6680v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6680","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"JDCJWYMT4ETG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JDCJWYMT4ETGEY5E","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JDCJWYMT","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:34503fb3a5c3763e9c268bd3878d76e349a76f1b7bf8ac112809af6811d9cfc5","target":"graph","created_at":"2026-05-18T02:30:46Z","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":"User cooperation based multi-hop wireless communication networks (MH-WCNs) as the key communication technological component of mobile social networks (MSNs) should be exploited to enhance the capability of accumulating data rates and extending coverage flexibly. As one of the most promising and efficient user cooperation techniques, network coding can increase the potential cooperation performance gains among selfishly driven users in MSNs. To take full advantages of network coding in MH-WCNs, a network coding transmission strategy and its corresponding channel estimation technique are studied","authors_text":"H. Vincent Poor, Mugen Peng, Qiang Hu, Xinqian Xie, Zhongyuan Zhao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-20T19:03:16Z","title":"Network Coded Multi-Hop Wireless Communication Networks: Channel Estimation and Training Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6680","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:4e0b78745f1c034ea716eba92d3aa0c5496af8a906019021a814929db9e65528","target":"record","created_at":"2026-05-18T02:30:46Z","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":"81779dd0b739efb8b782d48fc081058f6d8bae89a3451d5f35a6c11e88953082","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-20T19:03:16Z","title_canon_sha256":"dfb12247abbc4be977cfb131a0d6ccf4c054daf62effbd7b8f0a49a66f7d1d78"},"schema_version":"1.0","source":{"id":"1412.6680","kind":"arxiv","version":1}},"canonical_sha256":"48c49b6193e1266263a408a72eae3044823f8608fff2ff4a89aba128e6a7664e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48c49b6193e1266263a408a72eae3044823f8608fff2ff4a89aba128e6a7664e","first_computed_at":"2026-05-18T02:30:46.445304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:46.445304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oHxCeCsB9YiYCEGYk2YmmBZkpcqODqZqyvBB7G8QNI2bvv5uMDcrXbzPQ3aTybivilsPSHBynMJl0v0KgAEdBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:46.445725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6680","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e0b78745f1c034ea716eba92d3aa0c5496af8a906019021a814929db9e65528","sha256:34503fb3a5c3763e9c268bd3878d76e349a76f1b7bf8ac112809af6811d9cfc5"],"state_sha256":"3bce0600292243487838bdb6b1a7a3d1bd4aa7cbe6ffa95bd070293d001b4d70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ccnkVo03njXtuuk1SCG+qcBrIX+zbIgd9Pu+UconUN7IfNE0C9hPYmW9hVsSoLs+lLy1gNk2hJ5ciX0NzmiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:21:57.480669Z","bundle_sha256":"f4c48faa84352c7de5940edc025a0c1faa423547b8470050fe75d90363334a71"}}