{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RC2MBFV36SAO3T6JW4C6SIGGQQ","short_pith_number":"pith:RC2MBFV3","schema_version":"1.0","canonical_sha256":"88b4c096bbf480edcfc9b705e920c6840a50c264e6341aaf83188ce94967656c","source":{"kind":"arxiv","id":"1908.04673","version":1},"attestation_state":"computed","paper":{"title":"Finding and counting permutations via CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Benjamin Aram Berendsohn, D\\'aniel Marx, L\\'aszl\\'o Kozma","submitted_at":"2019-08-13T14:46:25Z","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^{k/4 + o(k)}$, and a polynomial-space algorithm whose running time is the better of $O(1.6181^n)$ and $O(n^{k/2 + 1})$. These results improve the earlier best "},"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.04673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-13T14:46:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4af8760b35695672b4450be7aa0a973493e4dad6c7d42e82406315055adf1950","abstract_canon_sha256":"bf3d92316f74c7d93add8678d5bb7da4d5ace90784e59a297476d4f40006b8e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:55:15.478150Z","signature_b64":"fN+2X97kAQJOcDctf+8T/kRhv8Cgje9DWqySt2YOXlxh6X99Vc1/RGzeVbxVK04gxNgmmji2yXG7reRvbJ/gBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b4c096bbf480edcfc9b705e920c6840a50c264e6341aaf83188ce94967656c","last_reissued_at":"2026-07-04T23:55:15.477803Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:55:15.477803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding and counting permutations via CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Benjamin Aram Berendsohn, D\\'aniel Marx, L\\'aszl\\'o Kozma","submitted_at":"2019-08-13T14:46:25Z","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^{k/4 + o(k)}$, and a polynomial-space algorithm whose running time is the better of $O(1.6181^n)$ and $O(n^{k/2 + 1})$. These results improve the earlier best "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04673","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.04673/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.04673","created_at":"2026-07-04T23:55:15.477863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04673v1","created_at":"2026-07-04T23:55:15.477863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04673","created_at":"2026-07-04T23:55:15.477863+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC2MBFV36SAO","created_at":"2026-07-04T23:55:15.477863+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC2MBFV36SAO3T6J","created_at":"2026-07-04T23:55:15.477863+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC2MBFV3","created_at":"2026-07-04T23:55:15.477863+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/RC2MBFV36SAO3T6JW4C6SIGGQQ","json":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ.json","graph_json":"https://pith.science/api/pith-number/RC2MBFV36SAO3T6JW4C6SIGGQQ/graph.json","events_json":"https://pith.science/api/pith-number/RC2MBFV36SAO3T6JW4C6SIGGQQ/events.json","paper":"https://pith.science/paper/RC2MBFV3"},"agent_actions":{"view_html":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ","download_json":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ.json","view_paper":"https://pith.science/paper/RC2MBFV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04673&json=true","fetch_graph":"https://pith.science/api/pith-number/RC2MBFV36SAO3T6JW4C6SIGGQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RC2MBFV36SAO3T6JW4C6SIGGQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ/action/storage_attestation","attest_author":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ/action/author_attestation","sign_citation":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ/action/citation_signature","submit_replication":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ/action/replication_record"}},"created_at":"2026-07-04T23:55:15.477863+00:00","updated_at":"2026-07-04T23:55:15.477863+00:00"}