{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6ZKYW2UAHAOWCM5KEC3JQCSEBT","short_pith_number":"pith:6ZKYW2UA","schema_version":"1.0","canonical_sha256":"f6558b6a80381d6133aa20b6980a440cd5c8ecb3cdad355e2178a29483e92743","source":{"kind":"arxiv","id":"2502.11661","version":1},"attestation_state":"computed","paper":{"title":"Single-dimensional Contract Design: Efficient Algorithms and Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Andrea Celli, Martino Bernasconi, Matteo Castiglioni","submitted_at":"2025-02-17T10:52:24Z","abstract_excerpt":"We study a Bayesian contract design problem in which a principal interacts with an unknown agent. We consider the single-parameter uncertainty model introduced by Alon et al. [2021], in which the agent's type is described by a single parameter, i.e., the cost per unit-of-effort. Despite its simplicity, several works have shown that single-dimensional contract design is not necessarily easier than its multi-dimensional counterpart in many respects. Perhaps the most surprising result is the reduction by Castiglioni et al . [2025] from multi- to single-dimensional contract design. However, their "},"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":"2502.11661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-02-17T10:52:24Z","cross_cats_sorted":[],"title_canon_sha256":"7a3c8a80c104d70758480e0d885726766871328503ca51ae9a9495422c13367e","abstract_canon_sha256":"e481131329a6652ebf4d32a46964e6deb4f76624a2f23a13425e80e9411f33a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:17:17.800996Z","signature_b64":"KZwZvqifVCA3UORcF9GtksBsLKdncYNxzGGmmUZJTU9JZgkvx9qK5ChAoOFSFIf5IREZn4FH0afh6mEPyL+ZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6558b6a80381d6133aa20b6980a440cd5c8ecb3cdad355e2178a29483e92743","last_reissued_at":"2026-07-05T10:17:17.800383Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:17:17.800383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single-dimensional Contract Design: Efficient Algorithms and Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Andrea Celli, Martino Bernasconi, Matteo Castiglioni","submitted_at":"2025-02-17T10:52:24Z","abstract_excerpt":"We study a Bayesian contract design problem in which a principal interacts with an unknown agent. We consider the single-parameter uncertainty model introduced by Alon et al. [2021], in which the agent's type is described by a single parameter, i.e., the cost per unit-of-effort. Despite its simplicity, several works have shown that single-dimensional contract design is not necessarily easier than its multi-dimensional counterpart in many respects. Perhaps the most surprising result is the reduction by Castiglioni et al . [2025] from multi- to single-dimensional contract design. However, their "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11661","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/2502.11661/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":"2502.11661","created_at":"2026-07-05T10:17:17.800450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.11661v1","created_at":"2026-07-05T10:17:17.800450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11661","created_at":"2026-07-05T10:17:17.800450+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZKYW2UAHAOW","created_at":"2026-07-05T10:17:17.800450+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZKYW2UAHAOWCM5K","created_at":"2026-07-05T10:17:17.800450+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZKYW2UA","created_at":"2026-07-05T10:17:17.800450+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06125","citing_title":"Regret Minimization in Single-Dimensional Contract-Design with Binary Actions","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6ZKYW2UAHAOWCM5KEC3JQCSEBT","json":"https://pith.science/pith/6ZKYW2UAHAOWCM5KEC3JQCSEBT.json","graph_json":"https://pith.science/api/pith-number/6ZKYW2UAHAOWCM5KEC3JQCSEBT/graph.json","events_json":"https://pith.science/api/pith-number/6ZKYW2UAHAOWCM5KEC3JQCSEBT/events.json","paper":"https://pith.science/paper/6ZKYW2UA"},"agent_actions":{"view_html":"https://pith.science/pith/6ZKYW2UAHAOWCM5KEC3JQCSEBT","download_json":"https://pith.science/pith/6ZKYW2UAHAOWCM5KEC3JQCSEBT.json","view_paper":"https://pith.science/paper/6ZKYW2UA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.11661&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZKYW2UAHAOWCM5KEC3JQCSEBT/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZKYW2UAHAOWCM5KEC3JQCSEBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZKYW2UAHAOWCM5KEC3JQCSEBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZKYW2UAHAOWCM5KEC3JQCSEBT/action/storage_attestation","attest_author":"https://pith.science/pith/6ZKYW2UAHAOWCM5KEC3JQCSEBT/action/author_attestation","sign_citation":"https://pith.science/pith/6ZKYW2UAHAOWCM5KEC3JQCSEBT/action/citation_signature","submit_replication":"https://pith.science/pith/6ZKYW2UAHAOWCM5KEC3JQCSEBT/action/replication_record"}},"created_at":"2026-07-05T10:17:17.800450+00:00","updated_at":"2026-07-05T10:17:17.800450+00:00"}