{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L52NQPLKM2DANAUSVYBYHXEDCN","short_pith_number":"pith:L52NQPLK","canonical_record":{"source":{"id":"1811.02249","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T09:31:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bd4f64db339107bc9aa3fc1aae8f79dfe16297b767525a521c03fecf8f878fcb","abstract_canon_sha256":"3872823ed8c8330cb0bcf2d0699fac8218f0a5becbb3da525fd1e8dadae1ac2d"},"schema_version":"1.0"},"canonical_sha256":"5f74d83d6a6686068292ae0383dc831363a98b5468ec8bf29eb1545c053a923b","source":{"kind":"arxiv","id":"1811.02249","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02249","created_at":"2026-05-17T23:58:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02249v2","created_at":"2026-05-17T23:58:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02249","created_at":"2026-05-17T23:58:01Z"},{"alias_kind":"pith_short_12","alias_value":"L52NQPLKM2DA","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L52NQPLKM2DANAUS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L52NQPLK","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L52NQPLKM2DANAUSVYBYHXEDCN","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02249","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T09:31:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bd4f64db339107bc9aa3fc1aae8f79dfe16297b767525a521c03fecf8f878fcb","abstract_canon_sha256":"3872823ed8c8330cb0bcf2d0699fac8218f0a5becbb3da525fd1e8dadae1ac2d"},"schema_version":"1.0"},"canonical_sha256":"5f74d83d6a6686068292ae0383dc831363a98b5468ec8bf29eb1545c053a923b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:01.700417Z","signature_b64":"XzpUfluPl6BO5YRaR1KIXCXGpa9+EM9dSezY+GfJtDIka89UehAqEJKrUGu+Q9rZxP6GlGn3HSNaTdE9KSqlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f74d83d6a6686068292ae0383dc831363a98b5468ec8bf29eb1545c053a923b","last_reissued_at":"2026-05-17T23:58:01.699996Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:01.699996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02249","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-17T23:58:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9TwitjufWSGmnR8BSyo1hj3wXTXve/3OWdxuuDCOc0NpC/aWjBlqgAHky8Jw4GwmLcZvinct7ELpYpqfwW/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:43:28.511819Z"},"content_sha256":"e00b5daed637e9e867880dfe57c86fc43cd43128deda579ac829d68ee9d98785","schema_version":"1.0","event_id":"sha256:e00b5daed637e9e867880dfe57c86fc43cd43128deda579ac829d68ee9d98785"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L52NQPLKM2DANAUSVYBYHXEDCN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Resource Consumption of M2M Random Access: Efficiency and Pareto Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mikhail Vilgelm, Sergio Rueda Linares, Wolfgang Kellerer","submitted_at":"2018-11-06T09:31:42Z","abstract_excerpt":"The advent of Machine-to-Machine communication has sparked a new wave of interest to random access protocols, especially in application to LTE Random Access (RA). By analogy with classical slotted ALOHA, state-of-the-art models LTE RA as a multi-channel slotted ALOHA. In this letter, we direct the attention to the resource consumption of RA. We show that the consumption is a random variable dependent on the contention parameters. We consider two approaches to include the consumption into RA optimization: by defining resource efficiency and by the means of a bi-objective optimization, where res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02249","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-17T23:58:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8AUHVwZYh51Vxy2zGDuBCvz+/Rlnustrp9Ph2WUlnbSBPchR/6QaTclwyAfl9SvRjzovbiRIPnzl+bebRVgOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:43:28.512164Z"},"content_sha256":"c8af589deaadf1a4b06cb7292a2e2e11395a9642c392cf1f8627e42ad098e5be","schema_version":"1.0","event_id":"sha256:c8af589deaadf1a4b06cb7292a2e2e11395a9642c392cf1f8627e42ad098e5be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L52NQPLKM2DANAUSVYBYHXEDCN/bundle.json","state_url":"https://pith.science/pith/L52NQPLKM2DANAUSVYBYHXEDCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L52NQPLKM2DANAUSVYBYHXEDCN/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:43:28Z","links":{"resolver":"https://pith.science/pith/L52NQPLKM2DANAUSVYBYHXEDCN","bundle":"https://pith.science/pith/L52NQPLKM2DANAUSVYBYHXEDCN/bundle.json","state":"https://pith.science/pith/L52NQPLKM2DANAUSVYBYHXEDCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L52NQPLKM2DANAUSVYBYHXEDCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L52NQPLKM2DANAUSVYBYHXEDCN","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":"3872823ed8c8330cb0bcf2d0699fac8218f0a5becbb3da525fd1e8dadae1ac2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T09:31:42Z","title_canon_sha256":"bd4f64db339107bc9aa3fc1aae8f79dfe16297b767525a521c03fecf8f878fcb"},"schema_version":"1.0","source":{"id":"1811.02249","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02249","created_at":"2026-05-17T23:58:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02249v2","created_at":"2026-05-17T23:58:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02249","created_at":"2026-05-17T23:58:01Z"},{"alias_kind":"pith_short_12","alias_value":"L52NQPLKM2DA","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L52NQPLKM2DANAUS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L52NQPLK","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:c8af589deaadf1a4b06cb7292a2e2e11395a9642c392cf1f8627e42ad098e5be","target":"graph","created_at":"2026-05-17T23:58:01Z","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":"The advent of Machine-to-Machine communication has sparked a new wave of interest to random access protocols, especially in application to LTE Random Access (RA). By analogy with classical slotted ALOHA, state-of-the-art models LTE RA as a multi-channel slotted ALOHA. In this letter, we direct the attention to the resource consumption of RA. We show that the consumption is a random variable dependent on the contention parameters. We consider two approaches to include the consumption into RA optimization: by defining resource efficiency and by the means of a bi-objective optimization, where res","authors_text":"Mikhail Vilgelm, Sergio Rueda Linares, Wolfgang Kellerer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T09:31:42Z","title":"On the Resource Consumption of M2M Random Access: Efficiency and Pareto Optimality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02249","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:e00b5daed637e9e867880dfe57c86fc43cd43128deda579ac829d68ee9d98785","target":"record","created_at":"2026-05-17T23:58:01Z","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":"3872823ed8c8330cb0bcf2d0699fac8218f0a5becbb3da525fd1e8dadae1ac2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T09:31:42Z","title_canon_sha256":"bd4f64db339107bc9aa3fc1aae8f79dfe16297b767525a521c03fecf8f878fcb"},"schema_version":"1.0","source":{"id":"1811.02249","kind":"arxiv","version":2}},"canonical_sha256":"5f74d83d6a6686068292ae0383dc831363a98b5468ec8bf29eb1545c053a923b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f74d83d6a6686068292ae0383dc831363a98b5468ec8bf29eb1545c053a923b","first_computed_at":"2026-05-17T23:58:01.699996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:01.699996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XzpUfluPl6BO5YRaR1KIXCXGpa9+EM9dSezY+GfJtDIka89UehAqEJKrUGu+Q9rZxP6GlGn3HSNaTdE9KSqlBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:01.700417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02249","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e00b5daed637e9e867880dfe57c86fc43cd43128deda579ac829d68ee9d98785","sha256:c8af589deaadf1a4b06cb7292a2e2e11395a9642c392cf1f8627e42ad098e5be"],"state_sha256":"7a8c588c493171788d997fdb74a356dd8d725ec238b1bc1598995be8890032a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/AczToOKEM7t7aG8hxegkPoDHFJd9ipPInWVyNi0h2OefsigUL9guEqbKXpZK4oyKBTwAoNCiOeTR6RGViZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:43:28.514087Z","bundle_sha256":"23d495efae421a43ebde201c4c5d0e0c95153b9539e659deed58619e44e62c05"}}