{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:POGEZSYOMT4WB7OUGL325RG6J2","short_pith_number":"pith:POGEZSYO","schema_version":"1.0","canonical_sha256":"7b8c4ccb0e64f960fdd432f7aec4de4eb95cbe694efea01d5b56f6872e5b9573","source":{"kind":"arxiv","id":"0710.5611","version":1},"attestation_state":"computed","paper":{"title":"Universal cycles for permutations","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. Robert Johnson","submitted_at":"2007-10-30T11:22:53Z","abstract_excerpt":"A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1 distinct integers are used. This is best possible and proves a conjecture of Chung, Diaconis and Graham."},"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":"0710.5611","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-10-30T11:22:53Z","cross_cats_sorted":[],"title_canon_sha256":"dadb9e29dfa64a79c0fb030069fefb59e206341cc405eec1c40e4cecdcff1d9d","abstract_canon_sha256":"385f6222ebd15aae780ae78af6d2d8d1b7ca6779556f45860798146a6f934471"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:05:17.529123Z","signature_b64":"+bAxl2eCUaCweNugtGilES7WO3S4LbEPtNG8rvRbv8wG4TQA8CCVCEZNX1JmyDMt5bDiMdNZHs7lKbN+MJ26DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b8c4ccb0e64f960fdd432f7aec4de4eb95cbe694efea01d5b56f6872e5b9573","last_reissued_at":"2026-07-04T15:05:17.528687Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:05:17.528687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal cycles for permutations","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. Robert Johnson","submitted_at":"2007-10-30T11:22:53Z","abstract_excerpt":"A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1 distinct integers are used. This is best possible and proves a conjecture of Chung, Diaconis and Graham."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.5611","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0710.5611/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0710.5611","created_at":"2026-07-04T15:05:17.528753+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.5611v1","created_at":"2026-07-04T15:05:17.528753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.5611","created_at":"2026-07-04T15:05:17.528753+00:00"},{"alias_kind":"pith_short_12","alias_value":"POGEZSYOMT4W","created_at":"2026-07-04T15:05:17.528753+00:00"},{"alias_kind":"pith_short_16","alias_value":"POGEZSYOMT4WB7OU","created_at":"2026-07-04T15:05:17.528753+00:00"},{"alias_kind":"pith_short_8","alias_value":"POGEZSYO","created_at":"2026-07-04T15:05:17.528753+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04708","citing_title":"Superpermutation matrices","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/POGEZSYOMT4WB7OUGL325RG6J2","json":"https://pith.science/pith/POGEZSYOMT4WB7OUGL325RG6J2.json","graph_json":"https://pith.science/api/pith-number/POGEZSYOMT4WB7OUGL325RG6J2/graph.json","events_json":"https://pith.science/api/pith-number/POGEZSYOMT4WB7OUGL325RG6J2/events.json","paper":"https://pith.science/paper/POGEZSYO"},"agent_actions":{"view_html":"https://pith.science/pith/POGEZSYOMT4WB7OUGL325RG6J2","download_json":"https://pith.science/pith/POGEZSYOMT4WB7OUGL325RG6J2.json","view_paper":"https://pith.science/paper/POGEZSYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.5611&json=true","fetch_graph":"https://pith.science/api/pith-number/POGEZSYOMT4WB7OUGL325RG6J2/graph.json","fetch_events":"https://pith.science/api/pith-number/POGEZSYOMT4WB7OUGL325RG6J2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POGEZSYOMT4WB7OUGL325RG6J2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POGEZSYOMT4WB7OUGL325RG6J2/action/storage_attestation","attest_author":"https://pith.science/pith/POGEZSYOMT4WB7OUGL325RG6J2/action/author_attestation","sign_citation":"https://pith.science/pith/POGEZSYOMT4WB7OUGL325RG6J2/action/citation_signature","submit_replication":"https://pith.science/pith/POGEZSYOMT4WB7OUGL325RG6J2/action/replication_record"}},"created_at":"2026-07-04T15:05:17.528753+00:00","updated_at":"2026-07-04T15:05:17.528753+00:00"}