{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FAYG4U3ULD3NYK2IFIG35LXC6J","short_pith_number":"pith:FAYG4U3U","canonical_record":{"source":{"id":"1408.5108","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-08-21T18:52:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9e641968e77541bff3aae82050dab69fc70e3120002455ec2010df9f5c608629","abstract_canon_sha256":"497c44394427591589514602576d9c73b38873bdce2d0b89138881044af9b12d"},"schema_version":"1.0"},"canonical_sha256":"28306e537458f6dc2b482a0dbeaee2f25a0631fa3f9fdc55920553545c81dda2","source":{"kind":"arxiv","id":"1408.5108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5108","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5108v1","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5108","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"FAYG4U3ULD3N","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FAYG4U3ULD3NYK2I","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FAYG4U3U","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FAYG4U3ULD3NYK2IFIG35LXC6J","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5108","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-08-21T18:52:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9e641968e77541bff3aae82050dab69fc70e3120002455ec2010df9f5c608629","abstract_canon_sha256":"497c44394427591589514602576d9c73b38873bdce2d0b89138881044af9b12d"},"schema_version":"1.0"},"canonical_sha256":"28306e537458f6dc2b482a0dbeaee2f25a0631fa3f9fdc55920553545c81dda2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:40.706883Z","signature_b64":"eKU3m9WEvT9gt4MfwlD8zjo93yPWkQ3/wKOdMpLa5zHefQX1YmCuC3wdSbBUyrkv8fCfNBOn9EydPgdP0FcvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28306e537458f6dc2b482a0dbeaee2f25a0631fa3f9fdc55920553545c81dda2","last_reissued_at":"2026-05-18T02:44:40.706151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:40.706151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5108","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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71yz0oNSDYM8BDIV6pKnWN9FJMWEuNWdhiXlI8bgHPBR2Sf7c+ipx9GnghW+RqsNbdLCPOyUlonUpJ4XRCThDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:09:12.303049Z"},"content_sha256":"a2db9c3a5fc418dfedef117db592a1796af238db911a4de814a5a18975d61a85","schema_version":"1.0","event_id":"sha256:a2db9c3a5fc418dfedef117db592a1796af238db911a4de814a5a18975d61a85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FAYG4U3ULD3NYK2IFIG35LXC6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tackling the Minimal Superpermutation Problem","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Robin Houston","submitted_at":"2014-08-21T18:52:00Z","abstract_excerpt":"A superpermutation on $n$ symbols is a string that contains each of the $n!$ permutations of the $n$ symbols as a contiguous substring. The shortest superpermutation on $n$ symbols was conjectured to have length $\\sum_{i=1}^n i!$. The conjecture had been verified for $n \\leq 5$. We disprove it by exhibiting an explicit counterexample for $n=6$. This counterexample was found by encoding the problem as an instance of the (asymmetric) Traveling Salesman Problem, and searching for a solution using a powerful heuristic solver."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5108","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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HJiWm9BlxQ8dI5GIFHGDj38CDvCjqV6Gyt9wZ8qbUErhrAlu4i2mOuyjGthgbq2JurWOpY3R54w2HbAASKUpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:09:12.303856Z"},"content_sha256":"b975cdd2118a66b83d9d14818a4b3727261182bbeef402dd366478e094e3fd03","schema_version":"1.0","event_id":"sha256:b975cdd2118a66b83d9d14818a4b3727261182bbeef402dd366478e094e3fd03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAYG4U3ULD3NYK2IFIG35LXC6J/bundle.json","state_url":"https://pith.science/pith/FAYG4U3ULD3NYK2IFIG35LXC6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAYG4U3ULD3NYK2IFIG35LXC6J/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-08-16T22:09:12Z","links":{"resolver":"https://pith.science/pith/FAYG4U3ULD3NYK2IFIG35LXC6J","bundle":"https://pith.science/pith/FAYG4U3ULD3NYK2IFIG35LXC6J/bundle.json","state":"https://pith.science/pith/FAYG4U3ULD3NYK2IFIG35LXC6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAYG4U3ULD3NYK2IFIG35LXC6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FAYG4U3ULD3NYK2IFIG35LXC6J","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":"497c44394427591589514602576d9c73b38873bdce2d0b89138881044af9b12d","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-08-21T18:52:00Z","title_canon_sha256":"9e641968e77541bff3aae82050dab69fc70e3120002455ec2010df9f5c608629"},"schema_version":"1.0","source":{"id":"1408.5108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5108","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5108v1","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5108","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"FAYG4U3ULD3N","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FAYG4U3ULD3NYK2I","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FAYG4U3U","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:b975cdd2118a66b83d9d14818a4b3727261182bbeef402dd366478e094e3fd03","target":"graph","created_at":"2026-05-18T02:44:40Z","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 superpermutation on $n$ symbols is a string that contains each of the $n!$ permutations of the $n$ symbols as a contiguous substring. The shortest superpermutation on $n$ symbols was conjectured to have length $\\sum_{i=1}^n i!$. The conjecture had been verified for $n \\leq 5$. We disprove it by exhibiting an explicit counterexample for $n=6$. This counterexample was found by encoding the problem as an instance of the (asymmetric) Traveling Salesman Problem, and searching for a solution using a powerful heuristic solver.","authors_text":"Robin Houston","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-08-21T18:52:00Z","title":"Tackling the Minimal Superpermutation Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5108","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:a2db9c3a5fc418dfedef117db592a1796af238db911a4de814a5a18975d61a85","target":"record","created_at":"2026-05-18T02:44:40Z","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":"497c44394427591589514602576d9c73b38873bdce2d0b89138881044af9b12d","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-08-21T18:52:00Z","title_canon_sha256":"9e641968e77541bff3aae82050dab69fc70e3120002455ec2010df9f5c608629"},"schema_version":"1.0","source":{"id":"1408.5108","kind":"arxiv","version":1}},"canonical_sha256":"28306e537458f6dc2b482a0dbeaee2f25a0631fa3f9fdc55920553545c81dda2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28306e537458f6dc2b482a0dbeaee2f25a0631fa3f9fdc55920553545c81dda2","first_computed_at":"2026-05-18T02:44:40.706151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:40.706151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eKU3m9WEvT9gt4MfwlD8zjo93yPWkQ3/wKOdMpLa5zHefQX1YmCuC3wdSbBUyrkv8fCfNBOn9EydPgdP0FcvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:40.706883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2db9c3a5fc418dfedef117db592a1796af238db911a4de814a5a18975d61a85","sha256:b975cdd2118a66b83d9d14818a4b3727261182bbeef402dd366478e094e3fd03"],"state_sha256":"7de8afa09b95847fdb39772c6e3246bc00c8ccd41b6c3ad996be01431df559d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qcPmcrGN0zWgUFnkmO8+YOaxRE6c63604RxnssOVEgvAFLLQvK9hR1jRVbH4Wc4Dw/uk5whWh/S0PjsItsfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T22:09:12.310071Z","bundle_sha256":"2d83e87fa9e2c922d237df75833abc326f30de391ad4734b719128408a01b000"}}