{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EFNEJHMLBBXTEJLVLG7G6NQF6G","short_pith_number":"pith:EFNEJHML","canonical_record":{"source":{"id":"1604.01168","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-05T08:21:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"82b232da1a70c542f1c395da4a2ae90219b7fb107ce85db27fdcf71c4c48a934","abstract_canon_sha256":"da096aff4bcbc82aaf75998b99982d067653f08e3649b99e91aae756d6d7f87b"},"schema_version":"1.0"},"canonical_sha256":"215a449d8b086f32257559be6f3605f18b220341d780450e2574cb974f276a0e","source":{"kind":"arxiv","id":"1604.01168","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01168","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01168v2","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01168","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"EFNEJHMLBBXT","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EFNEJHMLBBXTEJLV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EFNEJHML","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EFNEJHMLBBXTEJLVLG7G6NQF6G","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01168","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-05T08:21:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"82b232da1a70c542f1c395da4a2ae90219b7fb107ce85db27fdcf71c4c48a934","abstract_canon_sha256":"da096aff4bcbc82aaf75998b99982d067653f08e3649b99e91aae756d6d7f87b"},"schema_version":"1.0"},"canonical_sha256":"215a449d8b086f32257559be6f3605f18b220341d780450e2574cb974f276a0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:25.532788Z","signature_b64":"ezkmuG3VHE7AsLZnT/Lr8WA/3v3aW8zkWM67vmBAqNAJOnqfVfQGQcwhD+FCHspE2kn+1VSVd6D8NfyeN1S5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"215a449d8b086f32257559be6f3605f18b220341d780450e2574cb974f276a0e","last_reissued_at":"2026-05-18T00:59:25.532174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:25.532174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01168","source_version":2,"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-18T00:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t7VKC3sARe7iLF7JokMYQUECg0dgfgUQvH6wJja4AHql/5dLXvQ4xM7X+4Rcg58hbAu6YQVx24RyvXQfSD3kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:55:48.763823Z"},"content_sha256":"d60d2984063fa52ea3c4bf60ea77e2fc7f0d1508b02cd71dbfaba9cebc5ee899","schema_version":"1.0","event_id":"sha256:d60d2984063fa52ea3c4bf60ea77e2fc7f0d1508b02cd71dbfaba9cebc5ee899"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EFNEJHMLBBXTEJLVLG7G6NQF6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Estimation of the Size of Non-Compact Suffix Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"B\\'alint V\\'as\\'arhelyi","submitted_at":"2016-04-05T08:21:53Z","abstract_excerpt":"A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the compact suffix trees, which have linear space complexity. The motivation of this paper is the question whether the space complexity of simple suffix trees is quadratic not only in the worst case, but also in expectation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01168","kind":"arxiv","version":2},"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-18T00:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZqH5OxcgBlJdG1NLdcPWYuJzWNTKXXmf0uwZ3jIJTKmYenZOHZ3ZpEsSckcxcGQVKLsZwn9YGnVFwHE211zgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:55:48.764177Z"},"content_sha256":"cb561701ee5f9bbd1944076176b9e1f8337f2d08696d95011a26c035d2b253eb","schema_version":"1.0","event_id":"sha256:cb561701ee5f9bbd1944076176b9e1f8337f2d08696d95011a26c035d2b253eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFNEJHMLBBXTEJLVLG7G6NQF6G/bundle.json","state_url":"https://pith.science/pith/EFNEJHMLBBXTEJLVLG7G6NQF6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFNEJHMLBBXTEJLVLG7G6NQF6G/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-26T05:55:48Z","links":{"resolver":"https://pith.science/pith/EFNEJHMLBBXTEJLVLG7G6NQF6G","bundle":"https://pith.science/pith/EFNEJHMLBBXTEJLVLG7G6NQF6G/bundle.json","state":"https://pith.science/pith/EFNEJHMLBBXTEJLVLG7G6NQF6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFNEJHMLBBXTEJLVLG7G6NQF6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EFNEJHMLBBXTEJLVLG7G6NQF6G","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":"da096aff4bcbc82aaf75998b99982d067653f08e3649b99e91aae756d6d7f87b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-05T08:21:53Z","title_canon_sha256":"82b232da1a70c542f1c395da4a2ae90219b7fb107ce85db27fdcf71c4c48a934"},"schema_version":"1.0","source":{"id":"1604.01168","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01168","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01168v2","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01168","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"EFNEJHMLBBXT","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EFNEJHMLBBXTEJLV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EFNEJHML","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:cb561701ee5f9bbd1944076176b9e1f8337f2d08696d95011a26c035d2b253eb","target":"graph","created_at":"2026-05-18T00:59:25Z","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":"A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the compact suffix trees, which have linear space complexity. The motivation of this paper is the question whether the space complexity of simple suffix trees is quadratic not only in the worst case, but also in expectation.","authors_text":"B\\'alint V\\'as\\'arhelyi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-05T08:21:53Z","title":"An Estimation of the Size of Non-Compact Suffix Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01168","kind":"arxiv","version":2},"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:d60d2984063fa52ea3c4bf60ea77e2fc7f0d1508b02cd71dbfaba9cebc5ee899","target":"record","created_at":"2026-05-18T00:59:25Z","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":"da096aff4bcbc82aaf75998b99982d067653f08e3649b99e91aae756d6d7f87b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-05T08:21:53Z","title_canon_sha256":"82b232da1a70c542f1c395da4a2ae90219b7fb107ce85db27fdcf71c4c48a934"},"schema_version":"1.0","source":{"id":"1604.01168","kind":"arxiv","version":2}},"canonical_sha256":"215a449d8b086f32257559be6f3605f18b220341d780450e2574cb974f276a0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"215a449d8b086f32257559be6f3605f18b220341d780450e2574cb974f276a0e","first_computed_at":"2026-05-18T00:59:25.532174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:25.532174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ezkmuG3VHE7AsLZnT/Lr8WA/3v3aW8zkWM67vmBAqNAJOnqfVfQGQcwhD+FCHspE2kn+1VSVd6D8NfyeN1S5AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:25.532788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01168","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d60d2984063fa52ea3c4bf60ea77e2fc7f0d1508b02cd71dbfaba9cebc5ee899","sha256:cb561701ee5f9bbd1944076176b9e1f8337f2d08696d95011a26c035d2b253eb"],"state_sha256":"a5a657e47c4efb27e2e2e28726be342beb853e3b4f4dc711bb89542e124505b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsfYHjZkfVulxBLvIdIh4+noQD2aQRb0qyqc8hK3R9ek39GHfuH1WXcU7psn/cVJico9Jx96GCoLHC3KjeYrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T05:55:48.766106Z","bundle_sha256":"3f043df3a7dda7b786e102c6c1424322db2cc94d71e3b3d13dad5a001bebb628"}}