{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:J4X5BZX4Z2LDLNKS64RDKZ23YS","short_pith_number":"pith:J4X5BZX4","canonical_record":{"source":{"id":"1912.08788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-12-18T18:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"499adee598d313d1612da7b5ae40254393ded20404a52233e9af44d5b790fd2f","abstract_canon_sha256":"ab43db9082698cfe5d07148a602514f2f77d8cfa74e673174894275866dbb207"},"schema_version":"1.0"},"canonical_sha256":"4f2fd0e6fcce9635b552f72235675bc4bb3cb8e941d8e65f627f71b809ec0233","source":{"kind":"arxiv","id":"1912.08788","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.08788","created_at":"2026-07-05T01:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1912.08788v2","created_at":"2026-07-05T01:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.08788","created_at":"2026-07-05T01:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"J4X5BZX4Z2LD","created_at":"2026-07-05T01:17:59Z"},{"alias_kind":"pith_short_16","alias_value":"J4X5BZX4Z2LDLNKS","created_at":"2026-07-05T01:17:59Z"},{"alias_kind":"pith_short_8","alias_value":"J4X5BZX4","created_at":"2026-07-05T01:17:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:J4X5BZX4Z2LDLNKS64RDKZ23YS","target":"record","payload":{"canonical_record":{"source":{"id":"1912.08788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-12-18T18:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"499adee598d313d1612da7b5ae40254393ded20404a52233e9af44d5b790fd2f","abstract_canon_sha256":"ab43db9082698cfe5d07148a602514f2f77d8cfa74e673174894275866dbb207"},"schema_version":"1.0"},"canonical_sha256":"4f2fd0e6fcce9635b552f72235675bc4bb3cb8e941d8e65f627f71b809ec0233","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:59.391475Z","signature_b64":"CAQ0L7dX3n3L//nBVVXOlT2s9PkWCgv6UGbDCNqVOjLNRxsagjtOh6Fs+GRsxVCyXjDfKyaNFk+uKesPjLvwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f2fd0e6fcce9635b552f72235675bc4bb3cb8e941d8e65f627f71b809ec0233","last_reissued_at":"2026-07-05T01:17:59.391053Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:59.391053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.08788","source_version":2,"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-05T01:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjUuOPMkOHCm+rTSkDMdmKhetsZKvWQl3M45Ch65+qJ7ERH5Zvn8Ow+PEdl6ro8autbjo+0D5W8iipzmr4/9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:27:12.494555Z"},"content_sha256":"41d54b484625dc2d85680d19bfccfd6a628ac68434026bae793347092588a7d6","schema_version":"1.0","event_id":"sha256:41d54b484625dc2d85680d19bfccfd6a628ac68434026bae793347092588a7d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:J4X5BZX4Z2LDLNKS64RDKZ23YS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Lesly-Ann Daniel, S\\'ebastien Bardin, Tamara Rezk","submitted_at":"2019-12-18T18:41:34Z","abstract_excerpt":"The constant-time programming discipline (CT) is an efficient countermeasure against timing side-channel attacks, requiring the control flow and the memory accesses to be independent from the secrets. Yet, writing CT code is challenging as it demands to reason about pairs of execution traces (2- hypersafety property) and it is generally not preserved by the compiler, requiring binary-level analysis. Unfortunately, current verification tools for CT either reason at higher level (C or LLVM), or sacrifice bug-finding or bounded-verification, or do not scale. We tackle the problem of designing an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.08788","kind":"arxiv","version":2},"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/1912.08788/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-05T01:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOgjK6/t5+YXEZkYRfIJ+HCUrYCP6TCjIs10TqcqI3iitSMSsFbKzR0ZV5qWI745IouhVGJoqUrFAFaONdRQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:27:12.495112Z"},"content_sha256":"8440071c6ea6e6b20754b768d500faa3891cabe6c054beaac3e2186303f72338","schema_version":"1.0","event_id":"sha256:8440071c6ea6e6b20754b768d500faa3891cabe6c054beaac3e2186303f72338"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J4X5BZX4Z2LDLNKS64RDKZ23YS/bundle.json","state_url":"https://pith.science/pith/J4X5BZX4Z2LDLNKS64RDKZ23YS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J4X5BZX4Z2LDLNKS64RDKZ23YS/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-14T08:27:12Z","links":{"resolver":"https://pith.science/pith/J4X5BZX4Z2LDLNKS64RDKZ23YS","bundle":"https://pith.science/pith/J4X5BZX4Z2LDLNKS64RDKZ23YS/bundle.json","state":"https://pith.science/pith/J4X5BZX4Z2LDLNKS64RDKZ23YS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J4X5BZX4Z2LDLNKS64RDKZ23YS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:J4X5BZX4Z2LDLNKS64RDKZ23YS","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":"ab43db9082698cfe5d07148a602514f2f77d8cfa74e673174894275866dbb207","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-12-18T18:41:34Z","title_canon_sha256":"499adee598d313d1612da7b5ae40254393ded20404a52233e9af44d5b790fd2f"},"schema_version":"1.0","source":{"id":"1912.08788","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.08788","created_at":"2026-07-05T01:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1912.08788v2","created_at":"2026-07-05T01:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.08788","created_at":"2026-07-05T01:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"J4X5BZX4Z2LD","created_at":"2026-07-05T01:17:59Z"},{"alias_kind":"pith_short_16","alias_value":"J4X5BZX4Z2LDLNKS","created_at":"2026-07-05T01:17:59Z"},{"alias_kind":"pith_short_8","alias_value":"J4X5BZX4","created_at":"2026-07-05T01:17:59Z"}],"graph_snapshots":[{"event_id":"sha256:8440071c6ea6e6b20754b768d500faa3891cabe6c054beaac3e2186303f72338","target":"graph","created_at":"2026-07-05T01:17:59Z","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/1912.08788/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The constant-time programming discipline (CT) is an efficient countermeasure against timing side-channel attacks, requiring the control flow and the memory accesses to be independent from the secrets. Yet, writing CT code is challenging as it demands to reason about pairs of execution traces (2- hypersafety property) and it is generally not preserved by the compiler, requiring binary-level analysis. Unfortunately, current verification tools for CT either reason at higher level (C or LLVM), or sacrifice bug-finding or bounded-verification, or do not scale. We tackle the problem of designing an ","authors_text":"Lesly-Ann Daniel, S\\'ebastien Bardin, Tamara Rezk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-12-18T18:41:34Z","title":"Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.08788","kind":"arxiv","version":2},"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:41d54b484625dc2d85680d19bfccfd6a628ac68434026bae793347092588a7d6","target":"record","created_at":"2026-07-05T01:17:59Z","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":"ab43db9082698cfe5d07148a602514f2f77d8cfa74e673174894275866dbb207","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-12-18T18:41:34Z","title_canon_sha256":"499adee598d313d1612da7b5ae40254393ded20404a52233e9af44d5b790fd2f"},"schema_version":"1.0","source":{"id":"1912.08788","kind":"arxiv","version":2}},"canonical_sha256":"4f2fd0e6fcce9635b552f72235675bc4bb3cb8e941d8e65f627f71b809ec0233","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f2fd0e6fcce9635b552f72235675bc4bb3cb8e941d8e65f627f71b809ec0233","first_computed_at":"2026-07-05T01:17:59.391053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:17:59.391053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CAQ0L7dX3n3L//nBVVXOlT2s9PkWCgv6UGbDCNqVOjLNRxsagjtOh6Fs+GRsxVCyXjDfKyaNFk+uKesPjLvwAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:17:59.391475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.08788","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41d54b484625dc2d85680d19bfccfd6a628ac68434026bae793347092588a7d6","sha256:8440071c6ea6e6b20754b768d500faa3891cabe6c054beaac3e2186303f72338"],"state_sha256":"a8f65f417e9419b548ba6cd1ffd8ecc945ad1c0b39becfc13b37b0608dc9d128"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"am30HMRbB7IYacLHqneYUFo5wvl97jeUMsnq11qfhKaGJLTPvF/xh1noZ05sr2Dr71naAkS9gqpI6woxLMK6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T08:27:12.500443Z","bundle_sha256":"23f147e7b1f7c672243b5f73dc45cac8e7287a038eea287fa121c0a8de2b2d42"}}