{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LUID43HLDRGGI2H4MAEZPES3TE","short_pith_number":"pith:LUID43HL","schema_version":"1.0","canonical_sha256":"5d103e6ceb1c4c6468fc600997925b991f7853251ea369075c39da65784226ba","source":{"kind":"arxiv","id":"1010.4422","version":3},"attestation_state":"computed","paper":{"title":"Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alberto Griggio (FBK-Irst, Italy), Roberto Sebastiani (DISI, Thi Thieu Hoa Le (DISI, Trento, University of Trento","submitted_at":"2010-10-21T10:54:34Z","abstract_excerpt":"The problem of computing Craig interpolants in SAT and SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for interpolant generation have been presented for some theories of interest ---including that of equality and uninterpreted functions, linear arithmetic over the rationals, and their combination--- and they are successfully used within model checking tools. For the theory of linear arithmetic over the integers (LA(Z)), however, the problem of finding an interpolant is more challenging, and the task of developing efficient "},"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":"1010.4422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-10-21T10:54:34Z","cross_cats_sorted":[],"title_canon_sha256":"6ffb8d3c1f80a5edd1f3712e82f7bf6927efbded69a6ecc843b5fef2a6ef7fca","abstract_canon_sha256":"127fdebefef373ca3bd63e56f4e39c7b5384ee014cffa4af25d14c5a507c9aec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.817694Z","signature_b64":"G2vrHYMYwXGDEh/H+hODFyrgb3Z0Dl/5lOxPzgMEmUEFTmM9yx7TJrbH0T0Ux1lYBfTONEGMfd9h17CAj8YbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d103e6ceb1c4c6468fc600997925b991f7853251ea369075c39da65784226ba","last_reissued_at":"2026-05-18T01:37:39.817226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.817226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alberto Griggio (FBK-Irst, Italy), Roberto Sebastiani (DISI, Thi Thieu Hoa Le (DISI, Trento, University of Trento","submitted_at":"2010-10-21T10:54:34Z","abstract_excerpt":"The problem of computing Craig interpolants in SAT and SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for interpolant generation have been presented for some theories of interest ---including that of equality and uninterpreted functions, linear arithmetic over the rationals, and their combination--- and they are successfully used within model checking tools. For the theory of linear arithmetic over the integers (LA(Z)), however, the problem of finding an interpolant is more challenging, and the task of developing efficient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4422","kind":"arxiv","version":3},"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":"1010.4422","created_at":"2026-05-18T01:37:39.817299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.4422v3","created_at":"2026-05-18T01:37:39.817299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4422","created_at":"2026-05-18T01:37:39.817299+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUID43HLDRGG","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUID43HLDRGGI2H4","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUID43HL","created_at":"2026-05-18T12:26:10.704358+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/LUID43HLDRGGI2H4MAEZPES3TE","json":"https://pith.science/pith/LUID43HLDRGGI2H4MAEZPES3TE.json","graph_json":"https://pith.science/api/pith-number/LUID43HLDRGGI2H4MAEZPES3TE/graph.json","events_json":"https://pith.science/api/pith-number/LUID43HLDRGGI2H4MAEZPES3TE/events.json","paper":"https://pith.science/paper/LUID43HL"},"agent_actions":{"view_html":"https://pith.science/pith/LUID43HLDRGGI2H4MAEZPES3TE","download_json":"https://pith.science/pith/LUID43HLDRGGI2H4MAEZPES3TE.json","view_paper":"https://pith.science/paper/LUID43HL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.4422&json=true","fetch_graph":"https://pith.science/api/pith-number/LUID43HLDRGGI2H4MAEZPES3TE/graph.json","fetch_events":"https://pith.science/api/pith-number/LUID43HLDRGGI2H4MAEZPES3TE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUID43HLDRGGI2H4MAEZPES3TE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUID43HLDRGGI2H4MAEZPES3TE/action/storage_attestation","attest_author":"https://pith.science/pith/LUID43HLDRGGI2H4MAEZPES3TE/action/author_attestation","sign_citation":"https://pith.science/pith/LUID43HLDRGGI2H4MAEZPES3TE/action/citation_signature","submit_replication":"https://pith.science/pith/LUID43HLDRGGI2H4MAEZPES3TE/action/replication_record"}},"created_at":"2026-05-18T01:37:39.817299+00:00","updated_at":"2026-05-18T01:37:39.817299+00:00"}