{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6RWM4CREIAGOOO32TBWUTJ2Z2V","short_pith_number":"pith:6RWM4CRE","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"},"canonical_sha256":"f46cce0a24400ce73b7a986d49a759d5459ff2fe1bb6e57c99a453beaf183f17","source":{"kind":"arxiv","id":"2507.15017","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.15017","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"2507.15017v4","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15017","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"6RWM4CREIAGO","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_16","alias_value":"6RWM4CREIAGOOO32","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_8","alias_value":"6RWM4CRE","created_at":"2026-06-03T01:05:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6RWM4CREIAGOOO32TBWUTJ2Z2V","target":"record","payload":{"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"},"canonical_sha256":"f46cce0a24400ce73b7a986d49a759d5459ff2fe1bb6e57c99a453beaf183f17","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"},"source_kind":"arxiv","source_id":"2507.15017","source_version":4,"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-06-03T01:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0umcYNr5fLYQhR5TKIPvIDe/rH+IFN9uRckFoMZKCTvj4Id0z+kpBW7w17cCP5ARcPH0mk5ubUYapI34sqOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:49:18.498380Z"},"content_sha256":"45da5a863437d4270afc9bbef8ca0cb5910c686f7e25d22a6a91c1afaf0641b7","schema_version":"1.0","event_id":"sha256:45da5a863437d4270afc9bbef8ca0cb5910c686f7e25d22a6a91c1afaf0641b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6RWM4CREIAGOOO32TBWUTJ2Z2V","target":"graph","payload":{"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"},"verdict_id":"9dd8106b-2d89-4d9a-982e-b3a5be7055c3"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T01:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNY/K6+jr7SqT7OlAziF9VhY5vwozG+R60FqogJbn6yb5JGJ+Ars8BZ6hclJBDztOT54tKawJu7/84BHX52BAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:49:18.498846Z"},"content_sha256":"a0177d6364858a97909eb1884723ecc66e70bd89c1d93ddcc2297522c41a1a6d","schema_version":"1.0","event_id":"sha256:a0177d6364858a97909eb1884723ecc66e70bd89c1d93ddcc2297522c41a1a6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V/bundle.json","state_url":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V/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-25T06:49:18Z","links":{"resolver":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V","bundle":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V/bundle.json","state":"https://pith.science/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RWM4CREIAGOOO32TBWUTJ2Z2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6RWM4CREIAGOOO32TBWUTJ2Z2V","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":"e6ae3fde9c95b6095db1790798eac621ba8d23290b4a1e062b0bb3fb7380afec","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2025-07-20T16:02:17Z","title_canon_sha256":"a389fe8efe9755d0b6cc992ac1582f87e71d954d601207e1b4cf1198079df70c"},"schema_version":"1.0","source":{"id":"2507.15017","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.15017","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"2507.15017v4","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15017","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"6RWM4CREIAGO","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_16","alias_value":"6RWM4CREIAGOOO32","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_8","alias_value":"6RWM4CRE","created_at":"2026-06-03T01:05:05Z"}],"graph_snapshots":[{"event_id":"sha256:a0177d6364858a97909eb1884723ecc66e70bd89c1d93ddcc2297522c41a1a6d","target":"graph","created_at":"2026-06-03T01:05:05Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A framework combines round-off error analysis with polynomial constraint solving to generate tight invariants for floating-point programs."}],"snapshot_sha256":"b9734d1c8a4e7da24f1622d9c0d46f13e7635a935ea83e3db15ca953f7ec1793"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.15017/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hongfei Fu, Liqian Chen, Xuran Cai","cross_cats":[],"headline":"A framework combines round-off error analysis with polynomial constraint solving to generate tight invariants for floating-point programs.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2025-07-20T16:02:17Z","title":"Polynomial Invariant Generation for Floating-Point Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15017","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-19T03:56:52.405740Z","id":"9dd8106b-2d89-4d9a-982e-b3a5be7055c3","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"A framework combines round-off error analysis with polynomial constraint solving to generate tight invariants for floating-point programs.","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.","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."}},"verdict_id":"9dd8106b-2d89-4d9a-982e-b3a5be7055c3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:45da5a863437d4270afc9bbef8ca0cb5910c686f7e25d22a6a91c1afaf0641b7","target":"record","created_at":"2026-06-03T01:05:05Z","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":"e6ae3fde9c95b6095db1790798eac621ba8d23290b4a1e062b0bb3fb7380afec","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2025-07-20T16:02:17Z","title_canon_sha256":"a389fe8efe9755d0b6cc992ac1582f87e71d954d601207e1b4cf1198079df70c"},"schema_version":"1.0","source":{"id":"2507.15017","kind":"arxiv","version":4}},"canonical_sha256":"f46cce0a24400ce73b7a986d49a759d5459ff2fe1bb6e57c99a453beaf183f17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f46cce0a24400ce73b7a986d49a759d5459ff2fe1bb6e57c99a453beaf183f17","first_computed_at":"2026-06-03T01:05:05.163142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:05.163142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/LtAz0W9kuLIz380xHPfzUYJPvxDKwKEoXqDghR7KQ73JpNSpNRF20xjvCRGALaf0HdJ5QwbuR+JIIGA1l/oDQ==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:05.163612Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.15017","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45da5a863437d4270afc9bbef8ca0cb5910c686f7e25d22a6a91c1afaf0641b7","sha256:a0177d6364858a97909eb1884723ecc66e70bd89c1d93ddcc2297522c41a1a6d"],"state_sha256":"1c92f6be1651c76eb467e1301fcdac8411638d5713e69ef0d5d9b8bd596a22bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DYoTXBN4GgLiyWrMfas+WjJ4pGLub0Y6SRj7MmJ4tX+kCZvrFZgs6tG6E/jqwWVeIsjivukKuZowHmPq6z4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T06:49:18.501124Z","bundle_sha256":"86f0d898e306cc31d79cf5b5da7003086aaca2dec9aee9fe9094f3daf2b976f0"}}