{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6RWM4CREIAGOOO32TBWUTJ2Z2V","short_pith_number":"pith:6RWM4CRE","schema_version":"1.0","canonical_sha256":"f46cce0a24400ce73b7a986d49a759d5459ff2fe1bb6e57c99a453beaf183f17","source":{"kind":"arxiv","id":"2507.15017","version":4},"attestation_state":"computed","paper":{"title":"Polynomial Invariant Generation for Floating-Point Programs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A framework combines round-off error analysis with polynomial constraint solving to generate tight invariants for floating-point programs.","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hongfei Fu, Liqian Chen, Xuran Cai","submitted_at":"2025-07-20T16:02:17Z","abstract_excerpt":"In numeric-intensive computations, it is well known that the execution of floating-point programs is imprecise as floating-point arithmetic incurs round-off errors. Although round-off errors are small for a single floating-point operation, the aggregation of such errors may be dramatic and cause catastrophic program failures. Therefore, to ensure the correctness of floating-point programs, round-off error needs to be carefully taken into account. In this work, we consider polynomial invariant generation for floating-point programs, aiming at generating tight invariants under the perturbation o"},"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":"2507.15017","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2025-07-20T16:02:17Z","cross_cats_sorted":[],"title_canon_sha256":"a389fe8efe9755d0b6cc992ac1582f87e71d954d601207e1b4cf1198079df70c","abstract_canon_sha256":"e6ae3fde9c95b6095db1790798eac621ba8d23290b4a1e062b0bb3fb7380afec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:05.163612Z","signature_b64":"/LtAz0W9kuLIz380xHPfzUYJPvxDKwKEoXqDghR7KQ73JpNSpNRF20xjvCRGALaf0HdJ5QwbuR+JIIGA1l/oDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f46cce0a24400ce73b7a986d49a759d5459ff2fe1bb6e57c99a453beaf183f17","last_reissued_at":"2026-06-03T01:05:05.163142Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:05.163142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Invariant Generation for Floating-Point Programs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A framework combines round-off error analysis with polynomial constraint solving to generate tight invariants for floating-point programs.","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hongfei Fu, Liqian Chen, Xuran Cai","submitted_at":"2025-07-20T16:02:17Z","abstract_excerpt":"In numeric-intensive computations, it is well known that the execution of floating-point programs is imprecise as floating-point arithmetic incurs round-off errors. Although round-off errors are small for a single floating-point operation, the aggregation of such errors may be dramatic and cause catastrophic program failures. Therefore, to ensure the correctness of floating-point programs, round-off error needs to be carefully taken into account. In this work, we consider polynomial invariant generation for floating-point programs, aiming at generating tight invariants under the perturbation o"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our contribution is a novel framework for applying polynomial constraint solving to address the invariant generation problem, which is also the first polynomial constraint solving based approach that handles floating-point errors to our best knowledge.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The combination of round-off error analysis and polynomial constraint solving can circumvent the cost of handling a large number of error variables in the floating-point model without losing tightness of the generated invariants.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A framework merges round-off error analysis and polynomial constraint solving to generate tight invariants for floating-point programs and outperforms prior methods on benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A framework combines round-off error analysis with polynomial constraint solving to generate tight invariants for floating-point programs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b9734d1c8a4e7da24f1622d9c0d46f13e7635a935ea83e3db15ca953f7ec1793"},"source":{"id":"2507.15017","kind":"arxiv","version":4},"verdict":{"id":"9dd8106b-2d89-4d9a-982e-b3a5be7055c3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T03:56:52.405740Z","strongest_claim":"Our contribution is a novel framework for applying polynomial constraint solving to address the invariant generation problem, which is also the first polynomial constraint solving based approach that handles floating-point errors to our best knowledge.","one_line_summary":"A framework merges round-off error analysis and polynomial constraint solving to generate tight invariants for floating-point programs and outperforms prior methods on benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The combination of round-off error analysis and polynomial constraint solving can circumvent the cost of handling a large number of error variables in the floating-point model without losing tightness of the generated invariants.","pith_extraction_headline":"A framework combines round-off error analysis with polynomial constraint solving to generate tight invariants for floating-point programs."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.15017/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.15017","created_at":"2026-06-03T01:05:05.163197+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.15017v4","created_at":"2026-06-03T01:05:05.163197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15017","created_at":"2026-06-03T01:05:05.163197+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RWM4CREIAGO","created_at":"2026-06-03T01:05:05.163197+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RWM4CREIAGOOO32","created_at":"2026-06-03T01:05:05.163197+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RWM4CRE","created_at":"2026-06-03T01:05:05.163197+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/6RWM4CREIAGOOO32TBWUTJ2Z2V","json":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V.json","graph_json":"https://pith.science/api/pith-number/6RWM4CREIAGOOO32TBWUTJ2Z2V/graph.json","events_json":"https://pith.science/api/pith-number/6RWM4CREIAGOOO32TBWUTJ2Z2V/events.json","paper":"https://pith.science/paper/6RWM4CRE"},"agent_actions":{"view_html":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V","download_json":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V.json","view_paper":"https://pith.science/paper/6RWM4CRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.15017&json=true","fetch_graph":"https://pith.science/api/pith-number/6RWM4CREIAGOOO32TBWUTJ2Z2V/graph.json","fetch_events":"https://pith.science/api/pith-number/6RWM4CREIAGOOO32TBWUTJ2Z2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V/action/storage_attestation","attest_author":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V/action/author_attestation","sign_citation":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V/action/citation_signature","submit_replication":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V/action/replication_record"}},"created_at":"2026-06-03T01:05:05.163197+00:00","updated_at":"2026-06-03T01:05:05.163197+00:00"}