{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:THNST5M7YET3ZR6EHEZSM7JX3T","short_pith_number":"pith:THNST5M7","canonical_record":{"source":{"id":"1802.04385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-02-12T22:56:20Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"e645eb0b1fd60e14e226e35a03136f4099a35a06a3fa7163b926a84b19a57f90","abstract_canon_sha256":"16ccc88752b5c2ae7e59cf69dd478f877e707a1e8379adc7c43c520116cb17b1"},"schema_version":"1.0"},"canonical_sha256":"99db29f59fc127bcc7c43933267d37dcc336d9c53cd24d286a6f65f11ad37142","source":{"kind":"arxiv","id":"1802.04385","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04385","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04385v1","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04385","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"pith_short_12","alias_value":"THNST5M7YET3","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"THNST5M7YET3ZR6E","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"THNST5M7","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:THNST5M7YET3ZR6EHEZSM7JX3T","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-02-12T22:56:20Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"e645eb0b1fd60e14e226e35a03136f4099a35a06a3fa7163b926a84b19a57f90","abstract_canon_sha256":"16ccc88752b5c2ae7e59cf69dd478f877e707a1e8379adc7c43c520116cb17b1"},"schema_version":"1.0"},"canonical_sha256":"99db29f59fc127bcc7c43933267d37dcc336d9c53cd24d286a6f65f11ad37142","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:44.335948Z","signature_b64":"/Cep8r/m4qJeGxlpLOX1ZiPujsVyQiOPY5CYFEEcDGy2KhwJ4JArkBvC9u0bLZ/Mx/mUCMn/bPjwLTjvXEAMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99db29f59fc127bcc7c43933267d37dcc336d9c53cd24d286a6f65f11ad37142","last_reissued_at":"2026-05-18T00:23:44.335247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:44.335247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04385","source_version":1,"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-05-18T00:23:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7HHiThtaohpCWlESzkvDWY7REhmmMvNa3ImRqz8KmYXvbMJWiZXyGRCI7wuJs9Jbi4RQeWhwbtSgdItQDmRRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:02:26.565771Z"},"content_sha256":"5ee1d257c435288b8c9f808e311e57f41ac17b24a6e9ddb0bc91bfdc6be9cfd3","schema_version":"1.0","event_id":"sha256:5ee1d257c435288b8c9f808e311e57f41ac17b24a6e9ddb0bc91bfdc6be9cfd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:THNST5M7YET3ZR6EHEZSM7JX3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.NA","authors_text":"Alexandre Rocca, Thao Dang, Victor Magron","submitted_at":"2018-02-12T22:56:20Z","abstract_excerpt":"Floating point error is a drawback of embedded systems implementation that is difficult to avoid. Computing rigorous upper bounds of roundoff errors is absolutely necessary for the validation of critical software. This problem of computing rigorous upper bounds is even more challenging when addressing non-linear programs. In this paper, we propose and compare two new algorithms based on Bernstein expansions and sparse Krivine-Stengle representations, adapted from the field of the global optimization, to compute upper bounds of roundoff errors for programs implementing polynomial and rational f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04385","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:23:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHwqyTMIncxI9Q+qL31zi/VqidrIUcnd5KA/r3GwdJhK+5n8FDoTiP4AhaSz3wpiiTCwCi6adPUH1gEdabKoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:02:26.566126Z"},"content_sha256":"e6603fd6f0bea01c1002a386be139acdd9d1323f4b4c02f1319890295f13543a","schema_version":"1.0","event_id":"sha256:e6603fd6f0bea01c1002a386be139acdd9d1323f4b4c02f1319890295f13543a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THNST5M7YET3ZR6EHEZSM7JX3T/bundle.json","state_url":"https://pith.science/pith/THNST5M7YET3ZR6EHEZSM7JX3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THNST5M7YET3ZR6EHEZSM7JX3T/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-04T16:02:26Z","links":{"resolver":"https://pith.science/pith/THNST5M7YET3ZR6EHEZSM7JX3T","bundle":"https://pith.science/pith/THNST5M7YET3ZR6EHEZSM7JX3T/bundle.json","state":"https://pith.science/pith/THNST5M7YET3ZR6EHEZSM7JX3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THNST5M7YET3ZR6EHEZSM7JX3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:THNST5M7YET3ZR6EHEZSM7JX3T","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":"16ccc88752b5c2ae7e59cf69dd478f877e707a1e8379adc7c43c520116cb17b1","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-02-12T22:56:20Z","title_canon_sha256":"e645eb0b1fd60e14e226e35a03136f4099a35a06a3fa7163b926a84b19a57f90"},"schema_version":"1.0","source":{"id":"1802.04385","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04385","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04385v1","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04385","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"pith_short_12","alias_value":"THNST5M7YET3","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"THNST5M7YET3ZR6E","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"THNST5M7","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:e6603fd6f0bea01c1002a386be139acdd9d1323f4b4c02f1319890295f13543a","target":"graph","created_at":"2026-05-18T00:23:44Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Floating point error is a drawback of embedded systems implementation that is difficult to avoid. Computing rigorous upper bounds of roundoff errors is absolutely necessary for the validation of critical software. This problem of computing rigorous upper bounds is even more challenging when addressing non-linear programs. In this paper, we propose and compare two new algorithms based on Bernstein expansions and sparse Krivine-Stengle representations, adapted from the field of the global optimization, to compute upper bounds of roundoff errors for programs implementing polynomial and rational f","authors_text":"Alexandre Rocca, Thao Dang, Victor Magron","cross_cats":["cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-02-12T22:56:20Z","title":"Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04385","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5ee1d257c435288b8c9f808e311e57f41ac17b24a6e9ddb0bc91bfdc6be9cfd3","target":"record","created_at":"2026-05-18T00:23:44Z","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":"16ccc88752b5c2ae7e59cf69dd478f877e707a1e8379adc7c43c520116cb17b1","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-02-12T22:56:20Z","title_canon_sha256":"e645eb0b1fd60e14e226e35a03136f4099a35a06a3fa7163b926a84b19a57f90"},"schema_version":"1.0","source":{"id":"1802.04385","kind":"arxiv","version":1}},"canonical_sha256":"99db29f59fc127bcc7c43933267d37dcc336d9c53cd24d286a6f65f11ad37142","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99db29f59fc127bcc7c43933267d37dcc336d9c53cd24d286a6f65f11ad37142","first_computed_at":"2026-05-18T00:23:44.335247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:44.335247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Cep8r/m4qJeGxlpLOX1ZiPujsVyQiOPY5CYFEEcDGy2KhwJ4JArkBvC9u0bLZ/Mx/mUCMn/bPjwLTjvXEAMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:44.335948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04385","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ee1d257c435288b8c9f808e311e57f41ac17b24a6e9ddb0bc91bfdc6be9cfd3","sha256:e6603fd6f0bea01c1002a386be139acdd9d1323f4b4c02f1319890295f13543a"],"state_sha256":"e9ac64ea054bd8affbe1132728a5812188dbb9f624c7dcf1446aef75217039ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mQ8kVoX4IazOvfavjWPby0qfbG/AAMLy+7K3QS9EZyr1nmSAgcJTb8v8+MqmmNQuQ5vL9oVm5cUJq3IYBqwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:02:26.568089Z","bundle_sha256":"af59217819934940b064edc31daf64018c7bcd0189f6c966eb311f01d7494a20"}}