{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5H5ECS42UOAYHMDCFO3YPLULOA","short_pith_number":"pith:5H5ECS42","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"},"canonical_sha256":"e9fa414b9aa38183b0622bb787ae8b701b1e3f6bcbb6b9a4ed0b7615b27b6d58","source":{"kind":"arxiv","id":"1908.04708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04708","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04708v1","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04708","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"5H5ECS42UOAY","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_16","alias_value":"5H5ECS42UOAYHMDC","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_8","alias_value":"5H5ECS42","created_at":"2026-07-04T23:55:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5H5ECS42UOAYHMDCFO3YPLULOA","target":"record","payload":{"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"},"canonical_sha256":"e9fa414b9aa38183b0622bb787ae8b701b1e3f6bcbb6b9a4ed0b7615b27b6d58","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"},"source_kind":"arxiv","source_id":"1908.04708","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-07-04T23:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/YRKGVWSjSFlgrE0SyiS2/F2vgcg32kCrPWmWLWjkXFAMHEG3IMjMxK1kBWodjacrJCM5H1Sskes9q+7ochDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:42:11.481263Z"},"content_sha256":"eb9136dff111917eed4a7a2e0b3f110dc4881e43eb52882dfeb6c478a966ba9e","schema_version":"1.0","event_id":"sha256:eb9136dff111917eed4a7a2e0b3f110dc4881e43eb52882dfeb6c478a966ba9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5H5ECS42UOAYHMDCFO3YPLULOA","target":"graph","payload":{"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"},"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-07-04T23:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O6lBrAVUXnddgVCsq7qlaOTcuDZdjYFHi6xJM//OmUpEsqwS0+2fKJNWQvZNevJ0UDbbhJMn7AqH5hJZ+cMIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:42:11.481806Z"},"content_sha256":"4835b0513dec0646cb0a362d19b163960f9cf229cef361d668a9ef7763ebeaba","schema_version":"1.0","event_id":"sha256:4835b0513dec0646cb0a362d19b163960f9cf229cef361d668a9ef7763ebeaba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA/bundle.json","state_url":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5H5ECS42UOAYHMDCFO3YPLULOA/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-16T08:42:11Z","links":{"resolver":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA","bundle":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA/bundle.json","state":"https://pith.science/pith/5H5ECS42UOAYHMDCFO3YPLULOA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5H5ECS42UOAYHMDCFO3YPLULOA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5H5ECS42UOAYHMDCFO3YPLULOA","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":"9d2cc85ecd3c43584f723d408ebfed6fd7306dfc97f338ecec3ad538538d89bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-13T15:46:27Z","title_canon_sha256":"7341bfbdc7e83d8e677f5c9eca58aee81e598ff858645a7c1c6c737cab5a1661"},"schema_version":"1.0","source":{"id":"1908.04708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04708","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04708v1","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04708","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"5H5ECS42UOAY","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_16","alias_value":"5H5ECS42UOAYHMDC","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_8","alias_value":"5H5ECS42","created_at":"2026-07-04T23:55:15Z"}],"graph_snapshots":[{"event_id":"sha256:4835b0513dec0646cb0a362d19b163960f9cf229cef361d668a9ef7763ebeaba","target":"graph","created_at":"2026-07-04T23:55:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.04708/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Guillaume Dumas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-13T15:46:27Z","title":"Superpermutation matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04708","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:eb9136dff111917eed4a7a2e0b3f110dc4881e43eb52882dfeb6c478a966ba9e","target":"record","created_at":"2026-07-04T23:55:15Z","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":"9d2cc85ecd3c43584f723d408ebfed6fd7306dfc97f338ecec3ad538538d89bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-13T15:46:27Z","title_canon_sha256":"7341bfbdc7e83d8e677f5c9eca58aee81e598ff858645a7c1c6c737cab5a1661"},"schema_version":"1.0","source":{"id":"1908.04708","kind":"arxiv","version":1}},"canonical_sha256":"e9fa414b9aa38183b0622bb787ae8b701b1e3f6bcbb6b9a4ed0b7615b27b6d58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9fa414b9aa38183b0622bb787ae8b701b1e3f6bcbb6b9a4ed0b7615b27b6d58","first_computed_at":"2026-07-04T23:55:15.864946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:55:15.864946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UVNLurRMVVUDF9G/Yz0cShIlc7BxIC+9j0s6x9z+ys1qScYQaQkzUbKuZ6d2eYirVBo6WqYTWz3BQ1IownbPCw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:55:15.865484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb9136dff111917eed4a7a2e0b3f110dc4881e43eb52882dfeb6c478a966ba9e","sha256:4835b0513dec0646cb0a362d19b163960f9cf229cef361d668a9ef7763ebeaba"],"state_sha256":"0be657c8b1b7f201c710e1b28ad3458e6bf0acb799ddb78444ab212ee7235df7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZjoEAKw41VsY5Wuoq5HK3FNSzCmebWDiZsR/yo8O7y7oB9HF7BRkv1K7mpWdwUjXYt/5tR+KBQ6MoqljgLTeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T08:42:11.487833Z","bundle_sha256":"c83bff68d22b57aa86985b1b257529be101ebac7b76a651fa5a095c82e11baa6"}}