{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MFFQVUD3UB6TM7KJZGEFOXCH7J","short_pith_number":"pith:MFFQVUD3","canonical_record":{"source":{"id":"1308.3810","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-17T22:36:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"51979747c0c4ff436207ffdca85e84b88b68acf76794c95343a885cdf49526c3","abstract_canon_sha256":"62fd377d3cbf49a95db8d70c91a0a93c91b906b1ca16aeae1467c57fe27a9c5f"},"schema_version":"1.0"},"canonical_sha256":"614b0ad07ba07d367d49c988575c47fa4f9e4171e15592ef4e58db2f15b03b72","source":{"kind":"arxiv","id":"1308.3810","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3810","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3810v3","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3810","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"MFFQVUD3UB6T","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MFFQVUD3UB6TM7KJ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MFFQVUD3","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MFFQVUD3UB6TM7KJZGEFOXCH7J","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3810","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-17T22:36:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"51979747c0c4ff436207ffdca85e84b88b68acf76794c95343a885cdf49526c3","abstract_canon_sha256":"62fd377d3cbf49a95db8d70c91a0a93c91b906b1ca16aeae1467c57fe27a9c5f"},"schema_version":"1.0"},"canonical_sha256":"614b0ad07ba07d367d49c988575c47fa4f9e4171e15592ef4e58db2f15b03b72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:44.792712Z","signature_b64":"bo2ndpUHjPVNUv3eFsfOWNJAVHYiHLqQS0yHMMmOa+tWu56JrVLjIihGUEZ/CeXxJZ4aP61jmomBI2eS1B4IAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"614b0ad07ba07d367d49c988575c47fa4f9e4171e15592ef4e58db2f15b03b72","last_reissued_at":"2026-05-18T02:37:44.792178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:44.792178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3810","source_version":3,"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:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/P8N/p3kXV884fY0Nkh3RlueFJ0QQIfwhb6uTSUKwZs+Dz9MB26Zh2WJzOTK30JCRipYM/YW2GvGabaihhhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:19:28.188269Z"},"content_sha256":"675bb24087282fca2e3665f0a6ae95de638b29e6b5f24e73c559a1e55e7f453b","schema_version":"1.0","event_id":"sha256:675bb24087282fca2e3665f0a6ae95de638b29e6b5f24e73c559a1e55e7f453b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MFFQVUD3UB6TM7KJZGEFOXCH7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding sequence extremal functions with formations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jonathan Tidor, J.T. Geneson, Rohil Prasad","submitted_at":"2013-08-17T22:36:10Z","abstract_excerpt":"An $(r, s)$-formation is a concatenation of $s$ permutations of $r$ letters. If $u$ is a sequence with $r$ distinct letters, then let $\\mathit{Ex}(u, n)$ be the maximum length of any $r$-sparse sequence with $n$ distinct letters which has no subsequence isomorphic to $u$. For every sequence $u$ define $\\mathit{fw}(u)$, the formation width of $u$, to be the minimum $s$ for which there exists $r$ such that there is a subsequence isomorphic to $u$ in every $(r, s)$-formation. We use $\\mathit{fw}(u)$ to prove upper bounds on $\\mathit{Ex}(u, n)$ for sequences $u$ such that $u$ contains an alternati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3810","kind":"arxiv","version":3},"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:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hifHuc29qdFBP6KM7fMWKjC3tpw6UA+lJPCOloKWsg7aoxapSJLkz9S1A5Y5W8U87WnXJL8BSDSnmSVCSTzUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:19:28.188635Z"},"content_sha256":"8d7b1d1e4c9e5427b1da385a2c064cb437275c037438b24c5c83d7e5688e5993","schema_version":"1.0","event_id":"sha256:8d7b1d1e4c9e5427b1da385a2c064cb437275c037438b24c5c83d7e5688e5993"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFFQVUD3UB6TM7KJZGEFOXCH7J/bundle.json","state_url":"https://pith.science/pith/MFFQVUD3UB6TM7KJZGEFOXCH7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFFQVUD3UB6TM7KJZGEFOXCH7J/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-05T16:19:28Z","links":{"resolver":"https://pith.science/pith/MFFQVUD3UB6TM7KJZGEFOXCH7J","bundle":"https://pith.science/pith/MFFQVUD3UB6TM7KJZGEFOXCH7J/bundle.json","state":"https://pith.science/pith/MFFQVUD3UB6TM7KJZGEFOXCH7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFFQVUD3UB6TM7KJZGEFOXCH7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MFFQVUD3UB6TM7KJZGEFOXCH7J","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":"62fd377d3cbf49a95db8d70c91a0a93c91b906b1ca16aeae1467c57fe27a9c5f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-17T22:36:10Z","title_canon_sha256":"51979747c0c4ff436207ffdca85e84b88b68acf76794c95343a885cdf49526c3"},"schema_version":"1.0","source":{"id":"1308.3810","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3810","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3810v3","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3810","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"MFFQVUD3UB6T","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MFFQVUD3UB6TM7KJ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MFFQVUD3","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:8d7b1d1e4c9e5427b1da385a2c064cb437275c037438b24c5c83d7e5688e5993","target":"graph","created_at":"2026-05-18T02:37:44Z","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":"An $(r, s)$-formation is a concatenation of $s$ permutations of $r$ letters. If $u$ is a sequence with $r$ distinct letters, then let $\\mathit{Ex}(u, n)$ be the maximum length of any $r$-sparse sequence with $n$ distinct letters which has no subsequence isomorphic to $u$. For every sequence $u$ define $\\mathit{fw}(u)$, the formation width of $u$, to be the minimum $s$ for which there exists $r$ such that there is a subsequence isomorphic to $u$ in every $(r, s)$-formation. We use $\\mathit{fw}(u)$ to prove upper bounds on $\\mathit{Ex}(u, n)$ for sequences $u$ such that $u$ contains an alternati","authors_text":"Jonathan Tidor, J.T. Geneson, Rohil Prasad","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-17T22:36:10Z","title":"Bounding sequence extremal functions with formations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3810","kind":"arxiv","version":3},"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:675bb24087282fca2e3665f0a6ae95de638b29e6b5f24e73c559a1e55e7f453b","target":"record","created_at":"2026-05-18T02:37:44Z","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":"62fd377d3cbf49a95db8d70c91a0a93c91b906b1ca16aeae1467c57fe27a9c5f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-17T22:36:10Z","title_canon_sha256":"51979747c0c4ff436207ffdca85e84b88b68acf76794c95343a885cdf49526c3"},"schema_version":"1.0","source":{"id":"1308.3810","kind":"arxiv","version":3}},"canonical_sha256":"614b0ad07ba07d367d49c988575c47fa4f9e4171e15592ef4e58db2f15b03b72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"614b0ad07ba07d367d49c988575c47fa4f9e4171e15592ef4e58db2f15b03b72","first_computed_at":"2026-05-18T02:37:44.792178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:44.792178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bo2ndpUHjPVNUv3eFsfOWNJAVHYiHLqQS0yHMMmOa+tWu56JrVLjIihGUEZ/CeXxJZ4aP61jmomBI2eS1B4IAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:44.792712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3810","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:675bb24087282fca2e3665f0a6ae95de638b29e6b5f24e73c559a1e55e7f453b","sha256:8d7b1d1e4c9e5427b1da385a2c064cb437275c037438b24c5c83d7e5688e5993"],"state_sha256":"ce717c955b3d012c4d567067146f5a8ec7122d9c95192b2e95f981cf657b0333"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kyzj5OsQYHwpr2Fop9/jPinrm4j/msyKYvQvU3YoRvPQOLXZGx8yomBNSmZN5BUv1rwDRbTxfPNI1HpNFv6vCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:19:28.190805Z","bundle_sha256":"4f4b3e7677e24d079283fe173494b1f50c4b00f72efbb8a51adadbe5b5f0853d"}}