{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4QSEUGEMLB4CUREISMYYLVNB5O","short_pith_number":"pith:4QSEUGEM","canonical_record":{"source":{"id":"1705.09779","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-27T07:24:44Z","cross_cats_sorted":[],"title_canon_sha256":"b910122d5fda0eee93b4eccc26a295c115efb8588abacd031a4e29a9d010d082","abstract_canon_sha256":"cf8843b97fcd8450eede75e6de45fa6ad53fdf01dfcd11df777b5ac5b85d3067"},"schema_version":"1.0"},"canonical_sha256":"e4244a188c58782a4488933185d5a1eb9237d44cbd2da479b158e51c6b6ff403","source":{"kind":"arxiv","id":"1705.09779","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09779","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09779v2","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09779","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"4QSEUGEMLB4C","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4QSEUGEMLB4CUREI","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4QSEUGEM","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4QSEUGEMLB4CUREISMYYLVNB5O","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09779","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-27T07:24:44Z","cross_cats_sorted":[],"title_canon_sha256":"b910122d5fda0eee93b4eccc26a295c115efb8588abacd031a4e29a9d010d082","abstract_canon_sha256":"cf8843b97fcd8450eede75e6de45fa6ad53fdf01dfcd11df777b5ac5b85d3067"},"schema_version":"1.0"},"canonical_sha256":"e4244a188c58782a4488933185d5a1eb9237d44cbd2da479b158e51c6b6ff403","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:22.529490Z","signature_b64":"Yjy0xh8ia3eUWQ4VEbmRQIGv0fZvUyzPnKcfqbyxMkOI2stW961hoB6xh076pbZat68RoV8kqH1vtXjSytKUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4244a188c58782a4488933185d5a1eb9237d44cbd2da479b158e51c6b6ff403","last_reissued_at":"2026-05-18T00:39:22.528909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:22.528909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09779","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-18T00:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U5x1fOTHwn5z0MBRsqzhvKhIa6JoB1kX2Sprt20mgHgHKwiQg4tdzxwbNWN1CIPoDvXyceS8kGmhPKQbRT9rDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:29:18.340834Z"},"content_sha256":"18718669e6f528b879d0dcbfc2af2eec25bfd0216a70e00c7cd81cae4a6e6996","schema_version":"1.0","event_id":"sha256:18718669e6f528b879d0dcbfc2af2eec25bfd0216a70e00c7cd81cae4a6e6996"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4QSEUGEMLB4CUREISMYYLVNB5O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear-size CDAWG: new repetition-aware indexing and grammar compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroki Arimura, Keisuke Goto, Shunsuke Inenaga, Takuya Takagi, Yuta Fujishige","submitted_at":"2017-05-27T07:24:44Z","abstract_excerpt":"In this paper, we propose a novel approach to combine \\emph{compact directed acyclic word graphs} (CDAWGs) and grammar-based compression. This leads us to an efficient self-index, called Linear-size CDAWGs (L-CDAWGs), which can be represented with $O(\\tilde e_T \\log n)$ bits of space allowing for $O(\\log n)$-time random and $O(1)$-time sequential accesses to edge labels, and $O(m \\log \\sigma + occ)$-time pattern matching. Here, $\\tilde e_T$ is the number of all extensions of maximal repeats in $T$, $n$ and $m$ are respectively the lengths of the text $T$ and a given pattern, $\\sigma$ is the al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09779","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":""},"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-18T00:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYA06kC6bjpqLUYj9VDJ/Ckdp3hDXybGzvFGS5GY0AXXUdqwW2A9sVAlbGOEe2cOd0l8V8khjR6hMKcAEX4kCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:29:18.341181Z"},"content_sha256":"bcd1d38f8a00dbeeb1e1660460aa5f7866fb19576df603ade4d2d089fb578bb6","schema_version":"1.0","event_id":"sha256:bcd1d38f8a00dbeeb1e1660460aa5f7866fb19576df603ade4d2d089fb578bb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QSEUGEMLB4CUREISMYYLVNB5O/bundle.json","state_url":"https://pith.science/pith/4QSEUGEMLB4CUREISMYYLVNB5O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QSEUGEMLB4CUREISMYYLVNB5O/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-28T01:29:18Z","links":{"resolver":"https://pith.science/pith/4QSEUGEMLB4CUREISMYYLVNB5O","bundle":"https://pith.science/pith/4QSEUGEMLB4CUREISMYYLVNB5O/bundle.json","state":"https://pith.science/pith/4QSEUGEMLB4CUREISMYYLVNB5O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QSEUGEMLB4CUREISMYYLVNB5O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4QSEUGEMLB4CUREISMYYLVNB5O","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":"cf8843b97fcd8450eede75e6de45fa6ad53fdf01dfcd11df777b5ac5b85d3067","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-27T07:24:44Z","title_canon_sha256":"b910122d5fda0eee93b4eccc26a295c115efb8588abacd031a4e29a9d010d082"},"schema_version":"1.0","source":{"id":"1705.09779","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09779","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09779v2","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09779","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"4QSEUGEMLB4C","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4QSEUGEMLB4CUREI","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4QSEUGEM","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:bcd1d38f8a00dbeeb1e1660460aa5f7866fb19576df603ade4d2d089fb578bb6","target":"graph","created_at":"2026-05-18T00:39:22Z","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 this paper, we propose a novel approach to combine \\emph{compact directed acyclic word graphs} (CDAWGs) and grammar-based compression. This leads us to an efficient self-index, called Linear-size CDAWGs (L-CDAWGs), which can be represented with $O(\\tilde e_T \\log n)$ bits of space allowing for $O(\\log n)$-time random and $O(1)$-time sequential accesses to edge labels, and $O(m \\log \\sigma + occ)$-time pattern matching. Here, $\\tilde e_T$ is the number of all extensions of maximal repeats in $T$, $n$ and $m$ are respectively the lengths of the text $T$ and a given pattern, $\\sigma$ is the al","authors_text":"Hiroki Arimura, Keisuke Goto, Shunsuke Inenaga, Takuya Takagi, Yuta Fujishige","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-27T07:24:44Z","title":"Linear-size CDAWG: new repetition-aware indexing and grammar compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09779","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:18718669e6f528b879d0dcbfc2af2eec25bfd0216a70e00c7cd81cae4a6e6996","target":"record","created_at":"2026-05-18T00:39:22Z","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":"cf8843b97fcd8450eede75e6de45fa6ad53fdf01dfcd11df777b5ac5b85d3067","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-27T07:24:44Z","title_canon_sha256":"b910122d5fda0eee93b4eccc26a295c115efb8588abacd031a4e29a9d010d082"},"schema_version":"1.0","source":{"id":"1705.09779","kind":"arxiv","version":2}},"canonical_sha256":"e4244a188c58782a4488933185d5a1eb9237d44cbd2da479b158e51c6b6ff403","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4244a188c58782a4488933185d5a1eb9237d44cbd2da479b158e51c6b6ff403","first_computed_at":"2026-05-18T00:39:22.528909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:22.528909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yjy0xh8ia3eUWQ4VEbmRQIGv0fZvUyzPnKcfqbyxMkOI2stW961hoB6xh076pbZat68RoV8kqH1vtXjSytKUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:22.529490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09779","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18718669e6f528b879d0dcbfc2af2eec25bfd0216a70e00c7cd81cae4a6e6996","sha256:bcd1d38f8a00dbeeb1e1660460aa5f7866fb19576df603ade4d2d089fb578bb6"],"state_sha256":"425faee7e72e3884f11fdd28139d9dd67c65c4367ce886e7449a94f2c740e525"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HraSDO8PgUgBa8yckRtbkamJEQ8DMswmRT8XgpbPigp7y1/cGB9o4KBkhQqI+fyPC8or752o9ojjw+IyP973Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:29:18.343122Z","bundle_sha256":"7877b631aef90864efb1eeade8ffe10052ac2565b673b07f17cb25ea0024c408"}}