{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2LYLHKH3NIM6FGPMVVF3K7ESG2","short_pith_number":"pith:2LYLHKH3","schema_version":"1.0","canonical_sha256":"d2f0b3a8fb6a19e299ecad4bb57c9236b455fe7dc3306efece60684560583497","source":{"kind":"arxiv","id":"1005.4844","version":1},"attestation_state":"computed","paper":{"title":"Automatic Modular Abstractions for Template Numerical Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"David Monniaux","submitted_at":"2010-05-26T15:25:52Z","abstract_excerpt":"We propose a method for automatically generating abstract transformers for static analysis by abstract interpretation. The method focuses on linear constraints on programs operating on rational, real or floating-point variables and containing linear assignments and tests. Given the specification of an abstract domain, and a program block, our method automatically outputs an implementation of the corresponding abstract transformer. It is thus a form of program transformation. In addition to loop-free code, the same method also applies for obtaining least fixed points as functions of the precond"},"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":"1005.4844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-05-26T15:25:52Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"02579be7c7e0b0c8968dd436d26f59cdd3737e3c3486670a5fb36cd5ec71e5ce","abstract_canon_sha256":"e6dcaa2f61376ff5fefbfec96c961c851d3fe05c25d406efe67ae3743ded6474"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.155204Z","signature_b64":"Zin972/q2L6S+SyE8fl+JwYb7W9FViQpBI0EhyHAkLeDBASG68wm/ZWnFFTTtLabHJ1Nfdox52735UHdujaqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2f0b3a8fb6a19e299ecad4bb57c9236b455fe7dc3306efece60684560583497","last_reissued_at":"2026-05-17T23:51:24.154744Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.154744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Modular Abstractions for Template Numerical Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"David Monniaux","submitted_at":"2010-05-26T15:25:52Z","abstract_excerpt":"We propose a method for automatically generating abstract transformers for static analysis by abstract interpretation. The method focuses on linear constraints on programs operating on rational, real or floating-point variables and containing linear assignments and tests. Given the specification of an abstract domain, and a program block, our method automatically outputs an implementation of the corresponding abstract transformer. It is thus a form of program transformation. In addition to loop-free code, the same method also applies for obtaining least fixed points as functions of the precond"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4844","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":"1005.4844","created_at":"2026-05-17T23:51:24.154802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.4844v1","created_at":"2026-05-17T23:51:24.154802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4844","created_at":"2026-05-17T23:51:24.154802+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LYLHKH3NIM6","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LYLHKH3NIM6FGPM","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LYLHKH3","created_at":"2026-05-18T12:26:03.138858+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/2LYLHKH3NIM6FGPMVVF3K7ESG2","json":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2.json","graph_json":"https://pith.science/api/pith-number/2LYLHKH3NIM6FGPMVVF3K7ESG2/graph.json","events_json":"https://pith.science/api/pith-number/2LYLHKH3NIM6FGPMVVF3K7ESG2/events.json","paper":"https://pith.science/paper/2LYLHKH3"},"agent_actions":{"view_html":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2","download_json":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2.json","view_paper":"https://pith.science/paper/2LYLHKH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.4844&json=true","fetch_graph":"https://pith.science/api/pith-number/2LYLHKH3NIM6FGPMVVF3K7ESG2/graph.json","fetch_events":"https://pith.science/api/pith-number/2LYLHKH3NIM6FGPMVVF3K7ESG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2/action/storage_attestation","attest_author":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2/action/author_attestation","sign_citation":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2/action/citation_signature","submit_replication":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2/action/replication_record"}},"created_at":"2026-05-17T23:51:24.154802+00:00","updated_at":"2026-05-17T23:51:24.154802+00:00"}