{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:N3ZCCGVG6QOTD4BCZ6SCEK3EE5","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":"9760a8343711438a3275f23e50ed48a0fdb2329f85e42f5b40e82f998e91c416","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.TH","submitted_at":"2026-05-01T20:24:19Z","title_canon_sha256":"faae0bb63ec508b8fd99bd17f7beb7e1e636acf95073fb0acca141c4f952c54b"},"schema_version":"1.0","source":{"id":"2605.01080","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01080","created_at":"2026-05-20T00:03:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01080v2","created_at":"2026-05-20T00:03:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01080","created_at":"2026-05-20T00:03:13Z"},{"alias_kind":"pith_short_12","alias_value":"N3ZCCGVG6QOT","created_at":"2026-05-20T00:03:13Z"},{"alias_kind":"pith_short_16","alias_value":"N3ZCCGVG6QOTD4BC","created_at":"2026-05-20T00:03:13Z"},{"alias_kind":"pith_short_8","alias_value":"N3ZCCGVG","created_at":"2026-05-20T00:03:13Z"}],"graph_snapshots":[{"event_id":"sha256:6537da3f6140da0919729a7e710a831e72de33542c32b0d76c4676cc0ddb0056","target":"graph","created_at":"2026-05-20T00:03:13Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that the agent's optimization problem can be reformulated as a stochastic target problem. After characterizing the credible domain of this target problem, we show that the principal's objective can be solved as a stochastic optimal control problem with partial information and state constraints."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The principal is restricted to offering a unique contract (rather than a menu), and the agent's problem admits an exact reformulation as a stochastic target problem whose credible domain can be characterized."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Principal-agent adverse selection with unique contracts is reformulated as a stochastic target problem for the agent and a stochastic optimal control problem for the principal."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The agent's optimization in unique-contract adverse selection problems reformulates as a stochastic target problem, turning the principal's design into a stochastic control problem with partial information and state constraints."}],"snapshot_sha256":"7f6f7d5fa73d95fb9ebbaf3f200191c9271c7f12a2cf115b6f0b8c98ef6a0fd4"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T17:38:25.811262Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.01080/integrity.json","findings":[],"snapshot_sha256":"0ba5404a09770f18a9498b9b8e195564d0141ad8c0c21ec5456c04716442ca7c","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a principal-agent problem with adverse selection, where the principal does not know the agent's true cost but must design a contract to optimize a specific criterion. Unlike standard screening frameworks that allow for self-selection, we assume the principal can only offer a unique contract. We show that the agent's optimization problem can be reformulated as a stochastic target problem. After characterizing the credible domain of this target problem, we show that the principal's objective can be solved as a stochastic optimal control problem with partial information and state constra","authors_text":"Guillermo Alonso Alvarez, Ibrahim Ekren, Liwei Huang","cross_cats":["math.OC"],"headline":"The agent's optimization in unique-contract adverse selection problems reformulates as a stochastic target problem, turning the principal's design into a stochastic control problem with partial information and state constraints.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.TH","submitted_at":"2026-05-01T20:24:19Z","title":"Principal-agent problems with adverse selection: A stochastic target problem formulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.01080","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-09T14:20:05.361274Z","id":"5d1231ae-fd7d-4633-b6d7-5cf835a90bc7","model_set":{"reader":"grok-4.3"},"one_line_summary":"Principal-agent adverse selection with unique contracts is reformulated as a stochastic target problem for the agent and a stochastic optimal control problem for the principal.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The agent's optimization in unique-contract adverse selection problems reformulates as a stochastic target problem, turning the principal's design into a stochastic control problem with partial information and state constraints.","strongest_claim":"We show that the agent's optimization problem can be reformulated as a stochastic target problem. After characterizing the credible domain of this target problem, we show that the principal's objective can be solved as a stochastic optimal control problem with partial information and state constraints.","weakest_assumption":"The principal is restricted to offering a unique contract (rather than a menu), and the agent's problem admits an exact reformulation as a stochastic target problem whose credible domain can be characterized."}},"verdict_id":"5d1231ae-fd7d-4633-b6d7-5cf835a90bc7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fd247ede2677f7b3cadf385c18aeac448a435443fd537db221c0a797fa8fd7dc","target":"record","created_at":"2026-05-20T00:03:13Z","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":"9760a8343711438a3275f23e50ed48a0fdb2329f85e42f5b40e82f998e91c416","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.TH","submitted_at":"2026-05-01T20:24:19Z","title_canon_sha256":"faae0bb63ec508b8fd99bd17f7beb7e1e636acf95073fb0acca141c4f952c54b"},"schema_version":"1.0","source":{"id":"2605.01080","kind":"arxiv","version":2}},"canonical_sha256":"6ef2211aa6f41d31f022cfa4222b642764cd8a8c0c5f10e0c1a77bee7862a064","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ef2211aa6f41d31f022cfa4222b642764cd8a8c0c5f10e0c1a77bee7862a064","first_computed_at":"2026-05-20T00:03:13.343928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:13.343928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OcZ0H1k2YvNhyeVkirtlXnngA02CS6K70hdtU0lZxnI96o+XNHdYS0s3Vjct3ioo8tGo+bRx0OzrSgwawkiEDw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:13.345129Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.01080","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd247ede2677f7b3cadf385c18aeac448a435443fd537db221c0a797fa8fd7dc","sha256:6537da3f6140da0919729a7e710a831e72de33542c32b0d76c4676cc0ddb0056"],"state_sha256":"ef68416725db1b0685df2add1d320185a469483403acf1f944fe1a668354d962"}