{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5CL47J63XYXKX7LNKQU2ZDXFR4","short_pith_number":"pith:5CL47J63","schema_version":"1.0","canonical_sha256":"e897cfa7dbbe2eabfd6d5429ac8ee58f3d14f9fb1978a24e35cd955a8d9d13b6","source":{"kind":"arxiv","id":"1102.1746","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Jumbled Pattern Matching in Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ferdinando Cicalese, Gabriele Fici, P\\'eter Burcsi, Zsuzsanna Lipt\\'ak","submitted_at":"2011-02-08T23:11:17Z","abstract_excerpt":"The Parikh vector p(s) of a string s is defined as the vector of multiplicities of the characters. Parikh vector q occurs in s if s has a substring t with p(t)=q. We present two novel algorithms for searching for a query q in a text s. One solves the decision problem over a binary text in constant time, using a linear size index of the text. The second algorithm, for a general finite alphabet, finds all occurrences of a given Parikh vector q and has sub-linear expected time complexity; we present two variants, which both use a linear size index of the text."},"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":"1102.1746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-08T23:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"7a9b20a521c5452ec43a6902edd920194e2f0fbaddd6f3ef378c83dd5f68a2c3","abstract_canon_sha256":"3dde3554479d6c280b9749c847d31ae8164b3ab16e0dd4ac37026c7d0ef04867"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:39.477470Z","signature_b64":"tjyH4AKODJHxQA5+LAQXJZRhslsfDTthfvfAg1B+ajRsGnmkZnwqzJ3KKH958bth+n8sI53sl9WxqEgig9xuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e897cfa7dbbe2eabfd6d5429ac8ee58f3d14f9fb1978a24e35cd955a8d9d13b6","last_reissued_at":"2026-05-18T02:22:39.476724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:39.476724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Jumbled Pattern Matching in Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ferdinando Cicalese, Gabriele Fici, P\\'eter Burcsi, Zsuzsanna Lipt\\'ak","submitted_at":"2011-02-08T23:11:17Z","abstract_excerpt":"The Parikh vector p(s) of a string s is defined as the vector of multiplicities of the characters. Parikh vector q occurs in s if s has a substring t with p(t)=q. We present two novel algorithms for searching for a query q in a text s. One solves the decision problem over a binary text in constant time, using a linear size index of the text. The second algorithm, for a general finite alphabet, finds all occurrences of a given Parikh vector q and has sub-linear expected time complexity; we present two variants, which both use a linear size index of the text."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1746","kind":"arxiv","version":1},"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":"1102.1746","created_at":"2026-05-18T02:22:39.476827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1746v1","created_at":"2026-05-18T02:22:39.476827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1746","created_at":"2026-05-18T02:22:39.476827+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CL47J63XYXK","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CL47J63XYXKX7LN","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CL47J63","created_at":"2026-05-18T12:26:20.644004+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/5CL47J63XYXKX7LNKQU2ZDXFR4","json":"https://pith.science/pith/5CL47J63XYXKX7LNKQU2ZDXFR4.json","graph_json":"https://pith.science/api/pith-number/5CL47J63XYXKX7LNKQU2ZDXFR4/graph.json","events_json":"https://pith.science/api/pith-number/5CL47J63XYXKX7LNKQU2ZDXFR4/events.json","paper":"https://pith.science/paper/5CL47J63"},"agent_actions":{"view_html":"https://pith.science/pith/5CL47J63XYXKX7LNKQU2ZDXFR4","download_json":"https://pith.science/pith/5CL47J63XYXKX7LNKQU2ZDXFR4.json","view_paper":"https://pith.science/paper/5CL47J63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1746&json=true","fetch_graph":"https://pith.science/api/pith-number/5CL47J63XYXKX7LNKQU2ZDXFR4/graph.json","fetch_events":"https://pith.science/api/pith-number/5CL47J63XYXKX7LNKQU2ZDXFR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CL47J63XYXKX7LNKQU2ZDXFR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CL47J63XYXKX7LNKQU2ZDXFR4/action/storage_attestation","attest_author":"https://pith.science/pith/5CL47J63XYXKX7LNKQU2ZDXFR4/action/author_attestation","sign_citation":"https://pith.science/pith/5CL47J63XYXKX7LNKQU2ZDXFR4/action/citation_signature","submit_replication":"https://pith.science/pith/5CL47J63XYXKX7LNKQU2ZDXFR4/action/replication_record"}},"created_at":"2026-05-18T02:22:39.476827+00:00","updated_at":"2026-05-18T02:22:39.476827+00:00"}