{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BYS2MRSVBEXEWCJ2YNJ47I7RQL","short_pith_number":"pith:BYS2MRSV","canonical_record":{"source":{"id":"1903.10643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-26T00:43:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6a9fedf14999b636811a32a5304a75ee20d905bfa9079214dce0432bc4c18c4","abstract_canon_sha256":"4bd638677834e7ce5197c8d19bfd5531b4d691443130a358916a74c19bea08ce"},"schema_version":"1.0"},"canonical_sha256":"0e25a64655092e4b093ac353cfa3f182e6cf64a4559a9a9937c6d7d03ca9b7d1","source":{"kind":"arxiv","id":"1903.10643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10643","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10643v1","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10643","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"BYS2MRSVBEXE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BYS2MRSVBEXEWCJ2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BYS2MRSV","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BYS2MRSVBEXEWCJ2YNJ47I7RQL","target":"record","payload":{"canonical_record":{"source":{"id":"1903.10643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-26T00:43:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6a9fedf14999b636811a32a5304a75ee20d905bfa9079214dce0432bc4c18c4","abstract_canon_sha256":"4bd638677834e7ce5197c8d19bfd5531b4d691443130a358916a74c19bea08ce"},"schema_version":"1.0"},"canonical_sha256":"0e25a64655092e4b093ac353cfa3f182e6cf64a4559a9a9937c6d7d03ca9b7d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:18.232343Z","signature_b64":"UHe7D3es9VDUmIalno7nhNpSF+f1jVqDr7G+aMjeqZHId6D7HQ/yHiGoTiga3Nes39GHaWZpP3vKrXPO1fEgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e25a64655092e4b093ac353cfa3f182e6cf64a4559a9a9937c6d7d03ca9b7d1","last_reissued_at":"2026-05-17T23:50:18.231870Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:18.231870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.10643","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-17T23:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5hq6c8EfgtDbuBBzqgMe8dczEow+W7iVX/4BpR/T5mGJyDT87NmfZxKDaSAabvCVsXG6XwosHwpUJngXkImhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:05:07.691606Z"},"content_sha256":"062a94ce339382e7dade232e99da35a129c76315f1626958793a3ded4699e51d","schema_version":"1.0","event_id":"sha256:062a94ce339382e7dade232e99da35a129c76315f1626958793a3ded4699e51d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BYS2MRSVBEXEWCJ2YNJ47I7RQL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Study of Activity-Aware Multiple Feedback Successive Interference Cancellation for Massive Machine-Type Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. B. di Renna, R. C. de Lamare","submitted_at":"2019-03-26T00:43:25Z","abstract_excerpt":"In this work, we propose an activity-aware low-complexity multiple feedback successive interference cancellation (AA-MF-SIC) strategy for massive machine-type communications. The computational complexity of the proposed AA-MF-SIC is as low as the conventional SIC algorithm with very low additional complexity added. The simulation results show that the algorithm significantly outperforms the conventional SIC schemes and other proposals."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10643","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-17T23:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61pP3sP2Z/3IPpeG6c/7758swzevOQu/sY6qmTArbnqa21g+kmHbIM6qJTGig/JLulVwd9lkLJIi5A1ui7sDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:05:07.692246Z"},"content_sha256":"06e9fbe511798139a5e23dbaedd8aafa44551cfa30ae2f6fdfd2d95bb528fd71","schema_version":"1.0","event_id":"sha256:06e9fbe511798139a5e23dbaedd8aafa44551cfa30ae2f6fdfd2d95bb528fd71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYS2MRSVBEXEWCJ2YNJ47I7RQL/bundle.json","state_url":"https://pith.science/pith/BYS2MRSVBEXEWCJ2YNJ47I7RQL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYS2MRSVBEXEWCJ2YNJ47I7RQL/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-20T21:05:07Z","links":{"resolver":"https://pith.science/pith/BYS2MRSVBEXEWCJ2YNJ47I7RQL","bundle":"https://pith.science/pith/BYS2MRSVBEXEWCJ2YNJ47I7RQL/bundle.json","state":"https://pith.science/pith/BYS2MRSVBEXEWCJ2YNJ47I7RQL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYS2MRSVBEXEWCJ2YNJ47I7RQL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BYS2MRSVBEXEWCJ2YNJ47I7RQL","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":"4bd638677834e7ce5197c8d19bfd5531b4d691443130a358916a74c19bea08ce","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-26T00:43:25Z","title_canon_sha256":"e6a9fedf14999b636811a32a5304a75ee20d905bfa9079214dce0432bc4c18c4"},"schema_version":"1.0","source":{"id":"1903.10643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10643","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10643v1","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10643","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"BYS2MRSVBEXE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BYS2MRSVBEXEWCJ2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BYS2MRSV","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:06e9fbe511798139a5e23dbaedd8aafa44551cfa30ae2f6fdfd2d95bb528fd71","target":"graph","created_at":"2026-05-17T23:50:18Z","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":"In this work, we propose an activity-aware low-complexity multiple feedback successive interference cancellation (AA-MF-SIC) strategy for massive machine-type communications. The computational complexity of the proposed AA-MF-SIC is as low as the conventional SIC algorithm with very low additional complexity added. The simulation results show that the algorithm significantly outperforms the conventional SIC schemes and other proposals.","authors_text":"R. B. di Renna, R. C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-26T00:43:25Z","title":"Study of Activity-Aware Multiple Feedback Successive Interference Cancellation for Massive Machine-Type Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10643","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:062a94ce339382e7dade232e99da35a129c76315f1626958793a3ded4699e51d","target":"record","created_at":"2026-05-17T23:50:18Z","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":"4bd638677834e7ce5197c8d19bfd5531b4d691443130a358916a74c19bea08ce","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-26T00:43:25Z","title_canon_sha256":"e6a9fedf14999b636811a32a5304a75ee20d905bfa9079214dce0432bc4c18c4"},"schema_version":"1.0","source":{"id":"1903.10643","kind":"arxiv","version":1}},"canonical_sha256":"0e25a64655092e4b093ac353cfa3f182e6cf64a4559a9a9937c6d7d03ca9b7d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e25a64655092e4b093ac353cfa3f182e6cf64a4559a9a9937c6d7d03ca9b7d1","first_computed_at":"2026-05-17T23:50:18.231870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:18.231870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UHe7D3es9VDUmIalno7nhNpSF+f1jVqDr7G+aMjeqZHId6D7HQ/yHiGoTiga3Nes39GHaWZpP3vKrXPO1fEgAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:18.232343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:062a94ce339382e7dade232e99da35a129c76315f1626958793a3ded4699e51d","sha256:06e9fbe511798139a5e23dbaedd8aafa44551cfa30ae2f6fdfd2d95bb528fd71"],"state_sha256":"bf39ad3692e80827faa973eeea58183e3f940951770e1ec5c3345952fbf95d67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uCzsq+58uXPKAfB4ZFHvIrLDWYcQuccaXYf503Ij55HFVU98Tu+ELtFHlIkKjNsTdPDBzaYcdZAfAeMShrFcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T21:05:07.694747Z","bundle_sha256":"e3977a13d7dec985d860f5f2570beccb872e8023bdee14f0cbdbe516b6f80a2d"}}