{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7GSDRVLHS45253NF2NTTCZYM33","short_pith_number":"pith:7GSDRVLH","canonical_record":{"source":{"id":"2503.02415","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-04T09:00:40Z","cross_cats_sorted":[],"title_canon_sha256":"c15c4fd8acd063cb1f01c887df384614b4ea4c00e4e2e0e4ec9737a31c4b57eb","abstract_canon_sha256":"b858ee6fadbb2e81c1147415a18d213ceded97666b9f0e879b4452a64e1c18c8"},"schema_version":"1.0"},"canonical_sha256":"f9a438d567973baeeda5d36731670cdec45eaa061de501ee5244edfddc91e7f7","source":{"kind":"arxiv","id":"2503.02415","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.02415","created_at":"2026-05-29T02:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"2503.02415v2","created_at":"2026-05-29T02:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.02415","created_at":"2026-05-29T02:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"7GSDRVLHS452","created_at":"2026-05-29T02:05:34Z"},{"alias_kind":"pith_short_16","alias_value":"7GSDRVLHS45253NF","created_at":"2026-05-29T02:05:34Z"},{"alias_kind":"pith_short_8","alias_value":"7GSDRVLH","created_at":"2026-05-29T02:05:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7GSDRVLHS45253NF2NTTCZYM33","target":"record","payload":{"canonical_record":{"source":{"id":"2503.02415","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-04T09:00:40Z","cross_cats_sorted":[],"title_canon_sha256":"c15c4fd8acd063cb1f01c887df384614b4ea4c00e4e2e0e4ec9737a31c4b57eb","abstract_canon_sha256":"b858ee6fadbb2e81c1147415a18d213ceded97666b9f0e879b4452a64e1c18c8"},"schema_version":"1.0"},"canonical_sha256":"f9a438d567973baeeda5d36731670cdec45eaa061de501ee5244edfddc91e7f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T02:05:34.498199Z","signature_b64":"kIRbqf3QI15eZjsjVy7TgAchRHAx5ckVz7xTHBhEGbSWr5ZG1omiIlOEJ4vaqTdaL8Ks0yU6pJkirdgsNEu9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9a438d567973baeeda5d36731670cdec45eaa061de501ee5244edfddc91e7f7","last_reissued_at":"2026-05-29T02:05:34.497705Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T02:05:34.497705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.02415","source_version":2,"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-29T02:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dgvt+QFsKa656OBVjHMkZOsdRY3gcFoebAoqsuegg6IdceJQPW2ZadmX+goEQ3lezH9Yn9vQrXnkMQvWuWVHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:29:51.282972Z"},"content_sha256":"fec08fac0c158356d0d546b1286b856fea1cb1ad88652f0faa192b8e23c23262","schema_version":"1.0","event_id":"sha256:fec08fac0c158356d0d546b1286b856fea1cb1ad88652f0faa192b8e23c23262"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7GSDRVLHS45253NF2NTTCZYM33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the sensitivity of CDAWG-grammars","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroto Fujimaru, Shunsuke Inenaga","submitted_at":"2025-03-04T09:00:40Z","abstract_excerpt":"The compact directed acyclic word graph (CDAWG) [Blumer et al. 1987] of a string is the minimal compact automaton that recognizes all the suffixes of the string. CDAWGs can be used for various string tasks including text pattern searching, data compression, and pattern discovery. The CDAWG-grammar [Belazzougui & Cunial 2017] is a grammar-based text compression based on the CDAWG, which allows for representing the CDAWG in $O(e)$ space without storing the string, where $e$ denotes the number of CDAWG edges. Let $g$ be the size of the CDAWG-grammar for the input string $T$. We show that the wors"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.02415","kind":"arxiv","version":2},"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/2503.02415/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-05-29T02:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Og24XJ1TtXcTxCEbZnD0svH4dbJvfKgMHM4VRLbGrEOat9TnLDdavC6j6yYB3E9fnOqwxPH+M1PmnZJ/68/JDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:29:51.283788Z"},"content_sha256":"f98ea82a0a4b75766aaec3ed79353ce32cb94dba0aa6e45a669cd9b1e0c93642","schema_version":"1.0","event_id":"sha256:f98ea82a0a4b75766aaec3ed79353ce32cb94dba0aa6e45a669cd9b1e0c93642"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GSDRVLHS45253NF2NTTCZYM33/bundle.json","state_url":"https://pith.science/pith/7GSDRVLHS45253NF2NTTCZYM33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GSDRVLHS45253NF2NTTCZYM33/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-07T18:29:51Z","links":{"resolver":"https://pith.science/pith/7GSDRVLHS45253NF2NTTCZYM33","bundle":"https://pith.science/pith/7GSDRVLHS45253NF2NTTCZYM33/bundle.json","state":"https://pith.science/pith/7GSDRVLHS45253NF2NTTCZYM33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GSDRVLHS45253NF2NTTCZYM33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7GSDRVLHS45253NF2NTTCZYM33","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":"b858ee6fadbb2e81c1147415a18d213ceded97666b9f0e879b4452a64e1c18c8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-04T09:00:40Z","title_canon_sha256":"c15c4fd8acd063cb1f01c887df384614b4ea4c00e4e2e0e4ec9737a31c4b57eb"},"schema_version":"1.0","source":{"id":"2503.02415","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.02415","created_at":"2026-05-29T02:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"2503.02415v2","created_at":"2026-05-29T02:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.02415","created_at":"2026-05-29T02:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"7GSDRVLHS452","created_at":"2026-05-29T02:05:34Z"},{"alias_kind":"pith_short_16","alias_value":"7GSDRVLHS45253NF","created_at":"2026-05-29T02:05:34Z"},{"alias_kind":"pith_short_8","alias_value":"7GSDRVLH","created_at":"2026-05-29T02:05:34Z"}],"graph_snapshots":[{"event_id":"sha256:f98ea82a0a4b75766aaec3ed79353ce32cb94dba0aa6e45a669cd9b1e0c93642","target":"graph","created_at":"2026-05-29T02:05:34Z","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/2503.02415/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The compact directed acyclic word graph (CDAWG) [Blumer et al. 1987] of a string is the minimal compact automaton that recognizes all the suffixes of the string. CDAWGs can be used for various string tasks including text pattern searching, data compression, and pattern discovery. The CDAWG-grammar [Belazzougui & Cunial 2017] is a grammar-based text compression based on the CDAWG, which allows for representing the CDAWG in $O(e)$ space without storing the string, where $e$ denotes the number of CDAWG edges. Let $g$ be the size of the CDAWG-grammar for the input string $T$. We show that the wors","authors_text":"Hiroto Fujimaru, Shunsuke Inenaga","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-04T09:00:40Z","title":"On the sensitivity of CDAWG-grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.02415","kind":"arxiv","version":2},"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:fec08fac0c158356d0d546b1286b856fea1cb1ad88652f0faa192b8e23c23262","target":"record","created_at":"2026-05-29T02:05:34Z","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":"b858ee6fadbb2e81c1147415a18d213ceded97666b9f0e879b4452a64e1c18c8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-04T09:00:40Z","title_canon_sha256":"c15c4fd8acd063cb1f01c887df384614b4ea4c00e4e2e0e4ec9737a31c4b57eb"},"schema_version":"1.0","source":{"id":"2503.02415","kind":"arxiv","version":2}},"canonical_sha256":"f9a438d567973baeeda5d36731670cdec45eaa061de501ee5244edfddc91e7f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9a438d567973baeeda5d36731670cdec45eaa061de501ee5244edfddc91e7f7","first_computed_at":"2026-05-29T02:05:34.497705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T02:05:34.497705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kIRbqf3QI15eZjsjVy7TgAchRHAx5ckVz7xTHBhEGbSWr5ZG1omiIlOEJ4vaqTdaL8Ks0yU6pJkirdgsNEu9AA==","signature_status":"signed_v1","signed_at":"2026-05-29T02:05:34.498199Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.02415","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fec08fac0c158356d0d546b1286b856fea1cb1ad88652f0faa192b8e23c23262","sha256:f98ea82a0a4b75766aaec3ed79353ce32cb94dba0aa6e45a669cd9b1e0c93642"],"state_sha256":"b51bf48075031045b1642fea7ea4122cf99f22eb03a9b04342ef6bc3f4981b67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bN8IkICa7SYXrdEhkDGWCERTItLzPJHXUosglN21M3P13ajSeSkO4AlA++Gr8apT5CtI0Bop0yekMg0HxY9DAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:29:51.288116Z","bundle_sha256":"3d4db7f91d9cbad3601116cae9c3e3d78a514581bda62d669fd8a730fa6774df"}}