{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ISGWIGDKZIRWZGA6YXZVOB23PK","short_pith_number":"pith:ISGWIGDK","schema_version":"1.0","canonical_sha256":"448d64186aca236c981ec5f357075b7a9d74a215211d8c248f37ab002bfa1935","source":{"kind":"arxiv","id":"1001.2024","version":2},"attestation_state":"computed","paper":{"title":"Wireless Networks with Asynchronous Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir K. Khandani, Kamyar Moshksar","submitted_at":"2010-01-12T21:19:07Z","abstract_excerpt":"This paper addresses an interference channel consisting of $\\mathbf{n}$ active users sharing $u$ frequency sub-bands. Users are asynchronous meaning there exists a mutual delay between their transmitted codes. A stationary model for interference is considered by assuming the starting point of an interferer's data is uniformly distributed along the codeword of any user. This model is not ergodic, however, we show that the noise plus interference process satisfies an Asymptotic Equipartition Property (AEP) under certain conditions. This enables us to define achievable rates in the conventional S"},"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":"1001.2024","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-12T21:19:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"235bb38564937d525ed80f130d52a5ea33cd9bf2777965972c6582713e236447","abstract_canon_sha256":"038af64aba6dd2b45b86c9efaa0c09a4af4d5169ee1d7129549451da43f65754"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:30:31.506790Z","signature_b64":"W3NW2c+6sDokgDFvcpfgYFS9OAF/IqCDz+StV9zpwGQ/9fec1iob6+QtB7YtvYwAiRw/2fIXa0ycCDlFSrcrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"448d64186aca236c981ec5f357075b7a9d74a215211d8c248f37ab002bfa1935","last_reissued_at":"2026-07-04T17:30:31.506442Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:30:31.506442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wireless Networks with Asynchronous Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir K. Khandani, Kamyar Moshksar","submitted_at":"2010-01-12T21:19:07Z","abstract_excerpt":"This paper addresses an interference channel consisting of $\\mathbf{n}$ active users sharing $u$ frequency sub-bands. Users are asynchronous meaning there exists a mutual delay between their transmitted codes. A stationary model for interference is considered by assuming the starting point of an interferer's data is uniformly distributed along the codeword of any user. This model is not ergodic, however, we show that the noise plus interference process satisfies an Asymptotic Equipartition Property (AEP) under certain conditions. This enables us to define achievable rates in the conventional S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2024","kind":"arxiv","version":2},"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/1001.2024/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1001.2024","created_at":"2026-07-04T17:30:31.506502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.2024v2","created_at":"2026-07-04T17:30:31.506502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2024","created_at":"2026-07-04T17:30:31.506502+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISGWIGDKZIRW","created_at":"2026-07-04T17:30:31.506502+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISGWIGDKZIRWZGA6","created_at":"2026-07-04T17:30:31.506502+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISGWIGDK","created_at":"2026-07-04T17:30:31.506502+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2605.15083","citing_title":"Novel Dynamic Batch-Sensitive Adam Optimiser for Vehicular Accident Injury Severity Prediction","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12442","citing_title":"Reframing AI Loss of Control: What Control Is, How to Have It, How to Lose It","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2504.10527","citing_title":"Explainable Artificial Intelligence Techniques for Interpretation of Food Models: a Review","ref_index":94,"is_internal_anchor":true},{"citing_arxiv_id":"2504.10527","citing_title":"Explainable Artificial Intelligence Techniques for Interpretation of Food Models: a Review","ref_index":86,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05266","citing_title":"LLM2Manim: Pedagogy-Aware AI Generation of STEM Animations","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ISGWIGDKZIRWZGA6YXZVOB23PK","json":"https://pith.science/pith/ISGWIGDKZIRWZGA6YXZVOB23PK.json","graph_json":"https://pith.science/api/pith-number/ISGWIGDKZIRWZGA6YXZVOB23PK/graph.json","events_json":"https://pith.science/api/pith-number/ISGWIGDKZIRWZGA6YXZVOB23PK/events.json","paper":"https://pith.science/paper/ISGWIGDK"},"agent_actions":{"view_html":"https://pith.science/pith/ISGWIGDKZIRWZGA6YXZVOB23PK","download_json":"https://pith.science/pith/ISGWIGDKZIRWZGA6YXZVOB23PK.json","view_paper":"https://pith.science/paper/ISGWIGDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.2024&json=true","fetch_graph":"https://pith.science/api/pith-number/ISGWIGDKZIRWZGA6YXZVOB23PK/graph.json","fetch_events":"https://pith.science/api/pith-number/ISGWIGDKZIRWZGA6YXZVOB23PK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISGWIGDKZIRWZGA6YXZVOB23PK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISGWIGDKZIRWZGA6YXZVOB23PK/action/storage_attestation","attest_author":"https://pith.science/pith/ISGWIGDKZIRWZGA6YXZVOB23PK/action/author_attestation","sign_citation":"https://pith.science/pith/ISGWIGDKZIRWZGA6YXZVOB23PK/action/citation_signature","submit_replication":"https://pith.science/pith/ISGWIGDKZIRWZGA6YXZVOB23PK/action/replication_record"}},"created_at":"2026-07-04T17:30:31.506502+00:00","updated_at":"2026-07-04T17:30:31.506502+00:00"}