{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KUJMEWBW55BYNE5XZTJDBOFMWN","short_pith_number":"pith:KUJMEWBW","schema_version":"1.0","canonical_sha256":"5512c25836ef438693b7ccd230b8acb36d5306e371a493c74233f76a4d5c0236","source":{"kind":"arxiv","id":"1604.06221","version":4},"attestation_state":"computed","paper":{"title":"Detection and Combining Techniques for Asynchronous Random Access with Time Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Federico Clazzer, Francisco Lazaro, Gianluigi Liva, Mario Marchese","submitted_at":"2016-04-21T09:11:05Z","abstract_excerpt":"Asynchronous random access (RA) protocols are particularly attractive for their simplicity and avoidance of tight synchronization requirements. Recent enhancements have shown that the use of successive interference cancellation (SIC) can largely boost the performance of these schemes. A further step forward in the performance can be attained when diversity combining techniques are applied. In order to enable combining, the detection and association of the packets to their transmitters has to be done prior to decoding. We present a solution to this problem, that articulates into two phases. Non"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1604.06221","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-21T09:11:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c279fd5df7705c004043cc687109512701256c0a23f211b165f98f70eae2b298","abstract_canon_sha256":"773291becb453ac5bc217b2a5a19c01badfdbeec79feb6c4cab9a20d2b55822c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:42.664432Z","signature_b64":"2Suxor5uaBtC1PfR+BdERd/9rz8QzdOeW3vFwqd0aId1flPUfO1S5qF4v/B+DD/QLhpUKb9Gha0x4PriYc1UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5512c25836ef438693b7ccd230b8acb36d5306e371a493c74233f76a4d5c0236","last_reissued_at":"2026-05-18T01:10:42.663942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:42.663942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detection and Combining Techniques for Asynchronous Random Access with Time Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Federico Clazzer, Francisco Lazaro, Gianluigi Liva, Mario Marchese","submitted_at":"2016-04-21T09:11:05Z","abstract_excerpt":"Asynchronous random access (RA) protocols are particularly attractive for their simplicity and avoidance of tight synchronization requirements. Recent enhancements have shown that the use of successive interference cancellation (SIC) can largely boost the performance of these schemes. A further step forward in the performance can be attained when diversity combining techniques are applied. In order to enable combining, the detection and association of the packets to their transmitters has to be done prior to decoding. We present a solution to this problem, that articulates into two phases. Non"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06221","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.06221","created_at":"2026-05-18T01:10:42.663996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06221v4","created_at":"2026-05-18T01:10:42.663996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06221","created_at":"2026-05-18T01:10:42.663996+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUJMEWBW55BY","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUJMEWBW55BYNE5X","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUJMEWBW","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KUJMEWBW55BYNE5XZTJDBOFMWN","json":"https://pith.science/pith/KUJMEWBW55BYNE5XZTJDBOFMWN.json","graph_json":"https://pith.science/api/pith-number/KUJMEWBW55BYNE5XZTJDBOFMWN/graph.json","events_json":"https://pith.science/api/pith-number/KUJMEWBW55BYNE5XZTJDBOFMWN/events.json","paper":"https://pith.science/paper/KUJMEWBW"},"agent_actions":{"view_html":"https://pith.science/pith/KUJMEWBW55BYNE5XZTJDBOFMWN","download_json":"https://pith.science/pith/KUJMEWBW55BYNE5XZTJDBOFMWN.json","view_paper":"https://pith.science/paper/KUJMEWBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06221&json=true","fetch_graph":"https://pith.science/api/pith-number/KUJMEWBW55BYNE5XZTJDBOFMWN/graph.json","fetch_events":"https://pith.science/api/pith-number/KUJMEWBW55BYNE5XZTJDBOFMWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUJMEWBW55BYNE5XZTJDBOFMWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUJMEWBW55BYNE5XZTJDBOFMWN/action/storage_attestation","attest_author":"https://pith.science/pith/KUJMEWBW55BYNE5XZTJDBOFMWN/action/author_attestation","sign_citation":"https://pith.science/pith/KUJMEWBW55BYNE5XZTJDBOFMWN/action/citation_signature","submit_replication":"https://pith.science/pith/KUJMEWBW55BYNE5XZTJDBOFMWN/action/replication_record"}},"created_at":"2026-05-18T01:10:42.663996+00:00","updated_at":"2026-05-18T01:10:42.663996+00:00"}