{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S4JUDZQVG76EJFOPK6Z24B7CN5","short_pith_number":"pith:S4JUDZQV","schema_version":"1.0","canonical_sha256":"971341e61537fc4495cf57b3ae07e26f7172e1f941302fcf10cc4e5707bab27a","source":{"kind":"arxiv","id":"1711.10820","version":2},"attestation_state":"computed","paper":{"title":"On a Greedy Algorithm to Construct Universal Cycles for Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alice L.L. Gao, Philip B. Zhang, Sergey Kitaev, Wolfgang Steiner","submitted_at":"2017-11-29T12:40:58Z","abstract_excerpt":"A universal cycle for permutations of length $n$ is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length $n$, and containing all permutations of length $n$ as factors. It is well known that universal cycles for permutations of length $n$ exist. However, all known ways to construct such cycles are rather complicated. For example, in the original paper establishing the existence of the universal cycles, constructing such a cycle involves finding an Eulerian cycle in a certain graph and then dealing with partially ordered sets.\n  In this paper"},"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":"1711.10820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-29T12:40:58Z","cross_cats_sorted":[],"title_canon_sha256":"2c228140dedb58ab0c07bc589cd7de9de7128cd8280e0a4c1893e064245b7df6","abstract_canon_sha256":"704dc5b770f54cffe81fb2e1604ca8bde22e0179c4ac2e8b2a358d8783ff3b45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:11.038057Z","signature_b64":"E9TVjfgDADf3Z8CemLVLSdJ39FEIHAgI1rWrFWAfPqpQbaCdri98tBM6kjrHzWpzDQZsc/Vg3lFEQLXvCTZOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"971341e61537fc4495cf57b3ae07e26f7172e1f941302fcf10cc4e5707bab27a","last_reissued_at":"2026-05-18T00:10:11.037371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:11.037371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a Greedy Algorithm to Construct Universal Cycles for Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alice L.L. Gao, Philip B. Zhang, Sergey Kitaev, Wolfgang Steiner","submitted_at":"2017-11-29T12:40:58Z","abstract_excerpt":"A universal cycle for permutations of length $n$ is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length $n$, and containing all permutations of length $n$ as factors. It is well known that universal cycles for permutations of length $n$ exist. However, all known ways to construct such cycles are rather complicated. For example, in the original paper establishing the existence of the universal cycles, constructing such a cycle involves finding an Eulerian cycle in a certain graph and then dealing with partially ordered sets.\n  In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10820","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":"1711.10820","created_at":"2026-05-18T00:10:11.037482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10820v2","created_at":"2026-05-18T00:10:11.037482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10820","created_at":"2026-05-18T00:10:11.037482+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4JUDZQVG76E","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4JUDZQVG76EJFOP","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4JUDZQV","created_at":"2026-05-18T12:31:43.269735+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/S4JUDZQVG76EJFOPK6Z24B7CN5","json":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5.json","graph_json":"https://pith.science/api/pith-number/S4JUDZQVG76EJFOPK6Z24B7CN5/graph.json","events_json":"https://pith.science/api/pith-number/S4JUDZQVG76EJFOPK6Z24B7CN5/events.json","paper":"https://pith.science/paper/S4JUDZQV"},"agent_actions":{"view_html":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5","download_json":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5.json","view_paper":"https://pith.science/paper/S4JUDZQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10820&json=true","fetch_graph":"https://pith.science/api/pith-number/S4JUDZQVG76EJFOPK6Z24B7CN5/graph.json","fetch_events":"https://pith.science/api/pith-number/S4JUDZQVG76EJFOPK6Z24B7CN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5/action/storage_attestation","attest_author":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5/action/author_attestation","sign_citation":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5/action/citation_signature","submit_replication":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5/action/replication_record"}},"created_at":"2026-05-18T00:10:11.037482+00:00","updated_at":"2026-05-18T00:10:11.037482+00:00"}