{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LOVUMEWH3KVBMPHD45BHQ53OD6","short_pith_number":"pith:LOVUMEWH","canonical_record":{"source":{"id":"1609.09654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-30T09:51:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2b177a2a4bb75a22f7d6a5883e63a21b2ee81d81095c83daf2c26ddf995e4c4d","abstract_canon_sha256":"4bdaef3d4bc176354e83052a5b3c34dd710d4bf0b382bbc79300695a1741ab90"},"schema_version":"1.0"},"canonical_sha256":"5bab4612c7daaa163ce3e74278776e1fb388110cc890390185eea5184f85243e","source":{"kind":"arxiv","id":"1609.09654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09654","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09654v1","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09654","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"LOVUMEWH3KVB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LOVUMEWH3KVBMPHD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LOVUMEWH","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LOVUMEWH3KVBMPHD45BHQ53OD6","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-30T09:51:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2b177a2a4bb75a22f7d6a5883e63a21b2ee81d81095c83daf2c26ddf995e4c4d","abstract_canon_sha256":"4bdaef3d4bc176354e83052a5b3c34dd710d4bf0b382bbc79300695a1741ab90"},"schema_version":"1.0"},"canonical_sha256":"5bab4612c7daaa163ce3e74278776e1fb388110cc890390185eea5184f85243e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:35.428199Z","signature_b64":"hhGLvuqFJFcdprPSumCXhVBeFXiO4rSUezo6W6xpZ3CcySsWO0sNuGaTSJ2n4icc0rXAezL74E2TC6DgMxSTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bab4612c7daaa163ce3e74278776e1fb388110cc890390185eea5184f85243e","last_reissued_at":"2026-05-18T01:03:35.427576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:35.427576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09654","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-18T01:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jw3FOLohgilNvsCDKO6s3NQLqbfymiv6mWALYRLntCKVbL9OQ4bXJROAzvXTt41jqs5vSgG8ayDT0sfzXLyPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:16:05.968632Z"},"content_sha256":"50ffc41a191399f990515501dd8edd8c0c708c09d3c44087790b49d8b28940a1","schema_version":"1.0","event_id":"sha256:50ffc41a191399f990515501dd8edd8c0c708c09d3c44087790b49d8b28940a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LOVUMEWH3KVBMPHD45BHQ53OD6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ERA Revisited: Theoretical and Experimental Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andrej Brodnik, Matev\\v{z} Jekovec","submitted_at":"2016-09-30T09:51:36Z","abstract_excerpt":"Efficient construction of the suffix tree given an input text is an active area of research from the time it was first introduced. Both theoretical computer scientists and engineers tackled the problem. In this paper we focus on the fastest practical suffix tree construction algorithm to date, ERA. We first provide a theoretical analysis of the algorithm assuming the uniformly random text as an input and using the PEM model of computation with respect to the lower bounds. Secondly, we empirically confirm the theoretical results in different test scenarios exposing the critical terms. Thirdly, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09654","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-18T01:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTTVZqY7jtbfSo4B8suAS0uIHba4aOEQ8u2cMWf61tfTHazemAmjSLurz12cSs5OTFyqQQBIiO5PuGKBzlnWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:16:05.968988Z"},"content_sha256":"d2b5bffb45775132e3b3fec6e2a1cdb02b6c1121d7a72251dc842b3aa9e0209c","schema_version":"1.0","event_id":"sha256:d2b5bffb45775132e3b3fec6e2a1cdb02b6c1121d7a72251dc842b3aa9e0209c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOVUMEWH3KVBMPHD45BHQ53OD6/bundle.json","state_url":"https://pith.science/pith/LOVUMEWH3KVBMPHD45BHQ53OD6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOVUMEWH3KVBMPHD45BHQ53OD6/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-22T11:16:05Z","links":{"resolver":"https://pith.science/pith/LOVUMEWH3KVBMPHD45BHQ53OD6","bundle":"https://pith.science/pith/LOVUMEWH3KVBMPHD45BHQ53OD6/bundle.json","state":"https://pith.science/pith/LOVUMEWH3KVBMPHD45BHQ53OD6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOVUMEWH3KVBMPHD45BHQ53OD6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LOVUMEWH3KVBMPHD45BHQ53OD6","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":"4bdaef3d4bc176354e83052a5b3c34dd710d4bf0b382bbc79300695a1741ab90","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-30T09:51:36Z","title_canon_sha256":"2b177a2a4bb75a22f7d6a5883e63a21b2ee81d81095c83daf2c26ddf995e4c4d"},"schema_version":"1.0","source":{"id":"1609.09654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09654","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09654v1","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09654","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"LOVUMEWH3KVB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LOVUMEWH3KVBMPHD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LOVUMEWH","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:d2b5bffb45775132e3b3fec6e2a1cdb02b6c1121d7a72251dc842b3aa9e0209c","target":"graph","created_at":"2026-05-18T01:03:35Z","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":"Efficient construction of the suffix tree given an input text is an active area of research from the time it was first introduced. Both theoretical computer scientists and engineers tackled the problem. In this paper we focus on the fastest practical suffix tree construction algorithm to date, ERA. We first provide a theoretical analysis of the algorithm assuming the uniformly random text as an input and using the PEM model of computation with respect to the lower bounds. Secondly, we empirically confirm the theoretical results in different test scenarios exposing the critical terms. Thirdly, ","authors_text":"Andrej Brodnik, Matev\\v{z} Jekovec","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-30T09:51:36Z","title":"ERA Revisited: Theoretical and Experimental Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09654","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:50ffc41a191399f990515501dd8edd8c0c708c09d3c44087790b49d8b28940a1","target":"record","created_at":"2026-05-18T01:03:35Z","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":"4bdaef3d4bc176354e83052a5b3c34dd710d4bf0b382bbc79300695a1741ab90","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-30T09:51:36Z","title_canon_sha256":"2b177a2a4bb75a22f7d6a5883e63a21b2ee81d81095c83daf2c26ddf995e4c4d"},"schema_version":"1.0","source":{"id":"1609.09654","kind":"arxiv","version":1}},"canonical_sha256":"5bab4612c7daaa163ce3e74278776e1fb388110cc890390185eea5184f85243e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bab4612c7daaa163ce3e74278776e1fb388110cc890390185eea5184f85243e","first_computed_at":"2026-05-18T01:03:35.427576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:35.427576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hhGLvuqFJFcdprPSumCXhVBeFXiO4rSUezo6W6xpZ3CcySsWO0sNuGaTSJ2n4icc0rXAezL74E2TC6DgMxSTCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:35.428199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50ffc41a191399f990515501dd8edd8c0c708c09d3c44087790b49d8b28940a1","sha256:d2b5bffb45775132e3b3fec6e2a1cdb02b6c1121d7a72251dc842b3aa9e0209c"],"state_sha256":"0b37faa4013c34727305c752b0e41ca407945030b66dc7931399512aacccb6ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8FYx+jfabXM5NkBj/RszFp2hDGh0fiRqAG77g+p8SZYZa3GJ7bz+8b1cWo9q6OosOs69e3UmR5MUecvbrguuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:16:05.971076Z","bundle_sha256":"274c0c2b8dc5579e3c96a7def426712cdb27151e59500228f9da4691df3ca88a"}}