{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D6ZQ6WNDWOQGDTM3AFX5QSCMEY","short_pith_number":"pith:D6ZQ6WND","schema_version":"1.0","canonical_sha256":"1fb30f59a3b3a061cd9b016fd8484c261175f0cf7ee9c6938e3372036ab6d56b","source":{"kind":"arxiv","id":"2405.08260","version":1},"attestation_state":"computed","paper":{"title":"Multi-Agent Combinatorial Contracts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Michal Feldman, Paul Duetting, Thomas Kesselheim, Tomer Ezra","submitted_at":"2024-05-14T01:26:49Z","abstract_excerpt":"Combinatorial contracts are emerging as a key paradigm in algorithmic contract design, paralleling the role of combinatorial auctions in algorithmic mechanism design. In this paper we study natural combinatorial contract settings involving teams of agents, each capable of performing multiple actions. This scenario extends two fundamental special cases previously examined in the literature, namely the single-agent combinatorial action model of [Duetting et al., 2021] and the multi-agent binary-action model of [Babaioff et al., 2012, Duetting et al., 2023].\n  We study the algorithmic and computa"},"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":"2405.08260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-05-14T01:26:49Z","cross_cats_sorted":[],"title_canon_sha256":"2ea4273b09744747240fa3ff1aa3b2abee2be2157d4c25b4af2a51054b85643f","abstract_canon_sha256":"548047bb19398a3ac2a27d2ee340c64377c5e1a9127b2f1ec9ef3aa392a64da2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:57.817644Z","signature_b64":"UoyHLXBpLoJhPQz61xoS0AYMM8sCqUpvtBmayagCaAXs9bdaf0aiRT3OoG0U2foraSp+QtVWOHapKK3O/XZZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fb30f59a3b3a061cd9b016fd8484c261175f0cf7ee9c6938e3372036ab6d56b","last_reissued_at":"2026-07-05T08:18:57.817160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:57.817160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Combinatorial Contracts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Michal Feldman, Paul Duetting, Thomas Kesselheim, Tomer Ezra","submitted_at":"2024-05-14T01:26:49Z","abstract_excerpt":"Combinatorial contracts are emerging as a key paradigm in algorithmic contract design, paralleling the role of combinatorial auctions in algorithmic mechanism design. In this paper we study natural combinatorial contract settings involving teams of agents, each capable of performing multiple actions. This scenario extends two fundamental special cases previously examined in the literature, namely the single-agent combinatorial action model of [Duetting et al., 2021] and the multi-agent binary-action model of [Babaioff et al., 2012, Duetting et al., 2023].\n  We study the algorithmic and computa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.08260","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/2405.08260/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":"2405.08260","created_at":"2026-07-05T08:18:57.817228+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.08260v1","created_at":"2026-07-05T08:18:57.817228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.08260","created_at":"2026-07-05T08:18:57.817228+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6ZQ6WNDWOQG","created_at":"2026-07-05T08:18:57.817228+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6ZQ6WNDWOQGDTM3","created_at":"2026-07-05T08:18:57.817228+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6ZQ6WND","created_at":"2026-07-05T08:18:57.817228+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":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D6ZQ6WNDWOQGDTM3AFX5QSCMEY","json":"https://pith.science/pith/D6ZQ6WNDWOQGDTM3AFX5QSCMEY.json","graph_json":"https://pith.science/api/pith-number/D6ZQ6WNDWOQGDTM3AFX5QSCMEY/graph.json","events_json":"https://pith.science/api/pith-number/D6ZQ6WNDWOQGDTM3AFX5QSCMEY/events.json","paper":"https://pith.science/paper/D6ZQ6WND"},"agent_actions":{"view_html":"https://pith.science/pith/D6ZQ6WNDWOQGDTM3AFX5QSCMEY","download_json":"https://pith.science/pith/D6ZQ6WNDWOQGDTM3AFX5QSCMEY.json","view_paper":"https://pith.science/paper/D6ZQ6WND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.08260&json=true","fetch_graph":"https://pith.science/api/pith-number/D6ZQ6WNDWOQGDTM3AFX5QSCMEY/graph.json","fetch_events":"https://pith.science/api/pith-number/D6ZQ6WNDWOQGDTM3AFX5QSCMEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6ZQ6WNDWOQGDTM3AFX5QSCMEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6ZQ6WNDWOQGDTM3AFX5QSCMEY/action/storage_attestation","attest_author":"https://pith.science/pith/D6ZQ6WNDWOQGDTM3AFX5QSCMEY/action/author_attestation","sign_citation":"https://pith.science/pith/D6ZQ6WNDWOQGDTM3AFX5QSCMEY/action/citation_signature","submit_replication":"https://pith.science/pith/D6ZQ6WNDWOQGDTM3AFX5QSCMEY/action/replication_record"}},"created_at":"2026-07-05T08:18:57.817228+00:00","updated_at":"2026-07-05T08:18:57.817228+00:00"}