{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LQABXTYAPOD36OBDL3U4M7ERLZ","short_pith_number":"pith:LQABXTYA","canonical_record":{"source":{"id":"1707.02690","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2017-07-10T04:02:27Z","cross_cats_sorted":[],"title_canon_sha256":"1c32332d388f7ae0e17bb4496e3c60009c1b1a57853a6e5bdb19402db31d3553","abstract_canon_sha256":"edec1be2e3f886be72929dbb29804d2baf0059cbcdc655d0a5e006d19123cbfb"},"schema_version":"1.0"},"canonical_sha256":"5c001bcf007b87bf38235ee9c67c915e6ab4c2308ad70a24b7b8f690bbb15444","source":{"kind":"arxiv","id":"1707.02690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02690","created_at":"2026-05-18T00:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02690v1","created_at":"2026-05-18T00:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02690","created_at":"2026-05-18T00:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"LQABXTYAPOD3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LQABXTYAPOD36OBD","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LQABXTYA","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LQABXTYAPOD36OBDL3U4M7ERLZ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02690","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2017-07-10T04:02:27Z","cross_cats_sorted":[],"title_canon_sha256":"1c32332d388f7ae0e17bb4496e3c60009c1b1a57853a6e5bdb19402db31d3553","abstract_canon_sha256":"edec1be2e3f886be72929dbb29804d2baf0059cbcdc655d0a5e006d19123cbfb"},"schema_version":"1.0"},"canonical_sha256":"5c001bcf007b87bf38235ee9c67c915e6ab4c2308ad70a24b7b8f690bbb15444","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:36.142965Z","signature_b64":"AcR3q3OmrZCfQLAOoiOIMHx3QK1huR9I0BiKVScBiKwrjL+8ibb/ggqZ7lYQKJarE9TJue/Wwybs73uC/VWSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c001bcf007b87bf38235ee9c67c915e6ab4c2308ad70a24b7b8f690bbb15444","last_reissued_at":"2026-05-18T00:40:36.142201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:36.142201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02690","source_version":1,"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-18T00:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eKUjY/r29aDbIPe1XZl8RCGb/ANxogIMi7Kg/ltBIzkZx1+Xmr2jPyZjdstcz0b8WELGPOrtH09f7CUazqPnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:38:11.812181Z"},"content_sha256":"c6a9957b954f718804d5b25a42d632e2c9baf3050fa5e442c2750cc49121e001","schema_version":"1.0","event_id":"sha256:c6a9957b954f718804d5b25a42d632e2c9baf3050fa5e442c2750cc49121e001"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LQABXTYAPOD36OBDL3U4M7ERLZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding polynomial loop invariants for probabilistic programs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bican Xia, David N. Jansen, Lijun Zhang, Naijun Zhan, Yijun Feng","submitted_at":"2017-07-10T04:02:27Z","abstract_excerpt":"Quantitative loop invariants are an essential element in the verification of probabilistic programs. Recently, multivariate Lagrange interpolation has been applied to synthesizing polynomial invariants. In this paper, we propose an alternative approach. First, we fix a polynomial template as a candidate of a loop invariant. Using Stengle's Positivstellensatz and a transformation to a sum-of-squares problem, we find sufficient conditions on the coefficients. Then, we solve a semidefinite programming feasibility problem to synthesize the loop invariants. If the semidefinite program is unfeasible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02690","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"},"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-18T00:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ll4HnfOHShLQ2SkZUbHklnmz0B4hi6+5ulJPpFRSeOIKzy1vyAksWcbCJo4uvWpXg5Vyrr4HErOkyPHC9bATAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:38:11.812903Z"},"content_sha256":"712b70b9e7db51adfd46b711bd590150bc1f93f8b21f9eb34ad0c73c4a82198d","schema_version":"1.0","event_id":"sha256:712b70b9e7db51adfd46b711bd590150bc1f93f8b21f9eb34ad0c73c4a82198d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQABXTYAPOD36OBDL3U4M7ERLZ/bundle.json","state_url":"https://pith.science/pith/LQABXTYAPOD36OBDL3U4M7ERLZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQABXTYAPOD36OBDL3U4M7ERLZ/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-26T09:38:11Z","links":{"resolver":"https://pith.science/pith/LQABXTYAPOD36OBDL3U4M7ERLZ","bundle":"https://pith.science/pith/LQABXTYAPOD36OBDL3U4M7ERLZ/bundle.json","state":"https://pith.science/pith/LQABXTYAPOD36OBDL3U4M7ERLZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQABXTYAPOD36OBDL3U4M7ERLZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LQABXTYAPOD36OBDL3U4M7ERLZ","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":"edec1be2e3f886be72929dbb29804d2baf0059cbcdc655d0a5e006d19123cbfb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2017-07-10T04:02:27Z","title_canon_sha256":"1c32332d388f7ae0e17bb4496e3c60009c1b1a57853a6e5bdb19402db31d3553"},"schema_version":"1.0","source":{"id":"1707.02690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02690","created_at":"2026-05-18T00:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02690v1","created_at":"2026-05-18T00:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02690","created_at":"2026-05-18T00:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"LQABXTYAPOD3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LQABXTYAPOD36OBD","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LQABXTYA","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:712b70b9e7db51adfd46b711bd590150bc1f93f8b21f9eb34ad0c73c4a82198d","target":"graph","created_at":"2026-05-18T00:40:36Z","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":"Quantitative loop invariants are an essential element in the verification of probabilistic programs. Recently, multivariate Lagrange interpolation has been applied to synthesizing polynomial invariants. In this paper, we propose an alternative approach. First, we fix a polynomial template as a candidate of a loop invariant. Using Stengle's Positivstellensatz and a transformation to a sum-of-squares problem, we find sufficient conditions on the coefficients. Then, we solve a semidefinite programming feasibility problem to synthesize the loop invariants. If the semidefinite program is unfeasible","authors_text":"Bican Xia, David N. Jansen, Lijun Zhang, Naijun Zhan, Yijun Feng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2017-07-10T04:02:27Z","title":"Finding polynomial loop invariants for probabilistic programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02690","kind":"arxiv","version":1},"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:c6a9957b954f718804d5b25a42d632e2c9baf3050fa5e442c2750cc49121e001","target":"record","created_at":"2026-05-18T00:40:36Z","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":"edec1be2e3f886be72929dbb29804d2baf0059cbcdc655d0a5e006d19123cbfb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2017-07-10T04:02:27Z","title_canon_sha256":"1c32332d388f7ae0e17bb4496e3c60009c1b1a57853a6e5bdb19402db31d3553"},"schema_version":"1.0","source":{"id":"1707.02690","kind":"arxiv","version":1}},"canonical_sha256":"5c001bcf007b87bf38235ee9c67c915e6ab4c2308ad70a24b7b8f690bbb15444","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c001bcf007b87bf38235ee9c67c915e6ab4c2308ad70a24b7b8f690bbb15444","first_computed_at":"2026-05-18T00:40:36.142201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:36.142201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AcR3q3OmrZCfQLAOoiOIMHx3QK1huR9I0BiKVScBiKwrjL+8ibb/ggqZ7lYQKJarE9TJue/Wwybs73uC/VWSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:36.142965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6a9957b954f718804d5b25a42d632e2c9baf3050fa5e442c2750cc49121e001","sha256:712b70b9e7db51adfd46b711bd590150bc1f93f8b21f9eb34ad0c73c4a82198d"],"state_sha256":"e224e201480871b22a60c5ca333c27432f1c29ff2bcf4f2bec40cbb78a63447e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+yaJwyzNZGgRJz/H+P4XrgFzCzZACKbTiiB/LDZADEukfoULCCIC0bN1xEx909Fpf3oiOsf0BJk6G5R0Cr4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:38:11.819512Z","bundle_sha256":"d4c7771f9314072d3bbd51f1250d8c50ecaab9ec8e2d9daf0d736ebae027390c"}}