{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5H5ECS42UOAYHMDCFO3YPLULOA","short_pith_number":"pith:5H5ECS42","schema_version":"1.0","canonical_sha256":"e9fa414b9aa38183b0622bb787ae8b701b1e3f6bcbb6b9a4ed0b7615b27b6d58","source":{"kind":"arxiv","id":"1908.04708","version":1},"attestation_state":"computed","paper":{"title":"Superpermutation matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillaume Dumas","submitted_at":"2019-08-13T15:46:27Z","abstract_excerpt":"Superpermutations are words over a finite alphabet containing every permutation as a factor. Finding the minimal length of a superpermutation is still an open problem. In this article, we introduce superpermutations matrices. We establish a link between the minimal size of such a matrix and the minimal length of a universal word for the quotient of the symmetric group $S_n$ by an equivalence relation. We will then give non-trivial bounds on the minimal length of such a word and prove that the limit of their ratio when $n$ approaches infinity is 2."},"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":"1908.04708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-13T15:46:27Z","cross_cats_sorted":[],"title_canon_sha256":"7341bfbdc7e83d8e677f5c9eca58aee81e598ff858645a7c1c6c737cab5a1661","abstract_canon_sha256":"9d2cc85ecd3c43584f723d408ebfed6fd7306dfc97f338ecec3ad538538d89bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:55:15.865484Z","signature_b64":"UVNLurRMVVUDF9G/Yz0cShIlc7BxIC+9j0s6x9z+ys1qScYQaQkzUbKuZ6d2eYirVBo6WqYTWz3BQ1IownbPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9fa414b9aa38183b0622bb787ae8b701b1e3f6bcbb6b9a4ed0b7615b27b6d58","last_reissued_at":"2026-07-04T23:55:15.864946Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:55:15.864946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Superpermutation matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillaume Dumas","submitted_at":"2019-08-13T15:46:27Z","abstract_excerpt":"Superpermutations are words over a finite alphabet containing every permutation as a factor. Finding the minimal length of a superpermutation is still an open problem. In this article, we introduce superpermutations matrices. We establish a link between the minimal size of such a matrix and the minimal length of a universal word for the quotient of the symmetric group $S_n$ by an equivalence relation. We will then give non-trivial bounds on the minimal length of such a word and prove that the limit of their ratio when $n$ approaches infinity is 2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04708","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/1908.04708/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":"1908.04708","created_at":"2026-07-04T23:55:15.865003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04708v1","created_at":"2026-07-04T23:55:15.865003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04708","created_at":"2026-07-04T23:55:15.865003+00:00"},{"alias_kind":"pith_short_12","alias_value":"5H5ECS42UOAY","created_at":"2026-07-04T23:55:15.865003+00:00"},{"alias_kind":"pith_short_16","alias_value":"5H5ECS42UOAYHMDC","created_at":"2026-07-04T23:55:15.865003+00:00"},{"alias_kind":"pith_short_8","alias_value":"5H5ECS42","created_at":"2026-07-04T23:55:15.865003+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/5H5ECS42UOAYHMDCFO3YPLULOA","json":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA.json","graph_json":"https://pith.science/api/pith-number/5H5ECS42UOAYHMDCFO3YPLULOA/graph.json","events_json":"https://pith.science/api/pith-number/5H5ECS42UOAYHMDCFO3YPLULOA/events.json","paper":"https://pith.science/paper/5H5ECS42"},"agent_actions":{"view_html":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA","download_json":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA.json","view_paper":"https://pith.science/paper/5H5ECS42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04708&json=true","fetch_graph":"https://pith.science/api/pith-number/5H5ECS42UOAYHMDCFO3YPLULOA/graph.json","fetch_events":"https://pith.science/api/pith-number/5H5ECS42UOAYHMDCFO3YPLULOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA/action/storage_attestation","attest_author":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA/action/author_attestation","sign_citation":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA/action/citation_signature","submit_replication":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA/action/replication_record"}},"created_at":"2026-07-04T23:55:15.865003+00:00","updated_at":"2026-07-04T23:55:15.865003+00:00"}