{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LAWICUELNXURJW43QDZZGRI3NX","short_pith_number":"pith:LAWICUEL","canonical_record":{"source":{"id":"2509.03265","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-03T12:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"df5853089925db724fd39cecc2d6296632eba6390a003aa00a8cdc3c79d1e9dc","abstract_canon_sha256":"78dbace9442170ea96d39bdda1209ea31f7d0ff02c3a9c62b75e34c9a97c9b88"},"schema_version":"1.0"},"canonical_sha256":"582c81508b6de914db9b80f393451b6df96f62eca081a79ecca82b1805844f91","source":{"kind":"arxiv","id":"2509.03265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.03265","created_at":"2026-07-05T12:04:19Z"},{"alias_kind":"arxiv_version","alias_value":"2509.03265v1","created_at":"2026-07-05T12:04:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03265","created_at":"2026-07-05T12:04:19Z"},{"alias_kind":"pith_short_12","alias_value":"LAWICUELNXUR","created_at":"2026-07-05T12:04:19Z"},{"alias_kind":"pith_short_16","alias_value":"LAWICUELNXURJW43","created_at":"2026-07-05T12:04:19Z"},{"alias_kind":"pith_short_8","alias_value":"LAWICUEL","created_at":"2026-07-05T12:04:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LAWICUELNXURJW43QDZZGRI3NX","target":"record","payload":{"canonical_record":{"source":{"id":"2509.03265","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-03T12:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"df5853089925db724fd39cecc2d6296632eba6390a003aa00a8cdc3c79d1e9dc","abstract_canon_sha256":"78dbace9442170ea96d39bdda1209ea31f7d0ff02c3a9c62b75e34c9a97c9b88"},"schema_version":"1.0"},"canonical_sha256":"582c81508b6de914db9b80f393451b6df96f62eca081a79ecca82b1805844f91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:19.401995Z","signature_b64":"CQMHSXQs2qLRKftzcw1PHTN6+pxU18USVIc6OJIc3cXnkvAJhO8WLp/bwo2lrUT0GBG32rMiADM9l6GqudGbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"582c81508b6de914db9b80f393451b6df96f62eca081a79ecca82b1805844f91","last_reissued_at":"2026-07-05T12:04:19.401474Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:19.401474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.03265","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-07-05T12:04:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bEiav7Y3ykQ9Cu4s13NEk1LE/qZzBQuZ4+aF2clR4WVi5mGF17tJg89L7DFjDgy64xgQUBy9VeOXvOoLzlcEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:04:44.315724Z"},"content_sha256":"5d5893652adc0cedebf8726a41cf2453d3f54fbdc0e615cc57e7b3108a8e7f79","schema_version":"1.0","event_id":"sha256:5d5893652adc0cedebf8726a41cf2453d3f54fbdc0e615cc57e7b3108a8e7f79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LAWICUELNXURJW43QDZZGRI3NX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed Dictionary Matching on Run-Length Encoded Strings","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li G{\\o}rtz, Philip Bille, Simon J. Puglisi, Simon R. Tarnow","submitted_at":"2025-09-03T12:30:08Z","abstract_excerpt":"Given a set of pattern strings $\\mathcal{P}=\\{P_1, P_2,\\ldots P_k\\}$ and a text string $S$, the classic dictionary matching problem is to report all occurrences of each pattern in $S$. We study the dictionary problem in the compressed setting, where the pattern strings and the text string are compressed using run-length encoding, and the goal is to solve the problem without decompression and achieve efficient time and space in the size of the compressed strings. Let $m$ and $n$ be the total length of the patterns $\\mathcal{P}$ and the length of the text string $S$, respectively, and let $\\over"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03265","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.03265/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T12:04:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZDHkZEx9KmyjcKBRTbbxxg2/CB1Xlu/AbADz25Vwjkr23ykQGylFTbpZnkXwN9H33B67Jr2bt4BePsJ/ga+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:04:44.316499Z"},"content_sha256":"4a89ad75f69791ed5d8e1416af1c5b33ef845357a0b979b4f76c8c861fbb7e30","schema_version":"1.0","event_id":"sha256:4a89ad75f69791ed5d8e1416af1c5b33ef845357a0b979b4f76c8c861fbb7e30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAWICUELNXURJW43QDZZGRI3NX/bundle.json","state_url":"https://pith.science/pith/LAWICUELNXURJW43QDZZGRI3NX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAWICUELNXURJW43QDZZGRI3NX/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-08-20T04:04:44Z","links":{"resolver":"https://pith.science/pith/LAWICUELNXURJW43QDZZGRI3NX","bundle":"https://pith.science/pith/LAWICUELNXURJW43QDZZGRI3NX/bundle.json","state":"https://pith.science/pith/LAWICUELNXURJW43QDZZGRI3NX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAWICUELNXURJW43QDZZGRI3NX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LAWICUELNXURJW43QDZZGRI3NX","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":"78dbace9442170ea96d39bdda1209ea31f7d0ff02c3a9c62b75e34c9a97c9b88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-03T12:30:08Z","title_canon_sha256":"df5853089925db724fd39cecc2d6296632eba6390a003aa00a8cdc3c79d1e9dc"},"schema_version":"1.0","source":{"id":"2509.03265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.03265","created_at":"2026-07-05T12:04:19Z"},{"alias_kind":"arxiv_version","alias_value":"2509.03265v1","created_at":"2026-07-05T12:04:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03265","created_at":"2026-07-05T12:04:19Z"},{"alias_kind":"pith_short_12","alias_value":"LAWICUELNXUR","created_at":"2026-07-05T12:04:19Z"},{"alias_kind":"pith_short_16","alias_value":"LAWICUELNXURJW43","created_at":"2026-07-05T12:04:19Z"},{"alias_kind":"pith_short_8","alias_value":"LAWICUEL","created_at":"2026-07-05T12:04:19Z"}],"graph_snapshots":[{"event_id":"sha256:4a89ad75f69791ed5d8e1416af1c5b33ef845357a0b979b4f76c8c861fbb7e30","target":"graph","created_at":"2026-07-05T12:04:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.03265/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a set of pattern strings $\\mathcal{P}=\\{P_1, P_2,\\ldots P_k\\}$ and a text string $S$, the classic dictionary matching problem is to report all occurrences of each pattern in $S$. We study the dictionary problem in the compressed setting, where the pattern strings and the text string are compressed using run-length encoding, and the goal is to solve the problem without decompression and achieve efficient time and space in the size of the compressed strings. Let $m$ and $n$ be the total length of the patterns $\\mathcal{P}$ and the length of the text string $S$, respectively, and let $\\over","authors_text":"Inge Li G{\\o}rtz, Philip Bille, Simon J. Puglisi, Simon R. Tarnow","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03265","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:5d5893652adc0cedebf8726a41cf2453d3f54fbdc0e615cc57e7b3108a8e7f79","target":"record","created_at":"2026-07-05T12:04:19Z","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":"78dbace9442170ea96d39bdda1209ea31f7d0ff02c3a9c62b75e34c9a97c9b88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-03T12:30:08Z","title_canon_sha256":"df5853089925db724fd39cecc2d6296632eba6390a003aa00a8cdc3c79d1e9dc"},"schema_version":"1.0","source":{"id":"2509.03265","kind":"arxiv","version":1}},"canonical_sha256":"582c81508b6de914db9b80f393451b6df96f62eca081a79ecca82b1805844f91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"582c81508b6de914db9b80f393451b6df96f62eca081a79ecca82b1805844f91","first_computed_at":"2026-07-05T12:04:19.401474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:04:19.401474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CQMHSXQs2qLRKftzcw1PHTN6+pxU18USVIc6OJIc3cXnkvAJhO8WLp/bwo2lrUT0GBG32rMiADM9l6GqudGbCA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:04:19.401995Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.03265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d5893652adc0cedebf8726a41cf2453d3f54fbdc0e615cc57e7b3108a8e7f79","sha256:4a89ad75f69791ed5d8e1416af1c5b33ef845357a0b979b4f76c8c861fbb7e30"],"state_sha256":"cfe4ba215582e7f50f700a0eb067f8c2c97c6fcd94c2e22eaf0b1bf13daa896a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZPrCR6Y2ZMjDWAvVgyOTycA6sxluaq/H2K3PwHn+qElBXJOKAF3NhJQ0q899HIaZ+MdnK429TYSCeDkEuLoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T04:04:44.322672Z","bundle_sha256":"f5af26fe408a81b00d4c7d0d8e1f913fe38f59245bccda70b1c1a2d9ade978fc"}}