{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:BJQBOAVTV32C77MUH43XQWV5H4","short_pith_number":"pith:BJQBOAVT","canonical_record":{"source":{"id":"1010.1697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-10-08T14:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"0f4a51c8be7d4b315a8f009b36d67b089708672c2add0d374a9092f56df2f886","abstract_canon_sha256":"460da57e911ada94c33f752dd1ffc8b339ad26730102caf8c9d2d894480702bd"},"schema_version":"1.0"},"canonical_sha256":"0a601702b3aef42ffd943f37785abd3f066ad7981cdc1c6042c5700f2846b799","source":{"kind":"arxiv","id":"1010.1697","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1697","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1697v1","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1697","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"BJQBOAVTV32C","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BJQBOAVTV32C77MU","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BJQBOAVT","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:BJQBOAVTV32C77MUH43XQWV5H4","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-10-08T14:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"0f4a51c8be7d4b315a8f009b36d67b089708672c2add0d374a9092f56df2f886","abstract_canon_sha256":"460da57e911ada94c33f752dd1ffc8b339ad26730102caf8c9d2d894480702bd"},"schema_version":"1.0"},"canonical_sha256":"0a601702b3aef42ffd943f37785abd3f066ad7981cdc1c6042c5700f2846b799","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:39.841896Z","signature_b64":"QVK1ivQYliCrDIROFi4Osnr00q+Umlvu+Kg3V0/MOUUbBoejq5BdOs8lhNAU+hiLST90V9/UHTfhhu6bRBu6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a601702b3aef42ffd943f37785abd3f066ad7981cdc1c6042c5700f2846b799","last_reissued_at":"2026-05-18T04:39:39.841374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:39.841374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1697","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-05-18T04:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDqqaMM9/jL3vSwa5XONEnym5lxFeOn25WaSt8+KehPzNN+ll/9iMy332S8lbQYC3q1vhaBpj0mkYQR2mQ3lAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:31:25.728076Z"},"content_sha256":"05530a9eeb5055e675ddf8d77c2c66fb032946ed38750a8ea0ac54db9efeb74e","schema_version":"1.0","event_id":"sha256:05530a9eeb5055e675ddf8d77c2c66fb032946ed38750a8ea0ac54db9efeb74e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:BJQBOAVTV32C77MUH43XQWV5H4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Certifying cost annotations in compilers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"INRIA Paris - Rocquencourt), Nicolas Ayache (PPS, Roberto M. Amadio (PPS), Ronan Saillard (PPS, Yann R\\'egis-Gianas (PPS","submitted_at":"2010-10-08T14:13:09Z","abstract_excerpt":"We discuss the problem of building a compiler which can lift in a provably correct way pieces of information on the execution cost of the object code to cost annotations on the source code. To this end, we need a clear and flexible picture of: (i) the meaning of cost annotations, (ii) the method to prove them sound and precise, and (iii) the way such proofs can be composed. We propose a so-called labelling approach to these three questions. As a first step, we examine its application to a toy compiler. This formal study suggests that the labelling approach has good compositionality and scalabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1697","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":""},"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-18T04:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1f+aHLxFFt4yAS0/TpYAMCSBxF+7kjtCxS0z1MQ6v+vZWzplGJYj1rn2S8qfHUciKwg1OxDM5eyLpLsaUFN7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:31:25.728433Z"},"content_sha256":"bab018d686593020759001772a6215cbad84b2e8aed407458194721a38f0de40","schema_version":"1.0","event_id":"sha256:bab018d686593020759001772a6215cbad84b2e8aed407458194721a38f0de40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJQBOAVTV32C77MUH43XQWV5H4/bundle.json","state_url":"https://pith.science/pith/BJQBOAVTV32C77MUH43XQWV5H4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJQBOAVTV32C77MUH43XQWV5H4/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-06-21T11:31:25Z","links":{"resolver":"https://pith.science/pith/BJQBOAVTV32C77MUH43XQWV5H4","bundle":"https://pith.science/pith/BJQBOAVTV32C77MUH43XQWV5H4/bundle.json","state":"https://pith.science/pith/BJQBOAVTV32C77MUH43XQWV5H4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJQBOAVTV32C77MUH43XQWV5H4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:BJQBOAVTV32C77MUH43XQWV5H4","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":"460da57e911ada94c33f752dd1ffc8b339ad26730102caf8c9d2d894480702bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-10-08T14:13:09Z","title_canon_sha256":"0f4a51c8be7d4b315a8f009b36d67b089708672c2add0d374a9092f56df2f886"},"schema_version":"1.0","source":{"id":"1010.1697","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1697","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1697v1","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1697","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"BJQBOAVTV32C","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BJQBOAVTV32C77MU","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BJQBOAVT","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:bab018d686593020759001772a6215cbad84b2e8aed407458194721a38f0de40","target":"graph","created_at":"2026-05-18T04:39:39Z","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":"We discuss the problem of building a compiler which can lift in a provably correct way pieces of information on the execution cost of the object code to cost annotations on the source code. To this end, we need a clear and flexible picture of: (i) the meaning of cost annotations, (ii) the method to prove them sound and precise, and (iii) the way such proofs can be composed. We propose a so-called labelling approach to these three questions. As a first step, we examine its application to a toy compiler. This formal study suggests that the labelling approach has good compositionality and scalabi","authors_text":"INRIA Paris - Rocquencourt), Nicolas Ayache (PPS, Roberto M. Amadio (PPS), Ronan Saillard (PPS, Yann R\\'egis-Gianas (PPS","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-10-08T14:13:09Z","title":"Certifying cost annotations in compilers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1697","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:05530a9eeb5055e675ddf8d77c2c66fb032946ed38750a8ea0ac54db9efeb74e","target":"record","created_at":"2026-05-18T04:39:39Z","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":"460da57e911ada94c33f752dd1ffc8b339ad26730102caf8c9d2d894480702bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-10-08T14:13:09Z","title_canon_sha256":"0f4a51c8be7d4b315a8f009b36d67b089708672c2add0d374a9092f56df2f886"},"schema_version":"1.0","source":{"id":"1010.1697","kind":"arxiv","version":1}},"canonical_sha256":"0a601702b3aef42ffd943f37785abd3f066ad7981cdc1c6042c5700f2846b799","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a601702b3aef42ffd943f37785abd3f066ad7981cdc1c6042c5700f2846b799","first_computed_at":"2026-05-18T04:39:39.841374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:39.841374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QVK1ivQYliCrDIROFi4Osnr00q+Umlvu+Kg3V0/MOUUbBoejq5BdOs8lhNAU+hiLST90V9/UHTfhhu6bRBu6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:39.841896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1697","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05530a9eeb5055e675ddf8d77c2c66fb032946ed38750a8ea0ac54db9efeb74e","sha256:bab018d686593020759001772a6215cbad84b2e8aed407458194721a38f0de40"],"state_sha256":"ead7ca522aa2e8ac0d95df05b895f3b8eccb659156d989a036c50ffc07dc3e8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ja3kG6s/CkF2QZ4kRJzbIDaHDjiPYR7HREQaPhYGtyW9ts0vsHze7wILJuTfwuRiUHRAEqqkOlvVPEmW3MPpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T11:31:25.730363Z","bundle_sha256":"d5f303619c484c6b5a70c1e66987b5c862de59ad5d92a8f528102ace825b8695"}}