{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OX4GTDBVIZQOGM5MSB2GAHD6MU","short_pith_number":"pith:OX4GTDBV","schema_version":"1.0","canonical_sha256":"75f8698c354660e333ac9074601c7e65014b37163396636fb54b9011d0bbc1ec","source":{"kind":"arxiv","id":"1309.2511","version":1},"attestation_state":"computed","paper":{"title":"On Sound Compilation of Reals","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Eva Darulova, Viktor Kuncak","submitted_at":"2013-09-10T13:53:09Z","abstract_excerpt":"Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, including finite numerical precision of implementations. We present a programming model where the user writes a program in a real-valued implementation and specification language that explicitly includes different types of uncertainties. We then present a compilation algorithm that generates a conventional implementation that is guaranteed to meet the desired precision with respect to real numbers. Our verification step generates verification conditions that treat different uncertainties in a unif"},"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":"1309.2511","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.PL","submitted_at":"2013-09-10T13:53:09Z","cross_cats_sorted":[],"title_canon_sha256":"456e9b57db56c382b836ad993185e05ef4687dcc93a824a11d830615c1caa797","abstract_canon_sha256":"a0ec4977d7072e065091c6a236b04cd2821c2fa63fdfcdfb2632d30f8b03c84b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:44.423819Z","signature_b64":"heFoecpDTlYmTv9uoRFwIXQQMan9Jhd6FvAqB8A+w9tPNfMdSN8jeVyg77iEmeQfXEVEYmWeNPY13xrsf1yyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75f8698c354660e333ac9074601c7e65014b37163396636fb54b9011d0bbc1ec","last_reissued_at":"2026-05-18T03:13:44.423249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:44.423249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Sound Compilation of Reals","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Eva Darulova, Viktor Kuncak","submitted_at":"2013-09-10T13:53:09Z","abstract_excerpt":"Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, including finite numerical precision of implementations. We present a programming model where the user writes a program in a real-valued implementation and specification language that explicitly includes different types of uncertainties. We then present a compilation algorithm that generates a conventional implementation that is guaranteed to meet the desired precision with respect to real numbers. Our verification step generates verification conditions that treat different uncertainties in a unif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2511","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.2511","created_at":"2026-05-18T03:13:44.423330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2511v1","created_at":"2026-05-18T03:13:44.423330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2511","created_at":"2026-05-18T03:13:44.423330+00:00"},{"alias_kind":"pith_short_12","alias_value":"OX4GTDBVIZQO","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OX4GTDBVIZQOGM5M","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OX4GTDBV","created_at":"2026-05-18T12:27:54.935989+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/OX4GTDBVIZQOGM5MSB2GAHD6MU","json":"https://pith.science/pith/OX4GTDBVIZQOGM5MSB2GAHD6MU.json","graph_json":"https://pith.science/api/pith-number/OX4GTDBVIZQOGM5MSB2GAHD6MU/graph.json","events_json":"https://pith.science/api/pith-number/OX4GTDBVIZQOGM5MSB2GAHD6MU/events.json","paper":"https://pith.science/paper/OX4GTDBV"},"agent_actions":{"view_html":"https://pith.science/pith/OX4GTDBVIZQOGM5MSB2GAHD6MU","download_json":"https://pith.science/pith/OX4GTDBVIZQOGM5MSB2GAHD6MU.json","view_paper":"https://pith.science/paper/OX4GTDBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2511&json=true","fetch_graph":"https://pith.science/api/pith-number/OX4GTDBVIZQOGM5MSB2GAHD6MU/graph.json","fetch_events":"https://pith.science/api/pith-number/OX4GTDBVIZQOGM5MSB2GAHD6MU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OX4GTDBVIZQOGM5MSB2GAHD6MU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OX4GTDBVIZQOGM5MSB2GAHD6MU/action/storage_attestation","attest_author":"https://pith.science/pith/OX4GTDBVIZQOGM5MSB2GAHD6MU/action/author_attestation","sign_citation":"https://pith.science/pith/OX4GTDBVIZQOGM5MSB2GAHD6MU/action/citation_signature","submit_replication":"https://pith.science/pith/OX4GTDBVIZQOGM5MSB2GAHD6MU/action/replication_record"}},"created_at":"2026-05-18T03:13:44.423330+00:00","updated_at":"2026-05-18T03:13:44.423330+00:00"}