{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WOFEWX5MUP3NOFTQ247BQC7S7Q","short_pith_number":"pith:WOFEWX5M","schema_version":"1.0","canonical_sha256":"b38a4b5faca3f6d71670d73e180bf2fc28aba706c175fba37fd630b439260812","source":{"kind":"arxiv","id":"1201.5086","version":2},"attestation_state":"computed","paper":{"title":"Generating Program Invariants via Interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SC","math.CO"],"primary_cat":"cs.SE","authors_text":"Marc Moreno Maza, Rong Xiao","submitted_at":"2012-01-24T18:43:37Z","abstract_excerpt":"This article focuses on automatically generating polynomial equations that are inductive loop invariants of computer programs. We propose a new algorithm for this task, which is based on polynomial interpolation. Though the proposed algorithm is not complete, it is efficient and can be applied to a broader range of problems compared to existing methods targeting similar problems. The efficiency of our approach is testified by experiments on a large collection of programs. The current implementation of our method is based on dense interpolation, for which a total degree bound is needed. On the "},"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":"1201.5086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2012-01-24T18:43:37Z","cross_cats_sorted":["cs.DM","cs.SC","math.CO"],"title_canon_sha256":"5c93ae0a60b0272444c9087443877470b9575e3fb01202b8be7f3c4513cd12df","abstract_canon_sha256":"8d6e31c8800ebec537e639880cf869085a7b1eff834d76ae18dfe81c328f010d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:14.008372Z","signature_b64":"ZJgv8uKnGKx5ekLuhPVOLLrqeXvK2N0/pHwOU1281h3pgh0vYsZvIPDEF7nt0K9hBHLJXyPXie2wUno8O5pHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b38a4b5faca3f6d71670d73e180bf2fc28aba706c175fba37fd630b439260812","last_reissued_at":"2026-05-18T03:57:14.007899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:14.007899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Program Invariants via Interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SC","math.CO"],"primary_cat":"cs.SE","authors_text":"Marc Moreno Maza, Rong Xiao","submitted_at":"2012-01-24T18:43:37Z","abstract_excerpt":"This article focuses on automatically generating polynomial equations that are inductive loop invariants of computer programs. We propose a new algorithm for this task, which is based on polynomial interpolation. Though the proposed algorithm is not complete, it is efficient and can be applied to a broader range of problems compared to existing methods targeting similar problems. The efficiency of our approach is testified by experiments on a large collection of programs. The current implementation of our method is based on dense interpolation, for which a total degree bound is needed. On the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5086","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":"1201.5086","created_at":"2026-05-18T03:57:14.007969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5086v2","created_at":"2026-05-18T03:57:14.007969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5086","created_at":"2026-05-18T03:57:14.007969+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOFEWX5MUP3N","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOFEWX5MUP3NOFTQ","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOFEWX5M","created_at":"2026-05-18T12:27:25.539911+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/WOFEWX5MUP3NOFTQ247BQC7S7Q","json":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q.json","graph_json":"https://pith.science/api/pith-number/WOFEWX5MUP3NOFTQ247BQC7S7Q/graph.json","events_json":"https://pith.science/api/pith-number/WOFEWX5MUP3NOFTQ247BQC7S7Q/events.json","paper":"https://pith.science/paper/WOFEWX5M"},"agent_actions":{"view_html":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q","download_json":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q.json","view_paper":"https://pith.science/paper/WOFEWX5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5086&json=true","fetch_graph":"https://pith.science/api/pith-number/WOFEWX5MUP3NOFTQ247BQC7S7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/WOFEWX5MUP3NOFTQ247BQC7S7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q/action/storage_attestation","attest_author":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q/action/author_attestation","sign_citation":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q/action/citation_signature","submit_replication":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q/action/replication_record"}},"created_at":"2026-05-18T03:57:14.007969+00:00","updated_at":"2026-05-18T03:57:14.007969+00:00"}