{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZBP5Q5YEQPURYX5TM7GLTOHGDP","short_pith_number":"pith:ZBP5Q5YE","schema_version":"1.0","canonical_sha256":"c85fd8770483e91c5fb367ccb9b8e61bcf712d8ae6039bdd98b81c0db8d4a9da","source":{"kind":"arxiv","id":"1710.01896","version":1},"attestation_state":"computed","paper":{"title":"Dismantling DivSufSort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Kurpicz, Johannes Fischer","submitted_at":"2017-10-05T06:48:13Z","abstract_excerpt":"We give the first concise description of the fastest known suffix sorting algorithm in main memory, the DivSufSort by Yuta Mori. We then present an extension that also computes the LCP-array, which is competitive with the fastest known LCP-array construction algorithm."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1710.01896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-05T06:48:13Z","cross_cats_sorted":[],"title_canon_sha256":"10b109098c432c24aeb6ce323e39e178f9b58e7d47344c0246d653a4c18ca2ed","abstract_canon_sha256":"3cad3831ea1c797adee3f84259b597a62648da61fa1da87d47e2485d4cd4e076"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:38.125638Z","signature_b64":"HpfDoGllrJxqWpxrksAvoLDVvJQidizZz4F64PlJAoSNbed6JZL6YHtI8tZzjVID9wj3Mdi7jWfBdPm4NY9WAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c85fd8770483e91c5fb367ccb9b8e61bcf712d8ae6039bdd98b81c0db8d4a9da","last_reissued_at":"2026-05-18T00:33:38.125009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:38.125009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dismantling DivSufSort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Kurpicz, Johannes Fischer","submitted_at":"2017-10-05T06:48:13Z","abstract_excerpt":"We give the first concise description of the fastest known suffix sorting algorithm in main memory, the DivSufSort by Yuta Mori. We then present an extension that also computes the LCP-array, which is competitive with the fastest known LCP-array construction algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01896","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.01896","created_at":"2026-05-18T00:33:38.125100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01896v1","created_at":"2026-05-18T00:33:38.125100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01896","created_at":"2026-05-18T00:33:38.125100+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBP5Q5YEQPUR","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBP5Q5YEQPURYX5T","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBP5Q5YE","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZBP5Q5YEQPURYX5TM7GLTOHGDP","json":"https://pith.science/pith/ZBP5Q5YEQPURYX5TM7GLTOHGDP.json","graph_json":"https://pith.science/api/pith-number/ZBP5Q5YEQPURYX5TM7GLTOHGDP/graph.json","events_json":"https://pith.science/api/pith-number/ZBP5Q5YEQPURYX5TM7GLTOHGDP/events.json","paper":"https://pith.science/paper/ZBP5Q5YE"},"agent_actions":{"view_html":"https://pith.science/pith/ZBP5Q5YEQPURYX5TM7GLTOHGDP","download_json":"https://pith.science/pith/ZBP5Q5YEQPURYX5TM7GLTOHGDP.json","view_paper":"https://pith.science/paper/ZBP5Q5YE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01896&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBP5Q5YEQPURYX5TM7GLTOHGDP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBP5Q5YEQPURYX5TM7GLTOHGDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBP5Q5YEQPURYX5TM7GLTOHGDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBP5Q5YEQPURYX5TM7GLTOHGDP/action/storage_attestation","attest_author":"https://pith.science/pith/ZBP5Q5YEQPURYX5TM7GLTOHGDP/action/author_attestation","sign_citation":"https://pith.science/pith/ZBP5Q5YEQPURYX5TM7GLTOHGDP/action/citation_signature","submit_replication":"https://pith.science/pith/ZBP5Q5YEQPURYX5TM7GLTOHGDP/action/replication_record"}},"created_at":"2026-05-18T00:33:38.125100+00:00","updated_at":"2026-05-18T00:33:38.125100+00:00"}