{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EE7P6SXGKQG6KQVCLICOQTQHRN","short_pith_number":"pith:EE7P6SXG","canonical_record":{"source":{"id":"1504.07365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-28T07:26:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"69908e1e3c50ad2816ed8c7ee04a413546bca3900af6c13d4f7041b46974d273","abstract_canon_sha256":"cb69b806d408d7b0f029ff6291f5e76f340465e5361113c8ffda97865ffee4e7"},"schema_version":"1.0"},"canonical_sha256":"213eff4ae6540de542a25a04e84e078b6ecd0d11dc1196b7652620642e14dafd","source":{"kind":"arxiv","id":"1504.07365","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07365","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07365v1","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07365","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"EE7P6SXGKQG6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EE7P6SXGKQG6KQVC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EE7P6SXG","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EE7P6SXGKQG6KQVCLICOQTQHRN","target":"record","payload":{"canonical_record":{"source":{"id":"1504.07365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-28T07:26:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"69908e1e3c50ad2816ed8c7ee04a413546bca3900af6c13d4f7041b46974d273","abstract_canon_sha256":"cb69b806d408d7b0f029ff6291f5e76f340465e5361113c8ffda97865ffee4e7"},"schema_version":"1.0"},"canonical_sha256":"213eff4ae6540de542a25a04e84e078b6ecd0d11dc1196b7652620642e14dafd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:35.024521Z","signature_b64":"OzdzGhLspCMiQxfUkcq02jZMt05jmUs0OsSgrJClHgnRpClCMhvXyVYstwAf9nk4KutCW/qUf2fIrPwC8sl6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"213eff4ae6540de542a25a04e84e078b6ecd0d11dc1196b7652620642e14dafd","last_reissued_at":"2026-05-18T02:17:35.023834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:35.023834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.07365","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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"suF3KRe65sAE0HyFw6BnJlc58GRsTBZMswTCSjLUfhFyLZXvn2K+WImIag20qaf/w1riONyX2uAI8iDAESs9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:46:22.750121Z"},"content_sha256":"1f021b7b25a2bb485ccac19c9df5cd48e51f004992ebf9b5cdde86453748cdbc","schema_version":"1.0","event_id":"sha256:1f021b7b25a2bb485ccac19c9df5cd48e51f004992ebf9b5cdde86453748cdbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EE7P6SXGKQG6KQVCLICOQTQHRN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressive Rate Estimation with Applications to Device-to-Device Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jan Schreck, Peter Jung, S{\\l}awomir Sta\\'nczak","submitted_at":"2015-04-28T07:26:10Z","abstract_excerpt":"We develop a framework that we call compressive rate estimation. We assume that the composite channel gain matrix (i.e. the matrix of all channel gains between all network nodes) is compressible which means it can be approximated by a sparse or low rank representation. We develop and study a novel sensing and reconstruction protocol for the estimation of achievable rates. We develop a sensing protocol that exploits the superposition principle of the wireless channel and enables the receiving nodes to obtain non-adaptive random measurements of columns of the composite channel matrix. The random"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07365","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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+8IWHbrKtEzlDltVQVxRs+6QAPjIvN30V1nyFEoEAyakk/bwH3LSh/H0rGH2Ixe3bzUJb1onM1jiDuAJQcUCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:46:22.750800Z"},"content_sha256":"24d6a74d0f8b24da45691f0f0dbc4f040824a9141b136fdb6896eb1d3552b625","schema_version":"1.0","event_id":"sha256:24d6a74d0f8b24da45691f0f0dbc4f040824a9141b136fdb6896eb1d3552b625"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EE7P6SXGKQG6KQVCLICOQTQHRN/bundle.json","state_url":"https://pith.science/pith/EE7P6SXGKQG6KQVCLICOQTQHRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EE7P6SXGKQG6KQVCLICOQTQHRN/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-30T22:46:22Z","links":{"resolver":"https://pith.science/pith/EE7P6SXGKQG6KQVCLICOQTQHRN","bundle":"https://pith.science/pith/EE7P6SXGKQG6KQVCLICOQTQHRN/bundle.json","state":"https://pith.science/pith/EE7P6SXGKQG6KQVCLICOQTQHRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EE7P6SXGKQG6KQVCLICOQTQHRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EE7P6SXGKQG6KQVCLICOQTQHRN","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":"cb69b806d408d7b0f029ff6291f5e76f340465e5361113c8ffda97865ffee4e7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-28T07:26:10Z","title_canon_sha256":"69908e1e3c50ad2816ed8c7ee04a413546bca3900af6c13d4f7041b46974d273"},"schema_version":"1.0","source":{"id":"1504.07365","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07365","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07365v1","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07365","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"EE7P6SXGKQG6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EE7P6SXGKQG6KQVC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EE7P6SXG","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:24d6a74d0f8b24da45691f0f0dbc4f040824a9141b136fdb6896eb1d3552b625","target":"graph","created_at":"2026-05-18T02:17:35Z","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 develop a framework that we call compressive rate estimation. We assume that the composite channel gain matrix (i.e. the matrix of all channel gains between all network nodes) is compressible which means it can be approximated by a sparse or low rank representation. We develop and study a novel sensing and reconstruction protocol for the estimation of achievable rates. We develop a sensing protocol that exploits the superposition principle of the wireless channel and enables the receiving nodes to obtain non-adaptive random measurements of columns of the composite channel matrix. The random","authors_text":"Jan Schreck, Peter Jung, S{\\l}awomir Sta\\'nczak","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-28T07:26:10Z","title":"Compressive Rate Estimation with Applications to Device-to-Device Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07365","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:1f021b7b25a2bb485ccac19c9df5cd48e51f004992ebf9b5cdde86453748cdbc","target":"record","created_at":"2026-05-18T02:17:35Z","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":"cb69b806d408d7b0f029ff6291f5e76f340465e5361113c8ffda97865ffee4e7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-28T07:26:10Z","title_canon_sha256":"69908e1e3c50ad2816ed8c7ee04a413546bca3900af6c13d4f7041b46974d273"},"schema_version":"1.0","source":{"id":"1504.07365","kind":"arxiv","version":1}},"canonical_sha256":"213eff4ae6540de542a25a04e84e078b6ecd0d11dc1196b7652620642e14dafd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"213eff4ae6540de542a25a04e84e078b6ecd0d11dc1196b7652620642e14dafd","first_computed_at":"2026-05-18T02:17:35.023834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:35.023834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OzdzGhLspCMiQxfUkcq02jZMt05jmUs0OsSgrJClHgnRpClCMhvXyVYstwAf9nk4KutCW/qUf2fIrPwC8sl6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:35.024521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07365","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f021b7b25a2bb485ccac19c9df5cd48e51f004992ebf9b5cdde86453748cdbc","sha256:24d6a74d0f8b24da45691f0f0dbc4f040824a9141b136fdb6896eb1d3552b625"],"state_sha256":"16e5f1cfab7eaef8f170156e170917d9fbb7cac4b9ffb567ee1db246902f8940"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2H/9OVLODipImUkycpeXbOe0J6DPFoafi6WEuBV569H98P1RLnqu/PzuxusJqP6ouaEBNvHeazFG/ne7aPFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:46:22.753576Z","bundle_sha256":"927024ab5fb7ef8f1299da1503e27c0d066d4898ec772ba9332d8dc544b72e31"}}