{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FFTNGZUJR7WIBK4C3ZSWPAI6IA","short_pith_number":"pith:FFTNGZUJ","canonical_record":{"source":{"id":"1605.03454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-11T14:20:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27be55f066711d733b2ab9e509734ee8874a87f33668e50a96c0dc2f2bb2769f","abstract_canon_sha256":"84b52b03e1f20ee0411da677087626be6d1b6667ec85ba0b9ac83acdcc77aa91"},"schema_version":"1.0"},"canonical_sha256":"2966d366898fec80ab82de6567811e400f64d310dd220cbc4c2c5627021757ef","source":{"kind":"arxiv","id":"1605.03454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03454","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03454v1","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03454","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"FFTNGZUJR7WI","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FFTNGZUJR7WIBK4C","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FFTNGZUJ","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FFTNGZUJR7WIBK4C3ZSWPAI6IA","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-11T14:20:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27be55f066711d733b2ab9e509734ee8874a87f33668e50a96c0dc2f2bb2769f","abstract_canon_sha256":"84b52b03e1f20ee0411da677087626be6d1b6667ec85ba0b9ac83acdcc77aa91"},"schema_version":"1.0"},"canonical_sha256":"2966d366898fec80ab82de6567811e400f64d310dd220cbc4c2c5627021757ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:05.364740Z","signature_b64":"LM0Q8mRjmPsjbjaLHopOIMBjugDUuKSitgItZg74SiH8F+QYtacSZwFfLoSzX7gv7NswkgTjL4qBl44mmq+MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2966d366898fec80ab82de6567811e400f64d310dd220cbc4c2c5627021757ef","last_reissued_at":"2026-05-18T01:15:05.364128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:05.364128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03454","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-18T01:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHyyX5Gi2ZS/F5pDON5/WVKILzKWNQaYBtulETtEY4memxrbkV4E9mSNjJjtcqTS27fguz09suVjJSSYkMJAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:06:45.800895Z"},"content_sha256":"81cd3414638e10bfb25b076ee9ca6ebd2dedb3f5a83e54d365c2b0e518ac1ebc","schema_version":"1.0","event_id":"sha256:81cd3414638e10bfb25b076ee9ca6ebd2dedb3f5a83e54d365c2b0e518ac1ebc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FFTNGZUJR7WIBK4C3ZSWPAI6IA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Three new classes of optimal frequency-hopping sequence sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bocong Chen, Hongwei Liu, Liren Lin, San Ling","submitted_at":"2016-05-11T14:20:29Z","abstract_excerpt":"The study of frequency-hopping sequences (FHSs) has been focused on the establishment of theoretical bounds for the parameters of FHSs as well as on the construction of optimal FHSs with respect to the bounds. Peng and Fan (2004) derived two lower bounds on the maximum nontrivial Hamming correlation of an FHS set, which is an important indicator in measuring the performance of an FHS set employed in practice.\n  In this paper, we obtain two main results. We study the construction of new optimal frequency-hopping sequence sets by using cyclic codes over finite fields. Let $\\mathcal{C}$ be a cycl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03454","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-18T01:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxOwAi6VJoivmbf/x9pKGzhafT0Cl7+apTjz/MyvXW8gZK4221+0ht+YnDi91VVw+QnmFlcYxDulWb+DoVvACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:06:45.801279Z"},"content_sha256":"941b8cc817312fa74cb084de348694707ab7d86a91653676b42f266ec19ef938","schema_version":"1.0","event_id":"sha256:941b8cc817312fa74cb084de348694707ab7d86a91653676b42f266ec19ef938"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFTNGZUJR7WIBK4C3ZSWPAI6IA/bundle.json","state_url":"https://pith.science/pith/FFTNGZUJR7WIBK4C3ZSWPAI6IA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFTNGZUJR7WIBK4C3ZSWPAI6IA/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-03T16:06:45Z","links":{"resolver":"https://pith.science/pith/FFTNGZUJR7WIBK4C3ZSWPAI6IA","bundle":"https://pith.science/pith/FFTNGZUJR7WIBK4C3ZSWPAI6IA/bundle.json","state":"https://pith.science/pith/FFTNGZUJR7WIBK4C3ZSWPAI6IA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFTNGZUJR7WIBK4C3ZSWPAI6IA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FFTNGZUJR7WIBK4C3ZSWPAI6IA","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":"84b52b03e1f20ee0411da677087626be6d1b6667ec85ba0b9ac83acdcc77aa91","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-11T14:20:29Z","title_canon_sha256":"27be55f066711d733b2ab9e509734ee8874a87f33668e50a96c0dc2f2bb2769f"},"schema_version":"1.0","source":{"id":"1605.03454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03454","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03454v1","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03454","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"FFTNGZUJR7WI","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FFTNGZUJR7WIBK4C","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FFTNGZUJ","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:941b8cc817312fa74cb084de348694707ab7d86a91653676b42f266ec19ef938","target":"graph","created_at":"2026-05-18T01:15:05Z","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 study of frequency-hopping sequences (FHSs) has been focused on the establishment of theoretical bounds for the parameters of FHSs as well as on the construction of optimal FHSs with respect to the bounds. Peng and Fan (2004) derived two lower bounds on the maximum nontrivial Hamming correlation of an FHS set, which is an important indicator in measuring the performance of an FHS set employed in practice.\n  In this paper, we obtain two main results. We study the construction of new optimal frequency-hopping sequence sets by using cyclic codes over finite fields. Let $\\mathcal{C}$ be a cycl","authors_text":"Bocong Chen, Hongwei Liu, Liren Lin, San Ling","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-11T14:20:29Z","title":"Three new classes of optimal frequency-hopping sequence sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03454","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:81cd3414638e10bfb25b076ee9ca6ebd2dedb3f5a83e54d365c2b0e518ac1ebc","target":"record","created_at":"2026-05-18T01:15:05Z","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":"84b52b03e1f20ee0411da677087626be6d1b6667ec85ba0b9ac83acdcc77aa91","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-11T14:20:29Z","title_canon_sha256":"27be55f066711d733b2ab9e509734ee8874a87f33668e50a96c0dc2f2bb2769f"},"schema_version":"1.0","source":{"id":"1605.03454","kind":"arxiv","version":1}},"canonical_sha256":"2966d366898fec80ab82de6567811e400f64d310dd220cbc4c2c5627021757ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2966d366898fec80ab82de6567811e400f64d310dd220cbc4c2c5627021757ef","first_computed_at":"2026-05-18T01:15:05.364128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:05.364128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LM0Q8mRjmPsjbjaLHopOIMBjugDUuKSitgItZg74SiH8F+QYtacSZwFfLoSzX7gv7NswkgTjL4qBl44mmq+MAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:05.364740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81cd3414638e10bfb25b076ee9ca6ebd2dedb3f5a83e54d365c2b0e518ac1ebc","sha256:941b8cc817312fa74cb084de348694707ab7d86a91653676b42f266ec19ef938"],"state_sha256":"f3d20a9d1dd8cd9cff8d10ed6f51189ddedcdf04eb734d3d5a5389d6cdb2cfaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UEMUiHKK80gEWDW6vstDpvMxhtXgjpggfG7/SIgHNidA8/PnbLvl2QhxxrqzKgIULBeQLO1s1feAVyw9jXCLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:06:45.803237Z","bundle_sha256":"6282004d45b822ed6d1a31500a464a383be6a5bc1891b17b846bb3cf55d88c40"}}