{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2LYLHKH3NIM6FGPMVVF3K7ESG2","short_pith_number":"pith:2LYLHKH3","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"},"canonical_sha256":"d2f0b3a8fb6a19e299ecad4bb57c9236b455fe7dc3306efece60684560583497","source":{"kind":"arxiv","id":"1005.4844","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.4844","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1005.4844v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4844","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"2LYLHKH3NIM6","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2LYLHKH3NIM6FGPM","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2LYLHKH3","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2LYLHKH3NIM6FGPMVVF3K7ESG2","target":"record","payload":{"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"},"canonical_sha256":"d2f0b3a8fb6a19e299ecad4bb57c9236b455fe7dc3306efece60684560583497","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"},"source_kind":"arxiv","source_id":"1005.4844","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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSyO/AWIK+YTho6W8TPijSUdfwrupJE9rPVcUoQcwFQqBFiMF7clB8138zJDTLEI14Y4E+I+fiXBRlkImOt8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:46:21.571340Z"},"content_sha256":"13ea37433bdd71d648b1f2f009225ccf3c7909da7f2cf8eed4844ae322ba8ef6","schema_version":"1.0","event_id":"sha256:13ea37433bdd71d648b1f2f009225ccf3c7909da7f2cf8eed4844ae322ba8ef6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2LYLHKH3NIM6FGPMVVF3K7ESG2","target":"graph","payload":{"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"},"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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Np5KLAz3ru1cz9l2l6yfH0A8aq+FVqJS7bLpNd86+TIJFAJSaQ7yJGCw6B4GJaAMH6odb5Y8N1MDke/1s76VAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:46:21.571684Z"},"content_sha256":"d90839cadf69e5dfecdfbb81ca20361770caba4b1626736e4c1c1085a053c55f","schema_version":"1.0","event_id":"sha256:d90839cadf69e5dfecdfbb81ca20361770caba4b1626736e4c1c1085a053c55f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2/bundle.json","state_url":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2/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-08T11:46:21Z","links":{"resolver":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2","bundle":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2/bundle.json","state":"https://pith.science/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LYLHKH3NIM6FGPMVVF3K7ESG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2LYLHKH3NIM6FGPMVVF3K7ESG2","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":"e6dcaa2f61376ff5fefbfec96c961c851d3fe05c25d406efe67ae3743ded6474","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-05-26T15:25:52Z","title_canon_sha256":"02579be7c7e0b0c8968dd436d26f59cdd3737e3c3486670a5fb36cd5ec71e5ce"},"schema_version":"1.0","source":{"id":"1005.4844","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.4844","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1005.4844v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4844","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"2LYLHKH3NIM6","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2LYLHKH3NIM6FGPM","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2LYLHKH3","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:d90839cadf69e5dfecdfbb81ca20361770caba4b1626736e4c1c1085a053c55f","target":"graph","created_at":"2026-05-17T23:51:24Z","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":"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","authors_text":"David Monniaux","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-05-26T15:25:52Z","title":"Automatic Modular Abstractions for Template Numerical Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4844","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:13ea37433bdd71d648b1f2f009225ccf3c7909da7f2cf8eed4844ae322ba8ef6","target":"record","created_at":"2026-05-17T23:51:24Z","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":"e6dcaa2f61376ff5fefbfec96c961c851d3fe05c25d406efe67ae3743ded6474","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-05-26T15:25:52Z","title_canon_sha256":"02579be7c7e0b0c8968dd436d26f59cdd3737e3c3486670a5fb36cd5ec71e5ce"},"schema_version":"1.0","source":{"id":"1005.4844","kind":"arxiv","version":1}},"canonical_sha256":"d2f0b3a8fb6a19e299ecad4bb57c9236b455fe7dc3306efece60684560583497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2f0b3a8fb6a19e299ecad4bb57c9236b455fe7dc3306efece60684560583497","first_computed_at":"2026-05-17T23:51:24.154744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:24.154744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zin972/q2L6S+SyE8fl+JwYb7W9FViQpBI0EhyHAkLeDBASG68wm/ZWnFFTTtLabHJ1Nfdox52735UHdujaqBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:24.155204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.4844","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13ea37433bdd71d648b1f2f009225ccf3c7909da7f2cf8eed4844ae322ba8ef6","sha256:d90839cadf69e5dfecdfbb81ca20361770caba4b1626736e4c1c1085a053c55f"],"state_sha256":"c8ac7953ab44563980a707ece9dd934b241b47685b262ce29a7dba6fa57d0c34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvPfR6xnvE4l0aLg9vPzpgR4EhFmUnzL8V2tP6zzI1fBiNOnDtOfF3NTsMkDioa+IKjj6kTgTwOeHq66DWIxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:46:21.573490Z","bundle_sha256":"132620728d429871dc536d00e628403a3715029a746e11c16e2c9c2639eedf61"}}