{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UVYUEOLKGHTZF2R6Q3XIJZMEXB","short_pith_number":"pith:UVYUEOLK","schema_version":"1.0","canonical_sha256":"a57142396a31e792ea3e86ee84e584b86ee650fb37cd2d8a7a42313b5375bf0d","source":{"kind":"arxiv","id":"2603.17212","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Contracts for Cost-Effective AI Delegation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"Ariel D. Procaccia, Eden Saig, Inbal Talgam-Cohen, Jamie Tucker-Foltz, Tamar Garbuz","submitted_at":"2026-03-17T23:31:01Z","abstract_excerpt":"When organizations delegate text generation tasks to AI providers via pay-for-performance contracts, expected payments rise when evaluation is noisy. As evaluation methods become more elaborate, the economic benefits of decreased noise are often overshadowed by increased evaluation costs. In this work, we introduce adaptive contracts for AI delegation, which allow detailed evaluation to be performed selectively after observing an initial coarse signal in order to conserve resources. We make three sets of contributions: First, we provide efficient algorithms for computing optimal adaptive contr"},"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":"2603.17212","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-03-17T23:31:01Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"35f980671378b05e6ca1b42d060b2a1f4f4e83699ea1ea2fe8b08fec32dfdcbe","abstract_canon_sha256":"894ed7fc02aaca0bab5d3dce57989808cacb585b90b995bd59b741460814d580"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:18.719769Z","signature_b64":"/56wUduRCMUvSvd+uROWDMa1HGp01SK9pEicl7LmBkDxTK0mTO9N1fLojBwp3d7nJoeZSppGE++7mc0CTa8kBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a57142396a31e792ea3e86ee84e584b86ee650fb37cd2d8a7a42313b5375bf0d","last_reissued_at":"2026-07-03T01:17:18.719257Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:18.719257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Contracts for Cost-Effective AI Delegation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"Ariel D. Procaccia, Eden Saig, Inbal Talgam-Cohen, Jamie Tucker-Foltz, Tamar Garbuz","submitted_at":"2026-03-17T23:31:01Z","abstract_excerpt":"When organizations delegate text generation tasks to AI providers via pay-for-performance contracts, expected payments rise when evaluation is noisy. As evaluation methods become more elaborate, the economic benefits of decreased noise are often overshadowed by increased evaluation costs. In this work, we introduce adaptive contracts for AI delegation, which allow detailed evaluation to be performed selectively after observing an initial coarse signal in order to conserve resources. We make three sets of contributions: First, we provide efficient algorithms for computing optimal adaptive contr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.17212","kind":"arxiv","version":2},"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/2603.17212/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":"2603.17212","created_at":"2026-07-03T01:17:18.719321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.17212v2","created_at":"2026-07-03T01:17:18.719321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.17212","created_at":"2026-07-03T01:17:18.719321+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVYUEOLKGHTZ","created_at":"2026-07-03T01:17:18.719321+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVYUEOLKGHTZF2R6","created_at":"2026-07-03T01:17:18.719321+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVYUEOLK","created_at":"2026-07-03T01:17:18.719321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.06125","citing_title":"Regret Minimization in Single-Dimensional Contract-Design with Binary Actions","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UVYUEOLKGHTZF2R6Q3XIJZMEXB","json":"https://pith.science/pith/UVYUEOLKGHTZF2R6Q3XIJZMEXB.json","graph_json":"https://pith.science/api/pith-number/UVYUEOLKGHTZF2R6Q3XIJZMEXB/graph.json","events_json":"https://pith.science/api/pith-number/UVYUEOLKGHTZF2R6Q3XIJZMEXB/events.json","paper":"https://pith.science/paper/UVYUEOLK"},"agent_actions":{"view_html":"https://pith.science/pith/UVYUEOLKGHTZF2R6Q3XIJZMEXB","download_json":"https://pith.science/pith/UVYUEOLKGHTZF2R6Q3XIJZMEXB.json","view_paper":"https://pith.science/paper/UVYUEOLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.17212&json=true","fetch_graph":"https://pith.science/api/pith-number/UVYUEOLKGHTZF2R6Q3XIJZMEXB/graph.json","fetch_events":"https://pith.science/api/pith-number/UVYUEOLKGHTZF2R6Q3XIJZMEXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVYUEOLKGHTZF2R6Q3XIJZMEXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVYUEOLKGHTZF2R6Q3XIJZMEXB/action/storage_attestation","attest_author":"https://pith.science/pith/UVYUEOLKGHTZF2R6Q3XIJZMEXB/action/author_attestation","sign_citation":"https://pith.science/pith/UVYUEOLKGHTZF2R6Q3XIJZMEXB/action/citation_signature","submit_replication":"https://pith.science/pith/UVYUEOLKGHTZF2R6Q3XIJZMEXB/action/replication_record"}},"created_at":"2026-07-03T01:17:18.719321+00:00","updated_at":"2026-07-03T01:17:18.719321+00:00"}