{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VMIVPIXVC6JFXJN3GMHI66CHWF","short_pith_number":"pith:VMIVPIXV","schema_version":"1.0","canonical_sha256":"ab1157a2f517925ba5bb330e8f7847b15016ebf558477056bce997f05b51f44e","source":{"kind":"arxiv","id":"1304.0917","version":3},"attestation_state":"computed","paper":{"title":"A Succinct Grammar Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Sakamoto, Yasuo Tabei, Yoshimasa Takabatake","submitted_at":"2013-04-03T11:13:00Z","abstract_excerpt":"We solve an open problem related to an optimal encoding of a straight line program (SLP), a canonical form of grammar compression deriving a single string deterministically. We show that an information-theoretic lower bound for representing an SLP with n symbols requires at least 2n+logn!+o(n) bits. We then present a succinct representation of an SLP; this representation is asymptotically equivalent to the lower bound. The space is at most 2n log {rho}(1 + o(1)) bits for rho leq 2sqrt{n}, while supporting random access to any production rule of an SLP in O(log log n) time. In addition, we pres"},"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":"1304.0917","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-03T11:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"99a9acc12b67de5a602befb673ceec5ffa397a3904fbc9f0718158ed0ae61844","abstract_canon_sha256":"cb21b35528e9e20530a688318c306d2797c88592daceb18a51263eddce36cf4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:47.840636Z","signature_b64":"bziu7ZS5mD/R2VdhkDBYoq1UizpiNlPemnxm6B1WASVKrQqLsmBNdEUOMYIdTl0T2V15ZAu/pK5c0eXKtHW+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab1157a2f517925ba5bb330e8f7847b15016ebf558477056bce997f05b51f44e","last_reissued_at":"2026-05-18T03:20:47.839757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:47.839757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Succinct Grammar Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Sakamoto, Yasuo Tabei, Yoshimasa Takabatake","submitted_at":"2013-04-03T11:13:00Z","abstract_excerpt":"We solve an open problem related to an optimal encoding of a straight line program (SLP), a canonical form of grammar compression deriving a single string deterministically. We show that an information-theoretic lower bound for representing an SLP with n symbols requires at least 2n+logn!+o(n) bits. We then present a succinct representation of an SLP; this representation is asymptotically equivalent to the lower bound. The space is at most 2n log {rho}(1 + o(1)) bits for rho leq 2sqrt{n}, while supporting random access to any production rule of an SLP in O(log log n) time. In addition, we pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0917","kind":"arxiv","version":3},"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":"1304.0917","created_at":"2026-05-18T03:20:47.839911+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0917v3","created_at":"2026-05-18T03:20:47.839911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0917","created_at":"2026-05-18T03:20:47.839911+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMIVPIXVC6JF","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMIVPIXVC6JFXJN3","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMIVPIXV","created_at":"2026-05-18T12:28:04.890932+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/VMIVPIXVC6JFXJN3GMHI66CHWF","json":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF.json","graph_json":"https://pith.science/api/pith-number/VMIVPIXVC6JFXJN3GMHI66CHWF/graph.json","events_json":"https://pith.science/api/pith-number/VMIVPIXVC6JFXJN3GMHI66CHWF/events.json","paper":"https://pith.science/paper/VMIVPIXV"},"agent_actions":{"view_html":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF","download_json":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF.json","view_paper":"https://pith.science/paper/VMIVPIXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0917&json=true","fetch_graph":"https://pith.science/api/pith-number/VMIVPIXVC6JFXJN3GMHI66CHWF/graph.json","fetch_events":"https://pith.science/api/pith-number/VMIVPIXVC6JFXJN3GMHI66CHWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF/action/storage_attestation","attest_author":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF/action/author_attestation","sign_citation":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF/action/citation_signature","submit_replication":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF/action/replication_record"}},"created_at":"2026-05-18T03:20:47.839911+00:00","updated_at":"2026-05-18T03:20:47.839911+00:00"}