{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XF3QNVFHMM6CVHMJXFPIV5C3RV","short_pith_number":"pith:XF3QNVFH","schema_version":"1.0","canonical_sha256":"b97706d4a7633c2a9d89b95e8af45b8d6960a668d4d9e5c746122156594f70f5","source":{"kind":"arxiv","id":"1204.6671","version":1},"attestation_state":"computed","paper":{"title":"Delta-Decidability over the Reals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Edmund Clarke, Jeremy Avigad, Sicun Gao","submitted_at":"2012-04-30T15:35:10Z","abstract_excerpt":"Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence \\varphi containing only bounded quantifiers, and any positive rational number \\delta, decides either \"\\varphi is true\", or \"a \\delta-strengthening of \\varphi is false\". Under mild assumptions, for a C-computable signature F, the \\delta-decision problem for bounded \\Sigma_k-sentences in L_F resides in (\\Sigma_k^P)^C. The results stand in sharp contrast to the well-known undecidability results, and serve as a theoretical basis for the use of numerical methods in deci"},"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":"1204.6671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-30T15:35:10Z","cross_cats_sorted":[],"title_canon_sha256":"dc59f4866700fc3f656152dffe6f6ca520e30c404d6c39a460c4356b46ea6ec1","abstract_canon_sha256":"8f7a7e9ab89f24ff5ac90d6e7f08da644aaa342513f9218e8b524a5908b4f87a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:44.162771Z","signature_b64":"S0OwHSCMFH4VV3d1SxxeV3rk6IsgSiZkfv9znI5tewjWpg7jb5w/wLMd5Ig8h+UQi6C3SWpEvKKEZOLAcOV1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b97706d4a7633c2a9d89b95e8af45b8d6960a668d4d9e5c746122156594f70f5","last_reissued_at":"2026-05-18T03:56:44.162334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:44.162334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delta-Decidability over the Reals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Edmund Clarke, Jeremy Avigad, Sicun Gao","submitted_at":"2012-04-30T15:35:10Z","abstract_excerpt":"Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence \\varphi containing only bounded quantifiers, and any positive rational number \\delta, decides either \"\\varphi is true\", or \"a \\delta-strengthening of \\varphi is false\". Under mild assumptions, for a C-computable signature F, the \\delta-decision problem for bounded \\Sigma_k-sentences in L_F resides in (\\Sigma_k^P)^C. The results stand in sharp contrast to the well-known undecidability results, and serve as a theoretical basis for the use of numerical methods in deci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6671","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":"1204.6671","created_at":"2026-05-18T03:56:44.162395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.6671v1","created_at":"2026-05-18T03:56:44.162395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6671","created_at":"2026-05-18T03:56:44.162395+00:00"},{"alias_kind":"pith_short_12","alias_value":"XF3QNVFHMM6C","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XF3QNVFHMM6CVHMJ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XF3QNVFH","created_at":"2026-05-18T12:27:27.928770+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/XF3QNVFHMM6CVHMJXFPIV5C3RV","json":"https://pith.science/pith/XF3QNVFHMM6CVHMJXFPIV5C3RV.json","graph_json":"https://pith.science/api/pith-number/XF3QNVFHMM6CVHMJXFPIV5C3RV/graph.json","events_json":"https://pith.science/api/pith-number/XF3QNVFHMM6CVHMJXFPIV5C3RV/events.json","paper":"https://pith.science/paper/XF3QNVFH"},"agent_actions":{"view_html":"https://pith.science/pith/XF3QNVFHMM6CVHMJXFPIV5C3RV","download_json":"https://pith.science/pith/XF3QNVFHMM6CVHMJXFPIV5C3RV.json","view_paper":"https://pith.science/paper/XF3QNVFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.6671&json=true","fetch_graph":"https://pith.science/api/pith-number/XF3QNVFHMM6CVHMJXFPIV5C3RV/graph.json","fetch_events":"https://pith.science/api/pith-number/XF3QNVFHMM6CVHMJXFPIV5C3RV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XF3QNVFHMM6CVHMJXFPIV5C3RV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XF3QNVFHMM6CVHMJXFPIV5C3RV/action/storage_attestation","attest_author":"https://pith.science/pith/XF3QNVFHMM6CVHMJXFPIV5C3RV/action/author_attestation","sign_citation":"https://pith.science/pith/XF3QNVFHMM6CVHMJXFPIV5C3RV/action/citation_signature","submit_replication":"https://pith.science/pith/XF3QNVFHMM6CVHMJXFPIV5C3RV/action/replication_record"}},"created_at":"2026-05-18T03:56:44.162395+00:00","updated_at":"2026-05-18T03:56:44.162395+00:00"}