{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:X3BSSPIIXW4HM2CAHV5BZY66BM","short_pith_number":"pith:X3BSSPII","schema_version":"1.0","canonical_sha256":"bec3293d08bdb87668403d7a1ce3de0b181c2a95f9c14926e8741de89d163629","source":{"kind":"arxiv","id":"0808.1309","version":2},"attestation_state":"computed","paper":{"title":"Universal Cycles of Restricted Classes of Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Arielle Leitner","submitted_at":"2008-08-08T21:29:12Z","abstract_excerpt":"It is well known that Universal Cycles of $k$-letter words on an $n$-letter alphabet exist for all $k$ and $n$. In this paper, we prove that Universal Cycles exist for restricted classes of words, including: non-bijections, equitable words (under suitable restrictions), ranked permutations, and \"passwords\"."},"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":"0808.1309","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-08T21:29:12Z","cross_cats_sorted":[],"title_canon_sha256":"af0532c23c1be02e8b5e2bb880e94f86323c9af090e3f22af7b945f2a8b82472","abstract_canon_sha256":"b06d2917b4c45dea166f2c73c39d371c0feaf03fbcf30b30d702dd18943f1279"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:05.182460Z","signature_b64":"ytk48GDnwyq1ZexZqGixUGtZa0JTUslzxIlks7vmszRe9PeUv8g3Lsn867f9aNkaVkUzmOVvF3kKEwXQH57hBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bec3293d08bdb87668403d7a1ce3de0b181c2a95f9c14926e8741de89d163629","last_reissued_at":"2026-05-18T03:58:05.181990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:05.181990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Cycles of Restricted Classes of Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Arielle Leitner","submitted_at":"2008-08-08T21:29:12Z","abstract_excerpt":"It is well known that Universal Cycles of $k$-letter words on an $n$-letter alphabet exist for all $k$ and $n$. In this paper, we prove that Universal Cycles exist for restricted classes of words, including: non-bijections, equitable words (under suitable restrictions), ranked permutations, and \"passwords\"."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.1309","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":"0808.1309","created_at":"2026-05-18T03:58:05.182054+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.1309v2","created_at":"2026-05-18T03:58:05.182054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.1309","created_at":"2026-05-18T03:58:05.182054+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3BSSPIIXW4H","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3BSSPIIXW4HM2CA","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3BSSPII","created_at":"2026-05-18T12:25:58.018023+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/X3BSSPIIXW4HM2CAHV5BZY66BM","json":"https://pith.science/pith/X3BSSPIIXW4HM2CAHV5BZY66BM.json","graph_json":"https://pith.science/api/pith-number/X3BSSPIIXW4HM2CAHV5BZY66BM/graph.json","events_json":"https://pith.science/api/pith-number/X3BSSPIIXW4HM2CAHV5BZY66BM/events.json","paper":"https://pith.science/paper/X3BSSPII"},"agent_actions":{"view_html":"https://pith.science/pith/X3BSSPIIXW4HM2CAHV5BZY66BM","download_json":"https://pith.science/pith/X3BSSPIIXW4HM2CAHV5BZY66BM.json","view_paper":"https://pith.science/paper/X3BSSPII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.1309&json=true","fetch_graph":"https://pith.science/api/pith-number/X3BSSPIIXW4HM2CAHV5BZY66BM/graph.json","fetch_events":"https://pith.science/api/pith-number/X3BSSPIIXW4HM2CAHV5BZY66BM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3BSSPIIXW4HM2CAHV5BZY66BM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3BSSPIIXW4HM2CAHV5BZY66BM/action/storage_attestation","attest_author":"https://pith.science/pith/X3BSSPIIXW4HM2CAHV5BZY66BM/action/author_attestation","sign_citation":"https://pith.science/pith/X3BSSPIIXW4HM2CAHV5BZY66BM/action/citation_signature","submit_replication":"https://pith.science/pith/X3BSSPIIXW4HM2CAHV5BZY66BM/action/replication_record"}},"created_at":"2026-05-18T03:58:05.182054+00:00","updated_at":"2026-05-18T03:58:05.182054+00:00"}