{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5IO2ELIRDXTJM2WFG2WDIDUS7Y","short_pith_number":"pith:5IO2ELIR","canonical_record":{"source":{"id":"1703.01009","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-03T01:30:36Z","cross_cats_sorted":[],"title_canon_sha256":"b2cf984aab152a9f11402cfbdfa1d90389e3540b296ea8624f7302d2e743b6ab","abstract_canon_sha256":"01b250d727c14a895854dd294fa62b357c930d84cd49305cdafd6573691e4ca0"},"schema_version":"1.0"},"canonical_sha256":"ea1da22d111de6966ac536ac340e92fe134832f04b7af549d5bf821250eba1b1","source":{"kind":"arxiv","id":"1703.01009","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01009","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01009v5","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01009","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"5IO2ELIRDXTJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5IO2ELIRDXTJM2WF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5IO2ELIR","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5IO2ELIRDXTJM2WFG2WDIDUS7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1703.01009","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-03T01:30:36Z","cross_cats_sorted":[],"title_canon_sha256":"b2cf984aab152a9f11402cfbdfa1d90389e3540b296ea8624f7302d2e743b6ab","abstract_canon_sha256":"01b250d727c14a895854dd294fa62b357c930d84cd49305cdafd6573691e4ca0"},"schema_version":"1.0"},"canonical_sha256":"ea1da22d111de6966ac536ac340e92fe134832f04b7af549d5bf821250eba1b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:43.925414Z","signature_b64":"IZ74lw8RVV5VfwW80pTOkPOnefNdRyHvZ3rjBzYXIkABQeFGzfWEr1QIN3ulEmkDGk4n363iWhCyhllPg9DKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea1da22d111de6966ac536ac340e92fe134832f04b7af549d5bf821250eba1b1","last_reissued_at":"2026-05-17T23:40:43.924766Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:43.924766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.01009","source_version":5,"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-17T23:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VOzWKo4fKPk3jXJpoor6yyMPsL4J8CbsBEzoEq4EkOEYU5k2Nqyj5uaqkJHmb7HflT9aJDhGSZTtkRS58XRbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:45:34.465402Z"},"content_sha256":"4878f1f7ef9b5e34472fdd32e880ac175adb1bf0a5eff39d9e2efcd0a6944c56","schema_version":"1.0","event_id":"sha256:4878f1f7ef9b5e34472fdd32e880ac175adb1bf0a5eff39d9e2efcd0a6944c56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5IO2ELIRDXTJM2WFG2WDIDUS7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Keisuke Goto","submitted_at":"2017-03-03T01:30:36Z","abstract_excerpt":"Suffix arrays and LCP arrays are one of the most fundamental data structures widely used for various kinds of string processing. We consider two problems for a read-only string of length $N$ over an integer alphabet $[1, \\dots, \\sigma]$ for $1 \\leq \\sigma \\leq N$, the string contains $\\sigma$ distinct characters, the construction of the suffix array, and a simultaneous construction of both the suffix array and LCP array. For the word RAM model, we propose algorithms to solve both of the problems in $O(N)$ time by using $O(1)$ extra words, which are optimal in time and space. Extra words means "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01009","kind":"arxiv","version":5},"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-17T23:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEHQ86CfGUu8o0uMHvZM9nqbkNNSbWh2+n5sdmiH2Vp7g2tkz4s5xMN7PueBByy5pQz0Tr9lvDysA/3I1UkvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:45:34.465791Z"},"content_sha256":"45ead3cac47dcfa0cf92e2985e855b6618adaf282d870c1cff92ee47930e030c","schema_version":"1.0","event_id":"sha256:45ead3cac47dcfa0cf92e2985e855b6618adaf282d870c1cff92ee47930e030c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IO2ELIRDXTJM2WFG2WDIDUS7Y/bundle.json","state_url":"https://pith.science/pith/5IO2ELIRDXTJM2WFG2WDIDUS7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IO2ELIRDXTJM2WFG2WDIDUS7Y/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-09T22:45:34Z","links":{"resolver":"https://pith.science/pith/5IO2ELIRDXTJM2WFG2WDIDUS7Y","bundle":"https://pith.science/pith/5IO2ELIRDXTJM2WFG2WDIDUS7Y/bundle.json","state":"https://pith.science/pith/5IO2ELIRDXTJM2WFG2WDIDUS7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IO2ELIRDXTJM2WFG2WDIDUS7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5IO2ELIRDXTJM2WFG2WDIDUS7Y","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":"01b250d727c14a895854dd294fa62b357c930d84cd49305cdafd6573691e4ca0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-03T01:30:36Z","title_canon_sha256":"b2cf984aab152a9f11402cfbdfa1d90389e3540b296ea8624f7302d2e743b6ab"},"schema_version":"1.0","source":{"id":"1703.01009","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01009","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01009v5","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01009","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"5IO2ELIRDXTJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5IO2ELIRDXTJM2WF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5IO2ELIR","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:45ead3cac47dcfa0cf92e2985e855b6618adaf282d870c1cff92ee47930e030c","target":"graph","created_at":"2026-05-17T23:40:43Z","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":"Suffix arrays and LCP arrays are one of the most fundamental data structures widely used for various kinds of string processing. We consider two problems for a read-only string of length $N$ over an integer alphabet $[1, \\dots, \\sigma]$ for $1 \\leq \\sigma \\leq N$, the string contains $\\sigma$ distinct characters, the construction of the suffix array, and a simultaneous construction of both the suffix array and LCP array. For the word RAM model, we propose algorithms to solve both of the problems in $O(N)$ time by using $O(1)$ extra words, which are optimal in time and space. Extra words means ","authors_text":"Keisuke Goto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-03T01:30:36Z","title":"Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01009","kind":"arxiv","version":5},"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:4878f1f7ef9b5e34472fdd32e880ac175adb1bf0a5eff39d9e2efcd0a6944c56","target":"record","created_at":"2026-05-17T23:40:43Z","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":"01b250d727c14a895854dd294fa62b357c930d84cd49305cdafd6573691e4ca0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-03T01:30:36Z","title_canon_sha256":"b2cf984aab152a9f11402cfbdfa1d90389e3540b296ea8624f7302d2e743b6ab"},"schema_version":"1.0","source":{"id":"1703.01009","kind":"arxiv","version":5}},"canonical_sha256":"ea1da22d111de6966ac536ac340e92fe134832f04b7af549d5bf821250eba1b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea1da22d111de6966ac536ac340e92fe134832f04b7af549d5bf821250eba1b1","first_computed_at":"2026-05-17T23:40:43.924766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:43.924766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IZ74lw8RVV5VfwW80pTOkPOnefNdRyHvZ3rjBzYXIkABQeFGzfWEr1QIN3ulEmkDGk4n363iWhCyhllPg9DKAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:43.925414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01009","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4878f1f7ef9b5e34472fdd32e880ac175adb1bf0a5eff39d9e2efcd0a6944c56","sha256:45ead3cac47dcfa0cf92e2985e855b6618adaf282d870c1cff92ee47930e030c"],"state_sha256":"97396511012e1228b9f08a3b6e74ea08f4827065adb76e3d8bf8c4d61d1f642b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xG3xlfozmJTUQnbfMMbAvtLF25rY8U0aY0ef5U4Acxqq/YlOS9YqpgabE06ILkrqtCleBCfjFiKLVpiu+GBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T22:45:34.467951Z","bundle_sha256":"f2ca47ff494ab3290441d22445b6eaae8e5b495bb05c94eadc2c7fe9363512de"}}