{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3YXBM654KSCQC33GHSC7WAEJOB","short_pith_number":"pith:3YXBM654","canonical_record":{"source":{"id":"1708.02808","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-09T12:28:01Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a8977802b9f3ef93726e3f6d496aeb4e08d7f68ed3a050e7294e249f71d8a192","abstract_canon_sha256":"504b5785e295375075f5f25f70d136cc24e10cffb2206ab0c97a3ace2ed64294"},"schema_version":"1.0"},"canonical_sha256":"de2e167bbc5485016f663c85fb0089706bb08f96a542242f81a3902e1dfca277","source":{"kind":"arxiv","id":"1708.02808","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02808","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02808v2","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02808","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"pith_short_12","alias_value":"3YXBM654KSCQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3YXBM654KSCQC33G","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3YXBM654","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3YXBM654KSCQC33GHSC7WAEJOB","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02808","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-09T12:28:01Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a8977802b9f3ef93726e3f6d496aeb4e08d7f68ed3a050e7294e249f71d8a192","abstract_canon_sha256":"504b5785e295375075f5f25f70d136cc24e10cffb2206ab0c97a3ace2ed64294"},"schema_version":"1.0"},"canonical_sha256":"de2e167bbc5485016f663c85fb0089706bb08f96a542242f81a3902e1dfca277","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:30.198589Z","signature_b64":"ynZgFqpTAxbdP2I45SIgTt5fdtGU4r773/5XacJaaPHW4czCEp9Y8+fTmQiNSG434hcqSDPqYf9SqMTS9rL/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de2e167bbc5485016f663c85fb0089706bb08f96a542242f81a3902e1dfca277","last_reissued_at":"2026-05-18T00:30:30.197973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:30.197973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02808","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-18T00:30:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mr+VG2wHuKahkG1mOBIcTOGySm+xBA2vdZV8DymcK5evox/qCb8hEjJqUh1qyH/+IFj1MDpt6hqIViVev9/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:35:25.881182Z"},"content_sha256":"2e7268219271ea5d87bb4370f36e6a2807fe9fb49e30ec7ce248e84660bfcdc1","schema_version":"1.0","event_id":"sha256:2e7268219271ea5d87bb4370f36e6a2807fe9fb49e30ec7ce248e84660bfcdc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3YXBM654KSCQC33GHSC7WAEJOB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing Cellular M2M Random Access with Binary Countdown Contention Resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Mikhail Vilgelm, Sergio Rueda Li\\~nares, Wolfgang Kellerer","submitted_at":"2017-08-09T12:28:01Z","abstract_excerpt":"Accommodating Machine-to-Machine applications and their requirements is one of the challenges on the way from LTE towards 5G networks. The envisioned high density of devices, alongside with their sporadic and synchronized transmission patterns, might create signaling storms and overload in the current LTE network. Here, we address the notorious random access (RA) challenge, namely, scalability of the radio link connection establishment protocol in LTE networks. We revisit the binary countdown technique for contention resolution (BCCR), and apply it to the LTE RA procedure. We analytically inve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02808","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-18T00:30:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXLMJS8jtlj6DP4AqDKyLccPb/EKqvooBR9GXJAE0DhwDp+7jRP2HsClK+uUQlktLO3sLDy1f2rWNkC+wrGvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:35:25.881743Z"},"content_sha256":"eacc8fa8bae670d967a70887ea0627966315fd05e85fbd93c57f1cb80123540f","schema_version":"1.0","event_id":"sha256:eacc8fa8bae670d967a70887ea0627966315fd05e85fbd93c57f1cb80123540f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YXBM654KSCQC33GHSC7WAEJOB/bundle.json","state_url":"https://pith.science/pith/3YXBM654KSCQC33GHSC7WAEJOB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YXBM654KSCQC33GHSC7WAEJOB/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-30T07:35:25Z","links":{"resolver":"https://pith.science/pith/3YXBM654KSCQC33GHSC7WAEJOB","bundle":"https://pith.science/pith/3YXBM654KSCQC33GHSC7WAEJOB/bundle.json","state":"https://pith.science/pith/3YXBM654KSCQC33GHSC7WAEJOB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YXBM654KSCQC33GHSC7WAEJOB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3YXBM654KSCQC33GHSC7WAEJOB","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":"504b5785e295375075f5f25f70d136cc24e10cffb2206ab0c97a3ace2ed64294","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-09T12:28:01Z","title_canon_sha256":"a8977802b9f3ef93726e3f6d496aeb4e08d7f68ed3a050e7294e249f71d8a192"},"schema_version":"1.0","source":{"id":"1708.02808","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02808","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02808v2","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02808","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"pith_short_12","alias_value":"3YXBM654KSCQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3YXBM654KSCQC33G","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3YXBM654","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:eacc8fa8bae670d967a70887ea0627966315fd05e85fbd93c57f1cb80123540f","target":"graph","created_at":"2026-05-18T00:30:30Z","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":"Accommodating Machine-to-Machine applications and their requirements is one of the challenges on the way from LTE towards 5G networks. The envisioned high density of devices, alongside with their sporadic and synchronized transmission patterns, might create signaling storms and overload in the current LTE network. Here, we address the notorious random access (RA) challenge, namely, scalability of the radio link connection establishment protocol in LTE networks. We revisit the binary countdown technique for contention resolution (BCCR), and apply it to the LTE RA procedure. We analytically inve","authors_text":"Mikhail Vilgelm, Sergio Rueda Li\\~nares, Wolfgang Kellerer","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-09T12:28:01Z","title":"Enhancing Cellular M2M Random Access with Binary Countdown Contention Resolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02808","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:2e7268219271ea5d87bb4370f36e6a2807fe9fb49e30ec7ce248e84660bfcdc1","target":"record","created_at":"2026-05-18T00:30:30Z","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":"504b5785e295375075f5f25f70d136cc24e10cffb2206ab0c97a3ace2ed64294","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-09T12:28:01Z","title_canon_sha256":"a8977802b9f3ef93726e3f6d496aeb4e08d7f68ed3a050e7294e249f71d8a192"},"schema_version":"1.0","source":{"id":"1708.02808","kind":"arxiv","version":2}},"canonical_sha256":"de2e167bbc5485016f663c85fb0089706bb08f96a542242f81a3902e1dfca277","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de2e167bbc5485016f663c85fb0089706bb08f96a542242f81a3902e1dfca277","first_computed_at":"2026-05-18T00:30:30.197973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:30.197973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ynZgFqpTAxbdP2I45SIgTt5fdtGU4r773/5XacJaaPHW4czCEp9Y8+fTmQiNSG434hcqSDPqYf9SqMTS9rL/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:30.198589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02808","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e7268219271ea5d87bb4370f36e6a2807fe9fb49e30ec7ce248e84660bfcdc1","sha256:eacc8fa8bae670d967a70887ea0627966315fd05e85fbd93c57f1cb80123540f"],"state_sha256":"0259041cfdc2b049a236ae0639ef92b80f87ac402f65c8bab242812dcbbe6d47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WdwjrNsB4iH+Oyd9HexglpKsuapf25snGDaQ12C4RMIqvE2lHRtyuQlr5lBOgAy0arpTZqCUayAuCVktwDbsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:35:25.885892Z","bundle_sha256":"b3b1580c28d5f82f90177d59d50f9f58f31eb1b108026408680e9c49abd486c8"}}