{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X5CPKH7K7WMK4BILNGRZUQTG3B","short_pith_number":"pith:X5CPKH7K","canonical_record":{"source":{"id":"1608.08480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-30T14:48:22Z","cross_cats_sorted":[],"title_canon_sha256":"ab213e34037450298b6586b34f569559078e3cc993922b0f0352a7369beab924","abstract_canon_sha256":"3a17c3369da836b9929706ef04116945e5f9124ad51429e1ec447b3b1619af69"},"schema_version":"1.0"},"canonical_sha256":"bf44f51feafd98ae050b69a39a4266d84c3f9083634d6d5358475c1ff7ae02ac","source":{"kind":"arxiv","id":"1608.08480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08480","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08480v1","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08480","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"X5CPKH7K7WMK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X5CPKH7K7WMK4BIL","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X5CPKH7K","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X5CPKH7K7WMK4BILNGRZUQTG3B","target":"record","payload":{"canonical_record":{"source":{"id":"1608.08480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-30T14:48:22Z","cross_cats_sorted":[],"title_canon_sha256":"ab213e34037450298b6586b34f569559078e3cc993922b0f0352a7369beab924","abstract_canon_sha256":"3a17c3369da836b9929706ef04116945e5f9124ad51429e1ec447b3b1619af69"},"schema_version":"1.0"},"canonical_sha256":"bf44f51feafd98ae050b69a39a4266d84c3f9083634d6d5358475c1ff7ae02ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:18.025689Z","signature_b64":"R8qdsSae9+s1jqlipOS37TE1v5dLL5ojTb2WnzHP59u7kcLMyuTLQqgTJg5Tv3zuoYZQ6OFUeg4O+p7322GmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf44f51feafd98ae050b69a39a4266d84c3f9083634d6d5358475c1ff7ae02ac","last_reissued_at":"2026-05-18T01:07:18.025060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:18.025060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.08480","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:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fr/cYPsAO+1AEsrNGw9Thl5JuKtOvIDJrf9uxJ6XF1OL09902lTKQkTSGebfOpjYzwIMn2S8BYRFFmfky8KOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:50:01.956381Z"},"content_sha256":"25ad68082941d6b2e1ae8c97de6162f5f813ff9b7b1d271739595369090c658d","schema_version":"1.0","event_id":"sha256:25ad68082941d6b2e1ae8c97de6162f5f813ff9b7b1d271739595369090c658d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X5CPKH7K7WMK4BILNGRZUQTG3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Unoriented Variation on de Bruijn Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christie S. Burris, Francis C. Motta, Patrick D. Shipman","submitted_at":"2016-08-30T14:48:22Z","abstract_excerpt":"For positive integers $k,n$, a de Bruijn sequence $B(k,n)$ is a finite sequence of elements drawn from $k$ characters whose subwords of length $n$ are exactly the $k^n$ words of length $n$ on $k$ characters. This paper introduces the unoriented de Bruijn sequence $uB(k,n)$, an analog to de Bruijn sequences, but for which the sequence is read both forwards and backwards to determine the set of subwords of length $n$. We show that nontrivial unoriented de Bruijn sequences of optimal length exist if and only if $k$ is two or odd and $n$ is less than or equal to 3. Unoriented de Bruijn sequences f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08480","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:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5Rw4md4BZOHX9GvacBE+XvaAH4BNqudU1k/VPQnvN3hvztI6qj1IIAshLPI54xNZ+L1lVEoceLXTUVFWMY3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:50:01.956722Z"},"content_sha256":"4b4d5cff0689ebecad8364d6ed800700f87911fd9e2e62926a0c6903f9c4aece","schema_version":"1.0","event_id":"sha256:4b4d5cff0689ebecad8364d6ed800700f87911fd9e2e62926a0c6903f9c4aece"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5CPKH7K7WMK4BILNGRZUQTG3B/bundle.json","state_url":"https://pith.science/pith/X5CPKH7K7WMK4BILNGRZUQTG3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5CPKH7K7WMK4BILNGRZUQTG3B/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-22T14:50:01Z","links":{"resolver":"https://pith.science/pith/X5CPKH7K7WMK4BILNGRZUQTG3B","bundle":"https://pith.science/pith/X5CPKH7K7WMK4BILNGRZUQTG3B/bundle.json","state":"https://pith.science/pith/X5CPKH7K7WMK4BILNGRZUQTG3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5CPKH7K7WMK4BILNGRZUQTG3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X5CPKH7K7WMK4BILNGRZUQTG3B","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":"3a17c3369da836b9929706ef04116945e5f9124ad51429e1ec447b3b1619af69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-30T14:48:22Z","title_canon_sha256":"ab213e34037450298b6586b34f569559078e3cc993922b0f0352a7369beab924"},"schema_version":"1.0","source":{"id":"1608.08480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08480","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08480v1","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08480","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"X5CPKH7K7WMK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X5CPKH7K7WMK4BIL","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X5CPKH7K","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:4b4d5cff0689ebecad8364d6ed800700f87911fd9e2e62926a0c6903f9c4aece","target":"graph","created_at":"2026-05-18T01:07:18Z","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":"For positive integers $k,n$, a de Bruijn sequence $B(k,n)$ is a finite sequence of elements drawn from $k$ characters whose subwords of length $n$ are exactly the $k^n$ words of length $n$ on $k$ characters. This paper introduces the unoriented de Bruijn sequence $uB(k,n)$, an analog to de Bruijn sequences, but for which the sequence is read both forwards and backwards to determine the set of subwords of length $n$. We show that nontrivial unoriented de Bruijn sequences of optimal length exist if and only if $k$ is two or odd and $n$ is less than or equal to 3. Unoriented de Bruijn sequences f","authors_text":"Christie S. Burris, Francis C. Motta, Patrick D. Shipman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-30T14:48:22Z","title":"An Unoriented Variation on de Bruijn Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08480","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:25ad68082941d6b2e1ae8c97de6162f5f813ff9b7b1d271739595369090c658d","target":"record","created_at":"2026-05-18T01:07:18Z","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":"3a17c3369da836b9929706ef04116945e5f9124ad51429e1ec447b3b1619af69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-30T14:48:22Z","title_canon_sha256":"ab213e34037450298b6586b34f569559078e3cc993922b0f0352a7369beab924"},"schema_version":"1.0","source":{"id":"1608.08480","kind":"arxiv","version":1}},"canonical_sha256":"bf44f51feafd98ae050b69a39a4266d84c3f9083634d6d5358475c1ff7ae02ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf44f51feafd98ae050b69a39a4266d84c3f9083634d6d5358475c1ff7ae02ac","first_computed_at":"2026-05-18T01:07:18.025060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:18.025060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R8qdsSae9+s1jqlipOS37TE1v5dLL5ojTb2WnzHP59u7kcLMyuTLQqgTJg5Tv3zuoYZQ6OFUeg4O+p7322GmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:18.025689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25ad68082941d6b2e1ae8c97de6162f5f813ff9b7b1d271739595369090c658d","sha256:4b4d5cff0689ebecad8364d6ed800700f87911fd9e2e62926a0c6903f9c4aece"],"state_sha256":"20b36774950f455b206250944fc4282cfe9a928043ae3324777092ddc16ee75f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oI69GhXLJAI/ycmbGDWANJmD8yqQ0nC2GLbWMcXOSJLa0NYw9gWI0CLZr5AD9RZA4BArszDZGskbeYoyZsOXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:50:01.958573Z","bundle_sha256":"0b422391f70f3adcca47228e2f3d9822493791a0f8e70fe350fae8359d8c7757"}}