{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C6K7ZAWF467IR3BW3EYZY7VBJH","short_pith_number":"pith:C6K7ZAWF","schema_version":"1.0","canonical_sha256":"1795fc82c5e7be88ec36d9319c7ea149d7ad88a068c6f13a95ee038aa4c9398d","source":{"kind":"arxiv","id":"1804.10507","version":2},"attestation_state":"computed","paper":{"title":"Sound up-to techniques and Complete abstract domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Dusko Pavlovic, Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi","submitted_at":"2018-04-27T13:53:26Z","abstract_excerpt":"Abstract interpretation is a method to automatically find invariants of programs or pieces of code whose semantics is given via least fixed-points. Up-to techniques have been introduced as enhancements of coinduction, an abstract principle to prove properties expressed via greatest fixed-points.\n  While abstract interpretation is always sound by definition, the soundness of up-to techniques needs some ingenuity to be proven. For completeness, the setting is switched: up-to techniques are always complete, while abstract domains are not.\n  In this work we show that, under reasonable assumptions,"},"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":"1804.10507","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-27T13:53:26Z","cross_cats_sorted":[],"title_canon_sha256":"772c72a5ffafb28ac6a474f47782b620e241e16878f20aac47ea155ff0784990","abstract_canon_sha256":"138962044d061cb9b907de8657ed030408509b2a55d9cba06c1d768ab66d4ce3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:58.858584Z","signature_b64":"kLptnPNK58AEkny5yysFeJSGfofnOaScw0yAEgNnI067YmakaOhFc77OfPvHCBo6tL0kZI3wVMLSZfmpq2SoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1795fc82c5e7be88ec36d9319c7ea149d7ad88a068c6f13a95ee038aa4c9398d","last_reissued_at":"2026-05-18T00:16:58.857904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:58.857904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sound up-to techniques and Complete abstract domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Dusko Pavlovic, Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi","submitted_at":"2018-04-27T13:53:26Z","abstract_excerpt":"Abstract interpretation is a method to automatically find invariants of programs or pieces of code whose semantics is given via least fixed-points. Up-to techniques have been introduced as enhancements of coinduction, an abstract principle to prove properties expressed via greatest fixed-points.\n  While abstract interpretation is always sound by definition, the soundness of up-to techniques needs some ingenuity to be proven. For completeness, the setting is switched: up-to techniques are always complete, while abstract domains are not.\n  In this work we show that, under reasonable assumptions,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10507","kind":"arxiv","version":2},"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":"1804.10507","created_at":"2026-05-18T00:16:58.857995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10507v2","created_at":"2026-05-18T00:16:58.857995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10507","created_at":"2026-05-18T00:16:58.857995+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6K7ZAWF467I","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6K7ZAWF467IR3BW","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6K7ZAWF","created_at":"2026-05-18T12:32:16.446611+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/C6K7ZAWF467IR3BW3EYZY7VBJH","json":"https://pith.science/pith/C6K7ZAWF467IR3BW3EYZY7VBJH.json","graph_json":"https://pith.science/api/pith-number/C6K7ZAWF467IR3BW3EYZY7VBJH/graph.json","events_json":"https://pith.science/api/pith-number/C6K7ZAWF467IR3BW3EYZY7VBJH/events.json","paper":"https://pith.science/paper/C6K7ZAWF"},"agent_actions":{"view_html":"https://pith.science/pith/C6K7ZAWF467IR3BW3EYZY7VBJH","download_json":"https://pith.science/pith/C6K7ZAWF467IR3BW3EYZY7VBJH.json","view_paper":"https://pith.science/paper/C6K7ZAWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10507&json=true","fetch_graph":"https://pith.science/api/pith-number/C6K7ZAWF467IR3BW3EYZY7VBJH/graph.json","fetch_events":"https://pith.science/api/pith-number/C6K7ZAWF467IR3BW3EYZY7VBJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6K7ZAWF467IR3BW3EYZY7VBJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6K7ZAWF467IR3BW3EYZY7VBJH/action/storage_attestation","attest_author":"https://pith.science/pith/C6K7ZAWF467IR3BW3EYZY7VBJH/action/author_attestation","sign_citation":"https://pith.science/pith/C6K7ZAWF467IR3BW3EYZY7VBJH/action/citation_signature","submit_replication":"https://pith.science/pith/C6K7ZAWF467IR3BW3EYZY7VBJH/action/replication_record"}},"created_at":"2026-05-18T00:16:58.857995+00:00","updated_at":"2026-05-18T00:16:58.857995+00:00"}