{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:EGGW7ZUZTSXLKDL5UTI4XTL7OM","short_pith_number":"pith:EGGW7ZUZ","schema_version":"1.0","canonical_sha256":"218d6fe6999caeb50d7da4d1cbcd7f73279deacebab29e8a42ed40dbc7e0e030","source":{"kind":"arxiv","id":"1101.0080","version":3},"attestation_state":"computed","paper":{"title":"A Searchable Compressed Edit-Sensitive Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Sakamoto, Masaya Nakahara, Naoya Kishiue, Shirou Maruyama","submitted_at":"2010-12-30T13:04:56Z","abstract_excerpt":"Practical data structures for the edit-sensitive parsing (ESP) are proposed. Given a string S, its ESP tree is equivalent to a context-free grammar G generating just S, which is represented by a DAG. Using the succinct data structures for trees and permutations, G is decomposed to two LOUDS bit strings and single array in (1+\\epsilon)n\\log n+4n+o(n) bits for any 0<\\epsilon <1 and the number n of variables in G. The time to count occurrences of P in S is in O(\\frac{1}{\\epsilon}(m\\log n+occ_c(\\log m\\log u)), whereas m = |P|, u = |S|, and occ_c is the number of occurrences of a maximal common sub"},"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":"1101.0080","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-30T13:04:56Z","cross_cats_sorted":[],"title_canon_sha256":"c72157026e9d4e4ab770525216628f8c293c3f9f69631841c920c7b5b86542b2","abstract_canon_sha256":"c04c09bb894931896ab508f08692a14c020effc8b135c4cd24921638d2eaf01e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:05.980555Z","signature_b64":"DJK13cCUrP1sNkrwFfMhofIBQ41qe9/nQYmp8x17te/dKLuw64LwJNBaHQIDUBv/LJTOjEFVQSi4YO4qYfalDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"218d6fe6999caeb50d7da4d1cbcd7f73279deacebab29e8a42ed40dbc7e0e030","last_reissued_at":"2026-05-18T02:23:05.980073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:05.980073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Searchable Compressed Edit-Sensitive Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Sakamoto, Masaya Nakahara, Naoya Kishiue, Shirou Maruyama","submitted_at":"2010-12-30T13:04:56Z","abstract_excerpt":"Practical data structures for the edit-sensitive parsing (ESP) are proposed. Given a string S, its ESP tree is equivalent to a context-free grammar G generating just S, which is represented by a DAG. Using the succinct data structures for trees and permutations, G is decomposed to two LOUDS bit strings and single array in (1+\\epsilon)n\\log n+4n+o(n) bits for any 0<\\epsilon <1 and the number n of variables in G. The time to count occurrences of P in S is in O(\\frac{1}{\\epsilon}(m\\log n+occ_c(\\log m\\log u)), whereas m = |P|, u = |S|, and occ_c is the number of occurrences of a maximal common sub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0080","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":"1101.0080","created_at":"2026-05-18T02:23:05.980135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.0080v3","created_at":"2026-05-18T02:23:05.980135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0080","created_at":"2026-05-18T02:23:05.980135+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGGW7ZUZTSXL","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGGW7ZUZTSXLKDL5","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGGW7ZUZ","created_at":"2026-05-18T12:26:06.534383+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/EGGW7ZUZTSXLKDL5UTI4XTL7OM","json":"https://pith.science/pith/EGGW7ZUZTSXLKDL5UTI4XTL7OM.json","graph_json":"https://pith.science/api/pith-number/EGGW7ZUZTSXLKDL5UTI4XTL7OM/graph.json","events_json":"https://pith.science/api/pith-number/EGGW7ZUZTSXLKDL5UTI4XTL7OM/events.json","paper":"https://pith.science/paper/EGGW7ZUZ"},"agent_actions":{"view_html":"https://pith.science/pith/EGGW7ZUZTSXLKDL5UTI4XTL7OM","download_json":"https://pith.science/pith/EGGW7ZUZTSXLKDL5UTI4XTL7OM.json","view_paper":"https://pith.science/paper/EGGW7ZUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.0080&json=true","fetch_graph":"https://pith.science/api/pith-number/EGGW7ZUZTSXLKDL5UTI4XTL7OM/graph.json","fetch_events":"https://pith.science/api/pith-number/EGGW7ZUZTSXLKDL5UTI4XTL7OM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGGW7ZUZTSXLKDL5UTI4XTL7OM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGGW7ZUZTSXLKDL5UTI4XTL7OM/action/storage_attestation","attest_author":"https://pith.science/pith/EGGW7ZUZTSXLKDL5UTI4XTL7OM/action/author_attestation","sign_citation":"https://pith.science/pith/EGGW7ZUZTSXLKDL5UTI4XTL7OM/action/citation_signature","submit_replication":"https://pith.science/pith/EGGW7ZUZTSXLKDL5UTI4XTL7OM/action/replication_record"}},"created_at":"2026-05-18T02:23:05.980135+00:00","updated_at":"2026-05-18T02:23:05.980135+00:00"}