{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JAG63QQCRPFBZ7AKN2IC5U5ZXV","short_pith_number":"pith:JAG63QQC","schema_version":"1.0","canonical_sha256":"480dedc2028bca1cfc0a6e902ed3b9bd6872c52a3bda9f3481734702c1b7b51a","source":{"kind":"arxiv","id":"1705.08055","version":2},"attestation_state":"computed","paper":{"title":"Nearly optimal codebooks based on generalized Jacobi sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ziling Heng","submitted_at":"2017-05-23T01:52:53Z","abstract_excerpt":"Codebooks with small inner-product correlation are applied in many practical applications including direct spread code division multiple access (CDMA) communications, space-time codes and compressed sensing. It is extremely difficult to construct codebooks achieving the Welch bound or the Levenshtein bound. Constructing nearly optimal codebooks such that the ratio of its maximum cross-correlation amplitude to the corresponding bound approaches 1 is also an interesting research topic. In this paper, we firstly study a family of interesting character sums called generalized Jacobi sums over fini"},"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":"1705.08055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-23T01:52:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab3e267347c71c154d1c3841c3f4aa37a7bf23d68c1c1cdb09d006afba42f0ba","abstract_canon_sha256":"901b86b3b4f6d3bfef5767b3c81e6f67a9629347e79e010cfa39c4c9880137aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:14.594255Z","signature_b64":"HqVZGf5fKJRQP6iUr2hcWqnm8DTLkL/dAian8coS43N6/gyPkH9ripn0SBgDJO5IJFFdCgtbMzirrTJITycNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"480dedc2028bca1cfc0a6e902ed3b9bd6872c52a3bda9f3481734702c1b7b51a","last_reissued_at":"2026-05-18T00:16:14.593525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:14.593525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly optimal codebooks based on generalized Jacobi sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ziling Heng","submitted_at":"2017-05-23T01:52:53Z","abstract_excerpt":"Codebooks with small inner-product correlation are applied in many practical applications including direct spread code division multiple access (CDMA) communications, space-time codes and compressed sensing. It is extremely difficult to construct codebooks achieving the Welch bound or the Levenshtein bound. Constructing nearly optimal codebooks such that the ratio of its maximum cross-correlation amplitude to the corresponding bound approaches 1 is also an interesting research topic. In this paper, we firstly study a family of interesting character sums called generalized Jacobi sums over fini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08055","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":""},"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":"1705.08055","created_at":"2026-05-18T00:16:14.593659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08055v2","created_at":"2026-05-18T00:16:14.593659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08055","created_at":"2026-05-18T00:16:14.593659+00:00"},{"alias_kind":"pith_short_12","alias_value":"JAG63QQCRPFB","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"JAG63QQCRPFBZ7AK","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"JAG63QQC","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JAG63QQCRPFBZ7AKN2IC5U5ZXV","json":"https://pith.science/pith/JAG63QQCRPFBZ7AKN2IC5U5ZXV.json","graph_json":"https://pith.science/api/pith-number/JAG63QQCRPFBZ7AKN2IC5U5ZXV/graph.json","events_json":"https://pith.science/api/pith-number/JAG63QQCRPFBZ7AKN2IC5U5ZXV/events.json","paper":"https://pith.science/paper/JAG63QQC"},"agent_actions":{"view_html":"https://pith.science/pith/JAG63QQCRPFBZ7AKN2IC5U5ZXV","download_json":"https://pith.science/pith/JAG63QQCRPFBZ7AKN2IC5U5ZXV.json","view_paper":"https://pith.science/paper/JAG63QQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08055&json=true","fetch_graph":"https://pith.science/api/pith-number/JAG63QQCRPFBZ7AKN2IC5U5ZXV/graph.json","fetch_events":"https://pith.science/api/pith-number/JAG63QQCRPFBZ7AKN2IC5U5ZXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JAG63QQCRPFBZ7AKN2IC5U5ZXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JAG63QQCRPFBZ7AKN2IC5U5ZXV/action/storage_attestation","attest_author":"https://pith.science/pith/JAG63QQCRPFBZ7AKN2IC5U5ZXV/action/author_attestation","sign_citation":"https://pith.science/pith/JAG63QQCRPFBZ7AKN2IC5U5ZXV/action/citation_signature","submit_replication":"https://pith.science/pith/JAG63QQCRPFBZ7AKN2IC5U5ZXV/action/replication_record"}},"created_at":"2026-05-18T00:16:14.593659+00:00","updated_at":"2026-05-18T00:16:14.593659+00:00"}