{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6DTCLJ6JWE23HK7J23LS6HMOIL","short_pith_number":"pith:6DTCLJ6J","canonical_record":{"source":{"id":"2501.04183","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-01-07T23:29:01Z","cross_cats_sorted":[],"title_canon_sha256":"a8183a0e214f521ff7210db282d12eaaac4cc118856cc253f2f63dc31b33f705","abstract_canon_sha256":"4d31e5fa518f3c5105d27a93a56fd44d9642852cd4eac04b2023ae27800b6b45"},"schema_version":"1.0"},"canonical_sha256":"f0e625a7c9b135b3abe9d6d72f1d8e42e5d7e16df996575fca5124b33301ec5e","source":{"kind":"arxiv","id":"2501.04183","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04183","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04183v4","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04183","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_12","alias_value":"6DTCLJ6JWE23","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_16","alias_value":"6DTCLJ6JWE23HK7J","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_8","alias_value":"6DTCLJ6J","created_at":"2026-07-14T01:21:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6DTCLJ6JWE23HK7J23LS6HMOIL","target":"record","payload":{"canonical_record":{"source":{"id":"2501.04183","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-01-07T23:29:01Z","cross_cats_sorted":[],"title_canon_sha256":"a8183a0e214f521ff7210db282d12eaaac4cc118856cc253f2f63dc31b33f705","abstract_canon_sha256":"4d31e5fa518f3c5105d27a93a56fd44d9642852cd4eac04b2023ae27800b6b45"},"schema_version":"1.0"},"canonical_sha256":"f0e625a7c9b135b3abe9d6d72f1d8e42e5d7e16df996575fca5124b33301ec5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:58.708326Z","signature_b64":"tfJ+HLfajqe3oMELzT7xVXfHSRXho47r+Y3N8Re0JhaX7OimQOpTvPGmbPoFBfX9Phu3cTksJ7F+SO1pi6nfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0e625a7c9b135b3abe9d6d72f1d8e42e5d7e16df996575fca5124b33301ec5e","last_reissued_at":"2026-07-14T01:21:58.707342Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:58.707342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.04183","source_version":4,"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-14T01:21:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pd99vxLuJ9Btu3CUi/UADp7DRJ+voPJPkiAlfPUtc1LmXuoiUkRcF5Q46+Vu19abYc0oDt8ce9m0ZGCyA++JAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:23:37.798277Z"},"content_sha256":"c3cd7068bedf47704aeda90013fef6ab72493c21a3a72b9efa2d894d436a3273","schema_version":"1.0","event_id":"sha256:c3cd7068bedf47704aeda90013fef6ab72493c21a3a72b9efa2d894d436a3273"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6DTCLJ6JWE23HK7J23LS6HMOIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decompiling for Constant-Time Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Gilles Barthe, Lionel Blatter, Santiago Arranz-Olmos, S\\\"oren van der Wall, Youcef Bouzid, Zhiyuan Zhang","submitted_at":"2025-01-07T23:29:01Z","abstract_excerpt":"The CT programming discipline is commonly used to protect cryptographic libraries against side-channel attacks. However, it is hard to write CT code; moreover, compilers can introduce CT violations. Therefore, it is important to ensure that assembly code is CT. One approach is to show that source programs are CT, and that CT is preserved by compilation. In this paper, we explore the methodological soundness and scalability of the Decompile-then-Analyze (DtA) approach, a less conventional alternative that has been suggested in the broader setting of static analysis. Informally, the DtA approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04183","kind":"arxiv","version":4},"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/2501.04183/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-14T01:21:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"guro3eMoAMe0plcuCODeMcGlEP4QNGO1tD0qd+X1QLgEBAeVp0rfYWO6Buwsy8KdMdzbyo7u2IsQkOgKlmynAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:23:37.798879Z"},"content_sha256":"a73b2634ced1334e19016a698efe6b1c1c5d687bc64f95f45bb93421542ba4cf","schema_version":"1.0","event_id":"sha256:a73b2634ced1334e19016a698efe6b1c1c5d687bc64f95f45bb93421542ba4cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL/bundle.json","state_url":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DTCLJ6JWE23HK7J23LS6HMOIL/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-11T08:23:37Z","links":{"resolver":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL","bundle":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL/bundle.json","state":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DTCLJ6JWE23HK7J23LS6HMOIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6DTCLJ6JWE23HK7J23LS6HMOIL","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":"4d31e5fa518f3c5105d27a93a56fd44d9642852cd4eac04b2023ae27800b6b45","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-01-07T23:29:01Z","title_canon_sha256":"a8183a0e214f521ff7210db282d12eaaac4cc118856cc253f2f63dc31b33f705"},"schema_version":"1.0","source":{"id":"2501.04183","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04183","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04183v4","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04183","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_12","alias_value":"6DTCLJ6JWE23","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_16","alias_value":"6DTCLJ6JWE23HK7J","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_8","alias_value":"6DTCLJ6J","created_at":"2026-07-14T01:21:58Z"}],"graph_snapshots":[{"event_id":"sha256:a73b2634ced1334e19016a698efe6b1c1c5d687bc64f95f45bb93421542ba4cf","target":"graph","created_at":"2026-07-14T01:21:58Z","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/2501.04183/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The CT programming discipline is commonly used to protect cryptographic libraries against side-channel attacks. However, it is hard to write CT code; moreover, compilers can introduce CT violations. Therefore, it is important to ensure that assembly code is CT. One approach is to show that source programs are CT, and that CT is preserved by compilation. In this paper, we explore the methodological soundness and scalability of the Decompile-then-Analyze (DtA) approach, a less conventional alternative that has been suggested in the broader setting of static analysis. Informally, the DtA approach","authors_text":"Gilles Barthe, Lionel Blatter, Santiago Arranz-Olmos, S\\\"oren van der Wall, Youcef Bouzid, Zhiyuan Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-01-07T23:29:01Z","title":"Decompiling for Constant-Time Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04183","kind":"arxiv","version":4},"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:c3cd7068bedf47704aeda90013fef6ab72493c21a3a72b9efa2d894d436a3273","target":"record","created_at":"2026-07-14T01:21:58Z","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":"4d31e5fa518f3c5105d27a93a56fd44d9642852cd4eac04b2023ae27800b6b45","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-01-07T23:29:01Z","title_canon_sha256":"a8183a0e214f521ff7210db282d12eaaac4cc118856cc253f2f63dc31b33f705"},"schema_version":"1.0","source":{"id":"2501.04183","kind":"arxiv","version":4}},"canonical_sha256":"f0e625a7c9b135b3abe9d6d72f1d8e42e5d7e16df996575fca5124b33301ec5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0e625a7c9b135b3abe9d6d72f1d8e42e5d7e16df996575fca5124b33301ec5e","first_computed_at":"2026-07-14T01:21:58.707342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:21:58.707342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tfJ+HLfajqe3oMELzT7xVXfHSRXho47r+Y3N8Re0JhaX7OimQOpTvPGmbPoFBfX9Phu3cTksJ7F+SO1pi6nfBA==","signature_status":"signed_v1","signed_at":"2026-07-14T01:21:58.708326Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.04183","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3cd7068bedf47704aeda90013fef6ab72493c21a3a72b9efa2d894d436a3273","sha256:a73b2634ced1334e19016a698efe6b1c1c5d687bc64f95f45bb93421542ba4cf"],"state_sha256":"3a6de5711f7798327c59900bfedaf2c315911f052788bb625ecae8c248295e8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"stSbEzvHfqoG1iYi42QVEf7wtvuWhVU2nb+S54aKVzEnZAtlS7eQz8oAz6mJi/4s1qjKxiri57Ffeij/b9KkCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T08:23:37.802592Z","bundle_sha256":"ee07724888e9289355daffa62b8246bb7d05f73813ab038cb62234c82d00b948"}}