{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NJKVVTCPCKAFP4WPIPAC65EF4H","short_pith_number":"pith:NJKVVTCP","schema_version":"1.0","canonical_sha256":"6a555acc4f128057f2cf43c02f7485e1fdb8b46256f739a029cb9d457ef813ef","source":{"kind":"arxiv","id":"1801.05224","version":1},"attestation_state":"computed","paper":{"title":"Device-to-Device Aided Multicasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mari Kobayashi, Richard Combes, Thomas Varela Santana","submitted_at":"2018-01-16T12:29:02Z","abstract_excerpt":"We consider a device-to-device (D2D) aided multicast channel, where a transmitter wishes to convey a common message to many receivers and these receivers cooperate with each other. We propose a simple computationally efficient scheme requiring only statistical channel knowledge at transmitter. Our analysis in general topologies reveals that, when the number of receivers $K$ grows to infinity, the proposed scheme guarantees a multicast rate of ${1 \\over 2} \\log_2(1 + \\beta \\ln K )$ with high probability for any $\\beta < \\beta^\\star$ where $\\beta^\\star$ depends on the network topology. This sche"},"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":"1801.05224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T12:29:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"79ee32223c04dd575b454edbe9f7228d8f98b4f5117b5e7ec101a7f9f16d9bae","abstract_canon_sha256":"f0129993024429f4579383cd2ac7e19c7e10b8b680ce7f77d884dc85d9569473"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:47.470657Z","signature_b64":"WMSI0bWH6kTzWlEaQwsfBdeanrjCqh8wxkDru+LTno/y4eCZyf5+70p+3zxIJnAEKOmytHc367cp3VZQ4J1XCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a555acc4f128057f2cf43c02f7485e1fdb8b46256f739a029cb9d457ef813ef","last_reissued_at":"2026-05-18T00:25:47.469954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:47.469954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Device-to-Device Aided Multicasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mari Kobayashi, Richard Combes, Thomas Varela Santana","submitted_at":"2018-01-16T12:29:02Z","abstract_excerpt":"We consider a device-to-device (D2D) aided multicast channel, where a transmitter wishes to convey a common message to many receivers and these receivers cooperate with each other. We propose a simple computationally efficient scheme requiring only statistical channel knowledge at transmitter. Our analysis in general topologies reveals that, when the number of receivers $K$ grows to infinity, the proposed scheme guarantees a multicast rate of ${1 \\over 2} \\log_2(1 + \\beta \\ln K )$ with high probability for any $\\beta < \\beta^\\star$ where $\\beta^\\star$ depends on the network topology. This sche"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05224","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":"1801.05224","created_at":"2026-05-18T00:25:47.470063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05224v1","created_at":"2026-05-18T00:25:47.470063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05224","created_at":"2026-05-18T00:25:47.470063+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJKVVTCPCKAF","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJKVVTCPCKAFP4WP","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJKVVTCP","created_at":"2026-05-18T12:32:40.477152+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/NJKVVTCPCKAFP4WPIPAC65EF4H","json":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H.json","graph_json":"https://pith.science/api/pith-number/NJKVVTCPCKAFP4WPIPAC65EF4H/graph.json","events_json":"https://pith.science/api/pith-number/NJKVVTCPCKAFP4WPIPAC65EF4H/events.json","paper":"https://pith.science/paper/NJKVVTCP"},"agent_actions":{"view_html":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H","download_json":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H.json","view_paper":"https://pith.science/paper/NJKVVTCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05224&json=true","fetch_graph":"https://pith.science/api/pith-number/NJKVVTCPCKAFP4WPIPAC65EF4H/graph.json","fetch_events":"https://pith.science/api/pith-number/NJKVVTCPCKAFP4WPIPAC65EF4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H/action/storage_attestation","attest_author":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H/action/author_attestation","sign_citation":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H/action/citation_signature","submit_replication":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H/action/replication_record"}},"created_at":"2026-05-18T00:25:47.470063+00:00","updated_at":"2026-05-18T00:25:47.470063+00:00"}