{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ADYN7UJIHJM5Y34OW356M5BH7R","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":"4b427dac8380548674d5af6b46da677a5ad04786c8fe16543ef0879205ff4d6d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-28T03:34:54Z","title_canon_sha256":"a40b7bda791ad95b1e66e7d963555fbce6d1ec894d505660eae15f7f1d6f0822"},"schema_version":"1.0","source":{"id":"1810.11757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11757","created_at":"2026-05-18T00:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11757v2","created_at":"2026-05-18T00:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11757","created_at":"2026-05-18T00:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"ADYN7UJIHJM5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ADYN7UJIHJM5Y34O","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ADYN7UJI","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:2cafee724ccade5afbce4dd38bee5cee7e9bdfd625967b4cb8de07277a7d3ecc","target":"graph","created_at":"2026-05-18T00:02:03Z","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":"Given a $q$-ary frequency hopping sequence set of length $n$ and size $M$ with Hamming correlation $H$, one can obtain a $q$-ary (nonlinear) cyclic code of length $n$ and size $nM$ with Hamming distance $n-H$. Thus, every upper bound on the size of a code from coding theory gives an upper bound on the size of a frequency hopping sequence set. Indeed, all upper bounds from coding theory have been converted to upper bounds on frequency hopping sequence sets (\\cite{Ding09}). On the other hand, a lower bound from coding theory does not automatically produce a lower bound for frequency hopping sequ","authors_text":"Chaoping Xing, Chen Yuan, Xianhua Niu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-28T03:34:54Z","title":"Asymptotic Gilbert-Varshamov bound on Frequency Hopping Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11757","kind":"arxiv","version":2},"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:0b94526f3b8653a3cee8c6c5d67de1dee2d41822a1e2c7693eb70147d65d8456","target":"record","created_at":"2026-05-18T00:02:03Z","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":"4b427dac8380548674d5af6b46da677a5ad04786c8fe16543ef0879205ff4d6d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-28T03:34:54Z","title_canon_sha256":"a40b7bda791ad95b1e66e7d963555fbce6d1ec894d505660eae15f7f1d6f0822"},"schema_version":"1.0","source":{"id":"1810.11757","kind":"arxiv","version":2}},"canonical_sha256":"00f0dfd1283a59dc6f8eb6fbe67427fc4c913f4eb5c0664b859e8e033bf95c87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00f0dfd1283a59dc6f8eb6fbe67427fc4c913f4eb5c0664b859e8e033bf95c87","first_computed_at":"2026-05-18T00:02:03.027821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:03.027821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XnUEWf2z5cxZNDiwIGUBIlCvrN3tMFk7290/L+uhruzGY/BEGq9GeyV9vNarOctyTaOSKBp1UCIcjTUtypiICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:03.028422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b94526f3b8653a3cee8c6c5d67de1dee2d41822a1e2c7693eb70147d65d8456","sha256:2cafee724ccade5afbce4dd38bee5cee7e9bdfd625967b4cb8de07277a7d3ecc"],"state_sha256":"141bf65c8bae46a25d8dec714ceb7412b172146f4665d4cb7d01315f9fec667c"}