{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IZH5UOUHKRAM6F42AD5POEN436","short_pith_number":"pith:IZH5UOUH","schema_version":"1.0","canonical_sha256":"464fda3a875440cf179a00faf711bcdfad6cc8938c6c8424b1d16ad5b464c523","source":{"kind":"arxiv","id":"1707.06110","version":2},"attestation_state":"computed","paper":{"title":"On shortening u-cycles and u-words for permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Kitaev, Vincent Vajnovszki, Vladimir N. Potapov","submitted_at":"2017-07-19T14:20:37Z","abstract_excerpt":"This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature to the recent relevant studies for the de Bruijn sequences. A particular result we obtain in this paper is that u-words for $n$-permutations exist of lengths $n!+(1-k)(n-1)$ for $k=0,1,\\ldots,(n-2)!$."},"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":"1707.06110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-19T14:20:37Z","cross_cats_sorted":[],"title_canon_sha256":"94561bb2e50a58c8e8735d69c92e30e3f800fba7716cd1013a1d50b3cd883c46","abstract_canon_sha256":"50fe11c94fdae9f403ae3bf3b9ff12ce58c36b3f0bfb9523c0148bd6e7092a70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:53.614223Z","signature_b64":"krpqDgu2BeeaopooXIQ3Ms6PAxFMv+fSbZ+2P5fv74Exn4s2Xy4TqW8QxxVfa5hb5wOH9Xa/HuoXhO4TSkkyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"464fda3a875440cf179a00faf711bcdfad6cc8938c6c8424b1d16ad5b464c523","last_reissued_at":"2026-05-18T00:01:53.613830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:53.613830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On shortening u-cycles and u-words for permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Kitaev, Vincent Vajnovszki, Vladimir N. Potapov","submitted_at":"2017-07-19T14:20:37Z","abstract_excerpt":"This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature to the recent relevant studies for the de Bruijn sequences. A particular result we obtain in this paper is that u-words for $n$-permutations exist of lengths $n!+(1-k)(n-1)$ for $k=0,1,\\ldots,(n-2)!$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06110","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":"1707.06110","created_at":"2026-05-18T00:01:53.613889+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06110v2","created_at":"2026-05-18T00:01:53.613889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06110","created_at":"2026-05-18T00:01:53.613889+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZH5UOUHKRAM","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZH5UOUHKRAM6F42","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZH5UOUH","created_at":"2026-05-18T12:31:21.493067+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/IZH5UOUHKRAM6F42AD5POEN436","json":"https://pith.science/pith/IZH5UOUHKRAM6F42AD5POEN436.json","graph_json":"https://pith.science/api/pith-number/IZH5UOUHKRAM6F42AD5POEN436/graph.json","events_json":"https://pith.science/api/pith-number/IZH5UOUHKRAM6F42AD5POEN436/events.json","paper":"https://pith.science/paper/IZH5UOUH"},"agent_actions":{"view_html":"https://pith.science/pith/IZH5UOUHKRAM6F42AD5POEN436","download_json":"https://pith.science/pith/IZH5UOUHKRAM6F42AD5POEN436.json","view_paper":"https://pith.science/paper/IZH5UOUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06110&json=true","fetch_graph":"https://pith.science/api/pith-number/IZH5UOUHKRAM6F42AD5POEN436/graph.json","fetch_events":"https://pith.science/api/pith-number/IZH5UOUHKRAM6F42AD5POEN436/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZH5UOUHKRAM6F42AD5POEN436/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZH5UOUHKRAM6F42AD5POEN436/action/storage_attestation","attest_author":"https://pith.science/pith/IZH5UOUHKRAM6F42AD5POEN436/action/author_attestation","sign_citation":"https://pith.science/pith/IZH5UOUHKRAM6F42AD5POEN436/action/citation_signature","submit_replication":"https://pith.science/pith/IZH5UOUHKRAM6F42AD5POEN436/action/replication_record"}},"created_at":"2026-05-18T00:01:53.613889+00:00","updated_at":"2026-05-18T00:01:53.613889+00:00"}