{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BTDA6VXWXZA5HR5YFERWWU3TVE","short_pith_number":"pith:BTDA6VXW","schema_version":"1.0","canonical_sha256":"0cc60f56f6be41d3c7b829236b5373a90f17add2c2c11fc9408764e9c78ea3bc","source":{"kind":"arxiv","id":"1301.4952","version":2},"attestation_state":"computed","paper":{"title":"Single and multiple consecutive permutation motif search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adeline Pierrot, Djamal Belazzougui, Mathieu Raffinot, St\\'ephane Vialette","submitted_at":"2013-01-21T18:33:06Z","abstract_excerpt":"Let $t$ be a permutation (that shall play the role of the {\\em text}) on $[n]$ and a pattern $p$ be a sequence of $m$ distinct integer(s) of $[n]$, $m\\leq n$. The pattern $p$ occurs in $t$ in position $i$ if and only if $p_1... p_m$ is order-isomorphic to $t_i... t_{i+m-1}$, that is, for all $1 \\leq k< \\ell \\leq m$, $p_k>p_\\ell$ if and only if $t_{i+k-1}>t_{i+\\ell-1}$. Searching for a pattern $p$ in a text $t$ consists in identifying all occurrences of $p$ in $t$. We first present a forward automaton which allows us to search for $p$ in $t$ in $O(m^2\\log \\log m +n)$ time. We then introduce a M"},"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":"1301.4952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-21T18:33:06Z","cross_cats_sorted":[],"title_canon_sha256":"aa2a9305f793c4e0bdde3db75f51bec988eef09b1ad68cde4f9aff4174a8a840","abstract_canon_sha256":"1f7873221f1ef548f379d537253b7563c2637e06897f3f71062e8040fb41aecd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:03.088414Z","signature_b64":"+5OJBcQIWdVK39XFFkMSFafsGityQH6UI9Lc7h4ay2K56qi43SS9wMO2r1UyuAocUx8/QvoMo3QLnnLpNXkiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc60f56f6be41d3c7b829236b5373a90f17add2c2c11fc9408764e9c78ea3bc","last_reissued_at":"2026-05-18T03:27:03.087844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:03.087844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single and multiple consecutive permutation motif search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adeline Pierrot, Djamal Belazzougui, Mathieu Raffinot, St\\'ephane Vialette","submitted_at":"2013-01-21T18:33:06Z","abstract_excerpt":"Let $t$ be a permutation (that shall play the role of the {\\em text}) on $[n]$ and a pattern $p$ be a sequence of $m$ distinct integer(s) of $[n]$, $m\\leq n$. The pattern $p$ occurs in $t$ in position $i$ if and only if $p_1... p_m$ is order-isomorphic to $t_i... t_{i+m-1}$, that is, for all $1 \\leq k< \\ell \\leq m$, $p_k>p_\\ell$ if and only if $t_{i+k-1}>t_{i+\\ell-1}$. Searching for a pattern $p$ in a text $t$ consists in identifying all occurrences of $p$ in $t$. We first present a forward automaton which allows us to search for $p$ in $t$ in $O(m^2\\log \\log m +n)$ time. We then introduce a M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4952","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.4952","created_at":"2026-05-18T03:27:03.087935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4952v2","created_at":"2026-05-18T03:27:03.087935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4952","created_at":"2026-05-18T03:27:03.087935+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTDA6VXWXZA5","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTDA6VXWXZA5HR5Y","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTDA6VXW","created_at":"2026-05-18T12:27:40.988391+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/BTDA6VXWXZA5HR5YFERWWU3TVE","json":"https://pith.science/pith/BTDA6VXWXZA5HR5YFERWWU3TVE.json","graph_json":"https://pith.science/api/pith-number/BTDA6VXWXZA5HR5YFERWWU3TVE/graph.json","events_json":"https://pith.science/api/pith-number/BTDA6VXWXZA5HR5YFERWWU3TVE/events.json","paper":"https://pith.science/paper/BTDA6VXW"},"agent_actions":{"view_html":"https://pith.science/pith/BTDA6VXWXZA5HR5YFERWWU3TVE","download_json":"https://pith.science/pith/BTDA6VXWXZA5HR5YFERWWU3TVE.json","view_paper":"https://pith.science/paper/BTDA6VXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4952&json=true","fetch_graph":"https://pith.science/api/pith-number/BTDA6VXWXZA5HR5YFERWWU3TVE/graph.json","fetch_events":"https://pith.science/api/pith-number/BTDA6VXWXZA5HR5YFERWWU3TVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTDA6VXWXZA5HR5YFERWWU3TVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTDA6VXWXZA5HR5YFERWWU3TVE/action/storage_attestation","attest_author":"https://pith.science/pith/BTDA6VXWXZA5HR5YFERWWU3TVE/action/author_attestation","sign_citation":"https://pith.science/pith/BTDA6VXWXZA5HR5YFERWWU3TVE/action/citation_signature","submit_replication":"https://pith.science/pith/BTDA6VXWXZA5HR5YFERWWU3TVE/action/replication_record"}},"created_at":"2026-05-18T03:27:03.087935+00:00","updated_at":"2026-05-18T03:27:03.087935+00:00"}