{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ILMNZERAFCS5WW2QMEWUXLXY4G","short_pith_number":"pith:ILMNZERA","canonical_record":{"source":{"id":"1610.03587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-12T03:19:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34065c9f19e47e5d724fb788c5af4d4a26d27edb97e48819564b9d80ba5f8cb1","abstract_canon_sha256":"b95e990060beb0d6d318feb59e277f20adae890debf6bd10b1e7e49978f63beb"},"schema_version":"1.0"},"canonical_sha256":"42d8dc922028a5db5b50612d4baef8e1a68b3a81e0879085f3e5d49bb53b2340","source":{"kind":"arxiv","id":"1610.03587","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03587","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03587v1","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03587","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"ILMNZERAFCS5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ILMNZERAFCS5WW2Q","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ILMNZERA","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ILMNZERAFCS5WW2QMEWUXLXY4G","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-12T03:19:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34065c9f19e47e5d724fb788c5af4d4a26d27edb97e48819564b9d80ba5f8cb1","abstract_canon_sha256":"b95e990060beb0d6d318feb59e277f20adae890debf6bd10b1e7e49978f63beb"},"schema_version":"1.0"},"canonical_sha256":"42d8dc922028a5db5b50612d4baef8e1a68b3a81e0879085f3e5d49bb53b2340","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:29.843904Z","signature_b64":"RAmIJT6ZQjYX3bCtax7uUg1xk1IxCkmlsrzIsZd4RcBVluuVedoGqskYr3Z5/ho6ENIgcLdlAygQoE2jO1HFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42d8dc922028a5db5b50612d4baef8e1a68b3a81e0879085f3e5d49bb53b2340","last_reissued_at":"2026-05-18T01:02:29.843186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:29.843186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03587","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:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUxUcay/4V6/jKs+NYqXSZvVtXzpR46fZTHoRyXv4OGHsx4mMTpqxwdyg5fs/4hUbMay165QYCB9RY9CfYwAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:54:33.715285Z"},"content_sha256":"4095f67cd57e635ab554836bc537866268d18af38a78bdc1ef44541ce90af938","schema_version":"1.0","event_id":"sha256:4095f67cd57e635ab554836bc537866268d18af38a78bdc1ef44541ce90af938"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ILMNZERAFCS5WW2QMEWUXLXY4G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New families of Strictly 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":"Jingjun Bao","submitted_at":"2016-10-12T03:19:32Z","abstract_excerpt":"Frequency hopping sequences (FHSs) with favorable partial Hamming correlation properties have important applications in many synchronization and multiple-access systems. In this paper, we investigate constructions of FHS sets with optimal partial Hamming correlation. We present several direct constructions for balanced nested cyclic difference packings (BNCDPs) and balanced nested cyclic relative difference packings (BNCRDPs) such that both of them have a special property by using trace functions and discrete logarithm. We also show three recursive constructions for FHS sets with partial Hammi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03587","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:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2imTXQTygz1QWrMaWUXU5nJiINI6MAkYv1LOetvSjFID/ElMIuxxaRX3qdaUVDnbqySW5bu3v4cKt5n0viXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:54:33.716015Z"},"content_sha256":"0d09b3e0be7a09975ce0e061f1f5a8eb6ac942bf0f95952908eda8c6d04c4325","schema_version":"1.0","event_id":"sha256:0d09b3e0be7a09975ce0e061f1f5a8eb6ac942bf0f95952908eda8c6d04c4325"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILMNZERAFCS5WW2QMEWUXLXY4G/bundle.json","state_url":"https://pith.science/pith/ILMNZERAFCS5WW2QMEWUXLXY4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILMNZERAFCS5WW2QMEWUXLXY4G/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-05-26T13:54:33Z","links":{"resolver":"https://pith.science/pith/ILMNZERAFCS5WW2QMEWUXLXY4G","bundle":"https://pith.science/pith/ILMNZERAFCS5WW2QMEWUXLXY4G/bundle.json","state":"https://pith.science/pith/ILMNZERAFCS5WW2QMEWUXLXY4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILMNZERAFCS5WW2QMEWUXLXY4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ILMNZERAFCS5WW2QMEWUXLXY4G","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":"b95e990060beb0d6d318feb59e277f20adae890debf6bd10b1e7e49978f63beb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-12T03:19:32Z","title_canon_sha256":"34065c9f19e47e5d724fb788c5af4d4a26d27edb97e48819564b9d80ba5f8cb1"},"schema_version":"1.0","source":{"id":"1610.03587","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03587","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03587v1","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03587","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"ILMNZERAFCS5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ILMNZERAFCS5WW2Q","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ILMNZERA","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:0d09b3e0be7a09975ce0e061f1f5a8eb6ac942bf0f95952908eda8c6d04c4325","target":"graph","created_at":"2026-05-18T01:02:29Z","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":"Frequency hopping sequences (FHSs) with favorable partial Hamming correlation properties have important applications in many synchronization and multiple-access systems. In this paper, we investigate constructions of FHS sets with optimal partial Hamming correlation. We present several direct constructions for balanced nested cyclic difference packings (BNCDPs) and balanced nested cyclic relative difference packings (BNCRDPs) such that both of them have a special property by using trace functions and discrete logarithm. We also show three recursive constructions for FHS sets with partial Hammi","authors_text":"Jingjun Bao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-12T03:19:32Z","title":"New families of Strictly optimal Frequency hopping sequence sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03587","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:4095f67cd57e635ab554836bc537866268d18af38a78bdc1ef44541ce90af938","target":"record","created_at":"2026-05-18T01:02:29Z","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":"b95e990060beb0d6d318feb59e277f20adae890debf6bd10b1e7e49978f63beb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-12T03:19:32Z","title_canon_sha256":"34065c9f19e47e5d724fb788c5af4d4a26d27edb97e48819564b9d80ba5f8cb1"},"schema_version":"1.0","source":{"id":"1610.03587","kind":"arxiv","version":1}},"canonical_sha256":"42d8dc922028a5db5b50612d4baef8e1a68b3a81e0879085f3e5d49bb53b2340","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42d8dc922028a5db5b50612d4baef8e1a68b3a81e0879085f3e5d49bb53b2340","first_computed_at":"2026-05-18T01:02:29.843186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:29.843186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RAmIJT6ZQjYX3bCtax7uUg1xk1IxCkmlsrzIsZd4RcBVluuVedoGqskYr3Z5/ho6ENIgcLdlAygQoE2jO1HFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:29.843904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03587","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4095f67cd57e635ab554836bc537866268d18af38a78bdc1ef44541ce90af938","sha256:0d09b3e0be7a09975ce0e061f1f5a8eb6ac942bf0f95952908eda8c6d04c4325"],"state_sha256":"f5b36a668d5e1b886cebefca16ebd7b3a4d4225813921c696fe88dae975fee31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XIZTeT6QEgb0bQSQEaM4JYm/nAbrAD9lk3e50Ss9cgyutQeSwlQXh7BxKPL77vuL58Zbx3M9/pgnX7NbbulBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:54:33.719901Z","bundle_sha256":"e40fe71e50a727110db8a82367f58fc32551aa2374ab2e8b49533c7491b573ce"}}