{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EKUVLWOCIUPSXBNXA5NL7W6VPI","short_pith_number":"pith:EKUVLWOC","canonical_record":{"source":{"id":"1301.6127","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-25T19:06:06Z","cross_cats_sorted":[],"title_canon_sha256":"08791a293b133d84ec5cbfb8b82967d606f5961514f585cc05a4005158b1eee1","abstract_canon_sha256":"5e5d3d9d6402784dfad3f7ab4e2451e3ac927775de8c02667271bc8441a34c73"},"schema_version":"1.0"},"canonical_sha256":"22a955d9c2451f2b85b7075abfdbd57a3ba6d5bbcfd33c97b2fb1e7f0936148f","source":{"kind":"arxiv","id":"1301.6127","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6127","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6127v3","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6127","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"pith_short_12","alias_value":"EKUVLWOCIUPS","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EKUVLWOCIUPSXBNX","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EKUVLWOC","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EKUVLWOCIUPSXBNXA5NL7W6VPI","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6127","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-25T19:06:06Z","cross_cats_sorted":[],"title_canon_sha256":"08791a293b133d84ec5cbfb8b82967d606f5961514f585cc05a4005158b1eee1","abstract_canon_sha256":"5e5d3d9d6402784dfad3f7ab4e2451e3ac927775de8c02667271bc8441a34c73"},"schema_version":"1.0"},"canonical_sha256":"22a955d9c2451f2b85b7075abfdbd57a3ba6d5bbcfd33c97b2fb1e7f0936148f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:47.144939Z","signature_b64":"t06bGtgpBEBtgb4eNWX7mYS0jNJ2nvjCi6xEeWgJ+b8iE5id6mwB6iFS0BCdM/H1xmLNCJNrH9gdmGhzzwuXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22a955d9c2451f2b85b7075abfdbd57a3ba6d5bbcfd33c97b2fb1e7f0936148f","last_reissued_at":"2026-05-18T02:48:47.144267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:47.144267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6127","source_version":3,"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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrNTBDj46F6jj879QcN0CHVQvY17Q3d7pRAcVw1gXsp33fpSjTpt4Icous+qRpxSPTbdLQXJGZaWAe6SymyYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:01:51.247948Z"},"content_sha256":"4327a824310a4f0f620ebd7e159392907e4cc4344e9863566f7f4dd25ad852c0","schema_version":"1.0","event_id":"sha256:4327a824310a4f0f620ebd7e159392907e4cc4344e9863566f7f4dd25ad852c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EKUVLWOCIUPSXBNXA5NL7W6VPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Jumbled Pattern Matching on Trees and Tree-Like Structures","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, Travis Gagie","submitted_at":"2013-01-25T19:06:06Z","abstract_excerpt":"Binary jumbled pattern matching asks to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of length $i$ and has exactly $j$ 1-bits. This problem naturally generalizes to vertex-labeled trees and graphs by replacing \"substring\" with \"connected subgraph\". In this paper, we give an $O(n^2 / \\log^2 n)$-time solution for trees, matching the currently best bound for (the simpler problem of) strings. We also give an $\\Oh{g^{2 / 3} n^{4 / 3}/(\\log n)^{4/3}}$-time solution for strings that are compressed by a grammar of size $g$. This solution im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6127","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"},"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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5BR8edtdIO+VmKIWukqKXysRQ7TbmdvD8vePPDkyT6n0yUbiVC0eWXlnOd5UrPoUvSwVw2Pl+fH/1deQC5a4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:01:51.248291Z"},"content_sha256":"00883cdfa1164d8bffd2157f7dc4ff56d45dce7b2fe5a765a0e64fcd6002acef","schema_version":"1.0","event_id":"sha256:00883cdfa1164d8bffd2157f7dc4ff56d45dce7b2fe5a765a0e64fcd6002acef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKUVLWOCIUPSXBNXA5NL7W6VPI/bundle.json","state_url":"https://pith.science/pith/EKUVLWOCIUPSXBNXA5NL7W6VPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKUVLWOCIUPSXBNXA5NL7W6VPI/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-03T03:01:51Z","links":{"resolver":"https://pith.science/pith/EKUVLWOCIUPSXBNXA5NL7W6VPI","bundle":"https://pith.science/pith/EKUVLWOCIUPSXBNXA5NL7W6VPI/bundle.json","state":"https://pith.science/pith/EKUVLWOCIUPSXBNXA5NL7W6VPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKUVLWOCIUPSXBNXA5NL7W6VPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EKUVLWOCIUPSXBNXA5NL7W6VPI","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":"5e5d3d9d6402784dfad3f7ab4e2451e3ac927775de8c02667271bc8441a34c73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-25T19:06:06Z","title_canon_sha256":"08791a293b133d84ec5cbfb8b82967d606f5961514f585cc05a4005158b1eee1"},"schema_version":"1.0","source":{"id":"1301.6127","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6127","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6127v3","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6127","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"pith_short_12","alias_value":"EKUVLWOCIUPS","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EKUVLWOCIUPSXBNX","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EKUVLWOC","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:00883cdfa1164d8bffd2157f7dc4ff56d45dce7b2fe5a765a0e64fcd6002acef","target":"graph","created_at":"2026-05-18T02:48:47Z","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":"Binary jumbled pattern matching asks to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of length $i$ and has exactly $j$ 1-bits. This problem naturally generalizes to vertex-labeled trees and graphs by replacing \"substring\" with \"connected subgraph\". In this paper, we give an $O(n^2 / \\log^2 n)$-time solution for trees, matching the currently best bound for (the simpler problem of) strings. We also give an $\\Oh{g^{2 / 3} n^{4 / 3}/(\\log n)^{4/3}}$-time solution for strings that are compressed by a grammar of size $g$. This solution im","authors_text":"Danny Hermelin, Gad M. Landau, Oren Weimann, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-25T19:06:06Z","title":"Binary Jumbled Pattern Matching on Trees and Tree-Like Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6127","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:4327a824310a4f0f620ebd7e159392907e4cc4344e9863566f7f4dd25ad852c0","target":"record","created_at":"2026-05-18T02:48:47Z","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":"5e5d3d9d6402784dfad3f7ab4e2451e3ac927775de8c02667271bc8441a34c73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-25T19:06:06Z","title_canon_sha256":"08791a293b133d84ec5cbfb8b82967d606f5961514f585cc05a4005158b1eee1"},"schema_version":"1.0","source":{"id":"1301.6127","kind":"arxiv","version":3}},"canonical_sha256":"22a955d9c2451f2b85b7075abfdbd57a3ba6d5bbcfd33c97b2fb1e7f0936148f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22a955d9c2451f2b85b7075abfdbd57a3ba6d5bbcfd33c97b2fb1e7f0936148f","first_computed_at":"2026-05-18T02:48:47.144267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:47.144267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t06bGtgpBEBtgb4eNWX7mYS0jNJ2nvjCi6xEeWgJ+b8iE5id6mwB6iFS0BCdM/H1xmLNCJNrH9gdmGhzzwuXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:47.144939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6127","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4327a824310a4f0f620ebd7e159392907e4cc4344e9863566f7f4dd25ad852c0","sha256:00883cdfa1164d8bffd2157f7dc4ff56d45dce7b2fe5a765a0e64fcd6002acef"],"state_sha256":"12b353b5967bb0f6b1b3db130daa61cbbf352620223ec38533526907374538ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U6f9jF1XDa+xvFDr+AEG9ZovqElBQMD3/oR4dTeS0HGQQ7QdOAF897LNPuXfwzi/t+WRK7dgxKbMSh29fkp+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:01:51.250227Z","bundle_sha256":"3364f2bd5762eb39c95e7a52f4b68f3953b74b8a8c00ec9000fea45a74cea957"}}