{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6QBY43K7KHU66SFREMEBV6CB5A","short_pith_number":"pith:6QBY43K7","canonical_record":{"source":{"id":"1301.0340","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-02T22:03:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0f32210838ea3d90395a7e5464a8493ded9eaa13c4162deb74756894e713f139","abstract_canon_sha256":"8dd6861a55074d599f2445b9aa61efb4ace0804234af67251c47e1fcac1767a2"},"schema_version":"1.0"},"canonical_sha256":"f4038e6d5f51e9ef48b123081af841e818ed14f77d8efc9c93a986960a62c538","source":{"kind":"arxiv","id":"1301.0340","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0340","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0340v2","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0340","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"6QBY43K7KHU6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6QBY43K7KHU66SFR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6QBY43K7","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6QBY43K7KHU66SFREMEBV6CB5A","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0340","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-02T22:03:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0f32210838ea3d90395a7e5464a8493ded9eaa13c4162deb74756894e713f139","abstract_canon_sha256":"8dd6861a55074d599f2445b9aa61efb4ace0804234af67251c47e1fcac1767a2"},"schema_version":"1.0"},"canonical_sha256":"f4038e6d5f51e9ef48b123081af841e818ed14f77d8efc9c93a986960a62c538","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:58.320296Z","signature_b64":"dixkLbz78Ozheet26vdEZBWcqWoobQk/XKy7/3M4S/n+Zn+9AAjU52en/1aCon/y6bB6bCkZVn8NZJdzV33bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4038e6d5f51e9ef48b123081af841e818ed14f77d8efc9c93a986960a62c538","last_reissued_at":"2026-05-18T01:41:58.319842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:58.319842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0340","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-18T01:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bF/VRKep7dLuBiQyoRR9BN8gh9stQwPRdbprV7+8rr/0kFv8qX0C4vyW5AwEC7Ll/cQLHmq82XrHiOTku5sfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:24:36.592358Z"},"content_sha256":"8beba32ace21255211cd35d5f57a7727539472efc3ea7bc7a5bf9c0b3f792540","schema_version":"1.0","event_id":"sha256:8beba32ace21255211cd35d5f57a7727539472efc3ea7bc7a5bf9c0b3f792540"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6QBY43K7KHU66SFREMEBV6CB5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The computational landscape of permutation patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Marie-Louise Bruner, Martin Lackner","submitted_at":"2013-01-02T22:03:31Z","abstract_excerpt":"In the last years, different types of patterns in permutations have been studied: vincular, bivincular and mesh patterns, just to name a few. Every type of permutation pattern naturally defines a corresponding computational problem: Given a pattern P and a permutation T (the text), is P contained in T? In this paper we draw a map of the computational landscape of permutation pattern matching with different types of patterns. We provide a classical complexity analysis and investigate the impact of the pattern length on the computational hardness. Furthermore, we highlight several directions in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0340","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-18T01:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FkYz5tmDmZbLHGsMtUWXLwNZc3hCy/JDz8EIzclYjWUDB01mXeN79fInDDDdtwoeahHxWNoUQLbig0HcbH1rCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:24:36.593081Z"},"content_sha256":"c93faab5281aac5231c4742cc6e69d37f7cdff0fd4217bc3512ba25f84734c93","schema_version":"1.0","event_id":"sha256:c93faab5281aac5231c4742cc6e69d37f7cdff0fd4217bc3512ba25f84734c93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QBY43K7KHU66SFREMEBV6CB5A/bundle.json","state_url":"https://pith.science/pith/6QBY43K7KHU66SFREMEBV6CB5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QBY43K7KHU66SFREMEBV6CB5A/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-08T00:24:36Z","links":{"resolver":"https://pith.science/pith/6QBY43K7KHU66SFREMEBV6CB5A","bundle":"https://pith.science/pith/6QBY43K7KHU66SFREMEBV6CB5A/bundle.json","state":"https://pith.science/pith/6QBY43K7KHU66SFREMEBV6CB5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QBY43K7KHU66SFREMEBV6CB5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6QBY43K7KHU66SFREMEBV6CB5A","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":"8dd6861a55074d599f2445b9aa61efb4ace0804234af67251c47e1fcac1767a2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-02T22:03:31Z","title_canon_sha256":"0f32210838ea3d90395a7e5464a8493ded9eaa13c4162deb74756894e713f139"},"schema_version":"1.0","source":{"id":"1301.0340","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0340","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0340v2","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0340","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"6QBY43K7KHU6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6QBY43K7KHU66SFR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6QBY43K7","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:c93faab5281aac5231c4742cc6e69d37f7cdff0fd4217bc3512ba25f84734c93","target":"graph","created_at":"2026-05-18T01:41:58Z","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":"In the last years, different types of patterns in permutations have been studied: vincular, bivincular and mesh patterns, just to name a few. Every type of permutation pattern naturally defines a corresponding computational problem: Given a pattern P and a permutation T (the text), is P contained in T? In this paper we draw a map of the computational landscape of permutation pattern matching with different types of patterns. We provide a classical complexity analysis and investigate the impact of the pattern length on the computational hardness. Furthermore, we highlight several directions in ","authors_text":"Marie-Louise Bruner, Martin Lackner","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-02T22:03:31Z","title":"The computational landscape of permutation patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0340","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:8beba32ace21255211cd35d5f57a7727539472efc3ea7bc7a5bf9c0b3f792540","target":"record","created_at":"2026-05-18T01:41:58Z","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":"8dd6861a55074d599f2445b9aa61efb4ace0804234af67251c47e1fcac1767a2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-02T22:03:31Z","title_canon_sha256":"0f32210838ea3d90395a7e5464a8493ded9eaa13c4162deb74756894e713f139"},"schema_version":"1.0","source":{"id":"1301.0340","kind":"arxiv","version":2}},"canonical_sha256":"f4038e6d5f51e9ef48b123081af841e818ed14f77d8efc9c93a986960a62c538","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4038e6d5f51e9ef48b123081af841e818ed14f77d8efc9c93a986960a62c538","first_computed_at":"2026-05-18T01:41:58.319842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:58.319842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dixkLbz78Ozheet26vdEZBWcqWoobQk/XKy7/3M4S/n+Zn+9AAjU52en/1aCon/y6bB6bCkZVn8NZJdzV33bCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:58.320296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0340","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8beba32ace21255211cd35d5f57a7727539472efc3ea7bc7a5bf9c0b3f792540","sha256:c93faab5281aac5231c4742cc6e69d37f7cdff0fd4217bc3512ba25f84734c93"],"state_sha256":"9916f7007fdf55a0e8844369bb7754e3d271ac7f92247f4b278fe5fd9eb532c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WqPEVUEPO1CMkxOmf5PiEld2XDmgPWYxwYlDzKNPCc36NlkmRGNFNtgHsSZDmd9Tm67zO65foN0ie50ng3aKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T00:24:36.597349Z","bundle_sha256":"79929f2af78d026b9625b4c63c916b76f3d153091e6bc371658ffff8e7b8ccb1"}}