{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YFMIRCG2VYC52I7BLUAOB2QPVY","short_pith_number":"pith:YFMIRCG2","canonical_record":{"source":{"id":"1812.08993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-21T08:30:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a69488076f897a04cd955eed1352d3249c24e4df2ae265c75129228d1b05cba3","abstract_canon_sha256":"74307eb65165a9c0aa4381970682f19d268860b842b34113344fd4ec9ce95c34"},"schema_version":"1.0"},"canonical_sha256":"c1588888daae05dd23e15d00e0ea0fae349e3f562008e2ee2c90de382a78e94c","source":{"kind":"arxiv","id":"1812.08993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08993","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08993v1","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08993","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"YFMIRCG2VYC5","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YFMIRCG2VYC52I7B","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YFMIRCG2","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YFMIRCG2VYC52I7BLUAOB2QPVY","target":"record","payload":{"canonical_record":{"source":{"id":"1812.08993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-21T08:30:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a69488076f897a04cd955eed1352d3249c24e4df2ae265c75129228d1b05cba3","abstract_canon_sha256":"74307eb65165a9c0aa4381970682f19d268860b842b34113344fd4ec9ce95c34"},"schema_version":"1.0"},"canonical_sha256":"c1588888daae05dd23e15d00e0ea0fae349e3f562008e2ee2c90de382a78e94c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:45.697375Z","signature_b64":"iVxlYc/jPFFl/EVOfPSrGTPUrj5Mnelhycm6MZzIvT7KVtklVggIyO/YlhYW4va8/PDTVULIQw3TRtLVwOujAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1588888daae05dd23e15d00e0ea0fae349e3f562008e2ee2c90de382a78e94c","last_reissued_at":"2026-05-17T23:57:45.696848Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:45.696848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.08993","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-17T23:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XZx5g5YcmITeuu57OQIUXEzGg4GkaOWDJkFg/poPBsxvZLVBXJd+9oUwAFcPryxkasmj+Oqor5bPdlXKssQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:16:53.308207Z"},"content_sha256":"e1a0916d045db8ece5494febeb18eb4a34ae41ae938c3b49055d2d7167d63561","schema_version":"1.0","event_id":"sha256:e1a0916d045db8ece5494febeb18eb4a34ae41ae938c3b49055d2d7167d63561"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YFMIRCG2VYC52I7BLUAOB2QPVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Xianhua Niu","submitted_at":"2018-12-21T08:30:04Z","abstract_excerpt":"In literatures, there are various constructions of frequency hopping sequence (FHS for short) sets with good Hamming correlations. Some papers employed only multiplicative groups of finite fields to construct FHS sets, while other papers implicitly used only additive groups of finite fields for construction of FHS sets. In this paper, we make use of both multiplicative and additive groups of finite fields simultaneously to present a construction of optimal FHS sets. The construction provides a new family of optimal $\\left(q^m-1,\\frac{q^{m-t}-1}{r},rq^t;\\frac{q^{m-t}-1}{r}+1\\right)$ frequency h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08993","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-17T23:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hfh3zlQxSUo5yrUV+PkKHMtRy7LmHO+AA1SadKbOBQmAw11zl+OcD/12kOxQkWlL5oUhDUEaT1xziyeTR0i8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:16:53.309014Z"},"content_sha256":"5951541c7d089e9ad9f12c012036afb48544edb7934fcc0c44051ab4b86bc9b8","schema_version":"1.0","event_id":"sha256:5951541c7d089e9ad9f12c012036afb48544edb7934fcc0c44051ab4b86bc9b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFMIRCG2VYC52I7BLUAOB2QPVY/bundle.json","state_url":"https://pith.science/pith/YFMIRCG2VYC52I7BLUAOB2QPVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFMIRCG2VYC52I7BLUAOB2QPVY/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-07T14:16:53Z","links":{"resolver":"https://pith.science/pith/YFMIRCG2VYC52I7BLUAOB2QPVY","bundle":"https://pith.science/pith/YFMIRCG2VYC52I7BLUAOB2QPVY/bundle.json","state":"https://pith.science/pith/YFMIRCG2VYC52I7BLUAOB2QPVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFMIRCG2VYC52I7BLUAOB2QPVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YFMIRCG2VYC52I7BLUAOB2QPVY","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":"74307eb65165a9c0aa4381970682f19d268860b842b34113344fd4ec9ce95c34","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-21T08:30:04Z","title_canon_sha256":"a69488076f897a04cd955eed1352d3249c24e4df2ae265c75129228d1b05cba3"},"schema_version":"1.0","source":{"id":"1812.08993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08993","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08993v1","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08993","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"YFMIRCG2VYC5","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YFMIRCG2VYC52I7B","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YFMIRCG2","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:5951541c7d089e9ad9f12c012036afb48544edb7934fcc0c44051ab4b86bc9b8","target":"graph","created_at":"2026-05-17T23:57:45Z","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":"In literatures, there are various constructions of frequency hopping sequence (FHS for short) sets with good Hamming correlations. Some papers employed only multiplicative groups of finite fields to construct FHS sets, while other papers implicitly used only additive groups of finite fields for construction of FHS sets. In this paper, we make use of both multiplicative and additive groups of finite fields simultaneously to present a construction of optimal FHS sets. The construction provides a new family of optimal $\\left(q^m-1,\\frac{q^{m-t}-1}{r},rq^t;\\frac{q^{m-t}-1}{r}+1\\right)$ frequency h","authors_text":"Chaoping Xing, Xianhua Niu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-21T08:30:04Z","title":"A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08993","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:e1a0916d045db8ece5494febeb18eb4a34ae41ae938c3b49055d2d7167d63561","target":"record","created_at":"2026-05-17T23:57:45Z","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":"74307eb65165a9c0aa4381970682f19d268860b842b34113344fd4ec9ce95c34","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-21T08:30:04Z","title_canon_sha256":"a69488076f897a04cd955eed1352d3249c24e4df2ae265c75129228d1b05cba3"},"schema_version":"1.0","source":{"id":"1812.08993","kind":"arxiv","version":1}},"canonical_sha256":"c1588888daae05dd23e15d00e0ea0fae349e3f562008e2ee2c90de382a78e94c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1588888daae05dd23e15d00e0ea0fae349e3f562008e2ee2c90de382a78e94c","first_computed_at":"2026-05-17T23:57:45.696848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:45.696848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iVxlYc/jPFFl/EVOfPSrGTPUrj5Mnelhycm6MZzIvT7KVtklVggIyO/YlhYW4va8/PDTVULIQw3TRtLVwOujAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:45.697375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.08993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1a0916d045db8ece5494febeb18eb4a34ae41ae938c3b49055d2d7167d63561","sha256:5951541c7d089e9ad9f12c012036afb48544edb7934fcc0c44051ab4b86bc9b8"],"state_sha256":"3bba01215b3c0f8ad113c779626a6eff613082d265ff142fae40a85579f414f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i7Bf4MpMZXLE+sne+3lHXNaAHOAG5Yv0zysj2mHC2LVGCrhKSop59f2VsSlBtDgNDX8oipJYU9n/TU7DVn9+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:16:53.313305Z","bundle_sha256":"2fc47c35819be3ef4aeafb4ed7696aa005aa9e2b995a0ccedfb7881d6f134b7e"}}