{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FYRJ2I4OCDUJNUJRB34GPLA33I","short_pith_number":"pith:FYRJ2I4O","canonical_record":{"source":{"id":"1607.00307","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-01T16:34:02Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"f6710182026e9c2b5a19a282b4d5cdca9bf204562c3487592520b2bbc1f6936f","abstract_canon_sha256":"a77785387dadf0e801b7819042d92eab87a6a77f15ac47f147231a371b1ffb2c"},"schema_version":"1.0"},"canonical_sha256":"2e229d238e10e896d1310ef867ac1bda01fe01536421265c94833f4ae6bde164","source":{"kind":"arxiv","id":"1607.00307","version":10},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00307","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00307v10","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00307","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"FYRJ2I4OCDUJ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FYRJ2I4OCDUJNUJR","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FYRJ2I4O","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FYRJ2I4OCDUJNUJRB34GPLA33I","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00307","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-01T16:34:02Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"f6710182026e9c2b5a19a282b4d5cdca9bf204562c3487592520b2bbc1f6936f","abstract_canon_sha256":"a77785387dadf0e801b7819042d92eab87a6a77f15ac47f147231a371b1ffb2c"},"schema_version":"1.0"},"canonical_sha256":"2e229d238e10e896d1310ef867ac1bda01fe01536421265c94833f4ae6bde164","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:41.637449Z","signature_b64":"CMg0TUA3wyJwiroTFfT9WcrcbeNVpI9HDk3nBSvDqWWYS4+A3lbumsEEjbFEqO/49qMUqYfiylrJxwMv+jzaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e229d238e10e896d1310ef867ac1bda01fe01536421265c94833f4ae6bde164","last_reissued_at":"2026-05-18T00:41:41.636818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:41.636818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00307","source_version":10,"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:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLJWtfM0SiwNWSYgM0+9vvJYBhzy0MMFWdTbhHXdo64iBWK/Usg7B4kMlTZCdX1pvk97Ft7biXb70tGOGI5bAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:35:43.828250Z"},"content_sha256":"467a3eb0e58f0b44e83c362af74b5f95fd6ce40802a4a008aacc3c067a1cf175","schema_version":"1.0","event_id":"sha256:467a3eb0e58f0b44e83c362af74b5f95fd6ce40802a4a008aacc3c067a1cf175"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FYRJ2I4OCDUJNUJRB34GPLA33I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Tree Hash Modes: the Case of Trees Having their Leaves at All the Levels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Kevin Atighehchi","submitted_at":"2016-07-01T16:34:02Z","abstract_excerpt":"A recent work shows how we can optimize a tree based mode of operation for a hash function where the sizes of input message blocks and digest are the same, subject to the constraint that the involved tree structure has all its leaves at the same depth. In this work, we show that we can further optimize the running time of such a mode by using a tree having leaves at all its levels. We make the assumption that the input message block has a size a multiple of that of the digest and denote by $d$ the ratio block size over digest size. The running time is evaluated in terms of number of operations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00307","kind":"arxiv","version":10},"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:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yz4eKU/g6TjvY2GxEMQhNFx4dBW1mIzilyMzZGzNSFZ/sChhlwtZjlzjY3NaeeWsA1I++WVSRkRrMD1eG6WJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:35:43.828614Z"},"content_sha256":"eb2318fc357d14123e5f62e835bc22a55731ca684b95e18498a271b5f790a3c2","schema_version":"1.0","event_id":"sha256:eb2318fc357d14123e5f62e835bc22a55731ca684b95e18498a271b5f790a3c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYRJ2I4OCDUJNUJRB34GPLA33I/bundle.json","state_url":"https://pith.science/pith/FYRJ2I4OCDUJNUJRB34GPLA33I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYRJ2I4OCDUJNUJRB34GPLA33I/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-07-01T18:35:43Z","links":{"resolver":"https://pith.science/pith/FYRJ2I4OCDUJNUJRB34GPLA33I","bundle":"https://pith.science/pith/FYRJ2I4OCDUJNUJRB34GPLA33I/bundle.json","state":"https://pith.science/pith/FYRJ2I4OCDUJNUJRB34GPLA33I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYRJ2I4OCDUJNUJRB34GPLA33I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FYRJ2I4OCDUJNUJRB34GPLA33I","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":"a77785387dadf0e801b7819042d92eab87a6a77f15ac47f147231a371b1ffb2c","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-01T16:34:02Z","title_canon_sha256":"f6710182026e9c2b5a19a282b4d5cdca9bf204562c3487592520b2bbc1f6936f"},"schema_version":"1.0","source":{"id":"1607.00307","kind":"arxiv","version":10}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00307","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00307v10","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00307","created_at":"2026-05-18T00:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"FYRJ2I4OCDUJ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FYRJ2I4OCDUJNUJR","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FYRJ2I4O","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:eb2318fc357d14123e5f62e835bc22a55731ca684b95e18498a271b5f790a3c2","target":"graph","created_at":"2026-05-18T00:41:41Z","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":"A recent work shows how we can optimize a tree based mode of operation for a hash function where the sizes of input message blocks and digest are the same, subject to the constraint that the involved tree structure has all its leaves at the same depth. In this work, we show that we can further optimize the running time of such a mode by using a tree having leaves at all its levels. We make the assumption that the input message block has a size a multiple of that of the digest and denote by $d$ the ratio block size over digest size. The running time is evaluated in terms of number of operations","authors_text":"Kevin Atighehchi","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-01T16:34:02Z","title":"Optimal Tree Hash Modes: the Case of Trees Having their Leaves at All the Levels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00307","kind":"arxiv","version":10},"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:467a3eb0e58f0b44e83c362af74b5f95fd6ce40802a4a008aacc3c067a1cf175","target":"record","created_at":"2026-05-18T00:41:41Z","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":"a77785387dadf0e801b7819042d92eab87a6a77f15ac47f147231a371b1ffb2c","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-01T16:34:02Z","title_canon_sha256":"f6710182026e9c2b5a19a282b4d5cdca9bf204562c3487592520b2bbc1f6936f"},"schema_version":"1.0","source":{"id":"1607.00307","kind":"arxiv","version":10}},"canonical_sha256":"2e229d238e10e896d1310ef867ac1bda01fe01536421265c94833f4ae6bde164","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e229d238e10e896d1310ef867ac1bda01fe01536421265c94833f4ae6bde164","first_computed_at":"2026-05-18T00:41:41.636818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:41.636818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CMg0TUA3wyJwiroTFfT9WcrcbeNVpI9HDk3nBSvDqWWYS4+A3lbumsEEjbFEqO/49qMUqYfiylrJxwMv+jzaDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:41.637449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00307","source_kind":"arxiv","source_version":10}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:467a3eb0e58f0b44e83c362af74b5f95fd6ce40802a4a008aacc3c067a1cf175","sha256:eb2318fc357d14123e5f62e835bc22a55731ca684b95e18498a271b5f790a3c2"],"state_sha256":"a4fc65209d6d2fd27f96bd4f63b731652d8d575ee68dcf19aa58a2405e3d8a90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adr+BZxgxWvfDq1j2+CGjxQUA0aL4U80SUYdvpzyNomLnauSbhPNaOWrg+GjcLVQtZaoS+LwIurEqHVSJyxaAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T18:35:43.830724Z","bundle_sha256":"a140c8d1cee2e31d3a442c93a84bbdebd28e97df1028db3459377992cd717a64"}}