{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RCIOGWCA2OXSWYRPEN5PZPJI3Y","short_pith_number":"pith:RCIOGWCA","schema_version":"1.0","canonical_sha256":"8890e35840d3af2b622f237afcbd28de059fc213185b0a64f7efe5a15e6f81b1","source":{"kind":"arxiv","id":"1601.07975","version":1},"attestation_state":"computed","paper":{"title":"Perfect Necklaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR","math.ST","stat.TH"],"primary_cat":"math.CO","authors_text":"Nicol\\'as \\'Alvarez, Pablo A. Ferrari, Sergio A. Yuhjtman, Ver\\'onica Becher","submitted_at":"2016-01-29T04:14:43Z","abstract_excerpt":"We introduce a variant of de Bruijn words that we call perfect necklaces. Fix a finite alphabet. Recall that a word is a finite sequence of symbols in the alphabet and a circular word, or necklace, is the equivalence class of a word under rotations. For positive integers k and n, we call a necklace (k,n)-perfect if each word of length k occurs exactly n times at positions which are different modulo n for any convention on the starting point. We call a necklace perfect if it is (k,k)-perfect for some k. We prove that every arithmetic sequence with difference coprime with the alphabet size induc"},"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":"1601.07975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-29T04:14:43Z","cross_cats_sorted":["cs.DM","math.PR","math.ST","stat.TH"],"title_canon_sha256":"961514f5804072f1d07e2b615f3a3260755dc840b11a4e34ce40edc0c368df3d","abstract_canon_sha256":"06e57cac6946d6c9f83d399bafeb23e22ad4d966b2a8693595f833112974ba49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:41.364614Z","signature_b64":"2DZYuqDyWCsbIS0g9nwYNO+UA1u4+ECdA34kB957F8eaGfQQzIIXasb08+Bx9s/+kwD7wQuwUDFzYiQ3zoyKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8890e35840d3af2b622f237afcbd28de059fc213185b0a64f7efe5a15e6f81b1","last_reissued_at":"2026-05-18T01:21:41.363973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:41.363973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect Necklaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR","math.ST","stat.TH"],"primary_cat":"math.CO","authors_text":"Nicol\\'as \\'Alvarez, Pablo A. Ferrari, Sergio A. Yuhjtman, Ver\\'onica Becher","submitted_at":"2016-01-29T04:14:43Z","abstract_excerpt":"We introduce a variant of de Bruijn words that we call perfect necklaces. Fix a finite alphabet. Recall that a word is a finite sequence of symbols in the alphabet and a circular word, or necklace, is the equivalence class of a word under rotations. For positive integers k and n, we call a necklace (k,n)-perfect if each word of length k occurs exactly n times at positions which are different modulo n for any convention on the starting point. We call a necklace perfect if it is (k,k)-perfect for some k. We prove that every arithmetic sequence with difference coprime with the alphabet size induc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07975","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":"1601.07975","created_at":"2026-05-18T01:21:41.364062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07975v1","created_at":"2026-05-18T01:21:41.364062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07975","created_at":"2026-05-18T01:21:41.364062+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCIOGWCA2OXS","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCIOGWCA2OXSWYRP","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCIOGWCA","created_at":"2026-05-18T12:30:41.710351+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/RCIOGWCA2OXSWYRPEN5PZPJI3Y","json":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y.json","graph_json":"https://pith.science/api/pith-number/RCIOGWCA2OXSWYRPEN5PZPJI3Y/graph.json","events_json":"https://pith.science/api/pith-number/RCIOGWCA2OXSWYRPEN5PZPJI3Y/events.json","paper":"https://pith.science/paper/RCIOGWCA"},"agent_actions":{"view_html":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y","download_json":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y.json","view_paper":"https://pith.science/paper/RCIOGWCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07975&json=true","fetch_graph":"https://pith.science/api/pith-number/RCIOGWCA2OXSWYRPEN5PZPJI3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/RCIOGWCA2OXSWYRPEN5PZPJI3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y/action/storage_attestation","attest_author":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y/action/author_attestation","sign_citation":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y/action/citation_signature","submit_replication":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y/action/replication_record"}},"created_at":"2026-05-18T01:21:41.364062+00:00","updated_at":"2026-05-18T01:21:41.364062+00:00"}