{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:3IZCCLW6SRG3IOKEFQXFCYFAKZ","short_pith_number":"pith:3IZCCLW6","canonical_record":{"source":{"id":"0806.1659","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-06-10T13:39:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f97dd4fe6a07b8a3e8c71f24f7c5735583097dd6febaf6107687dd6d488144a","abstract_canon_sha256":"b13bc327f0ccab77895c84b9ab5022144413202758bbf397757973ecb8d1967d"},"schema_version":"1.0"},"canonical_sha256":"da32212ede944db439442c2e5160a056472ec9aea5399808e1cfc93efd4c0d79","source":{"kind":"arxiv","id":"0806.1659","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.1659","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0806.1659v3","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.1659","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"3IZCCLW6SRG3","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"3IZCCLW6SRG3IOKE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"3IZCCLW6","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:3IZCCLW6SRG3IOKEFQXFCYFAKZ","target":"record","payload":{"canonical_record":{"source":{"id":"0806.1659","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-06-10T13:39:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f97dd4fe6a07b8a3e8c71f24f7c5735583097dd6febaf6107687dd6d488144a","abstract_canon_sha256":"b13bc327f0ccab77895c84b9ab5022144413202758bbf397757973ecb8d1967d"},"schema_version":"1.0"},"canonical_sha256":"da32212ede944db439442c2e5160a056472ec9aea5399808e1cfc93efd4c0d79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.582573Z","signature_b64":"MI/uXuVGWvjYWyqP7inrSI2aVkeDf17uxpknrs01IJeXFqanpTGw7ondP636nQT0n4tQsH/9m/LdXRcOyzcSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da32212ede944db439442c2e5160a056472ec9aea5399808e1cfc93efd4c0d79","last_reissued_at":"2026-05-18T00:57:58.581939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.581939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0806.1659","source_version":3,"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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSHCRhfqrcP1jex2E/ByKMXJxQIharbUJwqwmm0/Au2RFuAHLTMT/QE/Abq4dl/lw3/kc5pvyiJo4BV/DIsPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:49:28.112552Z"},"content_sha256":"ffc61414b9642453b6ac4b2484275600d570ac14633403c3ba08613b3c996b36","schema_version":"1.0","event_id":"sha256:ffc61414b9642453b6ac4b2484275600d570ac14633403c3ba08613b3c996b36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:3IZCCLW6SRG3IOKEFQXFCYFAKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the Sum Capacity of Synchronous Binary CDMA Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"F. Marvasti, K. Alishahi, P. Pad, V. Aref","submitted_at":"2008-06-10T13:39:08Z","abstract_excerpt":"In this paper, we obtain a family of lower bounds for the sum capacity of Code Division Multiple Access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The envelope of this family gives a relatively tight lower bound in terms of the number of users, spreading gain and the noise distribution. The derivation methods for the noiseless and the noisy channels are different but when the noise variance goes to zero, the noisy channel bound approaches the noiseless case. The behavior of the lower bound shows that for s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.1659","kind":"arxiv","version":3},"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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5pagItAxKqQPfa8Ur9BqVcdYT/LwCspohsW/LbfIfdHxEK0Nez8gV7hceaMAVGGIZ5WnL88yIYno5mbr5fcbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:49:28.113092Z"},"content_sha256":"872776f005cf76af639c5745ec2f4e73cc4d890632590f82fcca8ffd5fcccc42","schema_version":"1.0","event_id":"sha256:872776f005cf76af639c5745ec2f4e73cc4d890632590f82fcca8ffd5fcccc42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IZCCLW6SRG3IOKEFQXFCYFAKZ/bundle.json","state_url":"https://pith.science/pith/3IZCCLW6SRG3IOKEFQXFCYFAKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IZCCLW6SRG3IOKEFQXFCYFAKZ/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-31T17:49:28Z","links":{"resolver":"https://pith.science/pith/3IZCCLW6SRG3IOKEFQXFCYFAKZ","bundle":"https://pith.science/pith/3IZCCLW6SRG3IOKEFQXFCYFAKZ/bundle.json","state":"https://pith.science/pith/3IZCCLW6SRG3IOKEFQXFCYFAKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IZCCLW6SRG3IOKEFQXFCYFAKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:3IZCCLW6SRG3IOKEFQXFCYFAKZ","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":"b13bc327f0ccab77895c84b9ab5022144413202758bbf397757973ecb8d1967d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-06-10T13:39:08Z","title_canon_sha256":"9f97dd4fe6a07b8a3e8c71f24f7c5735583097dd6febaf6107687dd6d488144a"},"schema_version":"1.0","source":{"id":"0806.1659","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.1659","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0806.1659v3","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.1659","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"3IZCCLW6SRG3","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"3IZCCLW6SRG3IOKE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"3IZCCLW6","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:872776f005cf76af639c5745ec2f4e73cc4d890632590f82fcca8ffd5fcccc42","target":"graph","created_at":"2026-05-18T00:57:58Z","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 paper, we obtain a family of lower bounds for the sum capacity of Code Division Multiple Access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The envelope of this family gives a relatively tight lower bound in terms of the number of users, spreading gain and the noise distribution. The derivation methods for the noiseless and the noisy channels are different but when the noise variance goes to zero, the noisy channel bound approaches the noiseless case. The behavior of the lower bound shows that for s","authors_text":"F. Marvasti, K. Alishahi, P. Pad, V. Aref","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-06-10T13:39:08Z","title":"Bounds on the Sum Capacity of Synchronous Binary CDMA Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.1659","kind":"arxiv","version":3},"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:ffc61414b9642453b6ac4b2484275600d570ac14633403c3ba08613b3c996b36","target":"record","created_at":"2026-05-18T00:57:58Z","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":"b13bc327f0ccab77895c84b9ab5022144413202758bbf397757973ecb8d1967d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-06-10T13:39:08Z","title_canon_sha256":"9f97dd4fe6a07b8a3e8c71f24f7c5735583097dd6febaf6107687dd6d488144a"},"schema_version":"1.0","source":{"id":"0806.1659","kind":"arxiv","version":3}},"canonical_sha256":"da32212ede944db439442c2e5160a056472ec9aea5399808e1cfc93efd4c0d79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da32212ede944db439442c2e5160a056472ec9aea5399808e1cfc93efd4c0d79","first_computed_at":"2026-05-18T00:57:58.581939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.581939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MI/uXuVGWvjYWyqP7inrSI2aVkeDf17uxpknrs01IJeXFqanpTGw7ondP636nQT0n4tQsH/9m/LdXRcOyzcSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.582573Z","signed_message":"canonical_sha256_bytes"},"source_id":"0806.1659","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffc61414b9642453b6ac4b2484275600d570ac14633403c3ba08613b3c996b36","sha256:872776f005cf76af639c5745ec2f4e73cc4d890632590f82fcca8ffd5fcccc42"],"state_sha256":"3c2a190be153cdeb835eb2d8696abfc9344b7cf0dfafd98426878169cf2a8a70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tcd/e/mxKvuUJkL+qaAv08OXjyRxe+iQ7i1sgxlUurOjzcOCPt7G/BZnq12FzwI/Z3Gx20JNTeBFyz55ZCXjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:49:28.116390Z","bundle_sha256":"f336da5d246fec535ad1340ef586a12e02fc252887a43e447bfb371124507a1d"}}