{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MG6ZGTMQWDTXAIGDI65WC3AIMS","short_pith_number":"pith:MG6ZGTMQ","canonical_record":{"source":{"id":"1307.3073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-11T11:50:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d90f8e76d3958835f1ab237f8804ae9a4404f85a7be8a39c9fb385501a57942d","abstract_canon_sha256":"9aab7c0f10afecf3e33ce1253735825966d198d6784b7944cb028852a026e894"},"schema_version":"1.0"},"canonical_sha256":"61bd934d90b0e77020c347bb616c08648bddd1eb0f2f128c7b0f8d8ee6d5e4af","source":{"kind":"arxiv","id":"1307.3073","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3073","created_at":"2026-05-18T03:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3073v2","created_at":"2026-05-18T03:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3073","created_at":"2026-05-18T03:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"MG6ZGTMQWDTX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MG6ZGTMQWDTXAIGD","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MG6ZGTMQ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MG6ZGTMQWDTXAIGDI65WC3AIMS","target":"record","payload":{"canonical_record":{"source":{"id":"1307.3073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-11T11:50:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d90f8e76d3958835f1ab237f8804ae9a4404f85a7be8a39c9fb385501a57942d","abstract_canon_sha256":"9aab7c0f10afecf3e33ce1253735825966d198d6784b7944cb028852a026e894"},"schema_version":"1.0"},"canonical_sha256":"61bd934d90b0e77020c347bb616c08648bddd1eb0f2f128c7b0f8d8ee6d5e4af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:24.686878Z","signature_b64":"Z1hIj6IRXAsZMWSe2072wgt+nvSLz/dXqrP+xdL9Y1Apn+SJGLGQMurlF8/KW52fevXfoJph/uKjGGsQ1RlXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61bd934d90b0e77020c347bb616c08648bddd1eb0f2f128c7b0f8d8ee6d5e4af","last_reissued_at":"2026-05-18T03:08:24.686293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:24.686293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.3073","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-18T03:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a20Xy02/h4DZjstIgwJX6I/PWq4xnI/O6us2WCf42ebWV2Wt/foovo6TJ+CJbJm/yT2fMkPFtcMX81sU4xQwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:53:11.492527Z"},"content_sha256":"4611005a58535e30f689b2c71ef950ec59aa978a813ef6f9cc4a836061f99eeb","schema_version":"1.0","event_id":"sha256:4611005a58535e30f689b2c71ef950ec59aa978a813ef6f9cc4a836061f99eeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MG6ZGTMQWDTXAIGDI65WC3AIMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding small patterns in permutations in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Sylvain Guillemot","submitted_at":"2013-07-11T11:50:48Z","abstract_excerpt":"Given two permutations $\\sigma$ and $\\pi$, the \\textsc{Permutation Pattern} problem asks if $\\sigma$ is a subpattern of $\\pi$. We show that the problem can be solved in time $2^{O(\\ell^2\\log \\ell)}\\cdot n$, where $\\ell=|\\sigma|$ and $n=|\\pi|$. In other words, the problem is fixed-parameter tractable parameterized by the size of the subpattern to be found.\n  We introduce a novel type of decompositions for permutations and a corresponding width measure. We present a linear-time algorithm that either finds $\\sigma$ as a subpattern of $\\pi$, or finds a decomposition of $\\pi$ whose width is bounded"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3073","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-18T03:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"deTIewqY1bBbiOtCZ6J/8awOMTrDsPWZM4j6E3zZmWcO8ItI2dGXPzrMTzb3BmfaEKxyWIe5wM7Uv8plaTmTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:53:11.492871Z"},"content_sha256":"3846ca5027e0e3ebf8e31478366cfd971df9d937ce67e7904062cc365013c773","schema_version":"1.0","event_id":"sha256:3846ca5027e0e3ebf8e31478366cfd971df9d937ce67e7904062cc365013c773"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS/bundle.json","state_url":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS/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-05-26T13:53:11Z","links":{"resolver":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS","bundle":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS/bundle.json","state":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MG6ZGTMQWDTXAIGDI65WC3AIMS","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":"9aab7c0f10afecf3e33ce1253735825966d198d6784b7944cb028852a026e894","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-11T11:50:48Z","title_canon_sha256":"d90f8e76d3958835f1ab237f8804ae9a4404f85a7be8a39c9fb385501a57942d"},"schema_version":"1.0","source":{"id":"1307.3073","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3073","created_at":"2026-05-18T03:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3073v2","created_at":"2026-05-18T03:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3073","created_at":"2026-05-18T03:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"MG6ZGTMQWDTX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MG6ZGTMQWDTXAIGD","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MG6ZGTMQ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:3846ca5027e0e3ebf8e31478366cfd971df9d937ce67e7904062cc365013c773","target":"graph","created_at":"2026-05-18T03:08:24Z","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":"Given two permutations $\\sigma$ and $\\pi$, the \\textsc{Permutation Pattern} problem asks if $\\sigma$ is a subpattern of $\\pi$. We show that the problem can be solved in time $2^{O(\\ell^2\\log \\ell)}\\cdot n$, where $\\ell=|\\sigma|$ and $n=|\\pi|$. In other words, the problem is fixed-parameter tractable parameterized by the size of the subpattern to be found.\n  We introduce a novel type of decompositions for permutations and a corresponding width measure. We present a linear-time algorithm that either finds $\\sigma$ as a subpattern of $\\pi$, or finds a decomposition of $\\pi$ whose width is bounded","authors_text":"D\\'aniel Marx, Sylvain Guillemot","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-11T11:50:48Z","title":"Finding small patterns in permutations in linear time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3073","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:4611005a58535e30f689b2c71ef950ec59aa978a813ef6f9cc4a836061f99eeb","target":"record","created_at":"2026-05-18T03:08:24Z","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":"9aab7c0f10afecf3e33ce1253735825966d198d6784b7944cb028852a026e894","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-11T11:50:48Z","title_canon_sha256":"d90f8e76d3958835f1ab237f8804ae9a4404f85a7be8a39c9fb385501a57942d"},"schema_version":"1.0","source":{"id":"1307.3073","kind":"arxiv","version":2}},"canonical_sha256":"61bd934d90b0e77020c347bb616c08648bddd1eb0f2f128c7b0f8d8ee6d5e4af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61bd934d90b0e77020c347bb616c08648bddd1eb0f2f128c7b0f8d8ee6d5e4af","first_computed_at":"2026-05-18T03:08:24.686293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:24.686293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z1hIj6IRXAsZMWSe2072wgt+nvSLz/dXqrP+xdL9Y1Apn+SJGLGQMurlF8/KW52fevXfoJph/uKjGGsQ1RlXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:24.686878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3073","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4611005a58535e30f689b2c71ef950ec59aa978a813ef6f9cc4a836061f99eeb","sha256:3846ca5027e0e3ebf8e31478366cfd971df9d937ce67e7904062cc365013c773"],"state_sha256":"6d7411451a5f2e03a27d9c1bd74cf87d3e5db69728ec6a4ed17517768a6a4847"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6WeLNWOl+Yri4K+aVrhlHpU8O/jC32sEs3nl52w3vzx5iFz2Bm9xN0eL2uw/F2RBgFs5z8bt0OeXdH5Ug7kAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:53:11.494923Z","bundle_sha256":"3c9d317a7dee6b8fffdbc6a5e7017aac14b767b4bc801baad45673764516c417"}}