{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VMIVPIXVC6JFXJN3GMHI66CHWF","short_pith_number":"pith:VMIVPIXV","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"},"canonical_sha256":"ab1157a2f517925ba5bb330e8f7847b15016ebf558477056bce997f05b51f44e","source":{"kind":"arxiv","id":"1304.0917","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0917","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0917v3","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0917","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"VMIVPIXVC6JF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VMIVPIXVC6JFXJN3","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VMIVPIXV","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VMIVPIXVC6JFXJN3GMHI66CHWF","target":"record","payload":{"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"},"canonical_sha256":"ab1157a2f517925ba5bb330e8f7847b15016ebf558477056bce997f05b51f44e","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"},"source_kind":"arxiv","source_id":"1304.0917","source_version":3,"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-18T03:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CNhl86/yNVyvvG/BOOAMDPSC4kq0nxdelf1Q/g4xDBm8V0yUb6Xk8Hmhx/Xq9WDUK1fIZ9Q8PBJpxs00d35NDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:14:09.058222Z"},"content_sha256":"fe6f9444bc91e4d7aac5aee2ec35b5205bde16f7ad007d33d3c712f673afa771","schema_version":"1.0","event_id":"sha256:fe6f9444bc91e4d7aac5aee2ec35b5205bde16f7ad007d33d3c712f673afa771"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VMIVPIXVC6JFXJN3GMHI66CHWF","target":"graph","payload":{"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"},"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-18T03:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlCxRXUbuEVRDNUJATvYqFpExjAYFzJfVf3M1jT/wJSJ7w4NMGU9TzeOHT37MKZGEjZCdHAZMJ7EuOL1JGMkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:14:09.058571Z"},"content_sha256":"df34ce37a0511b5d36ddf4e2f4a436eb0bb9e261394b92bb88d5a9c45b49744c","schema_version":"1.0","event_id":"sha256:df34ce37a0511b5d36ddf4e2f4a436eb0bb9e261394b92bb88d5a9c45b49744c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF/bundle.json","state_url":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMIVPIXVC6JFXJN3GMHI66CHWF/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-09T14:14:09Z","links":{"resolver":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF","bundle":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF/bundle.json","state":"https://pith.science/pith/VMIVPIXVC6JFXJN3GMHI66CHWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMIVPIXVC6JFXJN3GMHI66CHWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VMIVPIXVC6JFXJN3GMHI66CHWF","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":"cb21b35528e9e20530a688318c306d2797c88592daceb18a51263eddce36cf4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-03T11:13:00Z","title_canon_sha256":"99a9acc12b67de5a602befb673ceec5ffa397a3904fbc9f0718158ed0ae61844"},"schema_version":"1.0","source":{"id":"1304.0917","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0917","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0917v3","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0917","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"VMIVPIXVC6JF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VMIVPIXVC6JFXJN3","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VMIVPIXV","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:df34ce37a0511b5d36ddf4e2f4a436eb0bb9e261394b92bb88d5a9c45b49744c","target":"graph","created_at":"2026-05-18T03:20:47Z","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":"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","authors_text":"Hiroshi Sakamoto, Yasuo Tabei, Yoshimasa Takabatake","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-03T11:13:00Z","title":"A Succinct Grammar Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0917","kind":"arxiv","version":3},"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:fe6f9444bc91e4d7aac5aee2ec35b5205bde16f7ad007d33d3c712f673afa771","target":"record","created_at":"2026-05-18T03:20:47Z","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":"cb21b35528e9e20530a688318c306d2797c88592daceb18a51263eddce36cf4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-03T11:13:00Z","title_canon_sha256":"99a9acc12b67de5a602befb673ceec5ffa397a3904fbc9f0718158ed0ae61844"},"schema_version":"1.0","source":{"id":"1304.0917","kind":"arxiv","version":3}},"canonical_sha256":"ab1157a2f517925ba5bb330e8f7847b15016ebf558477056bce997f05b51f44e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab1157a2f517925ba5bb330e8f7847b15016ebf558477056bce997f05b51f44e","first_computed_at":"2026-05-18T03:20:47.839757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:47.839757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bziu7ZS5mD/R2VdhkDBYoq1UizpiNlPemnxm6B1WASVKrQqLsmBNdEUOMYIdTl0T2V15ZAu/pK5c0eXKtHW+Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:47.840636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0917","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe6f9444bc91e4d7aac5aee2ec35b5205bde16f7ad007d33d3c712f673afa771","sha256:df34ce37a0511b5d36ddf4e2f4a436eb0bb9e261394b92bb88d5a9c45b49744c"],"state_sha256":"e5e2347f71567a73f5153514a52536891ecd0adb0fbbd16c67534627447e89fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H3bndL71rNvCapMLadb1o+1NbG+fr5mwlwwFB7n46XK7j/jjlzJFppcNOQrbO6YCR72H5G0ZoivhTS5G+XkHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:14:09.060486Z","bundle_sha256":"ece2627f3d2e9564daa36527468404193d43fbd0b0c8e278a1d55c9e504d9237"}}