{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:TILGCCKAYH4N6GVM645BYN5XVG","short_pith_number":"pith:TILGCCKA","canonical_record":{"source":{"id":"2202.13156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-02-26T15:03:28Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"10369a1f99efe44e73f8d5f6c2131b7c6a433abb11608efc75b83d6c088a8280","abstract_canon_sha256":"7899a7013c7796c1d5ac52a675ab390280be25e29bf0801762f7966d2780f9dd"},"schema_version":"1.0"},"canonical_sha256":"9a16610940c1f8df1aacf73a1c37b7a99157149cde21c7721ce911f873f6730f","source":{"kind":"arxiv","id":"2202.13156","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.13156","created_at":"2026-07-05T04:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"2202.13156v1","created_at":"2026-07-05T04:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.13156","created_at":"2026-07-05T04:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"TILGCCKAYH4N","created_at":"2026-07-05T04:00:26Z"},{"alias_kind":"pith_short_16","alias_value":"TILGCCKAYH4N6GVM","created_at":"2026-07-05T04:00:26Z"},{"alias_kind":"pith_short_8","alias_value":"TILGCCKA","created_at":"2026-07-05T04:00:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:TILGCCKAYH4N6GVM645BYN5XVG","target":"record","payload":{"canonical_record":{"source":{"id":"2202.13156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-02-26T15:03:28Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"10369a1f99efe44e73f8d5f6c2131b7c6a433abb11608efc75b83d6c088a8280","abstract_canon_sha256":"7899a7013c7796c1d5ac52a675ab390280be25e29bf0801762f7966d2780f9dd"},"schema_version":"1.0"},"canonical_sha256":"9a16610940c1f8df1aacf73a1c37b7a99157149cde21c7721ce911f873f6730f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:26.663963Z","signature_b64":"ZZGoJvvjwVkQ26mWAVRRne+aGMJezUbgoYlhHGXPDq7gADUPw52AQOOkwV5gGD3Y1Jx2PFCtAw4qpy88XuJHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a16610940c1f8df1aacf73a1c37b7a99157149cde21c7721ce911f873f6730f","last_reissued_at":"2026-07-05T04:00:26.662731Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:26.662731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.13156","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-07-05T04:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zA7H7CrgPdA+Il1Du30bkfJOy4Iuvn0H7Bn+HiSZZZKLdcYc//ivAfUF6c8OWYZkcFyHTdAvpLP7jhcefUJIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:46:35.228263Z"},"content_sha256":"aebe77a0648e87543c15d9cf2c9f1a378a1213dae18349c8b01b2783eaac87c1","schema_version":"1.0","event_id":"sha256:aebe77a0648e87543c15d9cf2c9f1a378a1213dae18349c8b01b2783eaac87c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:TILGCCKAYH4N6GVM645BYN5XVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Impact of Interference Subtraction on Grant-Free Multiple Access with Massive MIMO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Alberto Faedi, Enrico Paolini, Lorenzo Valentini, Marco Chiani","submitted_at":"2022-02-26T15:03:28Z","abstract_excerpt":"The design of highly scalable multiple access schemes is a main challenge in the evolution towards future massive machine-type communications, where reliability and latency constraints must be ensured to a large number of uncoordinated devices. In this scenario, coded random access (CRA) schemes, where successive interference cancellation algorithms allow large improvements with respect to classical random access protocols, have recently attracted an increasing interest. Impressive performance can be potentially obtained by combining CRA with massive multiple input multiple output (MIMO). In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.13156","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.13156/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTO0UZ1i9QeM5sF/9TkY4/BNSU/KfiQB/7qXd285UOVybiAuhrJmsPGGvZmtuKxKYMpkGj6i6pSt8aUtUtxTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:46:35.228644Z"},"content_sha256":"30bee2bf7ff4be7034afbd54fdd272c1d66a62d6fb6e9bab142232b885dee5c3","schema_version":"1.0","event_id":"sha256:30bee2bf7ff4be7034afbd54fdd272c1d66a62d6fb6e9bab142232b885dee5c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TILGCCKAYH4N6GVM645BYN5XVG/bundle.json","state_url":"https://pith.science/pith/TILGCCKAYH4N6GVM645BYN5XVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TILGCCKAYH4N6GVM645BYN5XVG/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-07-06T17:46:35Z","links":{"resolver":"https://pith.science/pith/TILGCCKAYH4N6GVM645BYN5XVG","bundle":"https://pith.science/pith/TILGCCKAYH4N6GVM645BYN5XVG/bundle.json","state":"https://pith.science/pith/TILGCCKAYH4N6GVM645BYN5XVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TILGCCKAYH4N6GVM645BYN5XVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:TILGCCKAYH4N6GVM645BYN5XVG","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":"7899a7013c7796c1d5ac52a675ab390280be25e29bf0801762f7966d2780f9dd","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-02-26T15:03:28Z","title_canon_sha256":"10369a1f99efe44e73f8d5f6c2131b7c6a433abb11608efc75b83d6c088a8280"},"schema_version":"1.0","source":{"id":"2202.13156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.13156","created_at":"2026-07-05T04:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"2202.13156v1","created_at":"2026-07-05T04:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.13156","created_at":"2026-07-05T04:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"TILGCCKAYH4N","created_at":"2026-07-05T04:00:26Z"},{"alias_kind":"pith_short_16","alias_value":"TILGCCKAYH4N6GVM","created_at":"2026-07-05T04:00:26Z"},{"alias_kind":"pith_short_8","alias_value":"TILGCCKA","created_at":"2026-07-05T04:00:26Z"}],"graph_snapshots":[{"event_id":"sha256:30bee2bf7ff4be7034afbd54fdd272c1d66a62d6fb6e9bab142232b885dee5c3","target":"graph","created_at":"2026-07-05T04:00:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.13156/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The design of highly scalable multiple access schemes is a main challenge in the evolution towards future massive machine-type communications, where reliability and latency constraints must be ensured to a large number of uncoordinated devices. In this scenario, coded random access (CRA) schemes, where successive interference cancellation algorithms allow large improvements with respect to classical random access protocols, have recently attracted an increasing interest. Impressive performance can be potentially obtained by combining CRA with massive multiple input multiple output (MIMO). In t","authors_text":"Alberto Faedi, Enrico Paolini, Lorenzo Valentini, Marco Chiani","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-02-26T15:03:28Z","title":"Impact of Interference Subtraction on Grant-Free Multiple Access with Massive MIMO"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.13156","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:aebe77a0648e87543c15d9cf2c9f1a378a1213dae18349c8b01b2783eaac87c1","target":"record","created_at":"2026-07-05T04:00:26Z","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":"7899a7013c7796c1d5ac52a675ab390280be25e29bf0801762f7966d2780f9dd","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-02-26T15:03:28Z","title_canon_sha256":"10369a1f99efe44e73f8d5f6c2131b7c6a433abb11608efc75b83d6c088a8280"},"schema_version":"1.0","source":{"id":"2202.13156","kind":"arxiv","version":1}},"canonical_sha256":"9a16610940c1f8df1aacf73a1c37b7a99157149cde21c7721ce911f873f6730f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a16610940c1f8df1aacf73a1c37b7a99157149cde21c7721ce911f873f6730f","first_computed_at":"2026-07-05T04:00:26.662731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:00:26.662731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZZGoJvvjwVkQ26mWAVRRne+aGMJezUbgoYlhHGXPDq7gADUPw52AQOOkwV5gGD3Y1Jx2PFCtAw4qpy88XuJHDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:00:26.663963Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.13156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aebe77a0648e87543c15d9cf2c9f1a378a1213dae18349c8b01b2783eaac87c1","sha256:30bee2bf7ff4be7034afbd54fdd272c1d66a62d6fb6e9bab142232b885dee5c3"],"state_sha256":"1d6c7a3e98d59a5a29e78bb9851c2b04c8885858a9c6789e7f1f78db760ba86e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0JbK+/SE2tLPY+paKO2r/IZAwflIFAPbZOkvWdLiiptUco4cNeL4A9oKFovIcNysywIlWI70p4tL4SMXZGcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:46:35.230600Z","bundle_sha256":"0e5f467871ac070f56b8f06f0bf501eddc2421253ff80a1edacac075eb9de988"}}