{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:D3GUGO7IYPB4427EY7WDJ2FB7T","short_pith_number":"pith:D3GUGO7I","schema_version":"1.0","canonical_sha256":"1ecd433be8c3c3ce6be4c7ec34e8a1fcf6b6095fb3ab1706ee9a5d0ab39d9429","source":{"kind":"arxiv","id":"1606.05724","version":3},"attestation_state":"computed","paper":{"title":"A Compact Index for Order-Preserving Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gianni Decaroli, Giovanni Manzini, Travis Gagie","submitted_at":"2016-06-18T07:30:59Z","abstract_excerpt":"Order-preserving pattern matching was introduced recently but it has already attracted much attention. Given a reference sequence and a pattern, we want to locate all substrings of the reference sequence whose elements have the same relative order as the pattern elements. For this problem we consider the offline version in which we build an index for the reference sequence so that subsequent searches can be completed very efficiently. We propose a space-efficient index that works well in practice despite its lack of good worst-case time bounds. Our solution is based on the new approach of deco"},"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":"1606.05724","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-18T07:30:59Z","cross_cats_sorted":[],"title_canon_sha256":"bb43ca7f8f46a8e88a4f3264cb91c8f42ce5fc995a39a89d2f0b5e8f50e83448","abstract_canon_sha256":"d181b16da156de85f4a8b00ce45a2039961bd97cb84fb639805422b745472de5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:50.516684Z","signature_b64":"xqS84g+K04K7xT2wVJhjipYlz0ecugAU3FnoSS8MQ3j2S34PP+T032DmsicH3OObcP4ZP+7Jrxp0OrGev/iOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ecd433be8c3c3ce6be4c7ec34e8a1fcf6b6095fb3ab1706ee9a5d0ab39d9429","last_reissued_at":"2026-05-17T23:58:50.516167Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:50.516167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Compact Index for Order-Preserving Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gianni Decaroli, Giovanni Manzini, Travis Gagie","submitted_at":"2016-06-18T07:30:59Z","abstract_excerpt":"Order-preserving pattern matching was introduced recently but it has already attracted much attention. Given a reference sequence and a pattern, we want to locate all substrings of the reference sequence whose elements have the same relative order as the pattern elements. For this problem we consider the offline version in which we build an index for the reference sequence so that subsequent searches can be completed very efficiently. We propose a space-efficient index that works well in practice despite its lack of good worst-case time bounds. Our solution is based on the new approach of deco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05724","kind":"arxiv","version":3},"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":"1606.05724","created_at":"2026-05-17T23:58:50.516255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05724v3","created_at":"2026-05-17T23:58:50.516255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05724","created_at":"2026-05-17T23:58:50.516255+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3GUGO7IYPB4","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3GUGO7IYPB4427E","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3GUGO7I","created_at":"2026-05-18T12:30:09.641336+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/D3GUGO7IYPB4427EY7WDJ2FB7T","json":"https://pith.science/pith/D3GUGO7IYPB4427EY7WDJ2FB7T.json","graph_json":"https://pith.science/api/pith-number/D3GUGO7IYPB4427EY7WDJ2FB7T/graph.json","events_json":"https://pith.science/api/pith-number/D3GUGO7IYPB4427EY7WDJ2FB7T/events.json","paper":"https://pith.science/paper/D3GUGO7I"},"agent_actions":{"view_html":"https://pith.science/pith/D3GUGO7IYPB4427EY7WDJ2FB7T","download_json":"https://pith.science/pith/D3GUGO7IYPB4427EY7WDJ2FB7T.json","view_paper":"https://pith.science/paper/D3GUGO7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05724&json=true","fetch_graph":"https://pith.science/api/pith-number/D3GUGO7IYPB4427EY7WDJ2FB7T/graph.json","fetch_events":"https://pith.science/api/pith-number/D3GUGO7IYPB4427EY7WDJ2FB7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3GUGO7IYPB4427EY7WDJ2FB7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3GUGO7IYPB4427EY7WDJ2FB7T/action/storage_attestation","attest_author":"https://pith.science/pith/D3GUGO7IYPB4427EY7WDJ2FB7T/action/author_attestation","sign_citation":"https://pith.science/pith/D3GUGO7IYPB4427EY7WDJ2FB7T/action/citation_signature","submit_replication":"https://pith.science/pith/D3GUGO7IYPB4427EY7WDJ2FB7T/action/replication_record"}},"created_at":"2026-05-17T23:58:50.516255+00:00","updated_at":"2026-05-17T23:58:50.516255+00:00"}