{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:G7SBFLPIYGSMINOABK2RD42D4K","short_pith_number":"pith:G7SBFLPI","schema_version":"1.0","canonical_sha256":"37e412ade8c1a4c435c00ab511f343e2aa69f22a1d58e91f5e84d405f348c6b7","source":{"kind":"arxiv","id":"1011.3491","version":2},"attestation_state":"computed","paper":{"title":"Pattern Kits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Juha K\\\"arkk\\\"ainen, Kalle Karhu, Leena Salmela, Travis Gagie, Veli M\\\"akinen","submitted_at":"2010-11-15T20:21:33Z","abstract_excerpt":"Suppose we have just performed searches in a self-index for two patterns $A$ and $B$ and now we want to search for their concatenation \\A B); how can we best make use of our previous computations? In this paper we consider this problem and, more generally, how we can store a dynamic library of patterns that we can easily manipulate in interesting ways. We give a space- and time-efficient data structure for this problem that is compatible with many of the best self-indexes."},"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":"1011.3491","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-15T20:21:33Z","cross_cats_sorted":[],"title_canon_sha256":"1cad529f4f9974b8d2b479cd6f383c60548d680613c7aab74e24b23cf1587263","abstract_canon_sha256":"e029f73e263f721c103483b40c1cc970baa3f6f0038c1ad6aa6b158901754a4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:11.110230Z","signature_b64":"JjES3CVTytkKU951FEcHDr1ILAZVPaSAOSGCV0m8zDG0e5Bl0VrXlhVRoUj9uxEe8BzUT6LqNnTYW+ez7UAoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37e412ade8c1a4c435c00ab511f343e2aa69f22a1d58e91f5e84d405f348c6b7","last_reissued_at":"2026-05-18T04:25:11.109703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:11.109703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pattern Kits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Juha K\\\"arkk\\\"ainen, Kalle Karhu, Leena Salmela, Travis Gagie, Veli M\\\"akinen","submitted_at":"2010-11-15T20:21:33Z","abstract_excerpt":"Suppose we have just performed searches in a self-index for two patterns $A$ and $B$ and now we want to search for their concatenation \\A B); how can we best make use of our previous computations? In this paper we consider this problem and, more generally, how we can store a dynamic library of patterns that we can easily manipulate in interesting ways. We give a space- and time-efficient data structure for this problem that is compatible with many of the best self-indexes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3491","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":"1011.3491","created_at":"2026-05-18T04:25:11.109797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3491v2","created_at":"2026-05-18T04:25:11.109797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3491","created_at":"2026-05-18T04:25:11.109797+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7SBFLPIYGSM","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7SBFLPIYGSMINOA","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7SBFLPI","created_at":"2026-05-18T12:26:07.630475+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/G7SBFLPIYGSMINOABK2RD42D4K","json":"https://pith.science/pith/G7SBFLPIYGSMINOABK2RD42D4K.json","graph_json":"https://pith.science/api/pith-number/G7SBFLPIYGSMINOABK2RD42D4K/graph.json","events_json":"https://pith.science/api/pith-number/G7SBFLPIYGSMINOABK2RD42D4K/events.json","paper":"https://pith.science/paper/G7SBFLPI"},"agent_actions":{"view_html":"https://pith.science/pith/G7SBFLPIYGSMINOABK2RD42D4K","download_json":"https://pith.science/pith/G7SBFLPIYGSMINOABK2RD42D4K.json","view_paper":"https://pith.science/paper/G7SBFLPI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3491&json=true","fetch_graph":"https://pith.science/api/pith-number/G7SBFLPIYGSMINOABK2RD42D4K/graph.json","fetch_events":"https://pith.science/api/pith-number/G7SBFLPIYGSMINOABK2RD42D4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7SBFLPIYGSMINOABK2RD42D4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7SBFLPIYGSMINOABK2RD42D4K/action/storage_attestation","attest_author":"https://pith.science/pith/G7SBFLPIYGSMINOABK2RD42D4K/action/author_attestation","sign_citation":"https://pith.science/pith/G7SBFLPIYGSMINOABK2RD42D4K/action/citation_signature","submit_replication":"https://pith.science/pith/G7SBFLPIYGSMINOABK2RD42D4K/action/replication_record"}},"created_at":"2026-05-18T04:25:11.109797+00:00","updated_at":"2026-05-18T04:25:11.109797+00:00"}