{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RCIOGWCA2OXSWYRPEN5PZPJI3Y","short_pith_number":"pith:RCIOGWCA","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"},"canonical_sha256":"8890e35840d3af2b622f237afcbd28de059fc213185b0a64f7efe5a15e6f81b1","source":{"kind":"arxiv","id":"1601.07975","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07975","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07975v1","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07975","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"RCIOGWCA2OXS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RCIOGWCA2OXSWYRP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RCIOGWCA","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RCIOGWCA2OXSWYRPEN5PZPJI3Y","target":"record","payload":{"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"},"canonical_sha256":"8890e35840d3af2b622f237afcbd28de059fc213185b0a64f7efe5a15e6f81b1","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"},"source_kind":"arxiv","source_id":"1601.07975","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:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"flKX8j1J2jOdM6tYorG4aKFp0fYpZ18tCfo+jYXePvB+bKil7HpL2/Im+FeIDeiw3GDiYEEBym7r26lV+u3KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:32:14.994209Z"},"content_sha256":"cf802943f2fc9ac90ac7ec7cca1e05240635803c5a4364ba1f2857e7bf608ccd","schema_version":"1.0","event_id":"sha256:cf802943f2fc9ac90ac7ec7cca1e05240635803c5a4364ba1f2857e7bf608ccd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RCIOGWCA2OXSWYRPEN5PZPJI3Y","target":"graph","payload":{"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"},"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:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dinIrZl0sGDB/fXzxGNqzMC+CaEAlBefyI8WQjIacT9aq1bB/g5Voef90XLncofNpSyLH68QE5xd0o8HpHxTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:32:14.994571Z"},"content_sha256":"13959493cae13a8c6fc252b35d5330083de9e79f8d0234b1eba67560be9eb1d9","schema_version":"1.0","event_id":"sha256:13959493cae13a8c6fc252b35d5330083de9e79f8d0234b1eba67560be9eb1d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y/bundle.json","state_url":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y/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-06-10T20:32:14Z","links":{"resolver":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y","bundle":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y/bundle.json","state":"https://pith.science/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCIOGWCA2OXSWYRPEN5PZPJI3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RCIOGWCA2OXSWYRPEN5PZPJI3Y","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":"06e57cac6946d6c9f83d399bafeb23e22ad4d966b2a8693595f833112974ba49","cross_cats_sorted":["cs.DM","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-29T04:14:43Z","title_canon_sha256":"961514f5804072f1d07e2b615f3a3260755dc840b11a4e34ce40edc0c368df3d"},"schema_version":"1.0","source":{"id":"1601.07975","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07975","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07975v1","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07975","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"RCIOGWCA2OXS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RCIOGWCA2OXSWYRP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RCIOGWCA","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:13959493cae13a8c6fc252b35d5330083de9e79f8d0234b1eba67560be9eb1d9","target":"graph","created_at":"2026-05-18T01:21:41Z","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":"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","authors_text":"Nicol\\'as \\'Alvarez, Pablo A. Ferrari, Sergio A. Yuhjtman, Ver\\'onica Becher","cross_cats":["cs.DM","math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-29T04:14:43Z","title":"Perfect Necklaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07975","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:cf802943f2fc9ac90ac7ec7cca1e05240635803c5a4364ba1f2857e7bf608ccd","target":"record","created_at":"2026-05-18T01:21:41Z","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":"06e57cac6946d6c9f83d399bafeb23e22ad4d966b2a8693595f833112974ba49","cross_cats_sorted":["cs.DM","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-29T04:14:43Z","title_canon_sha256":"961514f5804072f1d07e2b615f3a3260755dc840b11a4e34ce40edc0c368df3d"},"schema_version":"1.0","source":{"id":"1601.07975","kind":"arxiv","version":1}},"canonical_sha256":"8890e35840d3af2b622f237afcbd28de059fc213185b0a64f7efe5a15e6f81b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8890e35840d3af2b622f237afcbd28de059fc213185b0a64f7efe5a15e6f81b1","first_computed_at":"2026-05-18T01:21:41.363973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:41.363973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2DZYuqDyWCsbIS0g9nwYNO+UA1u4+ECdA34kB957F8eaGfQQzIIXasb08+Bx9s/+kwD7wQuwUDFzYiQ3zoyKBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:41.364614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07975","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf802943f2fc9ac90ac7ec7cca1e05240635803c5a4364ba1f2857e7bf608ccd","sha256:13959493cae13a8c6fc252b35d5330083de9e79f8d0234b1eba67560be9eb1d9"],"state_sha256":"9d51eb1740fff512f24387192c78c32789adf8b3db8dc8ca1d6578b76b226618"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQGDyp52/w9hWWkTbsXHubg+7kZCxn+0KIh2bfs6p0dWHkLB7Lyo5CqNNFpczYrJKFyWb/7jPfJ9fhV7BKrjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T20:32:14.996583Z","bundle_sha256":"215ce797c1209ccfc82343497e2a8cbb4f8955bee819d6db52ed390fee5118f6"}}