{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7YUVYXHEAZ3UPQ4GWVTFEXVMBF","short_pith_number":"pith:7YUVYXHE","canonical_record":{"source":{"id":"1509.07417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-24T16:05:25Z","cross_cats_sorted":[],"title_canon_sha256":"2ea8dd1826108205b9d3313a755b2140799fdbe1864d745597819495b6d7c0d8","abstract_canon_sha256":"438d59a41cd016cf7a6f12462ec8d5cda18a626ef97cbbdbba786c8cab1a0f77"},"schema_version":"1.0"},"canonical_sha256":"fe295c5ce4067747c386b566525eac095849f1de6ed5ac565d9a5a67af3f60df","source":{"kind":"arxiv","id":"1509.07417","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07417","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07417v2","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07417","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"7YUVYXHEAZ3U","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7YUVYXHEAZ3UPQ4G","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7YUVYXHE","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7YUVYXHEAZ3UPQ4GWVTFEXVMBF","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-24T16:05:25Z","cross_cats_sorted":[],"title_canon_sha256":"2ea8dd1826108205b9d3313a755b2140799fdbe1864d745597819495b6d7c0d8","abstract_canon_sha256":"438d59a41cd016cf7a6f12462ec8d5cda18a626ef97cbbdbba786c8cab1a0f77"},"schema_version":"1.0"},"canonical_sha256":"fe295c5ce4067747c386b566525eac095849f1de6ed5ac565d9a5a67af3f60df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:22.591546Z","signature_b64":"NVDvjDEsy1VODELTqu2BaeHXrcJfllmE9bnStJX0QeDkmKjslM961PYbWSSZWTo20WiCsG0fIP+idN2sNGbkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe295c5ce4067747c386b566525eac095849f1de6ed5ac565d9a5a67af3f60df","last_reissued_at":"2026-05-18T00:20:22.590896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:22.590896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07417","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:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqSAMVJ4HRf4wxU0iM3aV3IplF+1gnxZITEU+pjZyMe2sktG3Voc3DBq5/CCkoLhGydq8ybfDj06vS/TSFfTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:57:11.899936Z"},"content_sha256":"731c961d818b8d1d200c60a7e96581a339c1dc1bea2d87a9bdc9e04f813ef75c","schema_version":"1.0","event_id":"sha256:731c961d818b8d1d200c60a7e96581a339c1dc1bea2d87a9bdc9e04f813ef75c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7YUVYXHEAZ3UPQ4GWVTFEXVMBF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Sparse Suffix Sorting in the Restore Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Johannes Fischer, Tomohiro I","submitted_at":"2015-09-24T16:05:25Z","abstract_excerpt":"Given a text $T$ of length $n$, we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of $T$ in $O(c \\sqrt{\\lg n} + m \\lg m \\lg n \\lg^* n)$ time with $O(m)$ words of space under the premise that the space of $T$ is rewritable, where $m \\le n$ is the number of suffixes to be sorted (provided online and arbitrarily), and $c$ is the number of characters with $m \\le c \\le n$ that must be compared for distinguishing the designated suffixes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07417","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:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOs5Or8GfBsGlCj1jxvbvbt4zxS0pMh3m/diV5QAYhLcYlS04l/kkUS33I1W5ys/En0ppdFBZNjD4S02xGc7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:57:11.900289Z"},"content_sha256":"faa116f78d78c9b10b8d2be7f22617bb386cb5323afe4bb1098e74751d57c851","schema_version":"1.0","event_id":"sha256:faa116f78d78c9b10b8d2be7f22617bb386cb5323afe4bb1098e74751d57c851"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/bundle.json","state_url":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/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-05-30T20:57:11Z","links":{"resolver":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF","bundle":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/bundle.json","state":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7YUVYXHEAZ3UPQ4GWVTFEXVMBF","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":"438d59a41cd016cf7a6f12462ec8d5cda18a626ef97cbbdbba786c8cab1a0f77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-24T16:05:25Z","title_canon_sha256":"2ea8dd1826108205b9d3313a755b2140799fdbe1864d745597819495b6d7c0d8"},"schema_version":"1.0","source":{"id":"1509.07417","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07417","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07417v2","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07417","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"7YUVYXHEAZ3U","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7YUVYXHEAZ3UPQ4G","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7YUVYXHE","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:faa116f78d78c9b10b8d2be7f22617bb386cb5323afe4bb1098e74751d57c851","target":"graph","created_at":"2026-05-18T00:20:22Z","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":"Given a text $T$ of length $n$, we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of $T$ in $O(c \\sqrt{\\lg n} + m \\lg m \\lg n \\lg^* n)$ time with $O(m)$ words of space under the premise that the space of $T$ is rewritable, where $m \\le n$ is the number of suffixes to be sorted (provided online and arbitrarily), and $c$ is the number of characters with $m \\le c \\le n$ that must be compared for distinguishing the designated suffixes.","authors_text":"Dominik K\\\"oppl, Johannes Fischer, Tomohiro I","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-24T16:05:25Z","title":"Deterministic Sparse Suffix Sorting in the Restore Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07417","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:731c961d818b8d1d200c60a7e96581a339c1dc1bea2d87a9bdc9e04f813ef75c","target":"record","created_at":"2026-05-18T00:20:22Z","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":"438d59a41cd016cf7a6f12462ec8d5cda18a626ef97cbbdbba786c8cab1a0f77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-24T16:05:25Z","title_canon_sha256":"2ea8dd1826108205b9d3313a755b2140799fdbe1864d745597819495b6d7c0d8"},"schema_version":"1.0","source":{"id":"1509.07417","kind":"arxiv","version":2}},"canonical_sha256":"fe295c5ce4067747c386b566525eac095849f1de6ed5ac565d9a5a67af3f60df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe295c5ce4067747c386b566525eac095849f1de6ed5ac565d9a5a67af3f60df","first_computed_at":"2026-05-18T00:20:22.590896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:22.590896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NVDvjDEsy1VODELTqu2BaeHXrcJfllmE9bnStJX0QeDkmKjslM961PYbWSSZWTo20WiCsG0fIP+idN2sNGbkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:22.591546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07417","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:731c961d818b8d1d200c60a7e96581a339c1dc1bea2d87a9bdc9e04f813ef75c","sha256:faa116f78d78c9b10b8d2be7f22617bb386cb5323afe4bb1098e74751d57c851"],"state_sha256":"4bfe1141b31232ac202cbbf5891c78eeec07ade2720873e7fb4b5d4b94369628"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FaSy7+EL1kNAFQnQpgKgZ9Xh6Tpl0BpNKxCMEJPaPCKRat1YS1KAatvyMqcpsUNwOzH4phig3//QtNKAeQ45CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:57:11.902433Z","bundle_sha256":"e1d5299ef0ef74ea0a85628717de0418096223b724c96193b91a973b80ea360c"}}