{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NJKVVTCPCKAFP4WPIPAC65EF4H","short_pith_number":"pith:NJKVVTCP","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"},"canonical_sha256":"6a555acc4f128057f2cf43c02f7485e1fdb8b46256f739a029cb9d457ef813ef","source":{"kind":"arxiv","id":"1801.05224","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05224","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05224v1","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05224","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"NJKVVTCPCKAF","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NJKVVTCPCKAFP4WP","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NJKVVTCP","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NJKVVTCPCKAFP4WPIPAC65EF4H","target":"record","payload":{"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"},"canonical_sha256":"6a555acc4f128057f2cf43c02f7485e1fdb8b46256f739a029cb9d457ef813ef","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"},"source_kind":"arxiv","source_id":"1801.05224","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:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uSm20TRp0nti+2QhOLeJj4Ni4j2vFIZDV/9DkXf73fQkm6p8h2mjfPqsFIzIr4jsmaA9Pq+j46CDXkFlg5RPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:14:40.989080Z"},"content_sha256":"db4ccf72855e361eefbd4ea3640b263b9a78508bb9b838b7afe73f827027461f","schema_version":"1.0","event_id":"sha256:db4ccf72855e361eefbd4ea3640b263b9a78508bb9b838b7afe73f827027461f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NJKVVTCPCKAFP4WPIPAC65EF4H","target":"graph","payload":{"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"},"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:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pLUox9RyMqVBCnKQSxvcMwWibMpLRA+MBkKOgECzX2kXg1g//h2FP9DhCgo9roH/lHnZftVrxD0z7TJp08A1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:14:40.989788Z"},"content_sha256":"9e9f4656618dce55f35cb1f650a64c317d6549831f3a1c5a791f8abb984c81c8","schema_version":"1.0","event_id":"sha256:9e9f4656618dce55f35cb1f650a64c317d6549831f3a1c5a791f8abb984c81c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H/bundle.json","state_url":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJKVVTCPCKAFP4WPIPAC65EF4H/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-26T08:14:40Z","links":{"resolver":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H","bundle":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H/bundle.json","state":"https://pith.science/pith/NJKVVTCPCKAFP4WPIPAC65EF4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJKVVTCPCKAFP4WPIPAC65EF4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NJKVVTCPCKAFP4WPIPAC65EF4H","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":"f0129993024429f4579383cd2ac7e19c7e10b8b680ce7f77d884dc85d9569473","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T12:29:02Z","title_canon_sha256":"79ee32223c04dd575b454edbe9f7228d8f98b4f5117b5e7ec101a7f9f16d9bae"},"schema_version":"1.0","source":{"id":"1801.05224","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05224","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05224v1","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05224","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"NJKVVTCPCKAF","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NJKVVTCPCKAFP4WP","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NJKVVTCP","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:9e9f4656618dce55f35cb1f650a64c317d6549831f3a1c5a791f8abb984c81c8","target":"graph","created_at":"2026-05-18T00:25:47Z","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":"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","authors_text":"Mari Kobayashi, Richard Combes, Thomas Varela Santana","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T12:29:02Z","title":"Device-to-Device Aided Multicasting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05224","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:db4ccf72855e361eefbd4ea3640b263b9a78508bb9b838b7afe73f827027461f","target":"record","created_at":"2026-05-18T00:25:47Z","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":"f0129993024429f4579383cd2ac7e19c7e10b8b680ce7f77d884dc85d9569473","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T12:29:02Z","title_canon_sha256":"79ee32223c04dd575b454edbe9f7228d8f98b4f5117b5e7ec101a7f9f16d9bae"},"schema_version":"1.0","source":{"id":"1801.05224","kind":"arxiv","version":1}},"canonical_sha256":"6a555acc4f128057f2cf43c02f7485e1fdb8b46256f739a029cb9d457ef813ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a555acc4f128057f2cf43c02f7485e1fdb8b46256f739a029cb9d457ef813ef","first_computed_at":"2026-05-18T00:25:47.469954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:47.469954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WMSI0bWH6kTzWlEaQwsfBdeanrjCqh8wxkDru+LTno/y4eCZyf5+70p+3zxIJnAEKOmytHc367cp3VZQ4J1XCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:47.470657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05224","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db4ccf72855e361eefbd4ea3640b263b9a78508bb9b838b7afe73f827027461f","sha256:9e9f4656618dce55f35cb1f650a64c317d6549831f3a1c5a791f8abb984c81c8"],"state_sha256":"fc536675a35b56fdd76d96d9637d68578e91f381bef42ad1d786c1e8e1bc2e92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SMZIy2UhoPnqVbY4LOn+N/0s3QMhKPQVcrzQn+0AqjY30H2QzrD/WzB4ZKz4RGRGBsERuCKmjrtUdGv9uNCuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:14:40.993708Z","bundle_sha256":"08d444397b88895bb4a6effa76b7af573b005c16e22aed90fa43abf089cc6570"}}