{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BNPTJDE7G3XHS4D5BOV7NSMGDW","short_pith_number":"pith:BNPTJDE7","schema_version":"1.0","canonical_sha256":"0b5f348c9f36ee79707d0babf6c9861dbeae7035ef670561ca2702c31ed0e3fb","source":{"kind":"arxiv","id":"1210.6176","version":2},"attestation_state":"computed","paper":{"title":"New algorithms for binary jumbled pattern matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Emanuele Giaquinta, Szymon Grabowski","submitted_at":"2012-10-23T09:51:03Z","abstract_excerpt":"Given a pattern $P$ and a text $T$, both strings over a binary alphabet, the binary jumbled string matching problem consists in telling whether any permutation of $P$ occurs in $T$. The indexed version of this problem, i.e., preprocessing a string to efficiently answer such permutation queries, is hard and has been studied in the last few years. Currently the best bounds for this problem are $O(n^2/\\log^2 n)$ (with O(n) space and O(1) query time) and $O(r^2\\log r)$ (with O(|L|) space and $O(\\log|L|)$ query time), where $r$ is the length of the run-length encoding of $T$ and $|L| = O(n)$ is the"},"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":"1210.6176","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-23T09:51:03Z","cross_cats_sorted":[],"title_canon_sha256":"caeed9a9a7bd2bcdf8bebb0a467b048f6bdf2fc6f81df0d98c1f517ebbfd4ca2","abstract_canon_sha256":"8149d683c075ad85285c71f4f96c5ada0fe424569dedce7ad7595963d8bfe2f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:20.570575Z","signature_b64":"jw2xJJFHaZo6TfbBmSVvDaSK2DamhuHYSJd+oHdXUsSiSbkCtSbYVrNCtfodu5RZpqKu6PhEbjqmTFwtE11xAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b5f348c9f36ee79707d0babf6c9861dbeae7035ef670561ca2702c31ed0e3fb","last_reissued_at":"2026-05-18T03:26:20.569931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:20.569931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New algorithms for binary jumbled pattern matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Emanuele Giaquinta, Szymon Grabowski","submitted_at":"2012-10-23T09:51:03Z","abstract_excerpt":"Given a pattern $P$ and a text $T$, both strings over a binary alphabet, the binary jumbled string matching problem consists in telling whether any permutation of $P$ occurs in $T$. The indexed version of this problem, i.e., preprocessing a string to efficiently answer such permutation queries, is hard and has been studied in the last few years. Currently the best bounds for this problem are $O(n^2/\\log^2 n)$ (with O(n) space and O(1) query time) and $O(r^2\\log r)$ (with O(|L|) space and $O(\\log|L|)$ query time), where $r$ is the length of the run-length encoding of $T$ and $|L| = O(n)$ is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6176","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":"1210.6176","created_at":"2026-05-18T03:26:20.570039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6176v2","created_at":"2026-05-18T03:26:20.570039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6176","created_at":"2026-05-18T03:26:20.570039+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNPTJDE7G3XH","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNPTJDE7G3XHS4D5","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNPTJDE7","created_at":"2026-05-18T12:27:01.376967+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/BNPTJDE7G3XHS4D5BOV7NSMGDW","json":"https://pith.science/pith/BNPTJDE7G3XHS4D5BOV7NSMGDW.json","graph_json":"https://pith.science/api/pith-number/BNPTJDE7G3XHS4D5BOV7NSMGDW/graph.json","events_json":"https://pith.science/api/pith-number/BNPTJDE7G3XHS4D5BOV7NSMGDW/events.json","paper":"https://pith.science/paper/BNPTJDE7"},"agent_actions":{"view_html":"https://pith.science/pith/BNPTJDE7G3XHS4D5BOV7NSMGDW","download_json":"https://pith.science/pith/BNPTJDE7G3XHS4D5BOV7NSMGDW.json","view_paper":"https://pith.science/paper/BNPTJDE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6176&json=true","fetch_graph":"https://pith.science/api/pith-number/BNPTJDE7G3XHS4D5BOV7NSMGDW/graph.json","fetch_events":"https://pith.science/api/pith-number/BNPTJDE7G3XHS4D5BOV7NSMGDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNPTJDE7G3XHS4D5BOV7NSMGDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNPTJDE7G3XHS4D5BOV7NSMGDW/action/storage_attestation","attest_author":"https://pith.science/pith/BNPTJDE7G3XHS4D5BOV7NSMGDW/action/author_attestation","sign_citation":"https://pith.science/pith/BNPTJDE7G3XHS4D5BOV7NSMGDW/action/citation_signature","submit_replication":"https://pith.science/pith/BNPTJDE7G3XHS4D5BOV7NSMGDW/action/replication_record"}},"created_at":"2026-05-18T03:26:20.570039+00:00","updated_at":"2026-05-18T03:26:20.570039+00:00"}