{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2AHA4XXYD3J7DO4SRWRSSGV24E","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":"1509708bdd27b463419134e2d2e424e74014cb11ff23c96911fdae91ebd85a43","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T18:14:35Z","title_canon_sha256":"a804853aff49be554c46424eb2e97af068349d7119b6c04c457334e0da926314"},"schema_version":"1.0","source":{"id":"1301.5852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5852","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5852v1","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5852","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"2AHA4XXYD3J7","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2AHA4XXYD3J7DO4S","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2AHA4XXY","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:6596e38ccf97bea514dd247835fdf3954c844fce87934e760bb13f624fa0bad8","target":"graph","created_at":"2026-05-18T00:58:17Z","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":"We address the problem of increasing the sum rate in a multiple-access system from [1] for small number of users. We suggest an improved signal-code construction in which in case of a small number of users we give more resources to them. For the resulting multiple-access system a lower bound on the relative sum rate is derived. It is shown to be very close to the maximal value of relative sum rate in [1] even for small number of users. The bound is obtained for the case of decoding by exhaustive search. We also suggest reduced-complexity decoding and compare the maximal number of users in this","authors_text":"Alexey Frolov, Robert Fischer, Victor Zyablov, Vladimir Sidorenko","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T18:14:35Z","title":"On a Multiple-Access in a Vector Disjunctive Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5852","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:a82d02b3b30650482923146981302b173bb1d1fe52d365a124e8d7f6530c127e","target":"record","created_at":"2026-05-18T00:58:17Z","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":"1509708bdd27b463419134e2d2e424e74014cb11ff23c96911fdae91ebd85a43","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T18:14:35Z","title_canon_sha256":"a804853aff49be554c46424eb2e97af068349d7119b6c04c457334e0da926314"},"schema_version":"1.0","source":{"id":"1301.5852","kind":"arxiv","version":1}},"canonical_sha256":"d00e0e5ef81ed3f1bb928da3291abae10e2508dd78868b330febe5ede68ca77a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d00e0e5ef81ed3f1bb928da3291abae10e2508dd78868b330febe5ede68ca77a","first_computed_at":"2026-05-18T00:58:17.680002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.680002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SAzli/RUSM1umOrHYW+6xfXzcat7JV+awCDktVyueNpYq51jYEdyOHpQ3ayOlEFcjDxfsqV6FzjrORKq3/qkCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.680718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a82d02b3b30650482923146981302b173bb1d1fe52d365a124e8d7f6530c127e","sha256:6596e38ccf97bea514dd247835fdf3954c844fce87934e760bb13f624fa0bad8"],"state_sha256":"abba42df87f081375a0d0a7ce14116303c1355f60652edcca3e44d01edaf3904"}