{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FGUWFQQJSZN6ODX44TRUEPOX5H","short_pith_number":"pith:FGUWFQQJ","canonical_record":{"source":{"id":"1401.2065","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-09T16:38:21Z","cross_cats_sorted":[],"title_canon_sha256":"6517ff850db098c61f068404f60c342414e78a4d8c611b378e145e08653f7df3","abstract_canon_sha256":"306a6611b235aaffe213db281d2199711bc4d80a3008ead0d39a29fa884e9510"},"schema_version":"1.0"},"canonical_sha256":"29a962c209965be70efce4e3423dd7e9d5f9db68f782f1f413f9d353aa0adf11","source":{"kind":"arxiv","id":"1401.2065","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2065","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2065v4","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2065","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"pith_short_12","alias_value":"FGUWFQQJSZN6","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FGUWFQQJSZN6ODX4","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FGUWFQQJ","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FGUWFQQJSZN6ODX44TRUEPOX5H","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2065","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-09T16:38:21Z","cross_cats_sorted":[],"title_canon_sha256":"6517ff850db098c61f068404f60c342414e78a4d8c611b378e145e08653f7df3","abstract_canon_sha256":"306a6611b235aaffe213db281d2199711bc4d80a3008ead0d39a29fa884e9510"},"schema_version":"1.0"},"canonical_sha256":"29a962c209965be70efce4e3423dd7e9d5f9db68f782f1f413f9d353aa0adf11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:46.451077Z","signature_b64":"3XWsqqk95YUhkJt/kCshRMJL250HuMQ82IQ184mE9PCinPX9peKhYRRZ6+f2qqGqvLJ1ihjD6rcESbD8cl2/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29a962c209965be70efce4e3423dd7e9d5f9db68f782f1f413f9d353aa0adf11","last_reissued_at":"2026-05-18T02:48:46.450432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:46.450432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2065","source_version":4,"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:48:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B5HVNFhRvhAdmyoTHTRDdkIDtwkIX4l4rtgX2gMceitswvY0EeH6NbA0dLlhHEWgyhli9r2EyceTBEqxy0diDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:47:09.691192Z"},"content_sha256":"e4a3104cb9f03a779b998d5d18a0c10f410d22790025fb216f99b6c51474c2fb","schema_version":"1.0","event_id":"sha256:e4a3104cb9f03a779b998d5d18a0c10f410d22790025fb216f99b6c51474c2fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FGUWFQQJSZN6ODX44TRUEPOX5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Jumbled Pattern Matching via All-Pairs Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Gad M. Landau, Oren Weimann, Yuri Rabinovich","submitted_at":"2014-01-09T16:38:21Z","abstract_excerpt":"In binary jumbled pattern matching we wish to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of size $i$ and has exactly $j$ 1-bits. The problem naturally generalizes to node-labeled trees and graphs by replacing \"substring\" with \"connected subgraph\".\n  In this paper, we give an ${n^2}/{2^{\\Omega(\\log n/\\log \\log n)^{1/2}}}$ time solution for both strings and trees. This odd-looking time complexity improves the state of the art $O(n^2/\\log^2 n)$ solutions by more than any poly-logarithmic factor. It originates from the recent seminal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2065","kind":"arxiv","version":4},"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:48:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HqLQJxtiVC1czob7CRP+Dvlt1uT56+J5PFEeV1uEplLxk2pZ6WrP2Ah00zpSB8nv4B9v7WiYPctPlr6u3eIwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:47:09.691638Z"},"content_sha256":"ce5bb26fe887f13c3346fa2a3081874cf928e7b22cc6a9a0285a4349a4066e2b","schema_version":"1.0","event_id":"sha256:ce5bb26fe887f13c3346fa2a3081874cf928e7b22cc6a9a0285a4349a4066e2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGUWFQQJSZN6ODX44TRUEPOX5H/bundle.json","state_url":"https://pith.science/pith/FGUWFQQJSZN6ODX44TRUEPOX5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGUWFQQJSZN6ODX44TRUEPOX5H/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-25T17:47:09Z","links":{"resolver":"https://pith.science/pith/FGUWFQQJSZN6ODX44TRUEPOX5H","bundle":"https://pith.science/pith/FGUWFQQJSZN6ODX44TRUEPOX5H/bundle.json","state":"https://pith.science/pith/FGUWFQQJSZN6ODX44TRUEPOX5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGUWFQQJSZN6ODX44TRUEPOX5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FGUWFQQJSZN6ODX44TRUEPOX5H","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":"306a6611b235aaffe213db281d2199711bc4d80a3008ead0d39a29fa884e9510","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-09T16:38:21Z","title_canon_sha256":"6517ff850db098c61f068404f60c342414e78a4d8c611b378e145e08653f7df3"},"schema_version":"1.0","source":{"id":"1401.2065","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2065","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2065v4","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2065","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"pith_short_12","alias_value":"FGUWFQQJSZN6","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FGUWFQQJSZN6ODX4","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FGUWFQQJ","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:ce5bb26fe887f13c3346fa2a3081874cf928e7b22cc6a9a0285a4349a4066e2b","target":"graph","created_at":"2026-05-18T02:48:46Z","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":"In binary jumbled pattern matching we wish to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of size $i$ and has exactly $j$ 1-bits. The problem naturally generalizes to node-labeled trees and graphs by replacing \"substring\" with \"connected subgraph\".\n  In this paper, we give an ${n^2}/{2^{\\Omega(\\log n/\\log \\log n)^{1/2}}}$ time solution for both strings and trees. This odd-looking time complexity improves the state of the art $O(n^2/\\log^2 n)$ solutions by more than any poly-logarithmic factor. It originates from the recent seminal ","authors_text":"Danny Hermelin, Gad M. Landau, Oren Weimann, Yuri Rabinovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-09T16:38:21Z","title":"Binary Jumbled Pattern Matching via All-Pairs Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2065","kind":"arxiv","version":4},"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:e4a3104cb9f03a779b998d5d18a0c10f410d22790025fb216f99b6c51474c2fb","target":"record","created_at":"2026-05-18T02:48:46Z","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":"306a6611b235aaffe213db281d2199711bc4d80a3008ead0d39a29fa884e9510","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-09T16:38:21Z","title_canon_sha256":"6517ff850db098c61f068404f60c342414e78a4d8c611b378e145e08653f7df3"},"schema_version":"1.0","source":{"id":"1401.2065","kind":"arxiv","version":4}},"canonical_sha256":"29a962c209965be70efce4e3423dd7e9d5f9db68f782f1f413f9d353aa0adf11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29a962c209965be70efce4e3423dd7e9d5f9db68f782f1f413f9d353aa0adf11","first_computed_at":"2026-05-18T02:48:46.450432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:46.450432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3XWsqqk95YUhkJt/kCshRMJL250HuMQ82IQ184mE9PCinPX9peKhYRRZ6+f2qqGqvLJ1ihjD6rcESbD8cl2/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:46.451077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2065","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4a3104cb9f03a779b998d5d18a0c10f410d22790025fb216f99b6c51474c2fb","sha256:ce5bb26fe887f13c3346fa2a3081874cf928e7b22cc6a9a0285a4349a4066e2b"],"state_sha256":"81935ea4bdfbc29f295aa935e52a90646591e95356fb6609da10dd9ad1b5d137"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwZZxQauC1zfP4ql9ZJtKiiN4AyKkH+E5rth3zgUSWIpYjFkH3MgxmZLFghujJ//VrgzuIGKeZxEnZGlJu22DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:47:09.694723Z","bundle_sha256":"cbd767cf26315918329c87b724a225d22a620e09a1a0cb1a3fc08bbfec1f63c3"}}