{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WD7K27ANXKL5PPV6MVQIQRVKTM","short_pith_number":"pith:WD7K27AN","schema_version":"1.0","canonical_sha256":"b0fead7c0dba97d7bebe65608846aa9b15dcc4b1cf2ebb118b6c2ff572faadb8","source":{"kind":"arxiv","id":"1212.4930","version":1},"attestation_state":"computed","paper":{"title":"Binary Sequences with Minimum Peak Sidelobe Level up to Length 68","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Anatolii Leukhin, Egor Potehin","submitted_at":"2012-12-20T05:58:39Z","abstract_excerpt":"Results of an exhaustive search for minimum peak sidelobe level binary sequences are presented. Several techniques for efficiency implementation of search algorithm are described. A table of number of non-equivalent optimal binary sequences with minimum peak sidelobe (MPS) level up to length 68 is given. This number can be used in prediction of the longest length for a given sidelobe level of binary sequences. The examples of optimal binary MPS sequences having high merit factor are shown."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1212.4930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2012-12-20T05:58:39Z","cross_cats_sorted":[],"title_canon_sha256":"4166d287ff1e02a29edf783a8ee4cdca8ac7183fface2f5edfb42ad9c058f04d","abstract_canon_sha256":"f801182e32ff638a4d4e7325fd323e86a04d5d7d792ca50095d97be23d0f5d7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:36.063464Z","signature_b64":"5WN6oMFnutJTvegUqs5LQGJ+lbr0sFXEfCmEasqUWuYLMoE4d6pXrwF4gSUOTEWVgzf0MPG5SIxxVQRizc2RDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0fead7c0dba97d7bebe65608846aa9b15dcc4b1cf2ebb118b6c2ff572faadb8","last_reissued_at":"2026-05-18T03:36:36.062804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:36.062804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Sequences with Minimum Peak Sidelobe Level up to Length 68","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Anatolii Leukhin, Egor Potehin","submitted_at":"2012-12-20T05:58:39Z","abstract_excerpt":"Results of an exhaustive search for minimum peak sidelobe level binary sequences are presented. Several techniques for efficiency implementation of search algorithm are described. A table of number of non-equivalent optimal binary sequences with minimum peak sidelobe (MPS) level up to length 68 is given. This number can be used in prediction of the longest length for a given sidelobe level of binary sequences. The examples of optimal binary MPS sequences having high merit factor are shown."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4930","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.4930","created_at":"2026-05-18T03:36:36.062935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4930v1","created_at":"2026-05-18T03:36:36.062935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4930","created_at":"2026-05-18T03:36:36.062935+00:00"},{"alias_kind":"pith_short_12","alias_value":"WD7K27ANXKL5","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WD7K27ANXKL5PPV6","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WD7K27AN","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WD7K27ANXKL5PPV6MVQIQRVKTM","json":"https://pith.science/pith/WD7K27ANXKL5PPV6MVQIQRVKTM.json","graph_json":"https://pith.science/api/pith-number/WD7K27ANXKL5PPV6MVQIQRVKTM/graph.json","events_json":"https://pith.science/api/pith-number/WD7K27ANXKL5PPV6MVQIQRVKTM/events.json","paper":"https://pith.science/paper/WD7K27AN"},"agent_actions":{"view_html":"https://pith.science/pith/WD7K27ANXKL5PPV6MVQIQRVKTM","download_json":"https://pith.science/pith/WD7K27ANXKL5PPV6MVQIQRVKTM.json","view_paper":"https://pith.science/paper/WD7K27AN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4930&json=true","fetch_graph":"https://pith.science/api/pith-number/WD7K27ANXKL5PPV6MVQIQRVKTM/graph.json","fetch_events":"https://pith.science/api/pith-number/WD7K27ANXKL5PPV6MVQIQRVKTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WD7K27ANXKL5PPV6MVQIQRVKTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WD7K27ANXKL5PPV6MVQIQRVKTM/action/storage_attestation","attest_author":"https://pith.science/pith/WD7K27ANXKL5PPV6MVQIQRVKTM/action/author_attestation","sign_citation":"https://pith.science/pith/WD7K27ANXKL5PPV6MVQIQRVKTM/action/citation_signature","submit_replication":"https://pith.science/pith/WD7K27ANXKL5PPV6MVQIQRVKTM/action/replication_record"}},"created_at":"2026-05-18T03:36:36.062935+00:00","updated_at":"2026-05-18T03:36:36.062935+00:00"}