{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZZMV3OLJUU56ZUIW2ZTP6PUN3R","short_pith_number":"pith:ZZMV3OLJ","schema_version":"1.0","canonical_sha256":"ce595db969a53becd116d666ff3e8ddc54eb6751470c6b95e295307b49647feb","source":{"kind":"arxiv","id":"1302.5851","version":1},"attestation_state":"computed","paper":{"title":"Parallel Suffix Array Construction by Accelerated Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexander Tiskin, Matthew Felice Pace","submitted_at":"2013-02-23T22:39:03Z","abstract_excerpt":"A deterministic BSP algorithm for constructing the suffix array of a given string is presented, based on a technique which we call accelerated sampling. It runs in optimal O(n/p) local computation and communication, and requires a near optimal O(log log p) synchronisation steps. The algorithm provides an improvement over the synchronisation costs of existing algorithms, and reinforces the importance of the sampling technique."},"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":"1302.5851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-23T22:39:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c3aaa3dafc2b3ac5d19a1af31c2b112850238ff60e021642d2842672616748bb","abstract_canon_sha256":"0046c7f2cd8b00095e59e37d22b068dca0d863e485455762cff1f1a0b5d381af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:43.479605Z","signature_b64":"pBRVO4eWYn8KKYpc8WADENctgDrkOQ422iy4o6VrDWIhi2Lo8hfiSJv+Sj+NOGBwUFicXYkrSPGk4Rcm38foAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce595db969a53becd116d666ff3e8ddc54eb6751470c6b95e295307b49647feb","last_reissued_at":"2026-05-18T03:32:43.479000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:43.479000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Suffix Array Construction by Accelerated Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexander Tiskin, Matthew Felice Pace","submitted_at":"2013-02-23T22:39:03Z","abstract_excerpt":"A deterministic BSP algorithm for constructing the suffix array of a given string is presented, based on a technique which we call accelerated sampling. It runs in optimal O(n/p) local computation and communication, and requires a near optimal O(log log p) synchronisation steps. The algorithm provides an improvement over the synchronisation costs of existing algorithms, and reinforces the importance of the sampling technique."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5851","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":"1302.5851","created_at":"2026-05-18T03:32:43.479110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5851v1","created_at":"2026-05-18T03:32:43.479110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5851","created_at":"2026-05-18T03:32:43.479110+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZMV3OLJUU56","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZMV3OLJUU56ZUIW","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZMV3OLJ","created_at":"2026-05-18T12:28:09.283467+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/ZZMV3OLJUU56ZUIW2ZTP6PUN3R","json":"https://pith.science/pith/ZZMV3OLJUU56ZUIW2ZTP6PUN3R.json","graph_json":"https://pith.science/api/pith-number/ZZMV3OLJUU56ZUIW2ZTP6PUN3R/graph.json","events_json":"https://pith.science/api/pith-number/ZZMV3OLJUU56ZUIW2ZTP6PUN3R/events.json","paper":"https://pith.science/paper/ZZMV3OLJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZZMV3OLJUU56ZUIW2ZTP6PUN3R","download_json":"https://pith.science/pith/ZZMV3OLJUU56ZUIW2ZTP6PUN3R.json","view_paper":"https://pith.science/paper/ZZMV3OLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5851&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZMV3OLJUU56ZUIW2ZTP6PUN3R/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZMV3OLJUU56ZUIW2ZTP6PUN3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZMV3OLJUU56ZUIW2ZTP6PUN3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZMV3OLJUU56ZUIW2ZTP6PUN3R/action/storage_attestation","attest_author":"https://pith.science/pith/ZZMV3OLJUU56ZUIW2ZTP6PUN3R/action/author_attestation","sign_citation":"https://pith.science/pith/ZZMV3OLJUU56ZUIW2ZTP6PUN3R/action/citation_signature","submit_replication":"https://pith.science/pith/ZZMV3OLJUU56ZUIW2ZTP6PUN3R/action/replication_record"}},"created_at":"2026-05-18T03:32:43.479110+00:00","updated_at":"2026-05-18T03:32:43.479110+00:00"}