{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IHWKL6FV4RDY27Z76MI3LVIGH7","short_pith_number":"pith:IHWKL6FV","canonical_record":{"source":{"id":"1405.0189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-01T15:30:37Z","cross_cats_sorted":[],"title_canon_sha256":"4aa9d0ea975ba1fd16c3465a97dcd7077eb5843bafb3f2c7eb60b464f464ef3a","abstract_canon_sha256":"cba8e5850c56251dff0b244888c1ee75867dc22701b1cc487619da7723ef8bba"},"schema_version":"1.0"},"canonical_sha256":"41eca5f8b5e4478d7f3ff311b5d5063fdc75b962d8916e3f0926415b3fa3e5f8","source":{"kind":"arxiv","id":"1405.0189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0189","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0189v1","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0189","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"IHWKL6FV4RDY","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IHWKL6FV4RDY27Z7","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IHWKL6FV","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IHWKL6FV4RDY27Z76MI3LVIGH7","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-01T15:30:37Z","cross_cats_sorted":[],"title_canon_sha256":"4aa9d0ea975ba1fd16c3465a97dcd7077eb5843bafb3f2c7eb60b464f464ef3a","abstract_canon_sha256":"cba8e5850c56251dff0b244888c1ee75867dc22701b1cc487619da7723ef8bba"},"schema_version":"1.0"},"canonical_sha256":"41eca5f8b5e4478d7f3ff311b5d5063fdc75b962d8916e3f0926415b3fa3e5f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:48.797536Z","signature_b64":"3I8LR48UB3TFO6xr4Y5jiVw5QWxRz1RZAAFFJIQ3rK96tHsMwpdLsYZZDUb6DKtCfTQpuNXrxvWMTdI0Ie3tDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41eca5f8b5e4478d7f3ff311b5d5063fdc75b962d8916e3f0926415b3fa3e5f8","last_reissued_at":"2026-05-18T02:52:48.797087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:48.797087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0189","source_version":1,"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-18T02:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+1/5nVL8YxnAhPTKir6nDbUdZa6rEt113n5j1it9C2X0J5k4ZLoJys1FzzcqIVYElUjM37/z2Xr3/MbSIAidAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:23:15.905033Z"},"content_sha256":"7aaa4da9a4d0dc279482d3de44258a8d59deaddfd076ae53808b2aabd7f748a8","schema_version":"1.0","event_id":"sha256:7aaa4da9a4d0dc279482d3de44258a8d59deaddfd076ae53808b2aabd7f748a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IHWKL6FV4RDY27Z76MI3LVIGH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Hardness of Jumbled Indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amihood Amir, Moshe Lewenstein, Noa Lewenstein, Timothy Chan","submitted_at":"2014-05-01T15:30:37Z","abstract_excerpt":"Jumbled indexing is the problem of indexing a text $T$ for queries that ask whether there is a substring of $T$ matching a pattern represented as a Parikh vector, i.e., the vector of frequency counts for each character. Jumbled indexing has garnered a lot of interest in the last four years. There is a naive algorithm that preprocesses all answers in $O(n^2|\\Sigma|)$ time allowing quick queries afterwards, and there is another naive algorithm that requires no preprocessing but has $O(n\\log|\\Sigma|)$ query time. Despite a tremendous amount of effort there has been little improvement over these r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0189","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"},"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-18T02:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hq1v5jgRISpcVOr2hnfEnFFuGwYoeY0l6aiX5Lm8lGVKpUciCQByNYSXuiB/OPU8RNcSmlwQKrJfUlI0n0HrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:23:15.905738Z"},"content_sha256":"b62e00e316238e7a0bf064601b94da2157285fa627a6397161570e901b7d9db5","schema_version":"1.0","event_id":"sha256:b62e00e316238e7a0bf064601b94da2157285fa627a6397161570e901b7d9db5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHWKL6FV4RDY27Z76MI3LVIGH7/bundle.json","state_url":"https://pith.science/pith/IHWKL6FV4RDY27Z76MI3LVIGH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHWKL6FV4RDY27Z76MI3LVIGH7/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-06-05T22:23:15Z","links":{"resolver":"https://pith.science/pith/IHWKL6FV4RDY27Z76MI3LVIGH7","bundle":"https://pith.science/pith/IHWKL6FV4RDY27Z76MI3LVIGH7/bundle.json","state":"https://pith.science/pith/IHWKL6FV4RDY27Z76MI3LVIGH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHWKL6FV4RDY27Z76MI3LVIGH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IHWKL6FV4RDY27Z76MI3LVIGH7","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":"cba8e5850c56251dff0b244888c1ee75867dc22701b1cc487619da7723ef8bba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-01T15:30:37Z","title_canon_sha256":"4aa9d0ea975ba1fd16c3465a97dcd7077eb5843bafb3f2c7eb60b464f464ef3a"},"schema_version":"1.0","source":{"id":"1405.0189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0189","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0189v1","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0189","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"IHWKL6FV4RDY","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IHWKL6FV4RDY27Z7","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IHWKL6FV","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:b62e00e316238e7a0bf064601b94da2157285fa627a6397161570e901b7d9db5","target":"graph","created_at":"2026-05-18T02:52: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":"Jumbled indexing is the problem of indexing a text $T$ for queries that ask whether there is a substring of $T$ matching a pattern represented as a Parikh vector, i.e., the vector of frequency counts for each character. Jumbled indexing has garnered a lot of interest in the last four years. There is a naive algorithm that preprocesses all answers in $O(n^2|\\Sigma|)$ time allowing quick queries afterwards, and there is another naive algorithm that requires no preprocessing but has $O(n\\log|\\Sigma|)$ query time. Despite a tremendous amount of effort there has been little improvement over these r","authors_text":"Amihood Amir, Moshe Lewenstein, Noa Lewenstein, Timothy Chan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-01T15:30:37Z","title":"On Hardness of Jumbled Indexing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0189","kind":"arxiv","version":1},"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:7aaa4da9a4d0dc279482d3de44258a8d59deaddfd076ae53808b2aabd7f748a8","target":"record","created_at":"2026-05-18T02:52: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":"cba8e5850c56251dff0b244888c1ee75867dc22701b1cc487619da7723ef8bba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-01T15:30:37Z","title_canon_sha256":"4aa9d0ea975ba1fd16c3465a97dcd7077eb5843bafb3f2c7eb60b464f464ef3a"},"schema_version":"1.0","source":{"id":"1405.0189","kind":"arxiv","version":1}},"canonical_sha256":"41eca5f8b5e4478d7f3ff311b5d5063fdc75b962d8916e3f0926415b3fa3e5f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41eca5f8b5e4478d7f3ff311b5d5063fdc75b962d8916e3f0926415b3fa3e5f8","first_computed_at":"2026-05-18T02:52:48.797087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:48.797087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3I8LR48UB3TFO6xr4Y5jiVw5QWxRz1RZAAFFJIQ3rK96tHsMwpdLsYZZDUb6DKtCfTQpuNXrxvWMTdI0Ie3tDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:48.797536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7aaa4da9a4d0dc279482d3de44258a8d59deaddfd076ae53808b2aabd7f748a8","sha256:b62e00e316238e7a0bf064601b94da2157285fa627a6397161570e901b7d9db5"],"state_sha256":"872271a65ddcef2403b43ca6889232839a0b534689725f7d6f2e16e1073aa578"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TLSnwqJF54kIXv7q5PbI/GIvRd3PO6WCW8AE7Wnk1iJ52qOFIXN5CMttfPqaXLw3ZgaCB9Q+445xR8axhcV1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:23:15.909666Z","bundle_sha256":"c7c2fc90c78e8a37b571bee4a6e7433f55fb19917e6d948c4f97491757422618"}}