{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:7P6RJCO2MXMLWJZZQJILINZAKC","short_pith_number":"pith:7P6RJCO2","schema_version":"1.0","canonical_sha256":"fbfd1489da65d8bb27398250b4372050bf929a0cc6b9d46e5e89b088d97cceeb","source":{"kind":"arxiv","id":"0806.1160","version":4},"attestation_state":"computed","paper":{"title":"Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Assal\\'e Adj\\'e, Eric Goubault, St\\'ephane Gaubert","submitted_at":"2008-06-06T18:58:59Z","abstract_excerpt":"The problem of computing the smallest fixed point of an order-preserving map arises in the study of zero-sum positive stochastic games. It also arises in static analysis of programs by abstract interpretation. In this context, the discount rate may be negative. We characterize the minimality of a fixed point in terms of the nonlinear spectral radius of a certain semidifferential. We apply this characterization to design a policy iteration algorithm, which applies to the case of finite state and action spaces. The algorithm returns a locally minimal fixed point, which turns out to be globally m"},"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":"0806.1160","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-06-06T18:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"420a9709236739d8670d978515ae08553ff64cf3d97a4b57725a061ba455bf57","abstract_canon_sha256":"02a6c944dc967c2bbe2de6b37bb9c2b00191f63fe7191406bd4467527f5abcef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:27.621539Z","signature_b64":"VUpbqNWnJPwBPeoRzTBq95jJ61MA9OLukP2d4h/ysfcZUVxVmgvB4M5QCX1911awFfR+nc7uhdbM67XRLpboBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbfd1489da65d8bb27398250b4372050bf929a0cc6b9d46e5e89b088d97cceeb","last_reissued_at":"2026-05-18T03:00:27.620803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:27.620803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Assal\\'e Adj\\'e, Eric Goubault, St\\'ephane Gaubert","submitted_at":"2008-06-06T18:58:59Z","abstract_excerpt":"The problem of computing the smallest fixed point of an order-preserving map arises in the study of zero-sum positive stochastic games. It also arises in static analysis of programs by abstract interpretation. In this context, the discount rate may be negative. We characterize the minimality of a fixed point in terms of the nonlinear spectral radius of a certain semidifferential. We apply this characterization to design a policy iteration algorithm, which applies to the case of finite state and action spaces. The algorithm returns a locally minimal fixed point, which turns out to be globally m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.1160","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0806.1160","created_at":"2026-05-18T03:00:27.620923+00:00"},{"alias_kind":"arxiv_version","alias_value":"0806.1160v4","created_at":"2026-05-18T03:00:27.620923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.1160","created_at":"2026-05-18T03:00:27.620923+00:00"},{"alias_kind":"pith_short_12","alias_value":"7P6RJCO2MXML","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"7P6RJCO2MXMLWJZZ","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"7P6RJCO2","created_at":"2026-05-18T12:25:56.245647+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/7P6RJCO2MXMLWJZZQJILINZAKC","json":"https://pith.science/pith/7P6RJCO2MXMLWJZZQJILINZAKC.json","graph_json":"https://pith.science/api/pith-number/7P6RJCO2MXMLWJZZQJILINZAKC/graph.json","events_json":"https://pith.science/api/pith-number/7P6RJCO2MXMLWJZZQJILINZAKC/events.json","paper":"https://pith.science/paper/7P6RJCO2"},"agent_actions":{"view_html":"https://pith.science/pith/7P6RJCO2MXMLWJZZQJILINZAKC","download_json":"https://pith.science/pith/7P6RJCO2MXMLWJZZQJILINZAKC.json","view_paper":"https://pith.science/paper/7P6RJCO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0806.1160&json=true","fetch_graph":"https://pith.science/api/pith-number/7P6RJCO2MXMLWJZZQJILINZAKC/graph.json","fetch_events":"https://pith.science/api/pith-number/7P6RJCO2MXMLWJZZQJILINZAKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7P6RJCO2MXMLWJZZQJILINZAKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7P6RJCO2MXMLWJZZQJILINZAKC/action/storage_attestation","attest_author":"https://pith.science/pith/7P6RJCO2MXMLWJZZQJILINZAKC/action/author_attestation","sign_citation":"https://pith.science/pith/7P6RJCO2MXMLWJZZQJILINZAKC/action/citation_signature","submit_replication":"https://pith.science/pith/7P6RJCO2MXMLWJZZQJILINZAKC/action/replication_record"}},"created_at":"2026-05-18T03:00:27.620923+00:00","updated_at":"2026-05-18T03:00:27.620923+00:00"}