{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FJT6RHS5YBP2R3VPSNU7GULJ3D","short_pith_number":"pith:FJT6RHS5","canonical_record":{"source":{"id":"1811.04596","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T08:11:54Z","cross_cats_sorted":[],"title_canon_sha256":"0bc434eaf1c9e2e9548941f854166c96478d61e885b70f74c0ec91e0bace32ed","abstract_canon_sha256":"82a3b96f49cdaf1b62e937860a2a838178b788e35808fe3d98cd1155fb58d057"},"schema_version":"1.0"},"canonical_sha256":"2a67e89e5dc05fa8eeaf9369f35169d8d5d3e52aa08b9bfe460951819c84fd25","source":{"kind":"arxiv","id":"1811.04596","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04596","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04596v2","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04596","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"pith_short_12","alias_value":"FJT6RHS5YBP2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FJT6RHS5YBP2R3VP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FJT6RHS5","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FJT6RHS5YBP2R3VPSNU7GULJ3D","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04596","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T08:11:54Z","cross_cats_sorted":[],"title_canon_sha256":"0bc434eaf1c9e2e9548941f854166c96478d61e885b70f74c0ec91e0bace32ed","abstract_canon_sha256":"82a3b96f49cdaf1b62e937860a2a838178b788e35808fe3d98cd1155fb58d057"},"schema_version":"1.0"},"canonical_sha256":"2a67e89e5dc05fa8eeaf9369f35169d8d5d3e52aa08b9bfe460951819c84fd25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:50.192993Z","signature_b64":"eD8pXVzJZQDA/LNgHMAuCINKsS8Ia1ZEjhDmErAv1t2nOuhiUNIILhklqqNtesAv2Xccmq3gYcmWEPxQVesjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a67e89e5dc05fa8eeaf9369f35169d8d5d3e52aa08b9bfe460951819c84fd25","last_reissued_at":"2026-05-17T23:53:50.192260Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:50.192260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04596","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-17T23:53:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZ0ti+4WiJFOV8iOO3qYMdw7tZ8aC7Q5QJsdhgRzJwocKdo2ZXOlCCZeRaQYjP0PwkwNe4qswXqVPOLdQPuiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:32:39.583532Z"},"content_sha256":"f376b27c639bc709ac19c1a133c8c7a2a264b1531c0bcca7b64aa90e12d87804","schema_version":"1.0","event_id":"sha256:f376b27c639bc709ac19c1a133c8c7a2a264b1531c0bcca7b64aa90e12d87804"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FJT6RHS5YBP2R3VPSNU7GULJ3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MR-RePair: Grammar Compression based on Maximal Repeats","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Isamu Furuya, Shunsuke Inenaga, Takuya Kida, Takuya Takagi, Yuto Nakashima","submitted_at":"2018-11-12T08:11:54Z","abstract_excerpt":"We analyze the grammar generation algorithm of the RePair compression algorithm and show the relation between a grammar generated by RePair and maximal repeats. We reveal that RePair replaces step by step the most frequent pairs within the corresponding most frequent maximal repeats. Then, we design a novel variant of RePair, called MR-RePair, which substitutes the most frequent maximal repeats at once instead of substituting the most frequent pairs consecutively. We implemented MR-RePair and compared the size of the grammar generated by MR-RePair to that by RePair on several text corpus. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04596","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-17T23:53:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQ147YNi1ubrPVsTBVyvPYCJyKPkln90YTXyDxpVKzNpkeC+n9sz8PDpNSMiN65UnCeErAdt8f4WZNoPplgNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:32:39.583881Z"},"content_sha256":"fecd9265c96a575908b3c21396ea4e61dc8ff286e50c2cf1dae4ee438ecb8247","schema_version":"1.0","event_id":"sha256:fecd9265c96a575908b3c21396ea4e61dc8ff286e50c2cf1dae4ee438ecb8247"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D/bundle.json","state_url":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D/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-28T03:32:39Z","links":{"resolver":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D","bundle":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D/bundle.json","state":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FJT6RHS5YBP2R3VPSNU7GULJ3D","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":"82a3b96f49cdaf1b62e937860a2a838178b788e35808fe3d98cd1155fb58d057","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T08:11:54Z","title_canon_sha256":"0bc434eaf1c9e2e9548941f854166c96478d61e885b70f74c0ec91e0bace32ed"},"schema_version":"1.0","source":{"id":"1811.04596","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04596","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04596v2","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04596","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"pith_short_12","alias_value":"FJT6RHS5YBP2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FJT6RHS5YBP2R3VP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FJT6RHS5","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:fecd9265c96a575908b3c21396ea4e61dc8ff286e50c2cf1dae4ee438ecb8247","target":"graph","created_at":"2026-05-17T23:53:50Z","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":"We analyze the grammar generation algorithm of the RePair compression algorithm and show the relation between a grammar generated by RePair and maximal repeats. We reveal that RePair replaces step by step the most frequent pairs within the corresponding most frequent maximal repeats. Then, we design a novel variant of RePair, called MR-RePair, which substitutes the most frequent maximal repeats at once instead of substituting the most frequent pairs consecutively. We implemented MR-RePair and compared the size of the grammar generated by MR-RePair to that by RePair on several text corpus. Our ","authors_text":"Hideo Bannai, Isamu Furuya, Shunsuke Inenaga, Takuya Kida, Takuya Takagi, Yuto Nakashima","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T08:11:54Z","title":"MR-RePair: Grammar Compression based on Maximal Repeats"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04596","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:f376b27c639bc709ac19c1a133c8c7a2a264b1531c0bcca7b64aa90e12d87804","target":"record","created_at":"2026-05-17T23:53:50Z","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":"82a3b96f49cdaf1b62e937860a2a838178b788e35808fe3d98cd1155fb58d057","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T08:11:54Z","title_canon_sha256":"0bc434eaf1c9e2e9548941f854166c96478d61e885b70f74c0ec91e0bace32ed"},"schema_version":"1.0","source":{"id":"1811.04596","kind":"arxiv","version":2}},"canonical_sha256":"2a67e89e5dc05fa8eeaf9369f35169d8d5d3e52aa08b9bfe460951819c84fd25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a67e89e5dc05fa8eeaf9369f35169d8d5d3e52aa08b9bfe460951819c84fd25","first_computed_at":"2026-05-17T23:53:50.192260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:50.192260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eD8pXVzJZQDA/LNgHMAuCINKsS8Ia1ZEjhDmErAv1t2nOuhiUNIILhklqqNtesAv2Xccmq3gYcmWEPxQVesjBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:50.192993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04596","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f376b27c639bc709ac19c1a133c8c7a2a264b1531c0bcca7b64aa90e12d87804","sha256:fecd9265c96a575908b3c21396ea4e61dc8ff286e50c2cf1dae4ee438ecb8247"],"state_sha256":"84807eabad6898c2ce3e8400a1700afad569fdedec60810889d6218537732714"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8x2SHB5TbX2HtZd8wnhDX6pHjW+iQukxv7K3kyBpjVYY41LKnN5Kgrpe1OtU8ujDdwKfrMJc05LBeeIvZWXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:32:39.585951Z","bundle_sha256":"91512cd56f07d274de0116d7b32f7ba292f579eb502726e2da2f8333ef837ea4"}}