{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7MC45EJKS2NTVKWVOTF75N3TDJ","short_pith_number":"pith:7MC45EJK","canonical_record":{"source":{"id":"1012.2073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-09T18:42:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ceb0f668eedf368cf95b41a4a2cf4e949245b7d55bbf8b80de6db15e2c4b6f3c","abstract_canon_sha256":"f7ffcdc28071138426c91e224bd026352af7bf74e7b13f63f91580f8b3303700"},"schema_version":"1.0"},"canonical_sha256":"fb05ce912a969b3aaad574cbfeb7731a46e39a77ab144cd127a8250f4d083e27","source":{"kind":"arxiv","id":"1012.2073","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2073","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2073v1","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2073","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"7MC45EJKS2NT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7MC45EJKS2NTVKWV","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7MC45EJK","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7MC45EJKS2NTVKWVOTF75N3TDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1012.2073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-09T18:42:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ceb0f668eedf368cf95b41a4a2cf4e949245b7d55bbf8b80de6db15e2c4b6f3c","abstract_canon_sha256":"f7ffcdc28071138426c91e224bd026352af7bf74e7b13f63f91580f8b3303700"},"schema_version":"1.0"},"canonical_sha256":"fb05ce912a969b3aaad574cbfeb7731a46e39a77ab144cd127a8250f4d083e27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:49.040387Z","signature_b64":"PCcHV4Ptup0JYBxvqZVaAVpJqGGQsiG8Hrr+69pKreSqnUqlJdK200mSY8oHTYN9LtDvqoweNRhsH/4d8yNeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb05ce912a969b3aaad574cbfeb7731a46e39a77ab144cd127a8250f4d083e27","last_reissued_at":"2026-05-18T04:33:49.039910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:49.039910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.2073","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-18T04:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d8GTxUZ2wFyqW/lqZhjCcEO1C/1P86mTrAkY6QdmATKuZaI7+58a5T7KqyWF5PEr2IIpyNSSP9KniV5VnxpGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:04:29.631836Z"},"content_sha256":"d8f6e275c23d55ab4b001a8e90c2a02e750673287a685a97ff30d6f92d7fc8f9","schema_version":"1.0","event_id":"sha256:d8f6e275c23d55ab4b001a8e90c2a02e750673287a685a97ff30d6f92d7fc8f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7MC45EJKS2NTVKWVOTF75N3TDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost-Optimum Signature Matrices in Binary-Input Synchronous Overloaded CDMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Rashidinejad, F. Marvasti, M. Heidari Khoozani, M. H. Lotfi Froushani, P. Pad","submitted_at":"2010-12-09T18:42:19Z","abstract_excerpt":"The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic Algorithm in search of optimum signature matrices for binary-input synchronous CDMA. The main measure of optimality considered in this paper, is the per-user channel capacity of the overall multiple access system. Our resulting matrices differ from the renowned Welch Bound Equality (WBE) codes, regarding the fact that our attention is specifically aimed at binary,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2073","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-18T04:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1tqKvgrxXDy434yx2q/Pju3XfXy5uZbmU6uyr4ARtmgR9nxKkfhj+/FeS4htxPvYVhRvWazdcurtDZv81ZEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:04:29.632185Z"},"content_sha256":"19603d43e17a8ff7f1fb22b8f2412633dc3dea5a10cad756a047b2bd0ac5f27e","schema_version":"1.0","event_id":"sha256:19603d43e17a8ff7f1fb22b8f2412633dc3dea5a10cad756a047b2bd0ac5f27e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MC45EJKS2NTVKWVOTF75N3TDJ/bundle.json","state_url":"https://pith.science/pith/7MC45EJKS2NTVKWVOTF75N3TDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MC45EJKS2NTVKWVOTF75N3TDJ/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-06-05T15:04:29Z","links":{"resolver":"https://pith.science/pith/7MC45EJKS2NTVKWVOTF75N3TDJ","bundle":"https://pith.science/pith/7MC45EJKS2NTVKWVOTF75N3TDJ/bundle.json","state":"https://pith.science/pith/7MC45EJKS2NTVKWVOTF75N3TDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MC45EJKS2NTVKWVOTF75N3TDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7MC45EJKS2NTVKWVOTF75N3TDJ","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":"f7ffcdc28071138426c91e224bd026352af7bf74e7b13f63f91580f8b3303700","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-09T18:42:19Z","title_canon_sha256":"ceb0f668eedf368cf95b41a4a2cf4e949245b7d55bbf8b80de6db15e2c4b6f3c"},"schema_version":"1.0","source":{"id":"1012.2073","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2073","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2073v1","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2073","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"7MC45EJKS2NT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7MC45EJKS2NTVKWV","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7MC45EJK","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:19603d43e17a8ff7f1fb22b8f2412633dc3dea5a10cad756a047b2bd0ac5f27e","target":"graph","created_at":"2026-05-18T04:33:49Z","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 everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic Algorithm in search of optimum signature matrices for binary-input synchronous CDMA. The main measure of optimality considered in this paper, is the per-user channel capacity of the overall multiple access system. Our resulting matrices differ from the renowned Welch Bound Equality (WBE) codes, regarding the fact that our attention is specifically aimed at binary,","authors_text":"A. Rashidinejad, F. Marvasti, M. Heidari Khoozani, M. H. Lotfi Froushani, P. Pad","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-09T18:42:19Z","title":"Almost-Optimum Signature Matrices in Binary-Input Synchronous Overloaded CDMA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2073","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:d8f6e275c23d55ab4b001a8e90c2a02e750673287a685a97ff30d6f92d7fc8f9","target":"record","created_at":"2026-05-18T04:33:49Z","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":"f7ffcdc28071138426c91e224bd026352af7bf74e7b13f63f91580f8b3303700","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-09T18:42:19Z","title_canon_sha256":"ceb0f668eedf368cf95b41a4a2cf4e949245b7d55bbf8b80de6db15e2c4b6f3c"},"schema_version":"1.0","source":{"id":"1012.2073","kind":"arxiv","version":1}},"canonical_sha256":"fb05ce912a969b3aaad574cbfeb7731a46e39a77ab144cd127a8250f4d083e27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb05ce912a969b3aaad574cbfeb7731a46e39a77ab144cd127a8250f4d083e27","first_computed_at":"2026-05-18T04:33:49.039910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:49.039910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PCcHV4Ptup0JYBxvqZVaAVpJqGGQsiG8Hrr+69pKreSqnUqlJdK200mSY8oHTYN9LtDvqoweNRhsH/4d8yNeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:49.040387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2073","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8f6e275c23d55ab4b001a8e90c2a02e750673287a685a97ff30d6f92d7fc8f9","sha256:19603d43e17a8ff7f1fb22b8f2412633dc3dea5a10cad756a047b2bd0ac5f27e"],"state_sha256":"d395f2fa08d0ff11ec250a9aabc4c62998ecd066f19e1759e1d0a13f1205982d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBnzmfLE7aL94Dl87L3LNzGmxdfFWc4FIWiVL5LDNN5wOw+d632TbueYt1Q3K2pnmLpxIEuVfV3GVSNkTkD0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:04:29.634356Z","bundle_sha256":"401d9068ac181d4d3560e14c2d09eb0afa7d55738a3cbd2a95a970451a697786"}}