{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FLNBQHBZSIKR4MLJ5PH4VWOXOG","short_pith_number":"pith:FLNBQHBZ","canonical_record":{"source":{"id":"1111.5736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-24T12:08:13Z","cross_cats_sorted":[],"title_canon_sha256":"0f84023d261bee71dd3d36ad6c39d1eea9b65f262159bc272202f420c0de82f7","abstract_canon_sha256":"874a8c69875eed1aa3618644d187ef278a9b8c5d07d8992fa22767f41443adf7"},"schema_version":"1.0"},"canonical_sha256":"2ada181c3992151e3169ebcfcad9d77189a12a26dabbb985e6fb8fa44ee8a0ae","source":{"kind":"arxiv","id":"1111.5736","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5736","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5736v1","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5736","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"FLNBQHBZSIKR","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FLNBQHBZSIKR4MLJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FLNBQHBZ","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FLNBQHBZSIKR4MLJ5PH4VWOXOG","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-24T12:08:13Z","cross_cats_sorted":[],"title_canon_sha256":"0f84023d261bee71dd3d36ad6c39d1eea9b65f262159bc272202f420c0de82f7","abstract_canon_sha256":"874a8c69875eed1aa3618644d187ef278a9b8c5d07d8992fa22767f41443adf7"},"schema_version":"1.0"},"canonical_sha256":"2ada181c3992151e3169ebcfcad9d77189a12a26dabbb985e6fb8fa44ee8a0ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:53.200662Z","signature_b64":"ENgyPAT0DAB+1xa3XWZAOwInbdoNyu2rJUDAW/CO9/GAs8ih06FtmhaOY4Rk3TJzQbQ7i+3dBK3E4eQGxpDaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ada181c3992151e3169ebcfcad9d77189a12a26dabbb985e6fb8fa44ee8a0ae","last_reissued_at":"2026-05-18T03:52:53.200086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:53.200086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5736","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:52:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LwOvnKqFFJ9oyfvveaWvhT96NzcJKhG5pQPC9glm6Be8txu3nVysPmInGFQpCZG9kzZVwrTDX67wMyWfSTmFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:32:42.151301Z"},"content_sha256":"ccaee86947362dd441b8b9e16752642b28c617bd56dd9c7715a77534b9106788","schema_version":"1.0","event_id":"sha256:ccaee86947362dd441b8b9e16752642b28c617bd56dd9c7715a77534b9106788"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FLNBQHBZSIKR4MLJ5PH4VWOXOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Claesson, Einar Steingr\\'imsson, V\\'it Jel\\'inek","submitted_at":"2011-11-24T12:08:13Z","abstract_excerpt":"We prove that the Stanley-Wilf limit of any layered permutation pattern of length $\\ell$ is at most $4\\ell^2$, and that the Stanley-Wilf limit of the pattern 1324 is at most 16. These bounds follow from a more general result showing that a permutation avoiding a pattern of a special form is a merge of two permutations, each of which avoids a smaller pattern. If the conjecture is true that the maximum Stanley-Wilf limit for patterns of length $\\ell$ is attained by a layered pattern then this implies an upper bound of $4\\ell^2$ for the Stanley-Wilf limit of any pattern of length $\\ell$.\n  We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5736","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:52:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WqQEVvjUfWQCR1uwVzNgQ1QwnwOKDa7jXeu6GD4WFjAxdRBWzBoSwjSzlT3DBNoHkUEQX/fK8U4KECLcHOGxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:32:42.151662Z"},"content_sha256":"2dd9804f58f2743f9e7feb98dd024aae6a63b37fbc8a75fa22a398951c8dbda2","schema_version":"1.0","event_id":"sha256:2dd9804f58f2743f9e7feb98dd024aae6a63b37fbc8a75fa22a398951c8dbda2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLNBQHBZSIKR4MLJ5PH4VWOXOG/bundle.json","state_url":"https://pith.science/pith/FLNBQHBZSIKR4MLJ5PH4VWOXOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLNBQHBZSIKR4MLJ5PH4VWOXOG/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-20T14:32:42Z","links":{"resolver":"https://pith.science/pith/FLNBQHBZSIKR4MLJ5PH4VWOXOG","bundle":"https://pith.science/pith/FLNBQHBZSIKR4MLJ5PH4VWOXOG/bundle.json","state":"https://pith.science/pith/FLNBQHBZSIKR4MLJ5PH4VWOXOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLNBQHBZSIKR4MLJ5PH4VWOXOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FLNBQHBZSIKR4MLJ5PH4VWOXOG","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":"874a8c69875eed1aa3618644d187ef278a9b8c5d07d8992fa22767f41443adf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-24T12:08:13Z","title_canon_sha256":"0f84023d261bee71dd3d36ad6c39d1eea9b65f262159bc272202f420c0de82f7"},"schema_version":"1.0","source":{"id":"1111.5736","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5736","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5736v1","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5736","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"FLNBQHBZSIKR","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FLNBQHBZSIKR4MLJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FLNBQHBZ","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:2dd9804f58f2743f9e7feb98dd024aae6a63b37fbc8a75fa22a398951c8dbda2","target":"graph","created_at":"2026-05-18T03:52:53Z","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 prove that the Stanley-Wilf limit of any layered permutation pattern of length $\\ell$ is at most $4\\ell^2$, and that the Stanley-Wilf limit of the pattern 1324 is at most 16. These bounds follow from a more general result showing that a permutation avoiding a pattern of a special form is a merge of two permutations, each of which avoids a smaller pattern. If the conjecture is true that the maximum Stanley-Wilf limit for patterns of length $\\ell$ is attained by a layered pattern then this implies an upper bound of $4\\ell^2$ for the Stanley-Wilf limit of any pattern of length $\\ell$.\n  We als","authors_text":"Anders Claesson, Einar Steingr\\'imsson, V\\'it Jel\\'inek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-24T12:08:13Z","title":"Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5736","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:ccaee86947362dd441b8b9e16752642b28c617bd56dd9c7715a77534b9106788","target":"record","created_at":"2026-05-18T03:52:53Z","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":"874a8c69875eed1aa3618644d187ef278a9b8c5d07d8992fa22767f41443adf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-24T12:08:13Z","title_canon_sha256":"0f84023d261bee71dd3d36ad6c39d1eea9b65f262159bc272202f420c0de82f7"},"schema_version":"1.0","source":{"id":"1111.5736","kind":"arxiv","version":1}},"canonical_sha256":"2ada181c3992151e3169ebcfcad9d77189a12a26dabbb985e6fb8fa44ee8a0ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ada181c3992151e3169ebcfcad9d77189a12a26dabbb985e6fb8fa44ee8a0ae","first_computed_at":"2026-05-18T03:52:53.200086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:53.200086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ENgyPAT0DAB+1xa3XWZAOwInbdoNyu2rJUDAW/CO9/GAs8ih06FtmhaOY4Rk3TJzQbQ7i+3dBK3E4eQGxpDaCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:53.200662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5736","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccaee86947362dd441b8b9e16752642b28c617bd56dd9c7715a77534b9106788","sha256:2dd9804f58f2743f9e7feb98dd024aae6a63b37fbc8a75fa22a398951c8dbda2"],"state_sha256":"ba22273716118404e59afcf40864c5ab6e446bc5bd6b2d5ed4b8406cd22bd203"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OP8JPxG9cgh0wVB8xS3n5Qgk5UU6B7dBPkTfeZkVyvVdcHCFflgJbroOX+wAtJR7lxxw1fl/fNDff47r2K2fAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T14:32:42.153436Z","bundle_sha256":"ee65cc058f79b304cc1dcaf1536cf741a58fe8410a22f9972330fc78dfcba5e5"}}