{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:7GWUVJHPKNSAQ4TTI3NOMBWYMJ","short_pith_number":"pith:7GWUVJHP","canonical_record":{"source":{"id":"2111.08404","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-11-16T12:03:04Z","cross_cats_sorted":[],"title_canon_sha256":"75b76488ca8919df49d3d65329bb3cc6423f8c0ddd6ab45f4b35b199ab6a851e","abstract_canon_sha256":"e9a264952f0fd087c37e81bb7758f388c3b140b3f632993dc0f298ff0d2d5c79"},"schema_version":"1.0"},"canonical_sha256":"f9ad4aa4ef536408727346dae606d86275e6f17d4280f06d1dc955b46c2ecc19","source":{"kind":"arxiv","id":"2111.08404","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.08404","created_at":"2026-07-05T03:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"2111.08404v1","created_at":"2026-07-05T03:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.08404","created_at":"2026-07-05T03:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"7GWUVJHPKNSA","created_at":"2026-07-05T03:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"7GWUVJHPKNSAQ4TT","created_at":"2026-07-05T03:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"7GWUVJHP","created_at":"2026-07-05T03:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:7GWUVJHPKNSAQ4TTI3NOMBWYMJ","target":"record","payload":{"canonical_record":{"source":{"id":"2111.08404","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-11-16T12:03:04Z","cross_cats_sorted":[],"title_canon_sha256":"75b76488ca8919df49d3d65329bb3cc6423f8c0ddd6ab45f4b35b199ab6a851e","abstract_canon_sha256":"e9a264952f0fd087c37e81bb7758f388c3b140b3f632993dc0f298ff0d2d5c79"},"schema_version":"1.0"},"canonical_sha256":"f9ad4aa4ef536408727346dae606d86275e6f17d4280f06d1dc955b46c2ecc19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:32:33.692000Z","signature_b64":"naJrs7Xm2FEdwrM+HUeYl0e6jAWVUoqaygCX1eVB/35fR4BWGNKn0f4VDDgazt1Babrl3J4V9w5LanIJLUSABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9ad4aa4ef536408727346dae606d86275e6f17d4280f06d1dc955b46c2ecc19","last_reissued_at":"2026-07-05T03:32:33.691584Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:32:33.691584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.08404","source_version":1,"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-07-05T03:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hf9c8n207I3HKlFhQOsaAZrpbQ3XtUeGXrQIksKwbGN3c8U1TSYHOzpXNPdXypiYFShD0jJylf5LDVrvWI50Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T04:42:08.535982Z"},"content_sha256":"7bf002894732e304fd264776c0607b2e0be4e33fc7a7bedc4013cdebc99ec161","schema_version":"1.0","event_id":"sha256:7bf002894732e304fd264776c0607b2e0be4e33fc7a7bedc4013cdebc99ec161"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:7GWUVJHPKNSAQ4TTI3NOMBWYMJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Timing Side Channel Attacks on Memory Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Daniel Gruss, Gururaj Saileshwar, Hanna M\\\"uller, Martin Schwarzl, Michael Schwarz, Pietro Borrello","submitted_at":"2021-11-16T12:03:04Z","abstract_excerpt":"Compression algorithms are widely used as they save memory without losing data. However, elimination of redundant symbols and sequences in data leads to a compression side channel. So far, compression attacks have only focused on the compression-ratio side channel, i.e., the size of compressed data,and largely targeted HTTP traffic and website content.\n  In this paper, we present the first memory compression attacks exploiting timing side channels in compression algorithms, targeting a broad set of applications using compression. Our work systematically analyzes different compression algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.08404","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.08404/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"245M966gcH4zKexBeentLTeDgdO9OhdlGexPL7dJTOoRkmrvL2QYxZSGBgXReL33CjIE8dgipvtR4x3kplcWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T04:42:08.536929Z"},"content_sha256":"8ebd200ed18b21bdb6985a3cf58d543b501cd528cabfad46173bba65a48ce0a0","schema_version":"1.0","event_id":"sha256:8ebd200ed18b21bdb6985a3cf58d543b501cd528cabfad46173bba65a48ce0a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GWUVJHPKNSAQ4TTI3NOMBWYMJ/bundle.json","state_url":"https://pith.science/pith/7GWUVJHPKNSAQ4TTI3NOMBWYMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GWUVJHPKNSAQ4TTI3NOMBWYMJ/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-08-23T04:42:08Z","links":{"resolver":"https://pith.science/pith/7GWUVJHPKNSAQ4TTI3NOMBWYMJ","bundle":"https://pith.science/pith/7GWUVJHPKNSAQ4TTI3NOMBWYMJ/bundle.json","state":"https://pith.science/pith/7GWUVJHPKNSAQ4TTI3NOMBWYMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GWUVJHPKNSAQ4TTI3NOMBWYMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:7GWUVJHPKNSAQ4TTI3NOMBWYMJ","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":"e9a264952f0fd087c37e81bb7758f388c3b140b3f632993dc0f298ff0d2d5c79","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-11-16T12:03:04Z","title_canon_sha256":"75b76488ca8919df49d3d65329bb3cc6423f8c0ddd6ab45f4b35b199ab6a851e"},"schema_version":"1.0","source":{"id":"2111.08404","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.08404","created_at":"2026-07-05T03:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"2111.08404v1","created_at":"2026-07-05T03:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.08404","created_at":"2026-07-05T03:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"7GWUVJHPKNSA","created_at":"2026-07-05T03:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"7GWUVJHPKNSAQ4TT","created_at":"2026-07-05T03:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"7GWUVJHP","created_at":"2026-07-05T03:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:8ebd200ed18b21bdb6985a3cf58d543b501cd528cabfad46173bba65a48ce0a0","target":"graph","created_at":"2026-07-05T03:32:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.08404/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Compression algorithms are widely used as they save memory without losing data. However, elimination of redundant symbols and sequences in data leads to a compression side channel. So far, compression attacks have only focused on the compression-ratio side channel, i.e., the size of compressed data,and largely targeted HTTP traffic and website content.\n  In this paper, we present the first memory compression attacks exploiting timing side channels in compression algorithms, targeting a broad set of applications using compression. Our work systematically analyzes different compression algorithm","authors_text":"Daniel Gruss, Gururaj Saileshwar, Hanna M\\\"uller, Martin Schwarzl, Michael Schwarz, Pietro Borrello","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-11-16T12:03:04Z","title":"Practical Timing Side Channel Attacks on Memory Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.08404","kind":"arxiv","version":1},"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:7bf002894732e304fd264776c0607b2e0be4e33fc7a7bedc4013cdebc99ec161","target":"record","created_at":"2026-07-05T03:32:33Z","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":"e9a264952f0fd087c37e81bb7758f388c3b140b3f632993dc0f298ff0d2d5c79","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-11-16T12:03:04Z","title_canon_sha256":"75b76488ca8919df49d3d65329bb3cc6423f8c0ddd6ab45f4b35b199ab6a851e"},"schema_version":"1.0","source":{"id":"2111.08404","kind":"arxiv","version":1}},"canonical_sha256":"f9ad4aa4ef536408727346dae606d86275e6f17d4280f06d1dc955b46c2ecc19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9ad4aa4ef536408727346dae606d86275e6f17d4280f06d1dc955b46c2ecc19","first_computed_at":"2026-07-05T03:32:33.691584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:32:33.691584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"naJrs7Xm2FEdwrM+HUeYl0e6jAWVUoqaygCX1eVB/35fR4BWGNKn0f4VDDgazt1Babrl3J4V9w5LanIJLUSABg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:32:33.692000Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.08404","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bf002894732e304fd264776c0607b2e0be4e33fc7a7bedc4013cdebc99ec161","sha256:8ebd200ed18b21bdb6985a3cf58d543b501cd528cabfad46173bba65a48ce0a0"],"state_sha256":"726ed50b9f51baad8de843f2d7ce1c81f426335b32e7dce94664885287164463"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OqqkKdXGsbN5xTkqmupSHAsYNmf6W7FprdYB0oLDC+2NYmu7Z0kdpyNFWpOr/C0GknEAMa55kVFswdZqDcqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T04:42:08.542183Z","bundle_sha256":"61ba73e2579eb9e8243bbe0a120736efbbd0259f572ad58f1cbcd94c66a2ffe7"}}