{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FJT6RHS5YBP2R3VPSNU7GULJ3D","short_pith_number":"pith:FJT6RHS5","schema_version":"1.0","canonical_sha256":"2a67e89e5dc05fa8eeaf9369f35169d8d5d3e52aa08b9bfe460951819c84fd25","source":{"kind":"arxiv","id":"1811.04596","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.04596","created_at":"2026-05-17T23:53:50.192373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.04596v2","created_at":"2026-05-17T23:53:50.192373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04596","created_at":"2026-05-17T23:53:50.192373+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJT6RHS5YBP2","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJT6RHS5YBP2R3VP","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJT6RHS5","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D","json":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D.json","graph_json":"https://pith.science/api/pith-number/FJT6RHS5YBP2R3VPSNU7GULJ3D/graph.json","events_json":"https://pith.science/api/pith-number/FJT6RHS5YBP2R3VPSNU7GULJ3D/events.json","paper":"https://pith.science/paper/FJT6RHS5"},"agent_actions":{"view_html":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D","download_json":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D.json","view_paper":"https://pith.science/paper/FJT6RHS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.04596&json=true","fetch_graph":"https://pith.science/api/pith-number/FJT6RHS5YBP2R3VPSNU7GULJ3D/graph.json","fetch_events":"https://pith.science/api/pith-number/FJT6RHS5YBP2R3VPSNU7GULJ3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D/action/storage_attestation","attest_author":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D/action/author_attestation","sign_citation":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D/action/citation_signature","submit_replication":"https://pith.science/pith/FJT6RHS5YBP2R3VPSNU7GULJ3D/action/replication_record"}},"created_at":"2026-05-17T23:53:50.192373+00:00","updated_at":"2026-05-17T23:53:50.192373+00:00"}