{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UEEIMGITSMXKWEQISVHW4ODMVC","short_pith_number":"pith:UEEIMGIT","schema_version":"1.0","canonical_sha256":"a108861913932eab1208954f6e386ca8ae880639563a5e3acb7d4469e822e7a0","source":{"kind":"arxiv","id":"2501.14474","version":1},"attestation_state":"computed","paper":{"title":"The Pseudo-Dimension of Contracts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","econ.TH"],"primary_cat":"cs.GT","authors_text":"Ermis Soumalias, Michal Feldman, Paul Duetting, Tomasz Ponitka","submitted_at":"2025-01-24T13:13:50Z","abstract_excerpt":"Algorithmic contract design studies scenarios where a principal incentivizes an agent to exert effort on her behalf. In this work, we focus on settings where the agent's type is drawn from an unknown distribution, and formalize an offline learning framework for learning near-optimal contracts from sample agent types. A central tool in our analysis is the notion of pseudo-dimension from statistical learning theory. Beyond its role in establishing upper bounds on the sample complexity, pseudo-dimension measures the intrinsic complexity of a class of contracts, offering a new perspective on the t"},"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":"2501.14474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-24T13:13:50Z","cross_cats_sorted":["cs.AI","cs.LG","econ.TH"],"title_canon_sha256":"ecf86c49ba278d04a7fdd2a8e5068734f42d8cc465f1990d1e4b4cef04edd44c","abstract_canon_sha256":"f439e6296565c8ab1961961511ac3a77fefc3432e28faebf79066ca45aae2427"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:01.398882Z","signature_b64":"ejma2cObrkQ+xD488kDTJ92y7Nt8Q55nsh8qBE8Miu72Ay9jtdaypGzZJjXbmfSlMlIwIi8mTjZHRtH99W6OBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a108861913932eab1208954f6e386ca8ae880639563a5e3acb7d4469e822e7a0","last_reissued_at":"2026-07-05T10:05:01.398508Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:01.398508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Pseudo-Dimension of Contracts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","econ.TH"],"primary_cat":"cs.GT","authors_text":"Ermis Soumalias, Michal Feldman, Paul Duetting, Tomasz Ponitka","submitted_at":"2025-01-24T13:13:50Z","abstract_excerpt":"Algorithmic contract design studies scenarios where a principal incentivizes an agent to exert effort on her behalf. In this work, we focus on settings where the agent's type is drawn from an unknown distribution, and formalize an offline learning framework for learning near-optimal contracts from sample agent types. A central tool in our analysis is the notion of pseudo-dimension from statistical learning theory. Beyond its role in establishing upper bounds on the sample complexity, pseudo-dimension measures the intrinsic complexity of a class of contracts, offering a new perspective on the t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14474","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/2501.14474/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":"2501.14474","created_at":"2026-07-05T10:05:01.398558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.14474v1","created_at":"2026-07-05T10:05:01.398558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14474","created_at":"2026-07-05T10:05:01.398558+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEEIMGITSMXK","created_at":"2026-07-05T10:05:01.398558+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEEIMGITSMXKWEQI","created_at":"2026-07-05T10:05:01.398558+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEEIMGIT","created_at":"2026-07-05T10:05:01.398558+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.20508","citing_title":"The Panel Complexity of Sortition: Is 12 Angry Men Enough?","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UEEIMGITSMXKWEQISVHW4ODMVC","json":"https://pith.science/pith/UEEIMGITSMXKWEQISVHW4ODMVC.json","graph_json":"https://pith.science/api/pith-number/UEEIMGITSMXKWEQISVHW4ODMVC/graph.json","events_json":"https://pith.science/api/pith-number/UEEIMGITSMXKWEQISVHW4ODMVC/events.json","paper":"https://pith.science/paper/UEEIMGIT"},"agent_actions":{"view_html":"https://pith.science/pith/UEEIMGITSMXKWEQISVHW4ODMVC","download_json":"https://pith.science/pith/UEEIMGITSMXKWEQISVHW4ODMVC.json","view_paper":"https://pith.science/paper/UEEIMGIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.14474&json=true","fetch_graph":"https://pith.science/api/pith-number/UEEIMGITSMXKWEQISVHW4ODMVC/graph.json","fetch_events":"https://pith.science/api/pith-number/UEEIMGITSMXKWEQISVHW4ODMVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEEIMGITSMXKWEQISVHW4ODMVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEEIMGITSMXKWEQISVHW4ODMVC/action/storage_attestation","attest_author":"https://pith.science/pith/UEEIMGITSMXKWEQISVHW4ODMVC/action/author_attestation","sign_citation":"https://pith.science/pith/UEEIMGITSMXKWEQISVHW4ODMVC/action/citation_signature","submit_replication":"https://pith.science/pith/UEEIMGITSMXKWEQISVHW4ODMVC/action/replication_record"}},"created_at":"2026-07-05T10:05:01.398558+00:00","updated_at":"2026-07-05T10:05:01.398558+00:00"}