{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5WSDFDVCRMTHGKFPDJ2CJHRONS","short_pith_number":"pith:5WSDFDVC","canonical_record":{"source":{"id":"1611.01479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-04T18:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"ae8e61ea2d6a4db85e7b3410eb5e0f808bf76aa5ab7ec0c611be7f01efdab817","abstract_canon_sha256":"bef796fe775c71c24af607793cac73e2110c7c6008107bfaca3a7c6c659596b9"},"schema_version":"1.0"},"canonical_sha256":"eda4328ea28b267328af1a74249e2e6c9a742b4fb811598c52b36ffb7fd04c00","source":{"kind":"arxiv","id":"1611.01479","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01479","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01479v1","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01479","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"5WSDFDVCRMTH","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5WSDFDVCRMTHGKFP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5WSDFDVC","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5WSDFDVCRMTHGKFPDJ2CJHRONS","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-04T18:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"ae8e61ea2d6a4db85e7b3410eb5e0f808bf76aa5ab7ec0c611be7f01efdab817","abstract_canon_sha256":"bef796fe775c71c24af607793cac73e2110c7c6008107bfaca3a7c6c659596b9"},"schema_version":"1.0"},"canonical_sha256":"eda4328ea28b267328af1a74249e2e6c9a742b4fb811598c52b36ffb7fd04c00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:10.886761Z","signature_b64":"hVxJRyQEIvtXrfImJ9ywzFXUw9X7WEoj3kUrqRj1w+r3JZCky8mjYzpQmzhqwStg0x2/Fis40BmZXP/jl9kPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eda4328ea28b267328af1a74249e2e6c9a742b4fb811598c52b36ffb7fd04c00","last_reissued_at":"2026-05-18T01:00:10.886070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:10.886070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01479","source_version":1,"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-18T01:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"no3C76YDhk2q91buiMPj/5yJYX+qG8fbi0MzbHHGWVKrz9QLaVQk5NLQUt+ui1GXVghg2+1vFrFe5NHeqLHwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:38:41.206346Z"},"content_sha256":"6c7f56c66cb57084cb3f110844456193ecfad293b4913f0c1662fb90c62ef851","schema_version":"1.0","event_id":"sha256:6c7f56c66cb57084cb3f110844456193ecfad293b4913f0c1662fb90c62ef851"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5WSDFDVCRMTHGKFPDJ2CJHRONS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space-Efficient 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":"2016-11-04T18:25:21Z","abstract_excerpt":"Re-Pair is an effective grammar-based compression scheme achieving strong compression rates in practice. Let $n$, $\\sigma$, and $d$ be the text length, alphabet size, and dictionary size of the final grammar, respectively. In their original paper, the authors show how to compute the Re-Pair grammar in expected linear time and $5n + 4\\sigma^2 + 4d + \\sqrt{n}$ words of working space on top of the text. In this work, we propose two algorithms improving on the space of their original solution. Our model assumes a memory word of $\\lceil\\log_2 n\\rceil$ bits and a re-writable input text composed by $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01479","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"},"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-18T01:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDGk/+hVrl8GZv5TON2/GFy8Kb7ZhTp91gafG26QhDJ83KSXcLhYo5MkPzCPG5LwMFl4/HLh39+3Wr8wG6TODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:38:41.206980Z"},"content_sha256":"17218d0d0e7d4a29a99d761ac3ef755138cdd147ffb677e34351111b38984863","schema_version":"1.0","event_id":"sha256:17218d0d0e7d4a29a99d761ac3ef755138cdd147ffb677e34351111b38984863"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5WSDFDVCRMTHGKFPDJ2CJHRONS/bundle.json","state_url":"https://pith.science/pith/5WSDFDVCRMTHGKFPDJ2CJHRONS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5WSDFDVCRMTHGKFPDJ2CJHRONS/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-06-11T07:38:41Z","links":{"resolver":"https://pith.science/pith/5WSDFDVCRMTHGKFPDJ2CJHRONS","bundle":"https://pith.science/pith/5WSDFDVCRMTHGKFPDJ2CJHRONS/bundle.json","state":"https://pith.science/pith/5WSDFDVCRMTHGKFPDJ2CJHRONS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5WSDFDVCRMTHGKFPDJ2CJHRONS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5WSDFDVCRMTHGKFPDJ2CJHRONS","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":"bef796fe775c71c24af607793cac73e2110c7c6008107bfaca3a7c6c659596b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-04T18:25:21Z","title_canon_sha256":"ae8e61ea2d6a4db85e7b3410eb5e0f808bf76aa5ab7ec0c611be7f01efdab817"},"schema_version":"1.0","source":{"id":"1611.01479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01479","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01479v1","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01479","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"5WSDFDVCRMTH","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5WSDFDVCRMTHGKFP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5WSDFDVC","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:17218d0d0e7d4a29a99d761ac3ef755138cdd147ffb677e34351111b38984863","target":"graph","created_at":"2026-05-18T01:00:10Z","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":"Re-Pair is an effective grammar-based compression scheme achieving strong compression rates in practice. Let $n$, $\\sigma$, and $d$ be the text length, alphabet size, and dictionary size of the final grammar, respectively. In their original paper, the authors show how to compute the Re-Pair grammar in expected linear time and $5n + 4\\sigma^2 + 4d + \\sqrt{n}$ words of working space on top of the text. In this work, we propose two algorithms improving on the space of their original solution. Our model assumes a memory word of $\\lceil\\log_2 n\\rceil$ bits and a re-writable input text composed by $","authors_text":"Inge Li G{\\o}rtz, Nicola Prezza, Philip Bille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-04T18:25:21Z","title":"Space-Efficient Re-Pair Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01479","kind":"arxiv","version":1},"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:6c7f56c66cb57084cb3f110844456193ecfad293b4913f0c1662fb90c62ef851","target":"record","created_at":"2026-05-18T01:00:10Z","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":"bef796fe775c71c24af607793cac73e2110c7c6008107bfaca3a7c6c659596b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-04T18:25:21Z","title_canon_sha256":"ae8e61ea2d6a4db85e7b3410eb5e0f808bf76aa5ab7ec0c611be7f01efdab817"},"schema_version":"1.0","source":{"id":"1611.01479","kind":"arxiv","version":1}},"canonical_sha256":"eda4328ea28b267328af1a74249e2e6c9a742b4fb811598c52b36ffb7fd04c00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eda4328ea28b267328af1a74249e2e6c9a742b4fb811598c52b36ffb7fd04c00","first_computed_at":"2026-05-18T01:00:10.886070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:10.886070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hVxJRyQEIvtXrfImJ9ywzFXUw9X7WEoj3kUrqRj1w+r3JZCky8mjYzpQmzhqwStg0x2/Fis40BmZXP/jl9kPDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:10.886761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c7f56c66cb57084cb3f110844456193ecfad293b4913f0c1662fb90c62ef851","sha256:17218d0d0e7d4a29a99d761ac3ef755138cdd147ffb677e34351111b38984863"],"state_sha256":"2b57db38a0f4461c442a8d495d2601145389f07bbfb7b2e3fcc8e3b029f6c9bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KeRSGNr5o4IHgXu2AgD/KvsJKVObvxX0sYPFjOtkugMy8fQsgC+9dOKrGnbgBJckcyqsketEQIACzfyrqzAgCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:38:41.210833Z","bundle_sha256":"9eeca7c176729b392d73025b8edfbd2776e1fbfbf940bee94665fa42787ed732"}}