{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RA5E3NHYR3XC5VI3J5S4GECUG7","short_pith_number":"pith:RA5E3NHY","schema_version":"1.0","canonical_sha256":"883a4db4f88eee2ed51b4f65c3105437cb3007ffdd886d522f821f3cb047da61","source":{"kind":"arxiv","id":"1210.8386","version":3},"attestation_state":"computed","paper":{"title":"Grammar-Based Construction of Indexes for Binary Jumbled Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Travis Gagie","submitted_at":"2012-10-31T16:45:08Z","abstract_excerpt":"We show how, given a straight-line program with $g$ rules for a binary string $B$ of length $n$, in $O(g^{2 / 3} n^{4 / 3})$ time we can build a linear-space index such that, given $m$ and $c$, in O(1) time we can determine whether there is a substring of $B$ with length $m$ containing exactly $c$ copies of 1. If we use $O(n \\log n)$ space for the index, then we can list all such substrings using $O(m)$ time per substring."},"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.8386","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-31T16:45:08Z","cross_cats_sorted":[],"title_canon_sha256":"90e1e9bda15930bdb1baa0ee5801b35cf311ae79115d9d87bd8873b6d2e03544","abstract_canon_sha256":"ddd9dbb1db1f99bfa286f4b704a58b26ebe41703b10a866c6e29d0c37862f969"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:48.926908Z","signature_b64":"928Ts+5IYI+UJkeE5IHoDccX6ZIFKA/onBctfB+/qVsOBYyGA6TL1F/48PJ+HwnUxwQkaunoXomak3gv/II0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"883a4db4f88eee2ed51b4f65c3105437cb3007ffdd886d522f821f3cb047da61","last_reissued_at":"2026-05-18T03:40:48.926106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:48.926106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Grammar-Based Construction of Indexes for Binary Jumbled Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Travis Gagie","submitted_at":"2012-10-31T16:45:08Z","abstract_excerpt":"We show how, given a straight-line program with $g$ rules for a binary string $B$ of length $n$, in $O(g^{2 / 3} n^{4 / 3})$ time we can build a linear-space index such that, given $m$ and $c$, in O(1) time we can determine whether there is a substring of $B$ with length $m$ containing exactly $c$ copies of 1. If we use $O(n \\log n)$ space for the index, then we can list all such substrings using $O(m)$ time per substring."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8386","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":"1210.8386","created_at":"2026-05-18T03:40:48.926233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8386v3","created_at":"2026-05-18T03:40:48.926233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8386","created_at":"2026-05-18T03:40:48.926233+00:00"},{"alias_kind":"pith_short_12","alias_value":"RA5E3NHYR3XC","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RA5E3NHYR3XC5VI3","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RA5E3NHY","created_at":"2026-05-18T12:27:20.899486+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/RA5E3NHYR3XC5VI3J5S4GECUG7","json":"https://pith.science/pith/RA5E3NHYR3XC5VI3J5S4GECUG7.json","graph_json":"https://pith.science/api/pith-number/RA5E3NHYR3XC5VI3J5S4GECUG7/graph.json","events_json":"https://pith.science/api/pith-number/RA5E3NHYR3XC5VI3J5S4GECUG7/events.json","paper":"https://pith.science/paper/RA5E3NHY"},"agent_actions":{"view_html":"https://pith.science/pith/RA5E3NHYR3XC5VI3J5S4GECUG7","download_json":"https://pith.science/pith/RA5E3NHYR3XC5VI3J5S4GECUG7.json","view_paper":"https://pith.science/paper/RA5E3NHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8386&json=true","fetch_graph":"https://pith.science/api/pith-number/RA5E3NHYR3XC5VI3J5S4GECUG7/graph.json","fetch_events":"https://pith.science/api/pith-number/RA5E3NHYR3XC5VI3J5S4GECUG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RA5E3NHYR3XC5VI3J5S4GECUG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RA5E3NHYR3XC5VI3J5S4GECUG7/action/storage_attestation","attest_author":"https://pith.science/pith/RA5E3NHYR3XC5VI3J5S4GECUG7/action/author_attestation","sign_citation":"https://pith.science/pith/RA5E3NHYR3XC5VI3J5S4GECUG7/action/citation_signature","submit_replication":"https://pith.science/pith/RA5E3NHYR3XC5VI3J5S4GECUG7/action/replication_record"}},"created_at":"2026-05-18T03:40:48.926233+00:00","updated_at":"2026-05-18T03:40:48.926233+00:00"}