{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TZJUK5WNG677O3PHFGAJF5YRXR","short_pith_number":"pith:TZJUK5WN","schema_version":"1.0","canonical_sha256":"9e534576cd37bff76de7298092f711bc79a94d1d59e9b061cc6ca2b9677481f0","source":{"kind":"arxiv","id":"1306.0045","version":2},"attestation_state":"computed","paper":{"title":"Wieferich pairs and Barker sequences, II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Michael J. Mossinghoff, Peter Borwein","submitted_at":"2013-05-31T22:51:23Z","abstract_excerpt":"We show that if a Barker sequence of length $n>13$ exists, then either $n=3979201339721749133016171583224100$, or $n > 4\\cdot10^{33}$. This improves the lower bound on the length of a long Barker sequence by a factor of nearly 2000. We also obtain 18 additional integers $n<10^{50}$ that cannot be ruled out as the length of a Barker sequence, and find more than 237000 additional candidates $n<10^{100}$. These results are obtained by completing extensive searches for Wieferich prime pairs and using them, together with a number of arithmetic restrictions on $n$, to construct qualifying integers b"},"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":"1306.0045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-31T22:51:23Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"676f3e57c8f14ea22329d605d4295c3634823c90338cc603eb14d684c6127ca4","abstract_canon_sha256":"e14cb6d4e0d01193286b64e3d08c3d00e4e3e6a2b51ba9dcf7df0c613136c11f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:35.583647Z","signature_b64":"bJT3KmC0IiTmq48ctMJH5MxbniEuOJ17OjmzFyDQSogEA6tfWBrkN4SNEbp1E8OuMD5R/3bb7b1RX6Cnz7J3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e534576cd37bff76de7298092f711bc79a94d1d59e9b061cc6ca2b9677481f0","last_reissued_at":"2026-05-17T23:53:35.582955Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:35.582955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wieferich pairs and Barker sequences, II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Michael J. Mossinghoff, Peter Borwein","submitted_at":"2013-05-31T22:51:23Z","abstract_excerpt":"We show that if a Barker sequence of length $n>13$ exists, then either $n=3979201339721749133016171583224100$, or $n > 4\\cdot10^{33}$. This improves the lower bound on the length of a long Barker sequence by a factor of nearly 2000. We also obtain 18 additional integers $n<10^{50}$ that cannot be ruled out as the length of a Barker sequence, and find more than 237000 additional candidates $n<10^{100}$. These results are obtained by completing extensive searches for Wieferich prime pairs and using them, together with a number of arithmetic restrictions on $n$, to construct qualifying integers b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0045","kind":"arxiv","version":2},"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":"1306.0045","created_at":"2026-05-17T23:53:35.583057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0045v2","created_at":"2026-05-17T23:53:35.583057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0045","created_at":"2026-05-17T23:53:35.583057+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZJUK5WNG677","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZJUK5WNG677O3PH","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZJUK5WN","created_at":"2026-05-18T12:28:02.375192+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/TZJUK5WNG677O3PHFGAJF5YRXR","json":"https://pith.science/pith/TZJUK5WNG677O3PHFGAJF5YRXR.json","graph_json":"https://pith.science/api/pith-number/TZJUK5WNG677O3PHFGAJF5YRXR/graph.json","events_json":"https://pith.science/api/pith-number/TZJUK5WNG677O3PHFGAJF5YRXR/events.json","paper":"https://pith.science/paper/TZJUK5WN"},"agent_actions":{"view_html":"https://pith.science/pith/TZJUK5WNG677O3PHFGAJF5YRXR","download_json":"https://pith.science/pith/TZJUK5WNG677O3PHFGAJF5YRXR.json","view_paper":"https://pith.science/paper/TZJUK5WN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0045&json=true","fetch_graph":"https://pith.science/api/pith-number/TZJUK5WNG677O3PHFGAJF5YRXR/graph.json","fetch_events":"https://pith.science/api/pith-number/TZJUK5WNG677O3PHFGAJF5YRXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZJUK5WNG677O3PHFGAJF5YRXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZJUK5WNG677O3PHFGAJF5YRXR/action/storage_attestation","attest_author":"https://pith.science/pith/TZJUK5WNG677O3PHFGAJF5YRXR/action/author_attestation","sign_citation":"https://pith.science/pith/TZJUK5WNG677O3PHFGAJF5YRXR/action/citation_signature","submit_replication":"https://pith.science/pith/TZJUK5WNG677O3PHFGAJF5YRXR/action/replication_record"}},"created_at":"2026-05-17T23:53:35.583057+00:00","updated_at":"2026-05-17T23:53:35.583057+00:00"}