{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XPT6U6Z6UOTEJROCBDXCVGH6ON","short_pith_number":"pith:XPT6U6Z6","canonical_record":{"source":{"id":"1401.0936","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-05T20:26:13Z","cross_cats_sorted":[],"title_canon_sha256":"8bfa760dc20aa2fdd684e9c1a9242c34954ba834269c261a4bfade1591b1c9cd","abstract_canon_sha256":"3f643c61210e936e56fedf29fa1c03cafff62cd378096f55a88e45201f642583"},"schema_version":"1.0"},"canonical_sha256":"bbe7ea7b3ea3a644c5c208ee2a98fe736a56e8b03879bf497fd43d441f659440","source":{"kind":"arxiv","id":"1401.0936","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0936","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0936v3","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0936","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"XPT6U6Z6UOTE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XPT6U6Z6UOTEJROC","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XPT6U6Z6","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XPT6U6Z6UOTEJROCBDXCVGH6ON","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0936","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-05T20:26:13Z","cross_cats_sorted":[],"title_canon_sha256":"8bfa760dc20aa2fdd684e9c1a9242c34954ba834269c261a4bfade1591b1c9cd","abstract_canon_sha256":"3f643c61210e936e56fedf29fa1c03cafff62cd378096f55a88e45201f642583"},"schema_version":"1.0"},"canonical_sha256":"bbe7ea7b3ea3a644c5c208ee2a98fe736a56e8b03879bf497fd43d441f659440","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:18.449551Z","signature_b64":"Onu54GpY+wQq2DTxynmhxjMhu3fOf4YTTRmdoHcBDtKQF96/D+7NZnsujYfTItBOQEH0L1xQADoxI0/Ql5sFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbe7ea7b3ea3a644c5c208ee2a98fe736a56e8b03879bf497fd43d441f659440","last_reissued_at":"2026-05-18T01:14:18.448982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:18.448982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0936","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-18T01:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBBdWeFWNIeq6JPQETPs1oTSQLaOnNSJ171E+D8cjg6+noiZWxDUg9nfmye+XcdowrrLUY71AUSk+r9CGYeHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:27:20.477173Z"},"content_sha256":"c1b130918d21936a9ff5343dd903cb0137329fbb1d9ee718ba6b934c8e270ed1","schema_version":"1.0","event_id":"sha256:c1b130918d21936a9ff5343dd903cb0137329fbb1d9ee718ba6b934c8e270ed1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XPT6U6Z6UOTEJROCBDXCVGH6ON","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear time construction of compressed text indices in compact space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui","submitted_at":"2014-01-05T20:26:13Z","abstract_excerpt":"We show that the compressed suffix array and the compressed suffix tree for a string of length $n$ over an integer alphabet of size $\\sigma\\leq n$ can both be built in $O(n)$ (randomized) time using only $O(n\\log\\sigma)$ bits of working space. The previously fastest construction algorithms that used $O(n\\log\\sigma)$ bits of space took times $O(n\\log\\log\\sigma)$ and $O(n\\log^{\\epsilon}n)$ respectively (where $\\epsilon$ is any positive constant smaller than $1$). In the passing, we show that the Burrows-Wheeler transform of a string of length $n$ over an alphabet of size $\\sigma$ can be built in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0936","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-18T01:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RCVAV+Wf+hR0VPeTXzpzYMqFQCLxn5NDsPluj2JFdQ4FZBjTE15SOfH74yfwyKKGEIrF6/arHTzdQ5J2KC/KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:27:20.477541Z"},"content_sha256":"7bb3a47d0322db4ae6d2904a63faafdd3866f7b31e5426ddd3e5a345371003bd","schema_version":"1.0","event_id":"sha256:7bb3a47d0322db4ae6d2904a63faafdd3866f7b31e5426ddd3e5a345371003bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPT6U6Z6UOTEJROCBDXCVGH6ON/bundle.json","state_url":"https://pith.science/pith/XPT6U6Z6UOTEJROCBDXCVGH6ON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPT6U6Z6UOTEJROCBDXCVGH6ON/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-02T10:27:20Z","links":{"resolver":"https://pith.science/pith/XPT6U6Z6UOTEJROCBDXCVGH6ON","bundle":"https://pith.science/pith/XPT6U6Z6UOTEJROCBDXCVGH6ON/bundle.json","state":"https://pith.science/pith/XPT6U6Z6UOTEJROCBDXCVGH6ON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPT6U6Z6UOTEJROCBDXCVGH6ON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XPT6U6Z6UOTEJROCBDXCVGH6ON","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":"3f643c61210e936e56fedf29fa1c03cafff62cd378096f55a88e45201f642583","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-05T20:26:13Z","title_canon_sha256":"8bfa760dc20aa2fdd684e9c1a9242c34954ba834269c261a4bfade1591b1c9cd"},"schema_version":"1.0","source":{"id":"1401.0936","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0936","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0936v3","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0936","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"XPT6U6Z6UOTE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XPT6U6Z6UOTEJROC","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XPT6U6Z6","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:7bb3a47d0322db4ae6d2904a63faafdd3866f7b31e5426ddd3e5a345371003bd","target":"graph","created_at":"2026-05-18T01:14:18Z","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 show that the compressed suffix array and the compressed suffix tree for a string of length $n$ over an integer alphabet of size $\\sigma\\leq n$ can both be built in $O(n)$ (randomized) time using only $O(n\\log\\sigma)$ bits of working space. The previously fastest construction algorithms that used $O(n\\log\\sigma)$ bits of space took times $O(n\\log\\log\\sigma)$ and $O(n\\log^{\\epsilon}n)$ respectively (where $\\epsilon$ is any positive constant smaller than $1$). In the passing, we show that the Burrows-Wheeler transform of a string of length $n$ over an alphabet of size $\\sigma$ can be built in","authors_text":"Djamal Belazzougui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-05T20:26:13Z","title":"Linear time construction of compressed text indices in compact space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0936","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:c1b130918d21936a9ff5343dd903cb0137329fbb1d9ee718ba6b934c8e270ed1","target":"record","created_at":"2026-05-18T01:14:18Z","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":"3f643c61210e936e56fedf29fa1c03cafff62cd378096f55a88e45201f642583","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-05T20:26:13Z","title_canon_sha256":"8bfa760dc20aa2fdd684e9c1a9242c34954ba834269c261a4bfade1591b1c9cd"},"schema_version":"1.0","source":{"id":"1401.0936","kind":"arxiv","version":3}},"canonical_sha256":"bbe7ea7b3ea3a644c5c208ee2a98fe736a56e8b03879bf497fd43d441f659440","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbe7ea7b3ea3a644c5c208ee2a98fe736a56e8b03879bf497fd43d441f659440","first_computed_at":"2026-05-18T01:14:18.448982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:18.448982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Onu54GpY+wQq2DTxynmhxjMhu3fOf4YTTRmdoHcBDtKQF96/D+7NZnsujYfTItBOQEH0L1xQADoxI0/Ql5sFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:18.449551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0936","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1b130918d21936a9ff5343dd903cb0137329fbb1d9ee718ba6b934c8e270ed1","sha256:7bb3a47d0322db4ae6d2904a63faafdd3866f7b31e5426ddd3e5a345371003bd"],"state_sha256":"3bf4f8aa19f23aa8763279a85d18ba9de69668aba03f3f35beb276a468546dbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9I59N1/D+x0jRRGK44ZoiKPMD63H80boiOn22Dq9E0LUboW/HlwGztla7mW1ULb54EGFEoI2QKfDMDQPmepAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:27:20.479336Z","bundle_sha256":"3562b1a6f582bf2fd2c3457e60ae597c2a8e2841b73a3f642d7c661d98edbcf2"}}