{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JG4RSY6734FF4PCWUZTP2RB2CG","short_pith_number":"pith:JG4RSY67","schema_version":"1.0","canonical_sha256":"49b91963dfdf0a5e3c56a666fd443a11913dd983183659b00de10075560a7063","source":{"kind":"arxiv","id":"2401.16198","version":1},"attestation_state":"computed","paper":{"title":"Contracting with a Learning Agent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","econ.TH"],"primary_cat":"cs.GT","authors_text":"Emmanouil-Vasileios Vlatakis-Gkaragkounis, Guru Guruganesh, Inbal Talgam-Cohen, Jon Schneider, Joshua R. Wang, S. Matthew Weinberg, Yoav Kolumbus","submitted_at":"2024-01-29T14:53:22Z","abstract_excerpt":"Many real-life contractual relations differ completely from the clean, static model at the heart of principal-agent theory. Typically, they involve repeated strategic interactions of the principal and agent, taking place under uncertainty and over time. While appealing in theory, players seldom use complex dynamic strategies in practice, often preferring to circumvent complexity and approach uncertainty through learning. We initiate the study of repeated contracts with a learning agent, focusing on agents who achieve no-regret outcomes.\n  Optimizing against a no-regret agent is a known open pr"},"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":"2401.16198","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-01-29T14:53:22Z","cross_cats_sorted":["cs.AI","cs.LG","econ.TH"],"title_canon_sha256":"b3f1cbef8b5f7ca708054a72c8f607dbc7402da9b75ec5cb0e715b00546a6778","abstract_canon_sha256":"eef5d8955a231b529ad02d475ac1ad1986c742272431e629d8cc0a58e8a9ebe5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:45.577979Z","signature_b64":"ArNbUwveNFZpEko84vr/D/x0F6iDoWzu+oRXaefxiqaRU39oCddmpJ2CR1bNjJiqito9QRktKAUb0YXj0qiMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49b91963dfdf0a5e3c56a666fd443a11913dd983183659b00de10075560a7063","last_reissued_at":"2026-07-05T07:38:45.577498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:45.577498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contracting with a Learning Agent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","econ.TH"],"primary_cat":"cs.GT","authors_text":"Emmanouil-Vasileios Vlatakis-Gkaragkounis, Guru Guruganesh, Inbal Talgam-Cohen, Jon Schneider, Joshua R. Wang, S. Matthew Weinberg, Yoav Kolumbus","submitted_at":"2024-01-29T14:53:22Z","abstract_excerpt":"Many real-life contractual relations differ completely from the clean, static model at the heart of principal-agent theory. Typically, they involve repeated strategic interactions of the principal and agent, taking place under uncertainty and over time. While appealing in theory, players seldom use complex dynamic strategies in practice, often preferring to circumvent complexity and approach uncertainty through learning. We initiate the study of repeated contracts with a learning agent, focusing on agents who achieve no-regret outcomes.\n  Optimizing against a no-regret agent is a known open pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.16198","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.16198/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.16198","created_at":"2026-07-05T07:38:45.577561+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.16198v1","created_at":"2026-07-05T07:38:45.577561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.16198","created_at":"2026-07-05T07:38:45.577561+00:00"},{"alias_kind":"pith_short_12","alias_value":"JG4RSY6734FF","created_at":"2026-07-05T07:38:45.577561+00:00"},{"alias_kind":"pith_short_16","alias_value":"JG4RSY6734FF4PCW","created_at":"2026-07-05T07:38:45.577561+00:00"},{"alias_kind":"pith_short_8","alias_value":"JG4RSY67","created_at":"2026-07-05T07:38:45.577561+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2405.20642","citing_title":"Learning Under Moral Hazard with Instrumental Regression and Generalized Method of Moments","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JG4RSY6734FF4PCWUZTP2RB2CG","json":"https://pith.science/pith/JG4RSY6734FF4PCWUZTP2RB2CG.json","graph_json":"https://pith.science/api/pith-number/JG4RSY6734FF4PCWUZTP2RB2CG/graph.json","events_json":"https://pith.science/api/pith-number/JG4RSY6734FF4PCWUZTP2RB2CG/events.json","paper":"https://pith.science/paper/JG4RSY67"},"agent_actions":{"view_html":"https://pith.science/pith/JG4RSY6734FF4PCWUZTP2RB2CG","download_json":"https://pith.science/pith/JG4RSY6734FF4PCWUZTP2RB2CG.json","view_paper":"https://pith.science/paper/JG4RSY67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.16198&json=true","fetch_graph":"https://pith.science/api/pith-number/JG4RSY6734FF4PCWUZTP2RB2CG/graph.json","fetch_events":"https://pith.science/api/pith-number/JG4RSY6734FF4PCWUZTP2RB2CG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JG4RSY6734FF4PCWUZTP2RB2CG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JG4RSY6734FF4PCWUZTP2RB2CG/action/storage_attestation","attest_author":"https://pith.science/pith/JG4RSY6734FF4PCWUZTP2RB2CG/action/author_attestation","sign_citation":"https://pith.science/pith/JG4RSY6734FF4PCWUZTP2RB2CG/action/citation_signature","submit_replication":"https://pith.science/pith/JG4RSY6734FF4PCWUZTP2RB2CG/action/replication_record"}},"created_at":"2026-07-05T07:38:45.577561+00:00","updated_at":"2026-07-05T07:38:45.577561+00:00"}