{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CGKUVD5LU53Z2BSQKTZUBQJBLW","short_pith_number":"pith:CGKUVD5L","schema_version":"1.0","canonical_sha256":"11954a8faba7779d065054f340c1215d98143e1d631f47ab495aff9c1ce615c6","source":{"kind":"arxiv","id":"1611.07726","version":1},"attestation_state":"computed","paper":{"title":"Polynomial invariants by linear algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Saddek Bensalem, Steven de Oliveira, Virgile Prevosto","submitted_at":"2016-11-23T10:25:54Z","abstract_excerpt":"We present in this paper a new technique for generating polynomial invariants, divided in two independent parts : a procedure that reduces polynomial assignments composed loops analysis to linear loops under certain hypotheses and a procedure for generating inductive invariants for linear loops. Both of these techniques have a polynomial complexity for a bounded number of variables and we guarantee the completeness of the technique for a bounded degree which we successfully implemented for C programs verification."},"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":"1611.07726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-23T10:25:54Z","cross_cats_sorted":[],"title_canon_sha256":"c9c448a7fb5aa956768e2e6a3a41203f3ed6d0cffa11ec7a5babd00bc66d61b3","abstract_canon_sha256":"e52467009742a0bc2842eb090470d03d1c4dd93177b463c546a50fc9139e1001"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:59.989772Z","signature_b64":"GkVksBm0Z0k6IfIWscWn/faUQp9R7Ddtk3f+5spzx30006M9u1oc91jpW1KB+npltC7kMcQw4K9pVhZ9pI8dDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11954a8faba7779d065054f340c1215d98143e1d631f47ab495aff9c1ce615c6","last_reissued_at":"2026-05-18T00:56:59.989192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:59.989192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial invariants by linear algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Saddek Bensalem, Steven de Oliveira, Virgile Prevosto","submitted_at":"2016-11-23T10:25:54Z","abstract_excerpt":"We present in this paper a new technique for generating polynomial invariants, divided in two independent parts : a procedure that reduces polynomial assignments composed loops analysis to linear loops under certain hypotheses and a procedure for generating inductive invariants for linear loops. Both of these techniques have a polynomial complexity for a bounded number of variables and we guarantee the completeness of the technique for a bounded degree which we successfully implemented for C programs verification."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07726","kind":"arxiv","version":1},"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":"1611.07726","created_at":"2026-05-18T00:56:59.989285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07726v1","created_at":"2026-05-18T00:56:59.989285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07726","created_at":"2026-05-18T00:56:59.989285+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGKUVD5LU53Z","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGKUVD5LU53Z2BSQ","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGKUVD5L","created_at":"2026-05-18T12:30:09.641336+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/CGKUVD5LU53Z2BSQKTZUBQJBLW","json":"https://pith.science/pith/CGKUVD5LU53Z2BSQKTZUBQJBLW.json","graph_json":"https://pith.science/api/pith-number/CGKUVD5LU53Z2BSQKTZUBQJBLW/graph.json","events_json":"https://pith.science/api/pith-number/CGKUVD5LU53Z2BSQKTZUBQJBLW/events.json","paper":"https://pith.science/paper/CGKUVD5L"},"agent_actions":{"view_html":"https://pith.science/pith/CGKUVD5LU53Z2BSQKTZUBQJBLW","download_json":"https://pith.science/pith/CGKUVD5LU53Z2BSQKTZUBQJBLW.json","view_paper":"https://pith.science/paper/CGKUVD5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07726&json=true","fetch_graph":"https://pith.science/api/pith-number/CGKUVD5LU53Z2BSQKTZUBQJBLW/graph.json","fetch_events":"https://pith.science/api/pith-number/CGKUVD5LU53Z2BSQKTZUBQJBLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGKUVD5LU53Z2BSQKTZUBQJBLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGKUVD5LU53Z2BSQKTZUBQJBLW/action/storage_attestation","attest_author":"https://pith.science/pith/CGKUVD5LU53Z2BSQKTZUBQJBLW/action/author_attestation","sign_citation":"https://pith.science/pith/CGKUVD5LU53Z2BSQKTZUBQJBLW/action/citation_signature","submit_replication":"https://pith.science/pith/CGKUVD5LU53Z2BSQKTZUBQJBLW/action/replication_record"}},"created_at":"2026-05-18T00:56:59.989285+00:00","updated_at":"2026-05-18T00:56:59.989285+00:00"}