{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BYV6NPT3BER4GUCG3NRCS5KR5S","short_pith_number":"pith:BYV6NPT3","canonical_record":{"source":{"id":"2505.18791","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-05-24T17:07:45Z","cross_cats_sorted":["cs.LO","cs.NA"],"title_canon_sha256":"95f353c647b72b1586013ceba45ee9026eb0fd4b3ea6b51f530a305eb619643e","abstract_canon_sha256":"386acc157082089cf7da084f40b6cf2979914f78517cd3754235cfee8fd23bd9"},"schema_version":"1.0"},"canonical_sha256":"0e2be6be7b0923c35046db62297551ecbafe4b0d3dc8f7d6bfde56c47f365bed","source":{"kind":"arxiv","id":"2505.18791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18791","created_at":"2026-07-05T11:09:19Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18791v1","created_at":"2026-07-05T11:09:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18791","created_at":"2026-07-05T11:09:19Z"},{"alias_kind":"pith_short_12","alias_value":"BYV6NPT3BER4","created_at":"2026-07-05T11:09:19Z"},{"alias_kind":"pith_short_16","alias_value":"BYV6NPT3BER4GUCG","created_at":"2026-07-05T11:09:19Z"},{"alias_kind":"pith_short_8","alias_value":"BYV6NPT3","created_at":"2026-07-05T11:09:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BYV6NPT3BER4GUCG3NRCS5KR5S","target":"record","payload":{"canonical_record":{"source":{"id":"2505.18791","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-05-24T17:07:45Z","cross_cats_sorted":["cs.LO","cs.NA"],"title_canon_sha256":"95f353c647b72b1586013ceba45ee9026eb0fd4b3ea6b51f530a305eb619643e","abstract_canon_sha256":"386acc157082089cf7da084f40b6cf2979914f78517cd3754235cfee8fd23bd9"},"schema_version":"1.0"},"canonical_sha256":"0e2be6be7b0923c35046db62297551ecbafe4b0d3dc8f7d6bfde56c47f365bed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:19.628691Z","signature_b64":"O7Uu7/GZ+KKL978ic15NwRFiIwzS5lQDLk/8pmb1fJlbTmDkc0uvihXkxhzVACz/qXQx0Z0QLjscZMhqV9zhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e2be6be7b0923c35046db62297551ecbafe4b0d3dc8f7d6bfde56c47f365bed","last_reissued_at":"2026-07-05T11:09:19.628151Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:19.628151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.18791","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-07-05T11:09:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3yyFsDCPUBR3zHROcmvgOcaWNR2CB3xb9Esr4aSFAJJ5tHMMD//v7ExcPTTKA3et4Bn8FX0l5cPb9+VRm4ceDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:53:01.578771Z"},"content_sha256":"4131f0394b40df4ccd2ee43a830dd01c42581a0a97113329ca118bc015c7d4d6","schema_version":"1.0","event_id":"sha256:4131f0394b40df4ccd2ee43a830dd01c42581a0a97113329ca118bc015c7d4d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BYV6NPT3BER4GUCG3NRCS5KR5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automatic Verification of Floating-Point Accumulation Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","cs.NA"],"primary_cat":"math.NA","authors_text":"Alex Aiken, David K. Zhang","submitted_at":"2025-05-24T17:07:45Z","abstract_excerpt":"Floating-point accumulation networks (FPANs) are key building blocks used in many floating-point algorithms, including compensated summation and double-double arithmetic. FPANs are notoriously difficult to analyze, and algorithms using FPANs are often published without rigorous correctness proofs. In fact, on at least one occasion, a published error bound for a widely used FPAN was later found to be incorrect. In this paper, we present an automatic procedure that produces computer-verified proofs of several FPAN correctness properties, including error bounds that are tight to the nearest bit. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18791","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.18791/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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:09:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0vOXIMqHFPEwFdKjYoVGUVuVrF1V/4O5tPMvKHIN5KplBSSK6H9dgrj4Gs5rvoH4PUftNFjm8E6OPqPUbbHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:53:01.579706Z"},"content_sha256":"bb03a42e0eed253c4e62d28d664d89c251ecbdcc26fbed0ae218e883311ace72","schema_version":"1.0","event_id":"sha256:bb03a42e0eed253c4e62d28d664d89c251ecbdcc26fbed0ae218e883311ace72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYV6NPT3BER4GUCG3NRCS5KR5S/bundle.json","state_url":"https://pith.science/pith/BYV6NPT3BER4GUCG3NRCS5KR5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYV6NPT3BER4GUCG3NRCS5KR5S/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-08-12T16:53:01Z","links":{"resolver":"https://pith.science/pith/BYV6NPT3BER4GUCG3NRCS5KR5S","bundle":"https://pith.science/pith/BYV6NPT3BER4GUCG3NRCS5KR5S/bundle.json","state":"https://pith.science/pith/BYV6NPT3BER4GUCG3NRCS5KR5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYV6NPT3BER4GUCG3NRCS5KR5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BYV6NPT3BER4GUCG3NRCS5KR5S","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":"386acc157082089cf7da084f40b6cf2979914f78517cd3754235cfee8fd23bd9","cross_cats_sorted":["cs.LO","cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-05-24T17:07:45Z","title_canon_sha256":"95f353c647b72b1586013ceba45ee9026eb0fd4b3ea6b51f530a305eb619643e"},"schema_version":"1.0","source":{"id":"2505.18791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18791","created_at":"2026-07-05T11:09:19Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18791v1","created_at":"2026-07-05T11:09:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18791","created_at":"2026-07-05T11:09:19Z"},{"alias_kind":"pith_short_12","alias_value":"BYV6NPT3BER4","created_at":"2026-07-05T11:09:19Z"},{"alias_kind":"pith_short_16","alias_value":"BYV6NPT3BER4GUCG","created_at":"2026-07-05T11:09:19Z"},{"alias_kind":"pith_short_8","alias_value":"BYV6NPT3","created_at":"2026-07-05T11:09:19Z"}],"graph_snapshots":[{"event_id":"sha256:bb03a42e0eed253c4e62d28d664d89c251ecbdcc26fbed0ae218e883311ace72","target":"graph","created_at":"2026-07-05T11:09:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.18791/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Floating-point accumulation networks (FPANs) are key building blocks used in many floating-point algorithms, including compensated summation and double-double arithmetic. FPANs are notoriously difficult to analyze, and algorithms using FPANs are often published without rigorous correctness proofs. In fact, on at least one occasion, a published error bound for a widely used FPAN was later found to be incorrect. In this paper, we present an automatic procedure that produces computer-verified proofs of several FPAN correctness properties, including error bounds that are tight to the nearest bit. ","authors_text":"Alex Aiken, David K. Zhang","cross_cats":["cs.LO","cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-05-24T17:07:45Z","title":"Automatic Verification of Floating-Point Accumulation Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18791","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:4131f0394b40df4ccd2ee43a830dd01c42581a0a97113329ca118bc015c7d4d6","target":"record","created_at":"2026-07-05T11:09:19Z","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":"386acc157082089cf7da084f40b6cf2979914f78517cd3754235cfee8fd23bd9","cross_cats_sorted":["cs.LO","cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-05-24T17:07:45Z","title_canon_sha256":"95f353c647b72b1586013ceba45ee9026eb0fd4b3ea6b51f530a305eb619643e"},"schema_version":"1.0","source":{"id":"2505.18791","kind":"arxiv","version":1}},"canonical_sha256":"0e2be6be7b0923c35046db62297551ecbafe4b0d3dc8f7d6bfde56c47f365bed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e2be6be7b0923c35046db62297551ecbafe4b0d3dc8f7d6bfde56c47f365bed","first_computed_at":"2026-07-05T11:09:19.628151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:09:19.628151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O7Uu7/GZ+KKL978ic15NwRFiIwzS5lQDLk/8pmb1fJlbTmDkc0uvihXkxhzVACz/qXQx0Z0QLjscZMhqV9zhDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:09:19.628691Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.18791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4131f0394b40df4ccd2ee43a830dd01c42581a0a97113329ca118bc015c7d4d6","sha256:bb03a42e0eed253c4e62d28d664d89c251ecbdcc26fbed0ae218e883311ace72"],"state_sha256":"4d2c03089bca12d5c0fbdddf08f799bbeb993ffdab2a830d559667c78b4aca46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDQaeSdT13mImXugwuixkL4tN2slS020UWnntNgJy3ZbXs+2VnbLWHPo/fFy/vG5RIRr0UWk1Our5WlwpB2YDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T16:53:01.587877Z","bundle_sha256":"141c231d318002b8d6b3bd6aa6ec5ce108b68e022a768fdb336dd2ab945b7434"}}