{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZMZTXE2CMI4D6SMB6PTUWB4KUS","short_pith_number":"pith:ZMZTXE2C","schema_version":"1.0","canonical_sha256":"cb333b934262383f4981f3e74b078aa4931c21363cf9fc5c5575a8b42e01f5ea","source":{"kind":"arxiv","id":"1110.2350","version":2},"attestation_state":"computed","paper":{"title":"Certifying and reasoning about cost annotations of functional programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"INRIA Paris - Rocquencourt), Roberto M. Amadio (PPS), Yann Regis-Gianas (PPS","submitted_at":"2011-10-11T12:35:00Z","abstract_excerpt":"We present a so-called labelling method to insert cost annotations in a higher-order functional program, to certify their correctness with respect to a standard compilation chain to assembly code including safe memory management, and to reason on them in a higher-order Hoare logic."},"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":"1110.2350","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-10-11T12:35:00Z","cross_cats_sorted":[],"title_canon_sha256":"9bfed4069e89533905d662c8f0b39d80354c1ea35f50c8bd82928761605bb513","abstract_canon_sha256":"961db5e7aee4fa6a51553a615526d280544c2d89efe1a39946f5d269f9852d97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:25.316201Z","signature_b64":"ZyVXEthJCH5koHpQ2mJPEW7MKgN9fnoOhca/m9rruxQCCQ3y2eNXoWhxCVHxxXD/xXGYwTFuAFMXLvfXT2MhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb333b934262383f4981f3e74b078aa4931c21363cf9fc5c5575a8b42e01f5ea","last_reissued_at":"2026-05-18T03:36:25.315810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:25.315810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Certifying and reasoning about cost annotations of functional programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"INRIA Paris - Rocquencourt), Roberto M. Amadio (PPS), Yann Regis-Gianas (PPS","submitted_at":"2011-10-11T12:35:00Z","abstract_excerpt":"We present a so-called labelling method to insert cost annotations in a higher-order functional program, to certify their correctness with respect to a standard compilation chain to assembly code including safe memory management, and to reason on them in a higher-order Hoare logic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2350","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":""},"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":"1110.2350","created_at":"2026-05-18T03:36:25.315870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2350v2","created_at":"2026-05-18T03:36:25.315870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2350","created_at":"2026-05-18T03:36:25.315870+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMZTXE2CMI4D","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMZTXE2CMI4D6SMB","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMZTXE2C","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMZTXE2CMI4D6SMB6PTUWB4KUS","json":"https://pith.science/pith/ZMZTXE2CMI4D6SMB6PTUWB4KUS.json","graph_json":"https://pith.science/api/pith-number/ZMZTXE2CMI4D6SMB6PTUWB4KUS/graph.json","events_json":"https://pith.science/api/pith-number/ZMZTXE2CMI4D6SMB6PTUWB4KUS/events.json","paper":"https://pith.science/paper/ZMZTXE2C"},"agent_actions":{"view_html":"https://pith.science/pith/ZMZTXE2CMI4D6SMB6PTUWB4KUS","download_json":"https://pith.science/pith/ZMZTXE2CMI4D6SMB6PTUWB4KUS.json","view_paper":"https://pith.science/paper/ZMZTXE2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2350&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMZTXE2CMI4D6SMB6PTUWB4KUS/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMZTXE2CMI4D6SMB6PTUWB4KUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMZTXE2CMI4D6SMB6PTUWB4KUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMZTXE2CMI4D6SMB6PTUWB4KUS/action/storage_attestation","attest_author":"https://pith.science/pith/ZMZTXE2CMI4D6SMB6PTUWB4KUS/action/author_attestation","sign_citation":"https://pith.science/pith/ZMZTXE2CMI4D6SMB6PTUWB4KUS/action/citation_signature","submit_replication":"https://pith.science/pith/ZMZTXE2CMI4D6SMB6PTUWB4KUS/action/replication_record"}},"created_at":"2026-05-18T03:36:25.315870+00:00","updated_at":"2026-05-18T03:36:25.315870+00:00"}