{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6DTCLJ6JWE23HK7J23LS6HMOIL","short_pith_number":"pith:6DTCLJ6J","schema_version":"1.0","canonical_sha256":"f0e625a7c9b135b3abe9d6d72f1d8e42e5d7e16df996575fca5124b33301ec5e","source":{"kind":"arxiv","id":"2501.04183","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.04183","created_at":"2026-07-14T01:21:58.707803+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04183v4","created_at":"2026-07-14T01:21:58.707803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04183","created_at":"2026-07-14T01:21:58.707803+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DTCLJ6JWE23","created_at":"2026-07-14T01:21:58.707803+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DTCLJ6JWE23HK7J","created_at":"2026-07-14T01:21:58.707803+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DTCLJ6J","created_at":"2026-07-14T01:21:58.707803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.06112","citing_title":"Fun with flags: How Compilers Break and Fix Constant-Time Code","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL","json":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL.json","graph_json":"https://pith.science/api/pith-number/6DTCLJ6JWE23HK7J23LS6HMOIL/graph.json","events_json":"https://pith.science/api/pith-number/6DTCLJ6JWE23HK7J23LS6HMOIL/events.json","paper":"https://pith.science/paper/6DTCLJ6J"},"agent_actions":{"view_html":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL","download_json":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL.json","view_paper":"https://pith.science/paper/6DTCLJ6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04183&json=true","fetch_graph":"https://pith.science/api/pith-number/6DTCLJ6JWE23HK7J23LS6HMOIL/graph.json","fetch_events":"https://pith.science/api/pith-number/6DTCLJ6JWE23HK7J23LS6HMOIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL/action/storage_attestation","attest_author":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL/action/author_attestation","sign_citation":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL/action/citation_signature","submit_replication":"https://pith.science/pith/6DTCLJ6JWE23HK7J23LS6HMOIL/action/replication_record"}},"created_at":"2026-07-14T01:21:58.707803+00:00","updated_at":"2026-07-14T01:21:58.707803+00:00"}