{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RA5E3NHYR3XC5VI3J5S4GECUG7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ddd9dbb1db1f99bfa286f4b704a58b26ebe41703b10a866c6e29d0c37862f969","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-31T16:45:08Z","title_canon_sha256":"90e1e9bda15930bdb1baa0ee5801b35cf311ae79115d9d87bd8873b6d2e03544"},"schema_version":"1.0","source":{"id":"1210.8386","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8386","created_at":"2026-05-18T03:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8386v3","created_at":"2026-05-18T03:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8386","created_at":"2026-05-18T03:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"RA5E3NHYR3XC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RA5E3NHYR3XC5VI3","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RA5E3NHY","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:7837a4caad7a831dee5d99549782b6476268d72aed2dbf1618fbecd91d85aeac","target":"graph","created_at":"2026-05-18T03:40:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-31T16:45:08Z","title":"Grammar-Based Construction of Indexes for Binary Jumbled Pattern Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8386","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9e6f8e0f2f4ea5a6dd9794c177e9fe18e02071638669c85292123fefa6f8688e","target":"record","created_at":"2026-05-18T03:40:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ddd9dbb1db1f99bfa286f4b704a58b26ebe41703b10a866c6e29d0c37862f969","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-31T16:45:08Z","title_canon_sha256":"90e1e9bda15930bdb1baa0ee5801b35cf311ae79115d9d87bd8873b6d2e03544"},"schema_version":"1.0","source":{"id":"1210.8386","kind":"arxiv","version":3}},"canonical_sha256":"883a4db4f88eee2ed51b4f65c3105437cb3007ffdd886d522f821f3cb047da61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"883a4db4f88eee2ed51b4f65c3105437cb3007ffdd886d522f821f3cb047da61","first_computed_at":"2026-05-18T03:40:48.926106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:48.926106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"928Ts+5IYI+UJkeE5IHoDccX6ZIFKA/onBctfB+/qVsOBYyGA6TL1F/48PJ+HwnUxwQkaunoXomak3gv/II0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:48.926908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.8386","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e6f8e0f2f4ea5a6dd9794c177e9fe18e02071638669c85292123fefa6f8688e","sha256:7837a4caad7a831dee5d99549782b6476268d72aed2dbf1618fbecd91d85aeac"],"state_sha256":"f6d1bdda29fb41a1ce8a29e0b9014e7e948ffba751882fb4d0f7e0bc3d155fef"}