{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4SLZCP2V522W7T75PXIBWN2ARG","short_pith_number":"pith:4SLZCP2V","schema_version":"1.0","canonical_sha256":"e497913f55eeb56fcffd7dd01b374089979b8e579b713d612da3534144ecc0be","source":{"kind":"arxiv","id":"1608.00492","version":3},"attestation_state":"computed","paper":{"title":"Some observations on the optimization of a parallel SHAKE function using Sakura","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Kevin Atighehchi","submitted_at":"2016-08-01T16:44:26Z","abstract_excerpt":"Some parallel constructions of a SHAKE hash function using Sakura coding are introduced, whose basic operation is the Keccak's permutation. For each proposed tree-based algorithm, observations are made on both its parallel running time (depth) and the required number of processors to reach it. This preliminary work makes the assumption that the tree-level chaining value length is equal to the capacity of the underlying sponge construction, as recommended in the Sakura paper."},"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":"1608.00492","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-08-01T16:44:26Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c4b21218d0f76d575ce687a9d7ac90ccea68f27b9b811e870c9ae6a9c6ac89bb","abstract_canon_sha256":"656a5f15e492bcaa20afd2ad27bf03e7a203f2b2a6bec0ad28b9352f0d27ddc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:06.144750Z","signature_b64":"xwl5S4KuIzbwUZbyX1WVaosUoccpkYd239inWHE/jkcfeSZGVdjDHvIlJpx1WytOw9rbNo+AjzfCgL3qfd4OCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e497913f55eeb56fcffd7dd01b374089979b8e579b713d612da3534144ecc0be","last_reissued_at":"2026-05-18T01:09:06.144154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:06.144154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some observations on the optimization of a parallel SHAKE function using Sakura","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Kevin Atighehchi","submitted_at":"2016-08-01T16:44:26Z","abstract_excerpt":"Some parallel constructions of a SHAKE hash function using Sakura coding are introduced, whose basic operation is the Keccak's permutation. For each proposed tree-based algorithm, observations are made on both its parallel running time (depth) and the required number of processors to reach it. This preliminary work makes the assumption that the tree-level chaining value length is equal to the capacity of the underlying sponge construction, as recommended in the Sakura paper."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00492","kind":"arxiv","version":3},"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":"1608.00492","created_at":"2026-05-18T01:09:06.144267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00492v3","created_at":"2026-05-18T01:09:06.144267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00492","created_at":"2026-05-18T01:09:06.144267+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SLZCP2V522W","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SLZCP2V522W7T75","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SLZCP2V","created_at":"2026-05-18T12:29:58.707656+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/4SLZCP2V522W7T75PXIBWN2ARG","json":"https://pith.science/pith/4SLZCP2V522W7T75PXIBWN2ARG.json","graph_json":"https://pith.science/api/pith-number/4SLZCP2V522W7T75PXIBWN2ARG/graph.json","events_json":"https://pith.science/api/pith-number/4SLZCP2V522W7T75PXIBWN2ARG/events.json","paper":"https://pith.science/paper/4SLZCP2V"},"agent_actions":{"view_html":"https://pith.science/pith/4SLZCP2V522W7T75PXIBWN2ARG","download_json":"https://pith.science/pith/4SLZCP2V522W7T75PXIBWN2ARG.json","view_paper":"https://pith.science/paper/4SLZCP2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00492&json=true","fetch_graph":"https://pith.science/api/pith-number/4SLZCP2V522W7T75PXIBWN2ARG/graph.json","fetch_events":"https://pith.science/api/pith-number/4SLZCP2V522W7T75PXIBWN2ARG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SLZCP2V522W7T75PXIBWN2ARG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SLZCP2V522W7T75PXIBWN2ARG/action/storage_attestation","attest_author":"https://pith.science/pith/4SLZCP2V522W7T75PXIBWN2ARG/action/author_attestation","sign_citation":"https://pith.science/pith/4SLZCP2V522W7T75PXIBWN2ARG/action/citation_signature","submit_replication":"https://pith.science/pith/4SLZCP2V522W7T75PXIBWN2ARG/action/replication_record"}},"created_at":"2026-05-18T01:09:06.144267+00:00","updated_at":"2026-05-18T01:09:06.144267+00:00"}