{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S4JUDZQVG76EJFOPK6Z24B7CN5","short_pith_number":"pith:S4JUDZQV","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"},"canonical_sha256":"971341e61537fc4495cf57b3ae07e26f7172e1f941302fcf10cc4e5707bab27a","source":{"kind":"arxiv","id":"1711.10820","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S4JUDZQVG76EJFOPK6Z24B7CN5","target":"record","payload":{"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"},"canonical_sha256":"971341e61537fc4495cf57b3ae07e26f7172e1f941302fcf10cc4e5707bab27a","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"},"source_kind":"arxiv","source_id":"1711.10820","source_version":2,"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-18T00:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHCve6F5t803MbDUD8MJ3ajORZu7o4dFEpzfHOw60OJiwKtv2vj1Vfglo02nlfKaCb/wXlPk/BdAW183+oz8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:38:28.507674Z"},"content_sha256":"83945ff0b927bba9be4633e9c8b60791ed02d758f4c04530c02d61c98a686260","schema_version":"1.0","event_id":"sha256:83945ff0b927bba9be4633e9c8b60791ed02d758f4c04530c02d61c98a686260"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S4JUDZQVG76EJFOPK6Z24B7CN5","target":"graph","payload":{"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"},"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-18T00:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQiEHo3G0/V5OgWNKYqdsY0dLMv76o4b5Xn3Q9BgE/wichnOdV0F1bJuaIFt+eHtXRiRsfPn4DRYgXCHYhkPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:38:28.508017Z"},"content_sha256":"4bad233b82220ed57560a7fa60ccd51dc0453613422be3444b7792b6671a92ef","schema_version":"1.0","event_id":"sha256:4bad233b82220ed57560a7fa60ccd51dc0453613422be3444b7792b6671a92ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5/bundle.json","state_url":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4JUDZQVG76EJFOPK6Z24B7CN5/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-03T17:38:28Z","links":{"resolver":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5","bundle":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5/bundle.json","state":"https://pith.science/pith/S4JUDZQVG76EJFOPK6Z24B7CN5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4JUDZQVG76EJFOPK6Z24B7CN5/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DskhlhOKfrwu2qmOjDsBV7NXFogm47+83CIVO8HXx1a3g6xyNZomX3KrSwJwZ7JGpxDyd4vwv1rWrsCtr+erAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:38:28.511765Z","bundle_sha256":"2455465a36fcb93d9657dd857383bd2dfcc6d981e9f8690060365c0516da3096"}}