{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TBATKGTAATV3SYOUJ7KSL5NVFP","short_pith_number":"pith:TBATKGTA","canonical_record":{"source":{"id":"1512.05864","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-18T07:29:03Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"9e8a9057e5ff03b0127e7de065ff4b2b3405a6f454e07ff9dffe74bd24b4e172","abstract_canon_sha256":"833ead9e74cedbd603643ae47fe4a1db4de9d7fff4011100390c3ad091dfc02b"},"schema_version":"1.0"},"canonical_sha256":"9841351a6004ebb961d44fd525f5b52bff85f8a2d68f0518a6e85d432d1bb765","source":{"kind":"arxiv","id":"1512.05864","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05864","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05864v7","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05864","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"TBATKGTAATV3","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TBATKGTAATV3SYOU","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TBATKGTA","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TBATKGTAATV3SYOUJ7KSL5NVFP","target":"record","payload":{"canonical_record":{"source":{"id":"1512.05864","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-18T07:29:03Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"9e8a9057e5ff03b0127e7de065ff4b2b3405a6f454e07ff9dffe74bd24b4e172","abstract_canon_sha256":"833ead9e74cedbd603643ae47fe4a1db4de9d7fff4011100390c3ad091dfc02b"},"schema_version":"1.0"},"canonical_sha256":"9841351a6004ebb961d44fd525f5b52bff85f8a2d68f0518a6e85d432d1bb765","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:39.608123Z","signature_b64":"GMruSYrCgUniH2FXpzYJ6nNlA4H48l2lO8htwpLvcdnUfoAU9bRq41zYaC2tmhXZZsofcXwrbcaI+ffQ2BP1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9841351a6004ebb961d44fd525f5b52bff85f8a2d68f0518a6e85d432d1bb765","last_reissued_at":"2026-05-18T00:42:39.607373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:39.607373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.05864","source_version":7,"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:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Onnt1Iweysa//lmkvB2ZzRnChokBr40RVchjOUc8VBfIHBCRJueYvGiL6HPuHWdaXBuj8tPz4dTZFHI9v+n8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:57:23.623719Z"},"content_sha256":"8cb3b9bcf82befd86c0384429a57d552e378a91a4b3478f5cd572ca6046775bc","schema_version":"1.0","event_id":"sha256:8cb3b9bcf82befd86c0384429a57d552e378a91a4b3478f5cd572ca6046775bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TBATKGTAATV3SYOUJ7KSL5NVFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization of Tree Modes for Parallel Hash Functions: A Case Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Kevin Atighehchi, Robert Rolland","submitted_at":"2015-12-18T07:29:03Z","abstract_excerpt":"This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function. We discuss the various forms of optimality that can be obtained when designing parallel hash functions based on trees where all leaves have the same depth. The first result is a scheme which optimizes the tree topology in order to decrease the running time. Then, without affecting the optimal running time we show that we can slightly change the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05864","kind":"arxiv","version":7},"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:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kF3MuGUjEInwHPWhrhGoanMyl8zKFK+lwm04toHkZ3joYXuKrs6hmCmrEwCR6pVJdweqFsMBJMH6BB2hLCnKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:57:23.624398Z"},"content_sha256":"04eb32dd3a5433ff7f7f8266fa5501099f87efcbb10b3cc0b0a50bade94aa889","schema_version":"1.0","event_id":"sha256:04eb32dd3a5433ff7f7f8266fa5501099f87efcbb10b3cc0b0a50bade94aa889"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBATKGTAATV3SYOUJ7KSL5NVFP/bundle.json","state_url":"https://pith.science/pith/TBATKGTAATV3SYOUJ7KSL5NVFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBATKGTAATV3SYOUJ7KSL5NVFP/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-28T21:57:23Z","links":{"resolver":"https://pith.science/pith/TBATKGTAATV3SYOUJ7KSL5NVFP","bundle":"https://pith.science/pith/TBATKGTAATV3SYOUJ7KSL5NVFP/bundle.json","state":"https://pith.science/pith/TBATKGTAATV3SYOUJ7KSL5NVFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBATKGTAATV3SYOUJ7KSL5NVFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TBATKGTAATV3SYOUJ7KSL5NVFP","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":"833ead9e74cedbd603643ae47fe4a1db4de9d7fff4011100390c3ad091dfc02b","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-18T07:29:03Z","title_canon_sha256":"9e8a9057e5ff03b0127e7de065ff4b2b3405a6f454e07ff9dffe74bd24b4e172"},"schema_version":"1.0","source":{"id":"1512.05864","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05864","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05864v7","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05864","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"TBATKGTAATV3","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TBATKGTAATV3SYOU","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TBATKGTA","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:04eb32dd3a5433ff7f7f8266fa5501099f87efcbb10b3cc0b0a50bade94aa889","target":"graph","created_at":"2026-05-18T00:42:39Z","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":"This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function. We discuss the various forms of optimality that can be obtained when designing parallel hash functions based on trees where all leaves have the same depth. The first result is a scheme which optimizes the tree topology in order to decrease the running time. Then, without affecting the optimal running time we show that we can slightly change the ","authors_text":"Kevin Atighehchi, Robert Rolland","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-18T07:29:03Z","title":"Optimization of Tree Modes for Parallel Hash Functions: A Case Study"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05864","kind":"arxiv","version":7},"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:8cb3b9bcf82befd86c0384429a57d552e378a91a4b3478f5cd572ca6046775bc","target":"record","created_at":"2026-05-18T00:42:39Z","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":"833ead9e74cedbd603643ae47fe4a1db4de9d7fff4011100390c3ad091dfc02b","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-18T07:29:03Z","title_canon_sha256":"9e8a9057e5ff03b0127e7de065ff4b2b3405a6f454e07ff9dffe74bd24b4e172"},"schema_version":"1.0","source":{"id":"1512.05864","kind":"arxiv","version":7}},"canonical_sha256":"9841351a6004ebb961d44fd525f5b52bff85f8a2d68f0518a6e85d432d1bb765","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9841351a6004ebb961d44fd525f5b52bff85f8a2d68f0518a6e85d432d1bb765","first_computed_at":"2026-05-18T00:42:39.607373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:39.607373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GMruSYrCgUniH2FXpzYJ6nNlA4H48l2lO8htwpLvcdnUfoAU9bRq41zYaC2tmhXZZsofcXwrbcaI+ffQ2BP1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:39.608123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05864","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cb3b9bcf82befd86c0384429a57d552e378a91a4b3478f5cd572ca6046775bc","sha256:04eb32dd3a5433ff7f7f8266fa5501099f87efcbb10b3cc0b0a50bade94aa889"],"state_sha256":"e60edd53076196c50909db9b057985c6fb7d15b3d2b3dbc2d9a00c07270aaffd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V59rf7OuROGPHTzTL5PgpFm2iltf/9RzB92OzRVEEWRkHYp8y+I0TNe8rEEi6PHyk/r90mnFU9yXjs86nh+0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:57:23.627924Z","bundle_sha256":"54d1a7f20b892c65f2551daf28a18c2e86d3d40814720ebf05cd97194f6ae853"}}