{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MT7VRPMNIOPR264D4NY6TENGYM","short_pith_number":"pith:MT7VRPMN","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"},"canonical_sha256":"64ff58bd8d439f1d7b83e371e991a6c3378b156c10c3b139cf7a96f46e84f00e","source":{"kind":"arxiv","id":"1303.4150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4150","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4150v1","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4150","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"MT7VRPMNIOPR","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MT7VRPMNIOPR264D","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MT7VRPMN","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MT7VRPMNIOPR264D4NY6TENGYM","target":"record","payload":{"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"},"canonical_sha256":"64ff58bd8d439f1d7b83e371e991a6c3378b156c10c3b139cf7a96f46e84f00e","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"},"source_kind":"arxiv","source_id":"1303.4150","source_version":1,"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-18T03:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ooxI3HLMZrbvVG/YHnY+ZgEsoGPpoVlIcioJ+Ok+4bTdeRNiRWqjeIE/HswDomxLet4ysWtrBc39OO7hOjcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:22:22.142702Z"},"content_sha256":"1ce505a7f1d497b33194dc5e136031d6562d1ff1286dcaf520dd74ec1cec7bb3","schema_version":"1.0","event_id":"sha256:1ce505a7f1d497b33194dc5e136031d6562d1ff1286dcaf520dd74ec1cec7bb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MT7VRPMNIOPR264D4NY6TENGYM","target":"graph","payload":{"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"},"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-18T03:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U3rUwT8GnhZ9C6mdLJd+A2+pcLVodTd4U27ezwBG1pe+pLLP4X1eQDIbaUolEAJmgpeyalVkwiWpMJLFHIUzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:22:22.143258Z"},"content_sha256":"d7f518745a2f230815b2d4ed2da53548f756eb467dc124acfe935340ba4eb08e","schema_version":"1.0","event_id":"sha256:d7f518745a2f230815b2d4ed2da53548f756eb467dc124acfe935340ba4eb08e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM/bundle.json","state_url":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MT7VRPMNIOPR264D4NY6TENGYM/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-04T16:22:22Z","links":{"resolver":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM","bundle":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM/bundle.json","state":"https://pith.science/pith/MT7VRPMNIOPR264D4NY6TENGYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MT7VRPMNIOPR264D4NY6TENGYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MT7VRPMNIOPR264D4NY6TENGYM","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":"28aa046b0570bcddf95161b79995852c91b52b6dc88678432bb50445695af0b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-18T03:48:13Z","title_canon_sha256":"e1f0ce5e0191d28e45d366c3777025577e31177d9ec0fc2f1dc682de5f8752d7"},"schema_version":"1.0","source":{"id":"1303.4150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4150","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4150v1","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4150","created_at":"2026-05-18T03:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"MT7VRPMNIOPR","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MT7VRPMNIOPR264D","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MT7VRPMN","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:d7f518745a2f230815b2d4ed2da53548f756eb467dc124acfe935340ba4eb08e","target":"graph","created_at":"2026-05-18T03:27:31Z","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":"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","authors_text":"Nathaniel Johnston","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-18T03:48:13Z","title":"Non-Uniqueness of Minimal Superpermutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4150","kind":"arxiv","version":1},"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:1ce505a7f1d497b33194dc5e136031d6562d1ff1286dcaf520dd74ec1cec7bb3","target":"record","created_at":"2026-05-18T03:27:31Z","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":"28aa046b0570bcddf95161b79995852c91b52b6dc88678432bb50445695af0b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-18T03:48:13Z","title_canon_sha256":"e1f0ce5e0191d28e45d366c3777025577e31177d9ec0fc2f1dc682de5f8752d7"},"schema_version":"1.0","source":{"id":"1303.4150","kind":"arxiv","version":1}},"canonical_sha256":"64ff58bd8d439f1d7b83e371e991a6c3378b156c10c3b139cf7a96f46e84f00e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64ff58bd8d439f1d7b83e371e991a6c3378b156c10c3b139cf7a96f46e84f00e","first_computed_at":"2026-05-18T03:27:31.923835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:31.923835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gUwa85MukZtGdw+Zr3MRhfeIRdY0/hPLvnV3DEXQuuh7Yyys+vgGvObI1qocG64YFmSVqxGNjKVsOEl5D6TiBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:31.924528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ce505a7f1d497b33194dc5e136031d6562d1ff1286dcaf520dd74ec1cec7bb3","sha256:d7f518745a2f230815b2d4ed2da53548f756eb467dc124acfe935340ba4eb08e"],"state_sha256":"a453574d9a16dac6e7aa802623870fd04a68883373547923eeea3cd77e277ab8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"El5BWbuS91jiUGy6MehZ9pTcuuep6/kgT32kBTd7E41Nmm4PjGhRDY1DViWiqMBgmBykOqRYUAMp2OmqlsBwDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:22:22.146290Z","bundle_sha256":"e59fb7bbe1cd46aa073679d3c25c41fbcce9b1f6a1c03472ae55abeb3aff2033"}}