{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BCCKE7BQ7OAHHZ7RN6JJ3CFCBH","short_pith_number":"pith:BCCKE7BQ","canonical_record":{"source":{"id":"1702.01280","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-04T12:15:06Z","cross_cats_sorted":[],"title_canon_sha256":"68a9cd7c9a9f3b47e7866181192c9a656b2eddee04c2c84c03a8b3c9da959f19","abstract_canon_sha256":"23c7c35699bb9c172eaecfeeb963d007e4123aa47729c4dc831cfcd3bb6b35af"},"schema_version":"1.0"},"canonical_sha256":"0884a27c30fb8073e7f16f929d88a209c9e6c3daa507b2a1d3b05a279d62885f","source":{"kind":"arxiv","id":"1702.01280","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01280","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01280v2","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01280","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"BCCKE7BQ7OAH","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BCCKE7BQ7OAHHZ7R","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BCCKE7BQ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BCCKE7BQ7OAHHZ7RN6JJ3CFCBH","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01280","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-04T12:15:06Z","cross_cats_sorted":[],"title_canon_sha256":"68a9cd7c9a9f3b47e7866181192c9a656b2eddee04c2c84c03a8b3c9da959f19","abstract_canon_sha256":"23c7c35699bb9c172eaecfeeb963d007e4123aa47729c4dc831cfcd3bb6b35af"},"schema_version":"1.0"},"canonical_sha256":"0884a27c30fb8073e7f16f929d88a209c9e6c3daa507b2a1d3b05a279d62885f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:51.670421Z","signature_b64":"OHu1fns9zxI4yruIcIXZLdsPWU0m/T4C1JpabBOnsUbyJnGAXBJ9Wx7qrej2m2lJpvC9K5mG+gbkxKkyBwQ4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0884a27c30fb8073e7f16f929d88a209c9e6c3daa507b2a1d3b05a279d62885f","last_reissued_at":"2026-05-18T00:50:51.669942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:51.669942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01280","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"198i3vpFIPkrPZIxxeTByyE2j5gJ9ZkIa2L6biN3eEunbRmNN5uLdf0V6nTOEAoO4461z7r+jXDmjJW0I1YtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:38:10.335622Z"},"content_sha256":"364de6beb636e36e9bc14876f83b6e9b13faf7415e8f2e4fa78e0e46bcab31c9","schema_version":"1.0","event_id":"sha256:364de6beb636e36e9bc14876f83b6e9b13faf7415e8f2e4fa78e0e46bcab31c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BCCKE7BQ7OAHHZ7RN6JJ3CFCBH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Simple Jumbled Indexing for Binary RLE Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jens Stoye, Lu\\'is Cunha, Luis Kowada, Roland Wittler, Simone Dantas, Travis Gagie","submitted_at":"2017-02-04T12:15:06Z","abstract_excerpt":"Important papers have appeared recently on the problem of indexing binary strings for jumbled pattern matching, and further lowering the time bounds in terms of the input size would now be a breakthrough with broad implications. We can still make progress on the problem, however, by considering other natural parameters. Badkobeh et al.\\ (IPL, 2013) and Amir et al.\\ (TCS, 2016) gave algorithms that index a binary string in $O (n + \\rho^2 \\log \\rho)$ time, where $n$ is the length and $\\rho$ is the number of runs, and Giaquinta and Grabowski (IPL, 2013) gave one that runs in $O (n + \\rho^2)$ time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01280","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSEQPZenh7n6V7EPDOxSovG3aQ2IHxWL3gzjQKDFAjkU/EJt2NfQArXNvQbmezfq2TcqV45i8zYYo1EOkqmEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:38:10.336261Z"},"content_sha256":"12d71737d8b1023b9d5962675b7cf581e58db5540a07f06aa4b30de0b07df5db","schema_version":"1.0","event_id":"sha256:12d71737d8b1023b9d5962675b7cf581e58db5540a07f06aa4b30de0b07df5db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCCKE7BQ7OAHHZ7RN6JJ3CFCBH/bundle.json","state_url":"https://pith.science/pith/BCCKE7BQ7OAHHZ7RN6JJ3CFCBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCCKE7BQ7OAHHZ7RN6JJ3CFCBH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T22:38:10Z","links":{"resolver":"https://pith.science/pith/BCCKE7BQ7OAHHZ7RN6JJ3CFCBH","bundle":"https://pith.science/pith/BCCKE7BQ7OAHHZ7RN6JJ3CFCBH/bundle.json","state":"https://pith.science/pith/BCCKE7BQ7OAHHZ7RN6JJ3CFCBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCCKE7BQ7OAHHZ7RN6JJ3CFCBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BCCKE7BQ7OAHHZ7RN6JJ3CFCBH","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":"23c7c35699bb9c172eaecfeeb963d007e4123aa47729c4dc831cfcd3bb6b35af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-04T12:15:06Z","title_canon_sha256":"68a9cd7c9a9f3b47e7866181192c9a656b2eddee04c2c84c03a8b3c9da959f19"},"schema_version":"1.0","source":{"id":"1702.01280","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01280","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01280v2","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01280","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"BCCKE7BQ7OAH","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BCCKE7BQ7OAHHZ7R","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BCCKE7BQ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:12d71737d8b1023b9d5962675b7cf581e58db5540a07f06aa4b30de0b07df5db","target":"graph","created_at":"2026-05-18T00:50:51Z","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":"Important papers have appeared recently on the problem of indexing binary strings for jumbled pattern matching, and further lowering the time bounds in terms of the input size would now be a breakthrough with broad implications. We can still make progress on the problem, however, by considering other natural parameters. Badkobeh et al.\\ (IPL, 2013) and Amir et al.\\ (TCS, 2016) gave algorithms that index a binary string in $O (n + \\rho^2 \\log \\rho)$ time, where $n$ is the length and $\\rho$ is the number of runs, and Giaquinta and Grabowski (IPL, 2013) gave one that runs in $O (n + \\rho^2)$ time","authors_text":"Jens Stoye, Lu\\'is Cunha, Luis Kowada, Roland Wittler, Simone Dantas, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-04T12:15:06Z","title":"Fast and Simple Jumbled Indexing for Binary RLE Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01280","kind":"arxiv","version":2},"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:364de6beb636e36e9bc14876f83b6e9b13faf7415e8f2e4fa78e0e46bcab31c9","target":"record","created_at":"2026-05-18T00:50:51Z","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":"23c7c35699bb9c172eaecfeeb963d007e4123aa47729c4dc831cfcd3bb6b35af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-04T12:15:06Z","title_canon_sha256":"68a9cd7c9a9f3b47e7866181192c9a656b2eddee04c2c84c03a8b3c9da959f19"},"schema_version":"1.0","source":{"id":"1702.01280","kind":"arxiv","version":2}},"canonical_sha256":"0884a27c30fb8073e7f16f929d88a209c9e6c3daa507b2a1d3b05a279d62885f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0884a27c30fb8073e7f16f929d88a209c9e6c3daa507b2a1d3b05a279d62885f","first_computed_at":"2026-05-18T00:50:51.669942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:51.669942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OHu1fns9zxI4yruIcIXZLdsPWU0m/T4C1JpabBOnsUbyJnGAXBJ9Wx7qrej2m2lJpvC9K5mG+gbkxKkyBwQ4DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:51.670421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01280","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:364de6beb636e36e9bc14876f83b6e9b13faf7415e8f2e4fa78e0e46bcab31c9","sha256:12d71737d8b1023b9d5962675b7cf581e58db5540a07f06aa4b30de0b07df5db"],"state_sha256":"36c531e728e3c6956411645049eefc7eade5597e7630c92e14e6ff3654296ef2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZ61hYk03NFF3SJSB7Y8Rnu3fsNTiJivjHBJWB2RAnDrIxEaUDsPb5OtPsK2FvQz7BJ4C5OUQ1KW/lUk/JxpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:38:10.339255Z","bundle_sha256":"a615f08a5426e680251202109c98026770dfd44b1c5d9336491c745924d84ee9"}}