{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UMEDW63QXEZZ65NO37237ZUYMS","short_pith_number":"pith:UMEDW63Q","canonical_record":{"source":{"id":"1803.08377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-22T14:35:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d8f7074444441d91e0d15ef1b72d3c7de7bb3b09b60d1807bf20a53bb782cd70","abstract_canon_sha256":"2e46d8a8fa4c55248d7c20ffb0dbfb6d0dccaa5948f5871f7f121de545f0541c"},"schema_version":"1.0"},"canonical_sha256":"a3083b7b70b9339f75aedff5bfe69864b0c98e0e3c0fbd7dbf74ef9bb8a1d771","source":{"kind":"arxiv","id":"1803.08377","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08377","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08377v1","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08377","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"UMEDW63QXEZZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UMEDW63QXEZZ65NO","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UMEDW63Q","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UMEDW63QXEZZ65NO37237ZUYMS","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-22T14:35:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d8f7074444441d91e0d15ef1b72d3c7de7bb3b09b60d1807bf20a53bb782cd70","abstract_canon_sha256":"2e46d8a8fa4c55248d7c20ffb0dbfb6d0dccaa5948f5871f7f121de545f0541c"},"schema_version":"1.0"},"canonical_sha256":"a3083b7b70b9339f75aedff5bfe69864b0c98e0e3c0fbd7dbf74ef9bb8a1d771","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:23.025500Z","signature_b64":"osTJsErzHVTMGkZTxnymlvQTSmUU40Vcucns0AUm76eNxFJCtkIHSrUmXWFbsJ5aLW9rnfE8uRWyS318L5FNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3083b7b70b9339f75aedff5bfe69864b0c98e0e3c0fbd7dbf74ef9bb8a1d771","last_reissued_at":"2026-05-18T00:20:23.024997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:23.024997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08377","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:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iGIdI0gfAxb7nTe2c4jzHsGzgeZj1S65AgEfVTjPxIAUOBOMHpBb2ZtJjmNlWk6F/mJN/ruCfiNM2U93pFyXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:27:11.543817Z"},"content_sha256":"694ca7132875018ddf1be5e49a2ad4e024caec1c8e3b06750eac5af2682a3b55","schema_version":"1.0","event_id":"sha256:694ca7132875018ddf1be5e49a2ad4e024caec1c8e3b06750eac5af2682a3b55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UMEDW63QXEZZ65NO37237ZUYMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexey Frolov, Anton Glebov, Luiza Medova, Pavel Rybin","submitted_at":"2018-03-22T14:35:27Z","abstract_excerpt":"This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of four parts: (i) the data transmission is partitioned into time slots; (ii) the data, transmitted in each slot, is split into two parts, the first one set an interleaver of the low-density parity-check (LDPC) type code and is encoded by spreading sequence or codewords that are designed to be decoded by compressed sensing type decoding; (iii) the another part of transm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08377","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:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjno22lzm9nOW0kTQk2zmGji5N7n4shyP0yi0AMwx7l41ZCXKIuJnJvKQuMhQbIOwe/IKgx2hFId4yU5Vdp4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:27:11.544161Z"},"content_sha256":"5e8a627bd383d1425f12dc1ee6987ee125235598f01a31e9f6c3a254a43967c9","schema_version":"1.0","event_id":"sha256:5e8a627bd383d1425f12dc1ee6987ee125235598f01a31e9f6c3a254a43967c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMEDW63QXEZZ65NO37237ZUYMS/bundle.json","state_url":"https://pith.science/pith/UMEDW63QXEZZ65NO37237ZUYMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMEDW63QXEZZ65NO37237ZUYMS/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-06-29T05:27:11Z","links":{"resolver":"https://pith.science/pith/UMEDW63QXEZZ65NO37237ZUYMS","bundle":"https://pith.science/pith/UMEDW63QXEZZ65NO37237ZUYMS/bundle.json","state":"https://pith.science/pith/UMEDW63QXEZZ65NO37237ZUYMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMEDW63QXEZZ65NO37237ZUYMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UMEDW63QXEZZ65NO37237ZUYMS","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":"2e46d8a8fa4c55248d7c20ffb0dbfb6d0dccaa5948f5871f7f121de545f0541c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-22T14:35:27Z","title_canon_sha256":"d8f7074444441d91e0d15ef1b72d3c7de7bb3b09b60d1807bf20a53bb782cd70"},"schema_version":"1.0","source":{"id":"1803.08377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08377","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08377v1","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08377","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"UMEDW63QXEZZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UMEDW63QXEZZ65NO","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UMEDW63Q","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:5e8a627bd383d1425f12dc1ee6987ee125235598f01a31e9f6c3a254a43967c9","target":"graph","created_at":"2026-05-18T00:20:23Z","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":"This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of four parts: (i) the data transmission is partitioned into time slots; (ii) the data, transmitted in each slot, is split into two parts, the first one set an interleaver of the low-density parity-check (LDPC) type code and is encoded by spreading sequence or codewords that are designed to be decoded by compressed sensing type decoding; (iii) the another part of transm","authors_text":"Alexey Frolov, Anton Glebov, Luiza Medova, Pavel Rybin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-22T14:35:27Z","title":"On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08377","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:694ca7132875018ddf1be5e49a2ad4e024caec1c8e3b06750eac5af2682a3b55","target":"record","created_at":"2026-05-18T00:20:23Z","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":"2e46d8a8fa4c55248d7c20ffb0dbfb6d0dccaa5948f5871f7f121de545f0541c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-22T14:35:27Z","title_canon_sha256":"d8f7074444441d91e0d15ef1b72d3c7de7bb3b09b60d1807bf20a53bb782cd70"},"schema_version":"1.0","source":{"id":"1803.08377","kind":"arxiv","version":1}},"canonical_sha256":"a3083b7b70b9339f75aedff5bfe69864b0c98e0e3c0fbd7dbf74ef9bb8a1d771","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3083b7b70b9339f75aedff5bfe69864b0c98e0e3c0fbd7dbf74ef9bb8a1d771","first_computed_at":"2026-05-18T00:20:23.024997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:23.024997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"osTJsErzHVTMGkZTxnymlvQTSmUU40Vcucns0AUm76eNxFJCtkIHSrUmXWFbsJ5aLW9rnfE8uRWyS318L5FNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:23.025500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:694ca7132875018ddf1be5e49a2ad4e024caec1c8e3b06750eac5af2682a3b55","sha256:5e8a627bd383d1425f12dc1ee6987ee125235598f01a31e9f6c3a254a43967c9"],"state_sha256":"b69d8a05b7d5ec9bb930c6927c9a282f3dc1b2689a182b354df9bcaf9c067b8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psp5808JyIlXyH8QlmSdnpT1Deye9rQF+7AKydd56SGyd4GcwAv+vFb301A8KkYJDAIq0yJGEtw0ymeZNtC8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T05:27:11.546040Z","bundle_sha256":"e8eea35d688d45812fca94992d4f5a96cc5fe50aa0295b3d174dabb94d5ffccd"}}