{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BU6B4ONPFALDF7IP7VRTW6XCXM","short_pith_number":"pith:BU6B4ONP","canonical_record":{"source":{"id":"1504.05318","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T06:52:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab02829c85be5b5062a243d9c521fd3a6b18558940f3cba729cadad727f3f94d","abstract_canon_sha256":"4f343319b35ae10b74718e53676c70214436087bab87369ac6f527dd852725b8"},"schema_version":"1.0"},"canonical_sha256":"0d3c1e39af281632fd0ffd633b7ae2bb214183bcdd8dc3877be06a64601a0aa2","source":{"kind":"arxiv","id":"1504.05318","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05318","created_at":"2026-05-18T01:04:33Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05318v2","created_at":"2026-05-18T01:04:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05318","created_at":"2026-05-18T01:04:33Z"},{"alias_kind":"pith_short_12","alias_value":"BU6B4ONPFALD","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BU6B4ONPFALDF7IP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BU6B4ONP","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BU6B4ONPFALDF7IP7VRTW6XCXM","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05318","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T06:52:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab02829c85be5b5062a243d9c521fd3a6b18558940f3cba729cadad727f3f94d","abstract_canon_sha256":"4f343319b35ae10b74718e53676c70214436087bab87369ac6f527dd852725b8"},"schema_version":"1.0"},"canonical_sha256":"0d3c1e39af281632fd0ffd633b7ae2bb214183bcdd8dc3877be06a64601a0aa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:33.364296Z","signature_b64":"DcTGFFNMAi38aOK8RJ+LE5DpHc5w7V8spvDpJ/oWs0pO1pbUbdwuxQq0pHD2uhBdrdHTIB0egf1HAHbiZTe8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d3c1e39af281632fd0ffd633b7ae2bb214183bcdd8dc3877be06a64601a0aa2","last_reissued_at":"2026-05-18T01:04:33.363599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:33.363599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05318","source_version":2,"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-18T01:04:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFzaEi5js1mE0ZONkxG5KTidOUYU6V6PkJ1y7WKlaOeFKtDYeZjoHLyE5Jz4+aNPw3Ky02pm51UEE8e+QbFsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:07:47.113796Z"},"content_sha256":"be67b2104b96a8920e971014f585fa5eae91a648490f4dae34457b8ea6d464bc","schema_version":"1.0","event_id":"sha256:be67b2104b96a8920e971014f585fa5eae91a648490f4dae34457b8ea6d464bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BU6B4ONPFALDF7IP7VRTW6XCXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressive Random Access Using A Common Overloaded Control Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerhard Wunder, Mohammed Ramadan, Peter Jung","submitted_at":"2015-04-21T06:52:44Z","abstract_excerpt":"We introduce a \"one shot\" random access procedure where users can send a message without a priori synchronizing with the network. In this procedure a common overloaded control channel is used to jointly detect sparse user activity and sparse channel profiles. The detected information is subsequently used to demodulate the data in dedicated frequency slots. We analyze the system theoretically and provide a link between achievable rates and standard compressing sensing estimates in terms of explicit expressions and scaling laws. Finally, we support our findings with simulations in an LTE-A-like "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05318","kind":"arxiv","version":2},"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-18T01:04:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gAkci4pwK5QKoPu87YGAWEFP9KgYBuDYBptUtrbnxcgy0BIjHuCUxRkK9w/DXTDvv3oSzQBhQ+mB2a5hCDNABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:07:47.114442Z"},"content_sha256":"b8c965e825a0d193508eb3d52f531fa3297dfb4970e1ef8711eed3bdbdb773ec","schema_version":"1.0","event_id":"sha256:b8c965e825a0d193508eb3d52f531fa3297dfb4970e1ef8711eed3bdbdb773ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BU6B4ONPFALDF7IP7VRTW6XCXM/bundle.json","state_url":"https://pith.science/pith/BU6B4ONPFALDF7IP7VRTW6XCXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BU6B4ONPFALDF7IP7VRTW6XCXM/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-31T05:07:47Z","links":{"resolver":"https://pith.science/pith/BU6B4ONPFALDF7IP7VRTW6XCXM","bundle":"https://pith.science/pith/BU6B4ONPFALDF7IP7VRTW6XCXM/bundle.json","state":"https://pith.science/pith/BU6B4ONPFALDF7IP7VRTW6XCXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BU6B4ONPFALDF7IP7VRTW6XCXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BU6B4ONPFALDF7IP7VRTW6XCXM","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":"4f343319b35ae10b74718e53676c70214436087bab87369ac6f527dd852725b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T06:52:44Z","title_canon_sha256":"ab02829c85be5b5062a243d9c521fd3a6b18558940f3cba729cadad727f3f94d"},"schema_version":"1.0","source":{"id":"1504.05318","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05318","created_at":"2026-05-18T01:04:33Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05318v2","created_at":"2026-05-18T01:04:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05318","created_at":"2026-05-18T01:04:33Z"},{"alias_kind":"pith_short_12","alias_value":"BU6B4ONPFALD","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BU6B4ONPFALDF7IP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BU6B4ONP","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:b8c965e825a0d193508eb3d52f531fa3297dfb4970e1ef8711eed3bdbdb773ec","target":"graph","created_at":"2026-05-18T01:04:33Z","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 introduce a \"one shot\" random access procedure where users can send a message without a priori synchronizing with the network. In this procedure a common overloaded control channel is used to jointly detect sparse user activity and sparse channel profiles. The detected information is subsequently used to demodulate the data in dedicated frequency slots. We analyze the system theoretically and provide a link between achievable rates and standard compressing sensing estimates in terms of explicit expressions and scaling laws. Finally, we support our findings with simulations in an LTE-A-like ","authors_text":"Gerhard Wunder, Mohammed Ramadan, Peter Jung","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T06:52:44Z","title":"Compressive Random Access Using A Common Overloaded Control Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05318","kind":"arxiv","version":2},"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:be67b2104b96a8920e971014f585fa5eae91a648490f4dae34457b8ea6d464bc","target":"record","created_at":"2026-05-18T01:04:33Z","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":"4f343319b35ae10b74718e53676c70214436087bab87369ac6f527dd852725b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T06:52:44Z","title_canon_sha256":"ab02829c85be5b5062a243d9c521fd3a6b18558940f3cba729cadad727f3f94d"},"schema_version":"1.0","source":{"id":"1504.05318","kind":"arxiv","version":2}},"canonical_sha256":"0d3c1e39af281632fd0ffd633b7ae2bb214183bcdd8dc3877be06a64601a0aa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d3c1e39af281632fd0ffd633b7ae2bb214183bcdd8dc3877be06a64601a0aa2","first_computed_at":"2026-05-18T01:04:33.363599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:33.363599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DcTGFFNMAi38aOK8RJ+LE5DpHc5w7V8spvDpJ/oWs0pO1pbUbdwuxQq0pHD2uhBdrdHTIB0egf1HAHbiZTe8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:33.364296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05318","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be67b2104b96a8920e971014f585fa5eae91a648490f4dae34457b8ea6d464bc","sha256:b8c965e825a0d193508eb3d52f531fa3297dfb4970e1ef8711eed3bdbdb773ec"],"state_sha256":"ace4e17659e87f388aef640d9971114c5b942d464ef4bf89cb9ed362844d8347"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dKayl5OsxPRdhLAVllhru5sK+tPouzeQV0Rw2tDAWYc9jYytPTzYku9EkUovqczwgSy9eO45QeYMQoCoK0yAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:07:47.117657Z","bundle_sha256":"983da192918d150f86f9deac92506a6c150e1bd659c070113245fe09cbcdd060"}}