{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JVAEJGSIVNNHLDPF26CI6UTIP6","short_pith_number":"pith:JVAEJGSI","canonical_record":{"source":{"id":"1303.3945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-16T05:07:24Z","cross_cats_sorted":[],"title_canon_sha256":"42bb77aeb5e227e9d501eeeb210375416fec4e18d71e95bc4c6bb46d969ad419","abstract_canon_sha256":"b8c2a07745dc7b001d1a4ca7281e746388ecc27c9e8215c24d65b97fc58d5b77"},"schema_version":"1.0"},"canonical_sha256":"4d40449a48ab5a758de5d7848f52687f9f3e027ce44d5c1f66782f83b72fee0c","source":{"kind":"arxiv","id":"1303.3945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3945","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3945v1","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3945","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"pith_short_12","alias_value":"JVAEJGSIVNNH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JVAEJGSIVNNHLDPF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JVAEJGSI","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JVAEJGSIVNNHLDPF26CI6UTIP6","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-16T05:07:24Z","cross_cats_sorted":[],"title_canon_sha256":"42bb77aeb5e227e9d501eeeb210375416fec4e18d71e95bc4c6bb46d969ad419","abstract_canon_sha256":"b8c2a07745dc7b001d1a4ca7281e746388ecc27c9e8215c24d65b97fc58d5b77"},"schema_version":"1.0"},"canonical_sha256":"4d40449a48ab5a758de5d7848f52687f9f3e027ce44d5c1f66782f83b72fee0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:40.434418Z","signature_b64":"AQpEliZW95JVCsw3/pJ68cMayp0jwV29Ao+E5RNKscADVQhKmWzX7lnhjlwIE+PdBh+qjK7GPtYbGKcrj//tAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d40449a48ab5a758de5d7848f52687f9f3e027ce44d5c1f66782f83b72fee0c","last_reissued_at":"2026-05-18T03:30:40.433660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:40.433660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3945","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-18T03:30:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usY3DWKIKq093FD02QPEpPABSUUEWSMueHzh1BLv30AoKgIrXKASul1cPKDevCNNTiuNYyuBHey+vAvoSI9nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:12:51.938363Z"},"content_sha256":"461db07d9b2b4deaf2f08f118a764afaba138ebb868e7c263a3edd2504ec5f4f","schema_version":"1.0","event_id":"sha256:461db07d9b2b4deaf2f08f118a764afaba138ebb868e7c263a3edd2504ec5f4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JVAEJGSIVNNHLDPF26CI6UTIP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing convolution on grammar-compressed text","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Tomohiro I, Toshiya Tanaka","submitted_at":"2013-03-16T05:07:24Z","abstract_excerpt":"The convolution between a text string $S$ of length $N$ and a pattern string $P$ of length $m$ can be computed in $O(N \\log m)$ time by FFT. It is known that various types of approximate string matching problems are reducible to convolution. In this paper, we assume that the input text string is given in a compressed form, as a \\emph{straight-line program (SLP)}, which is a context free grammar in the Chomsky normal form that derives a single string. Given an SLP $\\mathcal{S}$ of size $n$ describing a text $S$ of length $N$, and an uncompressed pattern $P$ of length $m$, we present a simple $O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3945","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-18T03:30:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHl4JaJCt8mSGrBW3lEzBKFdk5iKFXQrOHbjB8LMgMbZAKZWjl72oDS2zEEAlYVJrP+BVS0QjfK/1y/ZzyOABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:12:51.938716Z"},"content_sha256":"fbcdf0d73547a2d47a0dbded9f3dbc55c3801aead09ad8a6e0032dd37b3b096d","schema_version":"1.0","event_id":"sha256:fbcdf0d73547a2d47a0dbded9f3dbc55c3801aead09ad8a6e0032dd37b3b096d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVAEJGSIVNNHLDPF26CI6UTIP6/bundle.json","state_url":"https://pith.science/pith/JVAEJGSIVNNHLDPF26CI6UTIP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVAEJGSIVNNHLDPF26CI6UTIP6/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-28T06:12:51Z","links":{"resolver":"https://pith.science/pith/JVAEJGSIVNNHLDPF26CI6UTIP6","bundle":"https://pith.science/pith/JVAEJGSIVNNHLDPF26CI6UTIP6/bundle.json","state":"https://pith.science/pith/JVAEJGSIVNNHLDPF26CI6UTIP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVAEJGSIVNNHLDPF26CI6UTIP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JVAEJGSIVNNHLDPF26CI6UTIP6","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":"b8c2a07745dc7b001d1a4ca7281e746388ecc27c9e8215c24d65b97fc58d5b77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-16T05:07:24Z","title_canon_sha256":"42bb77aeb5e227e9d501eeeb210375416fec4e18d71e95bc4c6bb46d969ad419"},"schema_version":"1.0","source":{"id":"1303.3945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3945","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3945v1","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3945","created_at":"2026-05-18T03:30:40Z"},{"alias_kind":"pith_short_12","alias_value":"JVAEJGSIVNNH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JVAEJGSIVNNHLDPF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JVAEJGSI","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:fbcdf0d73547a2d47a0dbded9f3dbc55c3801aead09ad8a6e0032dd37b3b096d","target":"graph","created_at":"2026-05-18T03:30:40Z","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":"The convolution between a text string $S$ of length $N$ and a pattern string $P$ of length $m$ can be computed in $O(N \\log m)$ time by FFT. It is known that various types of approximate string matching problems are reducible to convolution. In this paper, we assume that the input text string is given in a compressed form, as a \\emph{straight-line program (SLP)}, which is a context free grammar in the Chomsky normal form that derives a single string. Given an SLP $\\mathcal{S}$ of size $n$ describing a text $S$ of length $N$, and an uncompressed pattern $P$ of length $m$, we present a simple $O","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Tomohiro I, Toshiya Tanaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-16T05:07:24Z","title":"Computing convolution on grammar-compressed text"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3945","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:461db07d9b2b4deaf2f08f118a764afaba138ebb868e7c263a3edd2504ec5f4f","target":"record","created_at":"2026-05-18T03:30:40Z","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":"b8c2a07745dc7b001d1a4ca7281e746388ecc27c9e8215c24d65b97fc58d5b77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-16T05:07:24Z","title_canon_sha256":"42bb77aeb5e227e9d501eeeb210375416fec4e18d71e95bc4c6bb46d969ad419"},"schema_version":"1.0","source":{"id":"1303.3945","kind":"arxiv","version":1}},"canonical_sha256":"4d40449a48ab5a758de5d7848f52687f9f3e027ce44d5c1f66782f83b72fee0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d40449a48ab5a758de5d7848f52687f9f3e027ce44d5c1f66782f83b72fee0c","first_computed_at":"2026-05-18T03:30:40.433660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:40.433660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AQpEliZW95JVCsw3/pJ68cMayp0jwV29Ao+E5RNKscADVQhKmWzX7lnhjlwIE+PdBh+qjK7GPtYbGKcrj//tAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:40.434418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:461db07d9b2b4deaf2f08f118a764afaba138ebb868e7c263a3edd2504ec5f4f","sha256:fbcdf0d73547a2d47a0dbded9f3dbc55c3801aead09ad8a6e0032dd37b3b096d"],"state_sha256":"5ce137c5b51c4e943f195c936785972209ed800cce483f71fd799d9c19988a00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hb++0w/auuWU2SjerJkLlLfF1a6rTG/btCVOYHtRRB9s8ggglFAO9WRk2EAnkV+ieqKBkwFeD2AoFWrZlnGcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:12:51.941000Z","bundle_sha256":"44455998eb5bc109b9647905cc0caf551a41f8f3782267e46328b3a9217fc6c7"}}