{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XGMUNPFK7TJEDGY4CZBGSQDP2C","short_pith_number":"pith:XGMUNPFK","schema_version":"1.0","canonical_sha256":"b99946bcaafcd2419b1c164269406fd0a00f7c189e976a7a99a8cc10c2333457","source":{"kind":"arxiv","id":"1107.2729","version":1},"attestation_state":"computed","paper":{"title":"Restructuring Compressed Texts without Explicit Decompression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Hiroshi Sakamoto, Keisuke Goto, Masayuki Takeda, Shirou Maruyama, Shunsuke Inenaga","submitted_at":"2011-07-14T05:35:09Z","abstract_excerpt":"We consider the problem of {\\em restructuring} compressed texts without explicit decompression. We present algorithms which allow conversions from compressed representations of a string $T$ produced by any grammar-based compression algorithm, to representations produced by several specific compression algorithms including LZ77, LZ78, run length encoding, and some grammar based compression algorithms. These are the first algorithms that achieve running times polynomial in the size of the compressed input and output representations of $T$. Since most of the representations we consider can achiev"},"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":"1107.2729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-14T05:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"954aa7ea9f9e1e0e4a7d5f1a408f26ba0b665e857e7e8c7f7ea6532875eb25c7","abstract_canon_sha256":"160fc95fd185f4e0f5a1464291436947df504a666399c422a8eb36bacae0ea6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:15.759621Z","signature_b64":"GHYEJ+n57jSejAnoSVu0u8A55y1ymDbi4P/+6ReA9yPXIFa6ubDFVXumUaTnuFSXoWYcsTTeE143RU5Rr6FUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b99946bcaafcd2419b1c164269406fd0a00f7c189e976a7a99a8cc10c2333457","last_reissued_at":"2026-05-18T04:18:15.759229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:15.759229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Restructuring Compressed Texts without Explicit Decompression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Hiroshi Sakamoto, Keisuke Goto, Masayuki Takeda, Shirou Maruyama, Shunsuke Inenaga","submitted_at":"2011-07-14T05:35:09Z","abstract_excerpt":"We consider the problem of {\\em restructuring} compressed texts without explicit decompression. We present algorithms which allow conversions from compressed representations of a string $T$ produced by any grammar-based compression algorithm, to representations produced by several specific compression algorithms including LZ77, LZ78, run length encoding, and some grammar based compression algorithms. These are the first algorithms that achieve running times polynomial in the size of the compressed input and output representations of $T$. Since most of the representations we consider can achiev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2729","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":"1107.2729","created_at":"2026-05-18T04:18:15.759285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2729v1","created_at":"2026-05-18T04:18:15.759285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2729","created_at":"2026-05-18T04:18:15.759285+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGMUNPFK7TJE","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGMUNPFK7TJEDGY4","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGMUNPFK","created_at":"2026-05-18T12:26:44.992195+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/XGMUNPFK7TJEDGY4CZBGSQDP2C","json":"https://pith.science/pith/XGMUNPFK7TJEDGY4CZBGSQDP2C.json","graph_json":"https://pith.science/api/pith-number/XGMUNPFK7TJEDGY4CZBGSQDP2C/graph.json","events_json":"https://pith.science/api/pith-number/XGMUNPFK7TJEDGY4CZBGSQDP2C/events.json","paper":"https://pith.science/paper/XGMUNPFK"},"agent_actions":{"view_html":"https://pith.science/pith/XGMUNPFK7TJEDGY4CZBGSQDP2C","download_json":"https://pith.science/pith/XGMUNPFK7TJEDGY4CZBGSQDP2C.json","view_paper":"https://pith.science/paper/XGMUNPFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2729&json=true","fetch_graph":"https://pith.science/api/pith-number/XGMUNPFK7TJEDGY4CZBGSQDP2C/graph.json","fetch_events":"https://pith.science/api/pith-number/XGMUNPFK7TJEDGY4CZBGSQDP2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGMUNPFK7TJEDGY4CZBGSQDP2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGMUNPFK7TJEDGY4CZBGSQDP2C/action/storage_attestation","attest_author":"https://pith.science/pith/XGMUNPFK7TJEDGY4CZBGSQDP2C/action/author_attestation","sign_citation":"https://pith.science/pith/XGMUNPFK7TJEDGY4CZBGSQDP2C/action/citation_signature","submit_replication":"https://pith.science/pith/XGMUNPFK7TJEDGY4CZBGSQDP2C/action/replication_record"}},"created_at":"2026-05-18T04:18:15.759285+00:00","updated_at":"2026-05-18T04:18:15.759285+00:00"}