{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SLFNFC42OMO6GF5EFTYJFOY7M2","short_pith_number":"pith:SLFNFC42","canonical_record":{"source":{"id":"1503.08090","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-27T14:26:54Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3a5d817731120204b0426cb08b8c52800b9cf11d36a75d25739a8fe6691e305a","abstract_canon_sha256":"d2b017b4274bc2cb716882df26a5f68a4559a86e691286b8e651648b2f93d87e"},"schema_version":"1.0"},"canonical_sha256":"92cad28b9a731de317a42cf092bb1f66ac8a985e58a337a30d58b56ea682c08a","source":{"kind":"arxiv","id":"1503.08090","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08090","created_at":"2026-05-18T00:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08090v4","created_at":"2026-05-18T00:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08090","created_at":"2026-05-18T00:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"SLFNFC42OMO6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SLFNFC42OMO6GF5E","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SLFNFC42","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SLFNFC42OMO6GF5EFTYJFOY7M2","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08090","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-27T14:26:54Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3a5d817731120204b0426cb08b8c52800b9cf11d36a75d25739a8fe6691e305a","abstract_canon_sha256":"d2b017b4274bc2cb716882df26a5f68a4559a86e691286b8e651648b2f93d87e"},"schema_version":"1.0"},"canonical_sha256":"92cad28b9a731de317a42cf092bb1f66ac8a985e58a337a30d58b56ea682c08a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:52.321035Z","signature_b64":"YUspTi6g4e+kYXWuoEnn1qfoTLbsA0fTqnzSvUlxL7x9bcydF//tk+k9TCvb7JNItHDfNs/I6FJjz1SD1k1ZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92cad28b9a731de317a42cf092bb1f66ac8a985e58a337a30d58b56ea682c08a","last_reissued_at":"2026-05-18T00:55:52.320432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:52.320432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08090","source_version":4,"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:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otUoQU3itN250ODy2ZJygaIhDmM8g23KK8sMs/2pQNSxR/Gue/9z4mTeHiuuujCfQ7mb3vtFUhq37Un2jPXqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:27:57.759693Z"},"content_sha256":"0866be101ac2701c7dc3500ffa6438953c2012c21ac955e5489d654494b5530a","schema_version":"1.0","event_id":"sha256:0866be101ac2701c7dc3500ffa6438953c2012c21ac955e5489d654494b5530a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SLFNFC42OMO6GF5EFTYJFOY7M2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sums-of-Squares Extension of Policy Iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LO","authors_text":"Assal\\'e Adj\\'e, Pierre-Lo\\\"ic Garoche, Victor Magron","submitted_at":"2015-03-27T14:26:54Z","abstract_excerpt":"In order to address the imprecision often introduced by widening operators in static analysis, policy iteration based on min-computations amounts to considering the characterization of reachable value set of a program as an iterative computation of policies, starting from a post-fixpoint. Computing each policy and the associated invariant relies on a sequence of numerical optimizations. While the early research efforts relied on linear programming (LP) to address linear properties of linear programs, the current state of the art is still limited to the analysis of linear programs with at most "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08090","kind":"arxiv","version":4},"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:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHX99vAvn9l2fsO06W3lecHBkJufxtaXAxUpT6GXTxGXHz0T9MyYtZeQ9/S8fuuCBXa+qWxIZx9ZV1AT3qbSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:27:57.760531Z"},"content_sha256":"b214e04287f7ff9a088ca63eb60634ad3af41fdd3b7e3fedad3e44d520944648","schema_version":"1.0","event_id":"sha256:b214e04287f7ff9a088ca63eb60634ad3af41fdd3b7e3fedad3e44d520944648"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLFNFC42OMO6GF5EFTYJFOY7M2/bundle.json","state_url":"https://pith.science/pith/SLFNFC42OMO6GF5EFTYJFOY7M2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLFNFC42OMO6GF5EFTYJFOY7M2/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-19T08:27:57Z","links":{"resolver":"https://pith.science/pith/SLFNFC42OMO6GF5EFTYJFOY7M2","bundle":"https://pith.science/pith/SLFNFC42OMO6GF5EFTYJFOY7M2/bundle.json","state":"https://pith.science/pith/SLFNFC42OMO6GF5EFTYJFOY7M2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLFNFC42OMO6GF5EFTYJFOY7M2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SLFNFC42OMO6GF5EFTYJFOY7M2","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":"d2b017b4274bc2cb716882df26a5f68a4559a86e691286b8e651648b2f93d87e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-27T14:26:54Z","title_canon_sha256":"3a5d817731120204b0426cb08b8c52800b9cf11d36a75d25739a8fe6691e305a"},"schema_version":"1.0","source":{"id":"1503.08090","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08090","created_at":"2026-05-18T00:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08090v4","created_at":"2026-05-18T00:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08090","created_at":"2026-05-18T00:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"SLFNFC42OMO6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SLFNFC42OMO6GF5E","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SLFNFC42","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:b214e04287f7ff9a088ca63eb60634ad3af41fdd3b7e3fedad3e44d520944648","target":"graph","created_at":"2026-05-18T00:55:52Z","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":"In order to address the imprecision often introduced by widening operators in static analysis, policy iteration based on min-computations amounts to considering the characterization of reachable value set of a program as an iterative computation of policies, starting from a post-fixpoint. Computing each policy and the associated invariant relies on a sequence of numerical optimizations. While the early research efforts relied on linear programming (LP) to address linear properties of linear programs, the current state of the art is still limited to the analysis of linear programs with at most ","authors_text":"Assal\\'e Adj\\'e, Pierre-Lo\\\"ic Garoche, Victor Magron","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-27T14:26:54Z","title":"A Sums-of-Squares Extension of Policy Iterations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08090","kind":"arxiv","version":4},"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:0866be101ac2701c7dc3500ffa6438953c2012c21ac955e5489d654494b5530a","target":"record","created_at":"2026-05-18T00:55:52Z","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":"d2b017b4274bc2cb716882df26a5f68a4559a86e691286b8e651648b2f93d87e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-27T14:26:54Z","title_canon_sha256":"3a5d817731120204b0426cb08b8c52800b9cf11d36a75d25739a8fe6691e305a"},"schema_version":"1.0","source":{"id":"1503.08090","kind":"arxiv","version":4}},"canonical_sha256":"92cad28b9a731de317a42cf092bb1f66ac8a985e58a337a30d58b56ea682c08a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92cad28b9a731de317a42cf092bb1f66ac8a985e58a337a30d58b56ea682c08a","first_computed_at":"2026-05-18T00:55:52.320432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:52.320432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YUspTi6g4e+kYXWuoEnn1qfoTLbsA0fTqnzSvUlxL7x9bcydF//tk+k9TCvb7JNItHDfNs/I6FJjz1SD1k1ZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:52.321035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08090","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0866be101ac2701c7dc3500ffa6438953c2012c21ac955e5489d654494b5530a","sha256:b214e04287f7ff9a088ca63eb60634ad3af41fdd3b7e3fedad3e44d520944648"],"state_sha256":"c4db4370d08395c13d0419615e3aee0eca078028ceda310daa56c2ebe1a18c8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WINbVxGQtIvJ1cAGgv9tV6Zh1oZQsf19do58O1SyRYv5gVbmFJaBHxb4HoXh1sNlI3kACfjDIUzx0hNBjVBbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T08:27:57.764187Z","bundle_sha256":"4a90cd239cd5e52c398d0190de429f33a7140fe20807c34f19098206f1cd4180"}}