{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XNKQHASCB3FGBH24OBCH5VGOCI","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":"10db10581946eea4aee7fbdb139ab27a8e8f564a560be2ee159268db3668b93d","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-10T01:27:14Z","title_canon_sha256":"eed1e970f20a48be5d2ba4a96f4c07e6a654c7354dd07c48a5b5e8c28b479fb4"},"schema_version":"1.0","source":{"id":"1008.1615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1615","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1615v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1615","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"XNKQHASCB3FG","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XNKQHASCB3FGBH24","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XNKQHASC","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:4271fe003fa75734c3c234df0bb8f9e64f901d0e0fd39e612bccae3b79203556","target":"graph","created_at":"2026-05-18T00:58:19Z","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":"Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, based on almost difference sets and cyclic difference matrices, are given. These produce new infinite families of optimal PCDPs (and hence optimal frequency-hopping sequences and optimal comma-free codes). The existence problem for optimal PCDPs in ${\\mathbb Z}_{3m}$, with $m$ base blocks of size three, is also solved for all $m\\not\\equiv 8,16\\pmod{24}$.","authors_text":"Alan C. H. Ling, Jianxing Yin, Yeow Meng Chee","cross_cats":["cs.DM","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-10T01:27:14Z","title":"Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1615","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:d6073d64961d1387e020671ad613a511e76fedcfaac85713f2baf0a676ce3531","target":"record","created_at":"2026-05-18T00:58:19Z","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":"10db10581946eea4aee7fbdb139ab27a8e8f564a560be2ee159268db3668b93d","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-10T01:27:14Z","title_canon_sha256":"eed1e970f20a48be5d2ba4a96f4c07e6a654c7354dd07c48a5b5e8c28b479fb4"},"schema_version":"1.0","source":{"id":"1008.1615","kind":"arxiv","version":1}},"canonical_sha256":"bb550382420eca609f5c70447ed4ce122492de1d60b1df1b6a69f3b6263d9a17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb550382420eca609f5c70447ed4ce122492de1d60b1df1b6a69f3b6263d9a17","first_computed_at":"2026-05-18T00:58:19.410815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.410815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A5Ki4zuTE/hSkHbVX1ORZ0ecmAzdwfQgpwkPG/TPdZelCnmmdfjVLFIIIoOHK9g1FfQ/ky8Cvuy4u5tnpWpTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.411509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.1615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6073d64961d1387e020671ad613a511e76fedcfaac85713f2baf0a676ce3531","sha256:4271fe003fa75734c3c234df0bb8f9e64f901d0e0fd39e612bccae3b79203556"],"state_sha256":"37d17a003ff27057130419eb54c4fc6d9345e4237732860993c6811ede765181"}