{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UZUIKVYUX25RKGFOHRJMAPOXJX","short_pith_number":"pith:UZUIKVYU","canonical_record":{"source":{"id":"1403.4445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-18T13:27:46Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"b27d5e0433ee28c3a53ecfe52cfce9e4adb303b473a5a8d18ab57289f9ad1038","abstract_canon_sha256":"428a152ebc48cb073a3ad48513488fca7482742921365f46b7afca6b298df7fa"},"schema_version":"1.0"},"canonical_sha256":"a668855714bebb1518ae3c52c03dd74dd59f3aa39855594e0918daca35c2634f","source":{"kind":"arxiv","id":"1403.4445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4445","created_at":"2026-05-18T02:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4445v1","created_at":"2026-05-18T02:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4445","created_at":"2026-05-18T02:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"UZUIKVYUX25R","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UZUIKVYUX25RKGFO","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UZUIKVYU","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UZUIKVYUX25RKGFOHRJMAPOXJX","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-18T13:27:46Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"b27d5e0433ee28c3a53ecfe52cfce9e4adb303b473a5a8d18ab57289f9ad1038","abstract_canon_sha256":"428a152ebc48cb073a3ad48513488fca7482742921365f46b7afca6b298df7fa"},"schema_version":"1.0"},"canonical_sha256":"a668855714bebb1518ae3c52c03dd74dd59f3aa39855594e0918daca35c2634f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:05.775382Z","signature_b64":"g6ooT93KrvItBbDoAXtmBqLgOCmWk10p1pRFHErmBCBaebGlaurK9Q2bhvo+axbiSXAH8BWAQfNmV/xbjad+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a668855714bebb1518ae3c52c03dd74dd59f3aa39855594e0918daca35c2634f","last_reissued_at":"2026-05-18T02:56:05.774919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:05.774919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4445","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-18T02:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rhxNHao+WMy58MsmhY/dXwg8GhiAZIOlbcova3J4IogWg3PuHlIBAZZU87CAxJq/aHJ+Qe/OH0jwPgE3TMLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:26:11.986631Z"},"content_sha256":"6e3586926874f9ed5887c1887a8813c851525a280f498c7720f77a05d0dfcf4f","schema_version":"1.0","event_id":"sha256:6e3586926874f9ed5887c1887a8813c851525a280f498c7720f77a05d0dfcf4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UZUIKVYUX25RKGFOHRJMAPOXJX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A really simple approximation of smallest grammar","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Artur Je\\.z","submitted_at":"2014-03-18T13:27:46Z","abstract_excerpt":"In this paper we present a really simple linear-time algorithm constructing a context-free grammar of size O(g log (N/g)) for the input string, where N is the size of the input string and g the size of the optimal grammar generating this string. The algorithm works for arbitrary size alphabets, but the running time is linear assuming that the alphabet Sigma of the input string can be identified with numbers from 1,ldots, N^c for some constant c. Algorithms with such an approximation guarantee and running time are known, however all of them were non-trivial and their analyses were involved. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4445","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-18T02:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ys5eBbRdKBWjkFVWFISau4uC+wJ4mSVevOqT9v5AFp3nRC5tUlsALEBkkVf6PHY5vQUOODsj8f1UoY+RMNYzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:26:11.986974Z"},"content_sha256":"d70a1118134bfd84b6a58e488428718972c1b6a270da602e248044f21130ab55","schema_version":"1.0","event_id":"sha256:d70a1118134bfd84b6a58e488428718972c1b6a270da602e248044f21130ab55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZUIKVYUX25RKGFOHRJMAPOXJX/bundle.json","state_url":"https://pith.science/pith/UZUIKVYUX25RKGFOHRJMAPOXJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZUIKVYUX25RKGFOHRJMAPOXJX/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-02T10:26:11Z","links":{"resolver":"https://pith.science/pith/UZUIKVYUX25RKGFOHRJMAPOXJX","bundle":"https://pith.science/pith/UZUIKVYUX25RKGFOHRJMAPOXJX/bundle.json","state":"https://pith.science/pith/UZUIKVYUX25RKGFOHRJMAPOXJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZUIKVYUX25RKGFOHRJMAPOXJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UZUIKVYUX25RKGFOHRJMAPOXJX","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":"428a152ebc48cb073a3ad48513488fca7482742921365f46b7afca6b298df7fa","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-18T13:27:46Z","title_canon_sha256":"b27d5e0433ee28c3a53ecfe52cfce9e4adb303b473a5a8d18ab57289f9ad1038"},"schema_version":"1.0","source":{"id":"1403.4445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4445","created_at":"2026-05-18T02:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4445v1","created_at":"2026-05-18T02:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4445","created_at":"2026-05-18T02:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"UZUIKVYUX25R","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UZUIKVYUX25RKGFO","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UZUIKVYU","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:d70a1118134bfd84b6a58e488428718972c1b6a270da602e248044f21130ab55","target":"graph","created_at":"2026-05-18T02:56:05Z","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":"In this paper we present a really simple linear-time algorithm constructing a context-free grammar of size O(g log (N/g)) for the input string, where N is the size of the input string and g the size of the optimal grammar generating this string. The algorithm works for arbitrary size alphabets, but the running time is linear assuming that the alphabet Sigma of the input string can be identified with numbers from 1,ldots, N^c for some constant c. Algorithms with such an approximation guarantee and running time are known, however all of them were non-trivial and their analyses were involved. The","authors_text":"Artur Je\\.z","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-18T13:27:46Z","title":"A really simple approximation of smallest grammar"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4445","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:6e3586926874f9ed5887c1887a8813c851525a280f498c7720f77a05d0dfcf4f","target":"record","created_at":"2026-05-18T02:56:05Z","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":"428a152ebc48cb073a3ad48513488fca7482742921365f46b7afca6b298df7fa","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-18T13:27:46Z","title_canon_sha256":"b27d5e0433ee28c3a53ecfe52cfce9e4adb303b473a5a8d18ab57289f9ad1038"},"schema_version":"1.0","source":{"id":"1403.4445","kind":"arxiv","version":1}},"canonical_sha256":"a668855714bebb1518ae3c52c03dd74dd59f3aa39855594e0918daca35c2634f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a668855714bebb1518ae3c52c03dd74dd59f3aa39855594e0918daca35c2634f","first_computed_at":"2026-05-18T02:56:05.774919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:05.774919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g6ooT93KrvItBbDoAXtmBqLgOCmWk10p1pRFHErmBCBaebGlaurK9Q2bhvo+axbiSXAH8BWAQfNmV/xbjad+Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:05.775382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e3586926874f9ed5887c1887a8813c851525a280f498c7720f77a05d0dfcf4f","sha256:d70a1118134bfd84b6a58e488428718972c1b6a270da602e248044f21130ab55"],"state_sha256":"f80b7d145323dc52f47fb2fae28aa35cf53c180637ba717cf546ff1e7159aba3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U3bMpLJcnI0qwQpy7iIiuRtpPMgv84m9/fILph3JtT6SaMANPVmBteZ3LJXXTuk2qCtO86VZurKO0KHNhIxaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:26:11.988846Z","bundle_sha256":"c96f27dcc58d54bd32d24fa0ebab6172379f2dac8962ab20ac9e877f6ddff71f"}}