{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QF5LJME66GXFNOLYCS4WWFKLZH","short_pith_number":"pith:QF5LJME6","canonical_record":{"source":{"id":"1902.08809","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-23T16:24:20Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2182b617de4a6ed2f51edcb3cf3419cb691295d190489087f7aa62a3dc021956","abstract_canon_sha256":"d6c27b4a4d3fa1bc48c11eeddd1a8e68682ba84c758600d8ecce90a57501cc7e"},"schema_version":"1.0"},"canonical_sha256":"817ab4b09ef1ae56b97814b96b154bc9d125fb9bfb8f73381284663163fb1aee","source":{"kind":"arxiv","id":"1902.08809","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08809","created_at":"2026-05-17T23:48:30Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08809v2","created_at":"2026-05-17T23:48:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08809","created_at":"2026-05-17T23:48:30Z"},{"alias_kind":"pith_short_12","alias_value":"QF5LJME66GXF","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QF5LJME66GXFNOLY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QF5LJME6","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QF5LJME66GXFNOLYCS4WWFKLZH","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08809","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-23T16:24:20Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2182b617de4a6ed2f51edcb3cf3419cb691295d190489087f7aa62a3dc021956","abstract_canon_sha256":"d6c27b4a4d3fa1bc48c11eeddd1a8e68682ba84c758600d8ecce90a57501cc7e"},"schema_version":"1.0"},"canonical_sha256":"817ab4b09ef1ae56b97814b96b154bc9d125fb9bfb8f73381284663163fb1aee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:30.351605Z","signature_b64":"cLzj+Cp83gVjCpb0/uDb9kLNmfgLCIZnPAMsjeL0UfOSMdhTQ3Lk54rMhhlKVcPK7GkTSTsLvJDD4ICATLocAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"817ab4b09ef1ae56b97814b96b154bc9d125fb9bfb8f73381284663163fb1aee","last_reissued_at":"2026-05-17T23:48:30.350911Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:30.350911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08809","source_version":2,"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-17T23:48:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0TcwhEi/0M83Ck+qvhG31T4/V7n54K35z+2EEa6PHzwmvOWNvZfpUC4GrlvF0c7u6YnGxiUj1Nmblj43MlJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:21:56.994734Z"},"content_sha256":"bce14627a813e85d98ffdd28cdf94f33e78e3e53ede01a6737a4840a13576576","schema_version":"1.0","event_id":"sha256:bce14627a813e85d98ffdd28cdf94f33e78e3e53ede01a6737a4840a13576576"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QF5LJME66GXFNOLYCS4WWFKLZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster and simpler algorithms for finding large patterns in permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o Kozma","submitted_at":"2019-02-23T16:24:20Z","abstract_excerpt":"Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this area is deciding whether a given permutation of length $n$ contains a given pattern of length $k$.\n  In this work we give two new algorithms for this well-studied problem, one whose running time is $n^{0.44k+o(k)}$, and one whose running time is the better of $O(1.6181^n)$ and $n^{k/2+o(k)}$. These results improve the earlier best bounds of Ahal and Rabinovi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08809","kind":"arxiv","version":2},"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-17T23:48:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ndHDHOEK0ryOSrNZfmJlEPYruZFrADBWQdtn2DLeQSXaV8avjj+0p5gzZl6OhR/RSYm9c00gm3yzKpnNTa3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:21:56.995089Z"},"content_sha256":"e2532f76b8cd2cc54d6702203074900c5694a26982e2598512d08a998df80977","schema_version":"1.0","event_id":"sha256:e2532f76b8cd2cc54d6702203074900c5694a26982e2598512d08a998df80977"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QF5LJME66GXFNOLYCS4WWFKLZH/bundle.json","state_url":"https://pith.science/pith/QF5LJME66GXFNOLYCS4WWFKLZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QF5LJME66GXFNOLYCS4WWFKLZH/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:21:56Z","links":{"resolver":"https://pith.science/pith/QF5LJME66GXFNOLYCS4WWFKLZH","bundle":"https://pith.science/pith/QF5LJME66GXFNOLYCS4WWFKLZH/bundle.json","state":"https://pith.science/pith/QF5LJME66GXFNOLYCS4WWFKLZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QF5LJME66GXFNOLYCS4WWFKLZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QF5LJME66GXFNOLYCS4WWFKLZH","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":"d6c27b4a4d3fa1bc48c11eeddd1a8e68682ba84c758600d8ecce90a57501cc7e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-23T16:24:20Z","title_canon_sha256":"2182b617de4a6ed2f51edcb3cf3419cb691295d190489087f7aa62a3dc021956"},"schema_version":"1.0","source":{"id":"1902.08809","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08809","created_at":"2026-05-17T23:48:30Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08809v2","created_at":"2026-05-17T23:48:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08809","created_at":"2026-05-17T23:48:30Z"},{"alias_kind":"pith_short_12","alias_value":"QF5LJME66GXF","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QF5LJME66GXFNOLY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QF5LJME6","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:e2532f76b8cd2cc54d6702203074900c5694a26982e2598512d08a998df80977","target":"graph","created_at":"2026-05-17T23:48:30Z","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":"Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this area is deciding whether a given permutation of length $n$ contains a given pattern of length $k$.\n  In this work we give two new algorithms for this well-studied problem, one whose running time is $n^{0.44k+o(k)}$, and one whose running time is the better of $O(1.6181^n)$ and $n^{k/2+o(k)}$. These results improve the earlier best bounds of Ahal and Rabinovi","authors_text":"L\\'aszl\\'o Kozma","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-23T16:24:20Z","title":"Faster and simpler algorithms for finding large patterns in permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08809","kind":"arxiv","version":2},"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:bce14627a813e85d98ffdd28cdf94f33e78e3e53ede01a6737a4840a13576576","target":"record","created_at":"2026-05-17T23:48:30Z","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":"d6c27b4a4d3fa1bc48c11eeddd1a8e68682ba84c758600d8ecce90a57501cc7e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-23T16:24:20Z","title_canon_sha256":"2182b617de4a6ed2f51edcb3cf3419cb691295d190489087f7aa62a3dc021956"},"schema_version":"1.0","source":{"id":"1902.08809","kind":"arxiv","version":2}},"canonical_sha256":"817ab4b09ef1ae56b97814b96b154bc9d125fb9bfb8f73381284663163fb1aee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"817ab4b09ef1ae56b97814b96b154bc9d125fb9bfb8f73381284663163fb1aee","first_computed_at":"2026-05-17T23:48:30.350911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:30.350911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cLzj+Cp83gVjCpb0/uDb9kLNmfgLCIZnPAMsjeL0UfOSMdhTQ3Lk54rMhhlKVcPK7GkTSTsLvJDD4ICATLocAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:30.351605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08809","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bce14627a813e85d98ffdd28cdf94f33e78e3e53ede01a6737a4840a13576576","sha256:e2532f76b8cd2cc54d6702203074900c5694a26982e2598512d08a998df80977"],"state_sha256":"3b04984b534aa253f5ecf7a364b2517899e57e5c884db748d13228c9a76de451"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"263lvdALnPtrXyljasttCbmJfVVkSH8NAWUAwR8tNZVuLWxs6qJkc1dPOvKkCf+ZBiuEAxeNa2ITNNPlOLcKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:21:56.997115Z","bundle_sha256":"a06f4e0f14b9bde489d86722bd9b0e2d2b5559db199520692906e0adc508b55d"}}