{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GMZ6Z2OEL6L56XJ33QFW6BXVC4","short_pith_number":"pith:GMZ6Z2OE","canonical_record":{"source":{"id":"1507.02761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T01:10:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c259f871f767165a23469bb9c514ea3cc726d155ca504fe684eb609627673fae","abstract_canon_sha256":"95a916824d6926634052ef15813527000d46da92e6a84d27d7819c8d68f48ab3"},"schema_version":"1.0"},"canonical_sha256":"3333ece9c45f97df5d3bdc0b6f06f5171197b599ecc23516558b6cb2c7ab82e9","source":{"kind":"arxiv","id":"1507.02761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02761","created_at":"2026-05-18T00:58:58Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02761v1","created_at":"2026-05-18T00:58:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02761","created_at":"2026-05-18T00:58:58Z"},{"alias_kind":"pith_short_12","alias_value":"GMZ6Z2OEL6L5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GMZ6Z2OEL6L56XJ3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GMZ6Z2OE","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GMZ6Z2OEL6L56XJ33QFW6BXVC4","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T01:10:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c259f871f767165a23469bb9c514ea3cc726d155ca504fe684eb609627673fae","abstract_canon_sha256":"95a916824d6926634052ef15813527000d46da92e6a84d27d7819c8d68f48ab3"},"schema_version":"1.0"},"canonical_sha256":"3333ece9c45f97df5d3bdc0b6f06f5171197b599ecc23516558b6cb2c7ab82e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:58.086349Z","signature_b64":"ROlYdnPGiR7nXqkd47WRc10UDotA7l0T1ZDA1jOxJfiDJ+nx7z1Gz9AkFi0AVaQsVhXnEMZ/OkAdzGZ4jVzTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3333ece9c45f97df5d3bdc0b6f06f5171197b599ecc23516558b6cb2c7ab82e9","last_reissued_at":"2026-05-18T00:58:58.085729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:58.085729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02761","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:58:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OrAB9XVPyt5DP/BKiXoYQRiKJJcH9a0Yeu+Dk+HFRRDmZssBRI3F5emfeW6qlyh2q4sZwp8Ulf1ZGLV4RX2EDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:52:58.842914Z"},"content_sha256":"fb9c3a3b4502e4eae75be0733f2da05cb3b1104d7cc4c9e23d22623699e75d11","schema_version":"1.0","event_id":"sha256:fb9c3a3b4502e4eae75be0733f2da05cb3b1104d7cc4c9e23d22623699e75d11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GMZ6Z2OEL6L56XJ33QFW6BXVC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Rateless Multiple Access for Machine-to-Machine Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Mahyar Shirvanimoghaddam, Mischa Dohler, Yonghui Li","submitted_at":"2015-07-10T01:10:12Z","abstract_excerpt":"Future machine to machine (M2M) communications need to support a massive number of devices communicating with each other with little or no human intervention. Random access techniques were originally proposed to enable M2M multiple access, but suffer from severe congestion and access delay in an M2M system with a large number of devices. In this paper, we propose a novel multiple access scheme for M2M communications based on the capacity-approaching analog fountain code to efficiently minimize the access delay and satisfy the delay requirement for each device. This is achieved by allowing M2M "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02761","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:58:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZA1bVHo8VfBclxCL87BxA9nFpwM66293/KXMscy2xuPtPgkF4Ldndywr0yJGGK+KEQK91rWlymh5fTRgzrB2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:52:58.843527Z"},"content_sha256":"d18312094576b956432340894ee877797afc01b200dd3b33aa1fe2411325930e","schema_version":"1.0","event_id":"sha256:d18312094576b956432340894ee877797afc01b200dd3b33aa1fe2411325930e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMZ6Z2OEL6L56XJ33QFW6BXVC4/bundle.json","state_url":"https://pith.science/pith/GMZ6Z2OEL6L56XJ33QFW6BXVC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMZ6Z2OEL6L56XJ33QFW6BXVC4/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:52:58Z","links":{"resolver":"https://pith.science/pith/GMZ6Z2OEL6L56XJ33QFW6BXVC4","bundle":"https://pith.science/pith/GMZ6Z2OEL6L56XJ33QFW6BXVC4/bundle.json","state":"https://pith.science/pith/GMZ6Z2OEL6L56XJ33QFW6BXVC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMZ6Z2OEL6L56XJ33QFW6BXVC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GMZ6Z2OEL6L56XJ33QFW6BXVC4","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":"95a916824d6926634052ef15813527000d46da92e6a84d27d7819c8d68f48ab3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T01:10:12Z","title_canon_sha256":"c259f871f767165a23469bb9c514ea3cc726d155ca504fe684eb609627673fae"},"schema_version":"1.0","source":{"id":"1507.02761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02761","created_at":"2026-05-18T00:58:58Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02761v1","created_at":"2026-05-18T00:58:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02761","created_at":"2026-05-18T00:58:58Z"},{"alias_kind":"pith_short_12","alias_value":"GMZ6Z2OEL6L5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GMZ6Z2OEL6L56XJ3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GMZ6Z2OE","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:d18312094576b956432340894ee877797afc01b200dd3b33aa1fe2411325930e","target":"graph","created_at":"2026-05-18T00:58:58Z","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":"Future machine to machine (M2M) communications need to support a massive number of devices communicating with each other with little or no human intervention. Random access techniques were originally proposed to enable M2M multiple access, but suffer from severe congestion and access delay in an M2M system with a large number of devices. In this paper, we propose a novel multiple access scheme for M2M communications based on the capacity-approaching analog fountain code to efficiently minimize the access delay and satisfy the delay requirement for each device. This is achieved by allowing M2M ","authors_text":"Branka Vucetic, Mahyar Shirvanimoghaddam, Mischa Dohler, Yonghui Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T01:10:12Z","title":"Probabilistic Rateless Multiple Access for Machine-to-Machine Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02761","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:fb9c3a3b4502e4eae75be0733f2da05cb3b1104d7cc4c9e23d22623699e75d11","target":"record","created_at":"2026-05-18T00:58:58Z","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":"95a916824d6926634052ef15813527000d46da92e6a84d27d7819c8d68f48ab3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T01:10:12Z","title_canon_sha256":"c259f871f767165a23469bb9c514ea3cc726d155ca504fe684eb609627673fae"},"schema_version":"1.0","source":{"id":"1507.02761","kind":"arxiv","version":1}},"canonical_sha256":"3333ece9c45f97df5d3bdc0b6f06f5171197b599ecc23516558b6cb2c7ab82e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3333ece9c45f97df5d3bdc0b6f06f5171197b599ecc23516558b6cb2c7ab82e9","first_computed_at":"2026-05-18T00:58:58.085729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:58.085729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ROlYdnPGiR7nXqkd47WRc10UDotA7l0T1ZDA1jOxJfiDJ+nx7z1Gz9AkFi0AVaQsVhXnEMZ/OkAdzGZ4jVzTDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:58.086349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb9c3a3b4502e4eae75be0733f2da05cb3b1104d7cc4c9e23d22623699e75d11","sha256:d18312094576b956432340894ee877797afc01b200dd3b33aa1fe2411325930e"],"state_sha256":"36937f74de93a34e7af2b8169e11167cae394cbfb5643a2ad28091693daed0aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlgPx6euS86hpUwv46fpER9Ek+j+qBm/VwsHxODiR0eIDbFaXV4szdJjXjHpP64JTvJU4BAQQbfQgdj63SL4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:52:58.847337Z","bundle_sha256":"9a93b6e50a395931353463113c3646f38d800b1b4369cf4eab4f0e663a2693aa"}}