{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WOFEWX5MUP3NOFTQ247BQC7S7Q","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":"8d6e31c8800ebec537e639880cf869085a7b1eff834d76ae18dfe81c328f010d","cross_cats_sorted":["cs.DM","cs.SC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2012-01-24T18:43:37Z","title_canon_sha256":"5c93ae0a60b0272444c9087443877470b9575e3fb01202b8be7f3c4513cd12df"},"schema_version":"1.0","source":{"id":"1201.5086","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5086","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5086v2","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5086","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"pith_short_12","alias_value":"WOFEWX5MUP3N","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WOFEWX5MUP3NOFTQ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WOFEWX5M","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:4487cbbe911a5bf0ace4adb883894e67ed0a7c57e9a1fa738d293a38d4185689","target":"graph","created_at":"2026-05-18T03:57:14Z","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":"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 ","authors_text":"Marc Moreno Maza, Rong Xiao","cross_cats":["cs.DM","cs.SC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2012-01-24T18:43:37Z","title":"Generating Program Invariants via Interpolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5086","kind":"arxiv","version":2},"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:56a92aa4a1f7a12a6b3cb18ce56f0b8b971eb9b3b7f99cdb06787fe49129066f","target":"record","created_at":"2026-05-18T03:57:14Z","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":"8d6e31c8800ebec537e639880cf869085a7b1eff834d76ae18dfe81c328f010d","cross_cats_sorted":["cs.DM","cs.SC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2012-01-24T18:43:37Z","title_canon_sha256":"5c93ae0a60b0272444c9087443877470b9575e3fb01202b8be7f3c4513cd12df"},"schema_version":"1.0","source":{"id":"1201.5086","kind":"arxiv","version":2}},"canonical_sha256":"b38a4b5faca3f6d71670d73e180bf2fc28aba706c175fba37fd630b439260812","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b38a4b5faca3f6d71670d73e180bf2fc28aba706c175fba37fd630b439260812","first_computed_at":"2026-05-18T03:57:14.007899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:14.007899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZJgv8uKnGKx5ekLuhPVOLLrqeXvK2N0/pHwOU1281h3pgh0vYsZvIPDEF7nt0K9hBHLJXyPXie2wUno8O5pHDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:14.008372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5086","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56a92aa4a1f7a12a6b3cb18ce56f0b8b971eb9b3b7f99cdb06787fe49129066f","sha256:4487cbbe911a5bf0ace4adb883894e67ed0a7c57e9a1fa738d293a38d4185689"],"state_sha256":"e6f43cef37e6a051c39313b429b36552f22ee57993b9ba0b9d21f497e5598cc9"}