{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LLF4OW7TFUPEO64MSGIXP2DFV6","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":"8ee81ba9da26bde0882c6537ba3e1b9fe92894e61ed92f01587519492ce3a7c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-14T02:42:36Z","title_canon_sha256":"e4c6d37e84d0633b37e91d6939ef4b251678cd074bce316ee3a88ccc5f38b2ec"},"schema_version":"1.0","source":{"id":"1908.04933","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04933","created_at":"2026-07-05T00:19:37Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04933v3","created_at":"2026-07-05T00:19:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04933","created_at":"2026-07-05T00:19:37Z"},{"alias_kind":"pith_short_12","alias_value":"LLF4OW7TFUPE","created_at":"2026-07-05T00:19:37Z"},{"alias_kind":"pith_short_16","alias_value":"LLF4OW7TFUPEO64M","created_at":"2026-07-05T00:19:37Z"},{"alias_kind":"pith_short_8","alias_value":"LLF4OW7T","created_at":"2026-07-05T00:19:37Z"}],"graph_snapshots":[{"event_id":"sha256:286690371b200fc1417f5de8e0ab41708eded20b460904bae2fd8a5a7b564aa4","target":"graph","created_at":"2026-07-05T00:19:37Z","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/1908.04933/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Re-Pair is a grammar compression scheme with favorably good compression rates. The computation of Re-Pair comes with the cost of maintaining large frequency tables, which makes it hard to compute Re-Pair on large scale data sets. As a solution for this problem we present, given a text of length $n$ whose characters are drawn from an integer alphabet, an $O(n^2) \\cap O(n^2 \\lg \\log_\\tau n \\lg \\lg \\lg n / \\log_\\tau n)$ time algorithm computing Re-Pair in $n \\lg \\max(n,\\tau)$ bits of space including the text space, where $\\tau$ is the number of terminals and non-terminals. The algorithm works in ","authors_text":"Dominik K\\\"oppl, Isamu Furuya, Keisuke Goto, Kensuke Sakai, Tomohiro I, Yoshimasa Takabatake","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-14T02:42:36Z","title":"Re-Pair In Small Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04933","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:6db40b79cac8dfcaa8d5de68bd0e06ad865beee2e10f597ae432dd7427b3abc1","target":"record","created_at":"2026-07-05T00:19:37Z","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":"8ee81ba9da26bde0882c6537ba3e1b9fe92894e61ed92f01587519492ce3a7c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-14T02:42:36Z","title_canon_sha256":"e4c6d37e84d0633b37e91d6939ef4b251678cd074bce316ee3a88ccc5f38b2ec"},"schema_version":"1.0","source":{"id":"1908.04933","kind":"arxiv","version":3}},"canonical_sha256":"5acbc75bf32d1e477b8c919177e865af8976524423c85a26e1e20b7dcaf8baef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5acbc75bf32d1e477b8c919177e865af8976524423c85a26e1e20b7dcaf8baef","first_computed_at":"2026-07-05T00:19:37.503648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:19:37.503648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FL7JxZHhIR+VqJIEXFrDyNo/zS/zp3jWvRQTh3dNqUqYgAJMO/Kp7o2DZM5wW5aE/F161rgrJ1Ac9bvOgMyFAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:19:37.504129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04933","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6db40b79cac8dfcaa8d5de68bd0e06ad865beee2e10f597ae432dd7427b3abc1","sha256:286690371b200fc1417f5de8e0ab41708eded20b460904bae2fd8a5a7b564aa4"],"state_sha256":"0f8bff30481fca3ab8a7d260abd6d763559b10dc3d3d8dc45261bd36281cc8dc"}