{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:36NTI55OV5NXFTWLHVVR5EOCBA","short_pith_number":"pith:36NTI55O","schema_version":"1.0","canonical_sha256":"df9b3477aeaf5b72cecb3d6b1e91c2081578808983a29bd148d2a224a10308cc","source":{"kind":"arxiv","id":"1612.06646","version":1},"attestation_state":"computed","paper":{"title":"Finite-Length Analysis of Frameless ALOHA with Multi-User Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cedomir Stefanovic, Francisco Lazaro","submitted_at":"2016-12-20T13:20:33Z","abstract_excerpt":"In this paper we present a finite-length analysis of frameless ALOHA for a k multi-user detection scenario, i.e., assuming the receiver can resolve collisions of size k or smaller. The analysis is obtained via a dynamical programming approach, and employed to optimize the scheme's performance. We also assess the optimized performance as function of k. Finally, we verify the presented results through Monte Carlo simulations."},"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":"1612.06646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-20T13:20:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a5a8d765fdeb652e3656f67516d4dbda41a2e0ae51aae90b1c6b75fc98c551ae","abstract_canon_sha256":"4963098a9ba4781535f1d764649d5bd5492843d3a5433d61c71c5e7d3c257e2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:45.739354Z","signature_b64":"XqfTuRjR+71TDf++DPoHFXVbCl1M5IO3hnJM0ahQb+jmV7vbTdZFS+5mZClMYwHoDtaerAF/owmxZat6rYPyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df9b3477aeaf5b72cecb3d6b1e91c2081578808983a29bd148d2a224a10308cc","last_reissued_at":"2026-05-18T00:53:45.738958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:45.738958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-Length Analysis of Frameless ALOHA with Multi-User Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cedomir Stefanovic, Francisco Lazaro","submitted_at":"2016-12-20T13:20:33Z","abstract_excerpt":"In this paper we present a finite-length analysis of frameless ALOHA for a k multi-user detection scenario, i.e., assuming the receiver can resolve collisions of size k or smaller. The analysis is obtained via a dynamical programming approach, and employed to optimize the scheme's performance. We also assess the optimized performance as function of k. Finally, we verify the presented results through Monte Carlo simulations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06646","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.06646","created_at":"2026-05-18T00:53:45.739022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06646v1","created_at":"2026-05-18T00:53:45.739022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06646","created_at":"2026-05-18T00:53:45.739022+00:00"},{"alias_kind":"pith_short_12","alias_value":"36NTI55OV5NX","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"36NTI55OV5NXFTWL","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"36NTI55O","created_at":"2026-05-18T12:29:55.572404+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/36NTI55OV5NXFTWLHVVR5EOCBA","json":"https://pith.science/pith/36NTI55OV5NXFTWLHVVR5EOCBA.json","graph_json":"https://pith.science/api/pith-number/36NTI55OV5NXFTWLHVVR5EOCBA/graph.json","events_json":"https://pith.science/api/pith-number/36NTI55OV5NXFTWLHVVR5EOCBA/events.json","paper":"https://pith.science/paper/36NTI55O"},"agent_actions":{"view_html":"https://pith.science/pith/36NTI55OV5NXFTWLHVVR5EOCBA","download_json":"https://pith.science/pith/36NTI55OV5NXFTWLHVVR5EOCBA.json","view_paper":"https://pith.science/paper/36NTI55O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06646&json=true","fetch_graph":"https://pith.science/api/pith-number/36NTI55OV5NXFTWLHVVR5EOCBA/graph.json","fetch_events":"https://pith.science/api/pith-number/36NTI55OV5NXFTWLHVVR5EOCBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36NTI55OV5NXFTWLHVVR5EOCBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36NTI55OV5NXFTWLHVVR5EOCBA/action/storage_attestation","attest_author":"https://pith.science/pith/36NTI55OV5NXFTWLHVVR5EOCBA/action/author_attestation","sign_citation":"https://pith.science/pith/36NTI55OV5NXFTWLHVVR5EOCBA/action/citation_signature","submit_replication":"https://pith.science/pith/36NTI55OV5NXFTWLHVVR5EOCBA/action/replication_record"}},"created_at":"2026-05-18T00:53:45.739022+00:00","updated_at":"2026-05-18T00:53:45.739022+00:00"}