{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QHP6346A46BBL46GVHVH5XLO3S","short_pith_number":"pith:QHP6346A","schema_version":"1.0","canonical_sha256":"81dfedf3c0e78215f3c6a9ea7edd6edc810628d347175b16766afa778ec330fd","source":{"kind":"arxiv","id":"1704.08558","version":1},"attestation_state":"computed","paper":{"title":"Practical and Effective Re-Pair Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li G{\\o}rtz, Nicola Prezza, Philip Bille","submitted_at":"2017-04-27T13:28:45Z","abstract_excerpt":"Re-Pair is an efficient grammar compressor that operates by recursively replacing high-frequency character pairs with new grammar symbols. The most space-efficient linear-time algorithm computing Re-Pair uses $(1+\\epsilon)n+\\sqrt n$ words on top of the re-writable text (of length $n$ and stored in $n$ words), for any constant $\\epsilon>0$; in practice however, this solution uses complex sub-procedures preventing it from being practical. In this paper, we present an implementation of the above-mentioned result making use of more practical solutions; our tool further improves the working space t"},"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":"1704.08558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T13:28:45Z","cross_cats_sorted":[],"title_canon_sha256":"9994bd80182c2b82ddd9cd3bb0d5d7d256120a27d7314755227f8e9437b2bc89","abstract_canon_sha256":"262190e1ddda6e152c3a822c7f18a8bdcd6647936882ee4d90e5765e0650d2f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.383646Z","signature_b64":"7QG2GzgyuQ44Lw3c9RnRJoLc/mBpT089qUYRPDTTjsNN6IMWh1r9bdp20x3EbzEJnIu80MYusyo0JzgJMk37DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81dfedf3c0e78215f3c6a9ea7edd6edc810628d347175b16766afa778ec330fd","last_reissued_at":"2026-05-18T00:45:27.383268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.383268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical and Effective Re-Pair Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li G{\\o}rtz, Nicola Prezza, Philip Bille","submitted_at":"2017-04-27T13:28:45Z","abstract_excerpt":"Re-Pair is an efficient grammar compressor that operates by recursively replacing high-frequency character pairs with new grammar symbols. The most space-efficient linear-time algorithm computing Re-Pair uses $(1+\\epsilon)n+\\sqrt n$ words on top of the re-writable text (of length $n$ and stored in $n$ words), for any constant $\\epsilon>0$; in practice however, this solution uses complex sub-procedures preventing it from being practical. In this paper, we present an implementation of the above-mentioned result making use of more practical solutions; our tool further improves the working space t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08558","kind":"arxiv","version":1},"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":"1704.08558","created_at":"2026-05-18T00:45:27.383326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08558v1","created_at":"2026-05-18T00:45:27.383326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08558","created_at":"2026-05-18T00:45:27.383326+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHP6346A46BB","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHP6346A46BBL46G","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHP6346A","created_at":"2026-05-18T12:31:39.905425+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/QHP6346A46BBL46GVHVH5XLO3S","json":"https://pith.science/pith/QHP6346A46BBL46GVHVH5XLO3S.json","graph_json":"https://pith.science/api/pith-number/QHP6346A46BBL46GVHVH5XLO3S/graph.json","events_json":"https://pith.science/api/pith-number/QHP6346A46BBL46GVHVH5XLO3S/events.json","paper":"https://pith.science/paper/QHP6346A"},"agent_actions":{"view_html":"https://pith.science/pith/QHP6346A46BBL46GVHVH5XLO3S","download_json":"https://pith.science/pith/QHP6346A46BBL46GVHVH5XLO3S.json","view_paper":"https://pith.science/paper/QHP6346A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08558&json=true","fetch_graph":"https://pith.science/api/pith-number/QHP6346A46BBL46GVHVH5XLO3S/graph.json","fetch_events":"https://pith.science/api/pith-number/QHP6346A46BBL46GVHVH5XLO3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHP6346A46BBL46GVHVH5XLO3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHP6346A46BBL46GVHVH5XLO3S/action/storage_attestation","attest_author":"https://pith.science/pith/QHP6346A46BBL46GVHVH5XLO3S/action/author_attestation","sign_citation":"https://pith.science/pith/QHP6346A46BBL46GVHVH5XLO3S/action/citation_signature","submit_replication":"https://pith.science/pith/QHP6346A46BBL46GVHVH5XLO3S/action/replication_record"}},"created_at":"2026-05-18T00:45:27.383326+00:00","updated_at":"2026-05-18T00:45:27.383326+00:00"}