{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MT7VRPMNIOPR264D4NY6TENGYM","short_pith_number":"pith:MT7VRPMN","schema_version":"1.0","canonical_sha256":"64ff58bd8d439f1d7b83e371e991a6c3378b156c10c3b139cf7a96f46e84f00e","source":{"kind":"arxiv","id":"1303.4150","version":1},"attestation_state":"computed","paper":{"title":"Non-Uniqueness of Minimal Superpermutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nathaniel Johnston","submitted_at":"2013-03-18T03:48:13Z","abstract_excerpt":"We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n symbols). It has been conjectured that the shortest superpermutation has length $\\sum_{k=1}^n k!$ and that this string is unique up to relabelling of the symbols. We provide a construction of short superpermutations that shows that, if the conjectured minimal length is true, then uniqueness fails for all n >= 5. Furthermore, uniqueness fails spectacularly; we construct more than doubly-exponentially many distinct su"},"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":"1303.4150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-18T03:48:13Z","cross_cats_sorted":[],"title_canon_sha256":"e1f0ce5e0191d28e45d366c3777025577e31177d9ec0fc2f1dc682de5f8752d7","abstract_canon_sha256":"28aa046b0570bcddf95161b79995852c91b52b6dc88678432bb50445695af0b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:31.924528Z","signature_b64":"gUwa85MukZtGdw+Zr3MRhfeIRdY0/hPLvnV3DEXQuuh7Yyys+vgGvObI1qocG64YFmSVqxGNjKVsOEl5D6TiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64ff58bd8d439f1d7b83e371e991a6c3378b156c10c3b139cf7a96f46e84f00e","last_reissued_at":"2026-05-18T03:27:31.923835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:31.923835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Uniqueness of Minimal Superpermutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nathaniel Johnston","submitted_at":"2013-03-18T03:48:13Z","abstract_excerpt":"We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n symbols). It has been conjectured that the shortest superpermutation has length $\\sum_{k=1}^n k!$ and that this string is unique up to relabelling of the symbols. We provide a construction of short superpermutations that shows that, if the conjectured minimal length is true, then uniqueness fails for all n >= 5. Furthermore, uniqueness fails spectacularly; we construct more than doubly-exponentially many distinct su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4150","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":""},"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":"1303.4150","created_at":"2026-05-18T03:27:31.923941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4150v1","created_at":"2026-05-18T03:27:31.923941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4150","created_at":"2026-05-18T03:27:31.923941+00:00"},{"alias_kind":"pith_short_12","alias_value":"MT7VRPMNIOPR","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MT7VRPMNIOPR264D","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MT7VRPMN","created_at":"2026-05-18T12:27:52.871228+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/MT7VRPMNIOPR264D4NY6TENGYM","json":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM.json","graph_json":"https://pith.science/api/pith-number/MT7VRPMNIOPR264D4NY6TENGYM/graph.json","events_json":"https://pith.science/api/pith-number/MT7VRPMNIOPR264D4NY6TENGYM/events.json","paper":"https://pith.science/paper/MT7VRPMN"},"agent_actions":{"view_html":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM","download_json":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM.json","view_paper":"https://pith.science/paper/MT7VRPMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4150&json=true","fetch_graph":"https://pith.science/api/pith-number/MT7VRPMNIOPR264D4NY6TENGYM/graph.json","fetch_events":"https://pith.science/api/pith-number/MT7VRPMNIOPR264D4NY6TENGYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM/action/storage_attestation","attest_author":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM/action/author_attestation","sign_citation":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM/action/citation_signature","submit_replication":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM/action/replication_record"}},"created_at":"2026-05-18T03:27:31.923941+00:00","updated_at":"2026-05-18T03:27:31.923941+00:00"}