{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UF2FGP7IXWZIWAYR2CXVRAPQZU","short_pith_number":"pith:UF2FGP7I","canonical_record":{"source":{"id":"1307.0085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-29T10:25:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d6a41c62df329028a093cb869b6e5462f91f6fc1979a45745281d1d0b7f3145d","abstract_canon_sha256":"483d013cc2ff2a047b95eeaffee778b6ca0247127c0da5c1a7799a48c6dddd03"},"schema_version":"1.0"},"canonical_sha256":"a174533fe8bdb28b0311d0af5881f0cd2714beb9a0af43b99d3f9eb85839ac2b","source":{"kind":"arxiv","id":"1307.0085","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0085","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0085v1","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0085","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"UF2FGP7IXWZI","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UF2FGP7IXWZIWAYR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UF2FGP7I","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UF2FGP7IXWZIWAYR2CXVRAPQZU","target":"record","payload":{"canonical_record":{"source":{"id":"1307.0085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-29T10:25:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d6a41c62df329028a093cb869b6e5462f91f6fc1979a45745281d1d0b7f3145d","abstract_canon_sha256":"483d013cc2ff2a047b95eeaffee778b6ca0247127c0da5c1a7799a48c6dddd03"},"schema_version":"1.0"},"canonical_sha256":"a174533fe8bdb28b0311d0af5881f0cd2714beb9a0af43b99d3f9eb85839ac2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:34.315909Z","signature_b64":"tzSnlNq92QFn9jbwbPhJxvyuytOSjiZkq8muzSW2ovLwjmg+P7RSVZCnxuu1PqR8VNBvwVoTnEy/XBLO3NODAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a174533fe8bdb28b0311d0af5881f0cd2714beb9a0af43b99d3f9eb85839ac2b","last_reissued_at":"2026-05-18T03:19:34.315457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:34.315457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.0085","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-18T03:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XXYU0RvtVXz6tBMSc4v/qWyUPMvOxr7rFNoK25arGxpNldh47TnYtP8NAkm2Lj2chtl4DtwuGkCD+vvTmylvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:04:49.904397Z"},"content_sha256":"854e3670a32996520d293009806c6dbfbd15e3d9e17f608c913efb208c22f816","schema_version":"1.0","event_id":"sha256:854e3670a32996520d293009806c6dbfbd15e3d9e17f608c913efb208c22f816"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UF2FGP7IXWZIWAYR2CXVRAPQZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Slotted ALOHA with Varying Packet Loss Rate across Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cedomir Stefanovic, Petar Popovski","submitted_at":"2013-06-29T10:25:14Z","abstract_excerpt":"The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by utilizing theory and tools of erasure-correcting codes. In this paper we present a generalization of the and-or tree evaluation, adapted for the asymptotic analysis of the slotted ALOHA-based random-access protocols, for the case when the contending users experience different channel conditions, resulting in packet loss probability that varies across users."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0085","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-18T03:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aaTT4vEdAe/jFqRXmR/aR6YL9Nb19MPLmqJOJ7mGvUNuJdfgzISwFtESsRL+3syOqo8h4PnqTuF+XiYyvREYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:04:49.904870Z"},"content_sha256":"091f0c6c60dfcaa68bb8a3f9bb14011425cc90c1201093a905530986982d2e31","schema_version":"1.0","event_id":"sha256:091f0c6c60dfcaa68bb8a3f9bb14011425cc90c1201093a905530986982d2e31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UF2FGP7IXWZIWAYR2CXVRAPQZU/bundle.json","state_url":"https://pith.science/pith/UF2FGP7IXWZIWAYR2CXVRAPQZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UF2FGP7IXWZIWAYR2CXVRAPQZU/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-26T16:04:49Z","links":{"resolver":"https://pith.science/pith/UF2FGP7IXWZIWAYR2CXVRAPQZU","bundle":"https://pith.science/pith/UF2FGP7IXWZIWAYR2CXVRAPQZU/bundle.json","state":"https://pith.science/pith/UF2FGP7IXWZIWAYR2CXVRAPQZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UF2FGP7IXWZIWAYR2CXVRAPQZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UF2FGP7IXWZIWAYR2CXVRAPQZU","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":"483d013cc2ff2a047b95eeaffee778b6ca0247127c0da5c1a7799a48c6dddd03","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-29T10:25:14Z","title_canon_sha256":"d6a41c62df329028a093cb869b6e5462f91f6fc1979a45745281d1d0b7f3145d"},"schema_version":"1.0","source":{"id":"1307.0085","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0085","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0085v1","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0085","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"UF2FGP7IXWZI","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UF2FGP7IXWZIWAYR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UF2FGP7I","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:091f0c6c60dfcaa68bb8a3f9bb14011425cc90c1201093a905530986982d2e31","target":"graph","created_at":"2026-05-18T03:19:34Z","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":"The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by utilizing theory and tools of erasure-correcting codes. In this paper we present a generalization of the and-or tree evaluation, adapted for the asymptotic analysis of the slotted ALOHA-based random-access protocols, for the case when the contending users experience different channel conditions, resulting in packet loss probability that varies across users.","authors_text":"Cedomir Stefanovic, Petar Popovski","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-29T10:25:14Z","title":"Coded Slotted ALOHA with Varying Packet Loss Rate across Users"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0085","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:854e3670a32996520d293009806c6dbfbd15e3d9e17f608c913efb208c22f816","target":"record","created_at":"2026-05-18T03:19:34Z","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":"483d013cc2ff2a047b95eeaffee778b6ca0247127c0da5c1a7799a48c6dddd03","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-29T10:25:14Z","title_canon_sha256":"d6a41c62df329028a093cb869b6e5462f91f6fc1979a45745281d1d0b7f3145d"},"schema_version":"1.0","source":{"id":"1307.0085","kind":"arxiv","version":1}},"canonical_sha256":"a174533fe8bdb28b0311d0af5881f0cd2714beb9a0af43b99d3f9eb85839ac2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a174533fe8bdb28b0311d0af5881f0cd2714beb9a0af43b99d3f9eb85839ac2b","first_computed_at":"2026-05-18T03:19:34.315457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:34.315457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tzSnlNq92QFn9jbwbPhJxvyuytOSjiZkq8muzSW2ovLwjmg+P7RSVZCnxuu1PqR8VNBvwVoTnEy/XBLO3NODAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:34.315909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0085","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:854e3670a32996520d293009806c6dbfbd15e3d9e17f608c913efb208c22f816","sha256:091f0c6c60dfcaa68bb8a3f9bb14011425cc90c1201093a905530986982d2e31"],"state_sha256":"082b8a7f04e28076130698a6ab00f3fe64fc3d4efa8de707d25b743a3ae16377"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nXKpJMOPtyXZLOElAEIjkJ9/x00cG9Mev0negYLm5qZsjSF5eoi1Z9yZpWa9XMV03jUwiEkCsdcbkEgp4aVEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:04:49.908028Z","bundle_sha256":"c8f9fb11df09b43994f69b669b7e86adf69a12ac65aae85e6acabed508f7ee78"}}