{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WOFEWX5MUP3NOFTQ247BQC7S7Q","short_pith_number":"pith:WOFEWX5M","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"},"canonical_sha256":"b38a4b5faca3f6d71670d73e180bf2fc28aba706c175fba37fd630b439260812","source":{"kind":"arxiv","id":"1201.5086","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WOFEWX5MUP3NOFTQ247BQC7S7Q","target":"record","payload":{"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"},"canonical_sha256":"b38a4b5faca3f6d71670d73e180bf2fc28aba706c175fba37fd630b439260812","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"},"source_kind":"arxiv","source_id":"1201.5086","source_version":2,"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-18T03:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZPrJjrMTVg0VrG3i7wwRtkG9OESiRkP6oVbELk7Xf9XqnYd0FBNEYIKFKAxX5srBsH4ie/wEHjCurqzQO+9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:35:42.915309Z"},"content_sha256":"56a92aa4a1f7a12a6b3cb18ce56f0b8b971eb9b3b7f99cdb06787fe49129066f","schema_version":"1.0","event_id":"sha256:56a92aa4a1f7a12a6b3cb18ce56f0b8b971eb9b3b7f99cdb06787fe49129066f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WOFEWX5MUP3NOFTQ247BQC7S7Q","target":"graph","payload":{"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"},"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-18T03:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JzLDDwq+TNQRXEhiYQ2S/4ruqq3bmHLPvxp4UxT/tnrmWm+k3nDrw5QDkIgEbpSlzQDw/JPFtKW/MlqQS42yBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:35:42.915939Z"},"content_sha256":"4487cbbe911a5bf0ace4adb883894e67ed0a7c57e9a1fa738d293a38d4185689","schema_version":"1.0","event_id":"sha256:4487cbbe911a5bf0ace4adb883894e67ed0a7c57e9a1fa738d293a38d4185689"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q/bundle.json","state_url":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q/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-05-27T21:35:42Z","links":{"resolver":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q","bundle":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q/bundle.json","state":"https://pith.science/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOFEWX5MUP3NOFTQ247BQC7S7Q/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UekcQ8Cl9Ny0wYoIhAInO1GzNtVOgGL3cS+FTxLcxe9t+mLkwJhL8W6rgGeGDs1jpLv8uLrjR6P47X0Bfq3cDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:35:42.919778Z","bundle_sha256":"3247ff0d47e68d50669f2b2396f17fecf88f550293af89be61193c09e3a9ac97"}}