{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YEBGZT7ZEKDVCKKEEZLCJWVYKH","short_pith_number":"pith:YEBGZT7Z","canonical_record":{"source":{"id":"1610.08305","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-26T12:45:59Z","cross_cats_sorted":[],"title_canon_sha256":"9f69d9b94b58dd3f23a6e9010f93b5f6aad3251f72b45c3cbf1469966fff5185","abstract_canon_sha256":"016fc7eafdac08821723ef1d641ed2e32762cf21ccd1d0bd1e72677580257ff9"},"schema_version":"1.0"},"canonical_sha256":"c1026ccff92287512944265624dab851c22e1bd7319000c94b70ad27a7100b37","source":{"kind":"arxiv","id":"1610.08305","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08305","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08305v6","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08305","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"YEBGZT7ZEKDV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YEBGZT7ZEKDVCKKE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YEBGZT7Z","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YEBGZT7ZEKDVCKKEEZLCJWVYKH","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08305","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-26T12:45:59Z","cross_cats_sorted":[],"title_canon_sha256":"9f69d9b94b58dd3f23a6e9010f93b5f6aad3251f72b45c3cbf1469966fff5185","abstract_canon_sha256":"016fc7eafdac08821723ef1d641ed2e32762cf21ccd1d0bd1e72677580257ff9"},"schema_version":"1.0"},"canonical_sha256":"c1026ccff92287512944265624dab851c22e1bd7319000c94b70ad27a7100b37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:15.504746Z","signature_b64":"M2dElNzpIBj69ivd5t/x+aI2IRRI7hyNuhEKo8mkrqxBPd2RBDgrkh7TcCjvsAVcGUJykv7w+Iz7MgZCZJFZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1026ccff92287512944265624dab851c22e1bd7319000c94b70ad27a7100b37","last_reissued_at":"2026-05-18T00:01:15.504330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:15.504330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08305","source_version":6,"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:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7NwT0TA1jmJVUib/N0sO0gp7yLDe3HJERhz4KPInzC48RGFm71lf/hbcaet8fHM6ThtSWv8hfGABZ83NS9qDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:55:51.210411Z"},"content_sha256":"8d4de225b095cb8304a200056317de5f8c4b2e4604d2d0db8d7f6ae6df440d89","schema_version":"1.0","event_id":"sha256:8d4de225b095cb8304a200056317de5f8c4b2e4604d2d0db8d7f6ae6df440d89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YEBGZT7ZEKDVCKKEEZLCJWVYKH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal In-Place Suffix Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hongwei Huo, Jian Li, Zhize Li","submitted_at":"2016-10-26T12:45:59Z","abstract_excerpt":"The suffix array is a fundamental data structure for many applications that involve string searching and data compression. Designing time/space-efficient suffix array construction algorithms has attracted significant attention and considerable advances have been made for the past 20 years. We obtain the \\emph{first} in-place suffix array construction algorithms that are optimal both in time and space for (read-only) integer alphabets. Concretely, we make the following contributions:\n  1. For integer alphabets, we obtain the first suffix sorting algorithm which takes linear time and uses only $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08305","kind":"arxiv","version":6},"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:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EcUzZPGXWXrvQkc1ra4Tosa0G35oU5Am4fKS2ZrDI4lIDM1cY5hFYbS9XHx5A80u1dV7TJK7qwgit4hhHLE3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:55:51.210750Z"},"content_sha256":"ced0118e9bbc752c01dc7753eacc654c92bd4c1aa4d02ab70dc3a8196034c108","schema_version":"1.0","event_id":"sha256:ced0118e9bbc752c01dc7753eacc654c92bd4c1aa4d02ab70dc3a8196034c108"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YEBGZT7ZEKDVCKKEEZLCJWVYKH/bundle.json","state_url":"https://pith.science/pith/YEBGZT7ZEKDVCKKEEZLCJWVYKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YEBGZT7ZEKDVCKKEEZLCJWVYKH/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-28T06:55:51Z","links":{"resolver":"https://pith.science/pith/YEBGZT7ZEKDVCKKEEZLCJWVYKH","bundle":"https://pith.science/pith/YEBGZT7ZEKDVCKKEEZLCJWVYKH/bundle.json","state":"https://pith.science/pith/YEBGZT7ZEKDVCKKEEZLCJWVYKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YEBGZT7ZEKDVCKKEEZLCJWVYKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YEBGZT7ZEKDVCKKEEZLCJWVYKH","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":"016fc7eafdac08821723ef1d641ed2e32762cf21ccd1d0bd1e72677580257ff9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-26T12:45:59Z","title_canon_sha256":"9f69d9b94b58dd3f23a6e9010f93b5f6aad3251f72b45c3cbf1469966fff5185"},"schema_version":"1.0","source":{"id":"1610.08305","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08305","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08305v6","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08305","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"YEBGZT7ZEKDV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YEBGZT7ZEKDVCKKE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YEBGZT7Z","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:ced0118e9bbc752c01dc7753eacc654c92bd4c1aa4d02ab70dc3a8196034c108","target":"graph","created_at":"2026-05-18T00:01:15Z","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":"The suffix array is a fundamental data structure for many applications that involve string searching and data compression. Designing time/space-efficient suffix array construction algorithms has attracted significant attention and considerable advances have been made for the past 20 years. We obtain the \\emph{first} in-place suffix array construction algorithms that are optimal both in time and space for (read-only) integer alphabets. Concretely, we make the following contributions:\n  1. For integer alphabets, we obtain the first suffix sorting algorithm which takes linear time and uses only $","authors_text":"Hongwei Huo, Jian Li, Zhize Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-26T12:45:59Z","title":"Optimal In-Place Suffix Sorting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08305","kind":"arxiv","version":6},"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:8d4de225b095cb8304a200056317de5f8c4b2e4604d2d0db8d7f6ae6df440d89","target":"record","created_at":"2026-05-18T00:01:15Z","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":"016fc7eafdac08821723ef1d641ed2e32762cf21ccd1d0bd1e72677580257ff9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-26T12:45:59Z","title_canon_sha256":"9f69d9b94b58dd3f23a6e9010f93b5f6aad3251f72b45c3cbf1469966fff5185"},"schema_version":"1.0","source":{"id":"1610.08305","kind":"arxiv","version":6}},"canonical_sha256":"c1026ccff92287512944265624dab851c22e1bd7319000c94b70ad27a7100b37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1026ccff92287512944265624dab851c22e1bd7319000c94b70ad27a7100b37","first_computed_at":"2026-05-18T00:01:15.504330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:15.504330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M2dElNzpIBj69ivd5t/x+aI2IRRI7hyNuhEKo8mkrqxBPd2RBDgrkh7TcCjvsAVcGUJykv7w+Iz7MgZCZJFZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:15.504746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08305","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d4de225b095cb8304a200056317de5f8c4b2e4604d2d0db8d7f6ae6df440d89","sha256:ced0118e9bbc752c01dc7753eacc654c92bd4c1aa4d02ab70dc3a8196034c108"],"state_sha256":"b2b9a98146dbe55048a88a39b66b48a44a83b1919afc6336da7776f53706c448"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZK8TaH1pDCHkk+E06T5egSf/cGz9S7m820cgmr+xsrYCC5daFV5SzYPokuIoQzoIprremfXCtlg87FCWQHRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T06:55:51.212549Z","bundle_sha256":"1df69e680158e6fea7ae5cb4549729855f198f038158869ca9d09fe890b1dfbc"}}