{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XTRV42GJYMZPZTPRJMKZFWUXKG","short_pith_number":"pith:XTRV42GJ","schema_version":"1.0","canonical_sha256":"bce35e68c9c332fccdf14b1592da9751a2adf2093e1f4dca6d5da074b2a85957","source":{"kind":"arxiv","id":"1704.07625","version":2},"attestation_state":"computed","paper":{"title":"Indexing Weighted Sequences: Neat and Efficient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Barton, Chang Liu, Jakub Radoszewski, Solon P. Pissis, Tomasz Kociumaka","submitted_at":"2017-04-25T10:46:49Z","abstract_excerpt":"In a \\emph{weighted sequence}, for every position of the sequence and every letter of the alphabet a probability of occurrence of this letter at this position is specified. Weighted sequences are commonly used to represent imprecise or uncertain data, for example, in molecular biology where they are known under the name of Position-Weight Matrices. Given a probability threshold $\\frac1z$, we say that a string $P$ of length $m$ occurs in a weighted sequence $X$ at position $i$ if the product of probabilities of the letters of $P$ at positions $i,\\ldots,i+m-1$ in $X$ is at least $\\frac1z$. In th"},"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":"1704.07625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-25T10:46:49Z","cross_cats_sorted":[],"title_canon_sha256":"cb7ed8136b84e5be5c2b6d3b134b3d35aa22bc4d15cb63dd3d91bc46fd5a5921","abstract_canon_sha256":"d6704c95a09feb31e14922d865640d1a61424a7c0b0b537d23ceb314507f9bb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:43.240589Z","signature_b64":"7F020/iWxGPLlzAP43OXy54eHJzeAsUNTv5zMucT9GWzfZ2wXdN0NkiyLfACL6lj+ajzkaPtzK/VTipi90A6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bce35e68c9c332fccdf14b1592da9751a2adf2093e1f4dca6d5da074b2a85957","last_reissued_at":"2026-05-18T00:36:43.239968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:43.239968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indexing Weighted Sequences: Neat and Efficient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Barton, Chang Liu, Jakub Radoszewski, Solon P. Pissis, Tomasz Kociumaka","submitted_at":"2017-04-25T10:46:49Z","abstract_excerpt":"In a \\emph{weighted sequence}, for every position of the sequence and every letter of the alphabet a probability of occurrence of this letter at this position is specified. Weighted sequences are commonly used to represent imprecise or uncertain data, for example, in molecular biology where they are known under the name of Position-Weight Matrices. Given a probability threshold $\\frac1z$, we say that a string $P$ of length $m$ occurs in a weighted sequence $X$ at position $i$ if the product of probabilities of the letters of $P$ at positions $i,\\ldots,i+m-1$ in $X$ is at least $\\frac1z$. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07625","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":"1704.07625","created_at":"2026-05-18T00:36:43.240053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07625v2","created_at":"2026-05-18T00:36:43.240053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07625","created_at":"2026-05-18T00:36:43.240053+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTRV42GJYMZP","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTRV42GJYMZPZTPR","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTRV42GJ","created_at":"2026-05-18T12:31:56.362134+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/XTRV42GJYMZPZTPRJMKZFWUXKG","json":"https://pith.science/pith/XTRV42GJYMZPZTPRJMKZFWUXKG.json","graph_json":"https://pith.science/api/pith-number/XTRV42GJYMZPZTPRJMKZFWUXKG/graph.json","events_json":"https://pith.science/api/pith-number/XTRV42GJYMZPZTPRJMKZFWUXKG/events.json","paper":"https://pith.science/paper/XTRV42GJ"},"agent_actions":{"view_html":"https://pith.science/pith/XTRV42GJYMZPZTPRJMKZFWUXKG","download_json":"https://pith.science/pith/XTRV42GJYMZPZTPRJMKZFWUXKG.json","view_paper":"https://pith.science/paper/XTRV42GJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07625&json=true","fetch_graph":"https://pith.science/api/pith-number/XTRV42GJYMZPZTPRJMKZFWUXKG/graph.json","fetch_events":"https://pith.science/api/pith-number/XTRV42GJYMZPZTPRJMKZFWUXKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTRV42GJYMZPZTPRJMKZFWUXKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTRV42GJYMZPZTPRJMKZFWUXKG/action/storage_attestation","attest_author":"https://pith.science/pith/XTRV42GJYMZPZTPRJMKZFWUXKG/action/author_attestation","sign_citation":"https://pith.science/pith/XTRV42GJYMZPZTPRJMKZFWUXKG/action/citation_signature","submit_replication":"https://pith.science/pith/XTRV42GJYMZPZTPRJMKZFWUXKG/action/replication_record"}},"created_at":"2026-05-18T00:36:43.240053+00:00","updated_at":"2026-05-18T00:36:43.240053+00:00"}