{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S4JUDZQVG76EJFOPK6Z24B7CN5","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":"704dc5b770f54cffe81fb2e1604ca8bde22e0179c4ac2e8b2a358d8783ff3b45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-29T12:40:58Z","title_canon_sha256":"2c228140dedb58ab0c07bc589cd7de9de7128cd8280e0a4c1893e064245b7df6"},"schema_version":"1.0","source":{"id":"1711.10820","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10820","created_at":"2026-05-18T00:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10820v2","created_at":"2026-05-18T00:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10820","created_at":"2026-05-18T00:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"S4JUDZQVG76E","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S4JUDZQVG76EJFOP","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S4JUDZQV","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:4bad233b82220ed57560a7fa60ccd51dc0453613422be3444b7792b6671a92ef","target":"graph","created_at":"2026-05-18T00:10:11Z","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":"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","authors_text":"Alice L.L. Gao, Philip B. Zhang, Sergey Kitaev, Wolfgang Steiner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-29T12:40:58Z","title":"On a Greedy Algorithm to Construct Universal Cycles for Permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10820","kind":"arxiv","version":2},"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:83945ff0b927bba9be4633e9c8b60791ed02d758f4c04530c02d61c98a686260","target":"record","created_at":"2026-05-18T00:10:11Z","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":"704dc5b770f54cffe81fb2e1604ca8bde22e0179c4ac2e8b2a358d8783ff3b45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-29T12:40:58Z","title_canon_sha256":"2c228140dedb58ab0c07bc589cd7de9de7128cd8280e0a4c1893e064245b7df6"},"schema_version":"1.0","source":{"id":"1711.10820","kind":"arxiv","version":2}},"canonical_sha256":"971341e61537fc4495cf57b3ae07e26f7172e1f941302fcf10cc4e5707bab27a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"971341e61537fc4495cf57b3ae07e26f7172e1f941302fcf10cc4e5707bab27a","first_computed_at":"2026-05-18T00:10:11.037371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:11.037371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E9TVjfgDADf3Z8CemLVLSdJ39FEIHAgI1rWrFWAfPqpQbaCdri98tBM6kjrHzWpzDQZsc/Vg3lFEQLXvCTZOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:11.038057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10820","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83945ff0b927bba9be4633e9c8b60791ed02d758f4c04530c02d61c98a686260","sha256:4bad233b82220ed57560a7fa60ccd51dc0453613422be3444b7792b6671a92ef"],"state_sha256":"86ff74b42bd0c6fec42334b13832c733dc2b480cd75620da625147edbdf300bd"}