{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:K7Q4CSCDPVTSS7CUVY4TQBLAEK","short_pith_number":"pith:K7Q4CSCD","schema_version":"1.0","canonical_sha256":"57e1c148437d67297c54ae3938056022a3b7a6acfddca3995ff148e9f25edbc7","source":{"kind":"arxiv","id":"2308.07473","version":1},"attestation_state":"computed","paper":{"title":"On Supermodular Contracts and Dense Subgraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aditya Prasad, Neel Patel, Ramiro Deo-Campo Vuong, Shaddin Dughmi","submitted_at":"2023-08-14T21:57:25Z","abstract_excerpt":"We study the combinatorial contract design problem, introduced and studied by Dutting et. al. (2021, 2022), in both the single and multi-agent settings. Prior work has examined the problem when the principal's utility function is submodular in the actions chosen by the agent(s).\n  We complement this emerging literature with an examination of the problem when the principal's utility is supermodular.\n  In the single-agent setting, we obtain a strongly polynomial time algorithm for the optimal contract.\n  This stands in contrast to the NP-hardness of the problem with submodular principal utility "},"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":"2308.07473","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-08-14T21:57:25Z","cross_cats_sorted":[],"title_canon_sha256":"1671ba2a5bbea491d23c9f639c1e57ec2994225b289d45bc8be65492e7e8af32","abstract_canon_sha256":"aa5fd582341826b99f24165e00bae075dc8e455bc0903ae280ea8d576606a70e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:41:26.247644Z","signature_b64":"lFp1RmqI8XjpO4TRrv0apqClPHe/kqaIRed8O2X3L3y5WEL0OJ9sC8OH4ZGKIWBjo2hu40iM0ZjZdgfGAITsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57e1c148437d67297c54ae3938056022a3b7a6acfddca3995ff148e9f25edbc7","last_reissued_at":"2026-07-05T06:41:26.247202Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:41:26.247202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Supermodular Contracts and Dense Subgraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aditya Prasad, Neel Patel, Ramiro Deo-Campo Vuong, Shaddin Dughmi","submitted_at":"2023-08-14T21:57:25Z","abstract_excerpt":"We study the combinatorial contract design problem, introduced and studied by Dutting et. al. (2021, 2022), in both the single and multi-agent settings. Prior work has examined the problem when the principal's utility function is submodular in the actions chosen by the agent(s).\n  We complement this emerging literature with an examination of the problem when the principal's utility is supermodular.\n  In the single-agent setting, we obtain a strongly polynomial time algorithm for the optimal contract.\n  This stands in contrast to the NP-hardness of the problem with submodular principal utility "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07473","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/2308.07473/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":"2308.07473","created_at":"2026-07-05T06:41:26.247263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.07473v1","created_at":"2026-07-05T06:41:26.247263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07473","created_at":"2026-07-05T06:41:26.247263+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7Q4CSCDPVTS","created_at":"2026-07-05T06:41:26.247263+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7Q4CSCDPVTSS7CU","created_at":"2026-07-05T06:41:26.247263+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7Q4CSCD","created_at":"2026-07-05T06:41:26.247263+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK","json":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK.json","graph_json":"https://pith.science/api/pith-number/K7Q4CSCDPVTSS7CUVY4TQBLAEK/graph.json","events_json":"https://pith.science/api/pith-number/K7Q4CSCDPVTSS7CUVY4TQBLAEK/events.json","paper":"https://pith.science/paper/K7Q4CSCD"},"agent_actions":{"view_html":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK","download_json":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK.json","view_paper":"https://pith.science/paper/K7Q4CSCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.07473&json=true","fetch_graph":"https://pith.science/api/pith-number/K7Q4CSCDPVTSS7CUVY4TQBLAEK/graph.json","fetch_events":"https://pith.science/api/pith-number/K7Q4CSCDPVTSS7CUVY4TQBLAEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK/action/storage_attestation","attest_author":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK/action/author_attestation","sign_citation":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK/action/citation_signature","submit_replication":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK/action/replication_record"}},"created_at":"2026-07-05T06:41:26.247263+00:00","updated_at":"2026-07-05T06:41:26.247263+00:00"}