{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RC2MBFV36SAO3T6JW4C6SIGGQQ","short_pith_number":"pith:RC2MBFV3","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"},"canonical_sha256":"88b4c096bbf480edcfc9b705e920c6840a50c264e6341aaf83188ce94967656c","source":{"kind":"arxiv","id":"1908.04673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04673","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04673v1","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04673","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"RC2MBFV36SAO","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_16","alias_value":"RC2MBFV36SAO3T6J","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_8","alias_value":"RC2MBFV3","created_at":"2026-07-04T23:55:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RC2MBFV36SAO3T6JW4C6SIGGQQ","target":"record","payload":{"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"},"canonical_sha256":"88b4c096bbf480edcfc9b705e920c6840a50c264e6341aaf83188ce94967656c","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"},"source_kind":"arxiv","source_id":"1908.04673","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":"5qTwm1dk+pemP7XN8HLSHvY7uCb2+iVP4UbQX4INAhFKeGuI34WPq6DdrXRyUClFjSXtcTWKs9JJJ2lWgID1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:20:45.304024Z"},"content_sha256":"387ab63fd9e0cbed1a8072a418db8f354873a8a0b1c64e51fb580469ceb453c1","schema_version":"1.0","event_id":"sha256:387ab63fd9e0cbed1a8072a418db8f354873a8a0b1c64e51fb580469ceb453c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RC2MBFV36SAO3T6JW4C6SIGGQQ","target":"graph","payload":{"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"},"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":"JPQwiyFP1bLUVC1GV8gmZk1qs/czBM42j7RDpFqv4snOgG9YjIxlkEGOMcBUu3aB4iWxBOXHXMBrA+MX+SjMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:20:45.304624Z"},"content_sha256":"e9c7fa8e5cfa092da277f68830439d038588011ea797f9b60caf0f49b9f7c86b","schema_version":"1.0","event_id":"sha256:e9c7fa8e5cfa092da277f68830439d038588011ea797f9b60caf0f49b9f7c86b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ/bundle.json","state_url":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ/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-16T11:20:45Z","links":{"resolver":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ","bundle":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ/bundle.json","state":"https://pith.science/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RC2MBFV36SAO3T6JW4C6SIGGQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RC2MBFV36SAO3T6JW4C6SIGGQQ","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":"bf3d92316f74c7d93add8678d5bb7da4d5ace90784e59a297476d4f40006b8e8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-13T14:46:25Z","title_canon_sha256":"4af8760b35695672b4450be7aa0a973493e4dad6c7d42e82406315055adf1950"},"schema_version":"1.0","source":{"id":"1908.04673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04673","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04673v1","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04673","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"RC2MBFV36SAO","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_16","alias_value":"RC2MBFV36SAO3T6J","created_at":"2026-07-04T23:55:15Z"},{"alias_kind":"pith_short_8","alias_value":"RC2MBFV3","created_at":"2026-07-04T23:55:15Z"}],"graph_snapshots":[{"event_id":"sha256:e9c7fa8e5cfa092da277f68830439d038588011ea797f9b60caf0f49b9f7c86b","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.04673/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"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^{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 ","authors_text":"Benjamin Aram Berendsohn, D\\'aniel Marx, 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-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04673","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:387ab63fd9e0cbed1a8072a418db8f354873a8a0b1c64e51fb580469ceb453c1","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":"bf3d92316f74c7d93add8678d5bb7da4d5ace90784e59a297476d4f40006b8e8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-13T14:46:25Z","title_canon_sha256":"4af8760b35695672b4450be7aa0a973493e4dad6c7d42e82406315055adf1950"},"schema_version":"1.0","source":{"id":"1908.04673","kind":"arxiv","version":1}},"canonical_sha256":"88b4c096bbf480edcfc9b705e920c6840a50c264e6341aaf83188ce94967656c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88b4c096bbf480edcfc9b705e920c6840a50c264e6341aaf83188ce94967656c","first_computed_at":"2026-07-04T23:55:15.477803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:55:15.477803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fN+2X97kAQJOcDctf+8T/kRhv8Cgje9DWqySt2YOXlxh6X99Vc1/RGzeVbxVK04gxNgmmji2yXG7reRvbJ/gBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:55:15.478150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:387ab63fd9e0cbed1a8072a418db8f354873a8a0b1c64e51fb580469ceb453c1","sha256:e9c7fa8e5cfa092da277f68830439d038588011ea797f9b60caf0f49b9f7c86b"],"state_sha256":"69a69e413f407e989351a7359b4efb19acdc8462898c5b91e20f27568ba9ede4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSWFIQvnbHldhsoCyesECqL043pDSDyaD5do68RG+hDa+ETbu3W6zN1afTmmTz54GwDsqUm4Qv4H8jm9QTrTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:20:45.309917Z","bundle_sha256":"9dc77f16908ed72dc81ff0a3410b3933932f39ef0dcf08923982aa1f57713c15"}}