{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:K7Q4CSCDPVTSS7CUVY4TQBLAEK","short_pith_number":"pith:K7Q4CSCD","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"},"canonical_sha256":"57e1c148437d67297c54ae3938056022a3b7a6acfddca3995ff148e9f25edbc7","source":{"kind":"arxiv","id":"2308.07473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07473","created_at":"2026-07-05T06:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07473v1","created_at":"2026-07-05T06:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07473","created_at":"2026-07-05T06:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"K7Q4CSCDPVTS","created_at":"2026-07-05T06:41:26Z"},{"alias_kind":"pith_short_16","alias_value":"K7Q4CSCDPVTSS7CU","created_at":"2026-07-05T06:41:26Z"},{"alias_kind":"pith_short_8","alias_value":"K7Q4CSCD","created_at":"2026-07-05T06:41:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:K7Q4CSCDPVTSS7CUVY4TQBLAEK","target":"record","payload":{"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"},"canonical_sha256":"57e1c148437d67297c54ae3938056022a3b7a6acfddca3995ff148e9f25edbc7","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"},"source_kind":"arxiv","source_id":"2308.07473","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUNI7VZSbATbRt4xfyoYu4aQi0o18llX+Lx5wsEFeDr6N8XGtZWBIA1QnnC8w89w3MENkcGuGHxqklmtCrfYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:53:58.076141Z"},"content_sha256":"710a060722e0f074f6d11d5974c47f520cc7638e47f25dc6f8f995422687d513","schema_version":"1.0","event_id":"sha256:710a060722e0f074f6d11d5974c47f520cc7638e47f25dc6f8f995422687d513"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:K7Q4CSCDPVTSS7CUVY4TQBLAEK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFTeEwKnIK3tvNDhYtp/V4rJ2JWFFsOKxmtoCVbr49FKX9F1svwRxvhyr7XRXSTZ8TDn5g+KI9p3hLxv+d5rCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:53:58.076538Z"},"content_sha256":"61c88809516f41cefba66dd0292595b38a81ba1dd3df74c6e44b45e3463ea409","schema_version":"1.0","event_id":"sha256:61c88809516f41cefba66dd0292595b38a81ba1dd3df74c6e44b45e3463ea409"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK/bundle.json","state_url":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T20:53:58Z","links":{"resolver":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK","bundle":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK/bundle.json","state":"https://pith.science/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7Q4CSCDPVTSS7CUVY4TQBLAEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:K7Q4CSCDPVTSS7CUVY4TQBLAEK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aa5fd582341826b99f24165e00bae075dc8e455bc0903ae280ea8d576606a70e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-08-14T21:57:25Z","title_canon_sha256":"1671ba2a5bbea491d23c9f639c1e57ec2994225b289d45bc8be65492e7e8af32"},"schema_version":"1.0","source":{"id":"2308.07473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07473","created_at":"2026-07-05T06:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07473v1","created_at":"2026-07-05T06:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07473","created_at":"2026-07-05T06:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"K7Q4CSCDPVTS","created_at":"2026-07-05T06:41:26Z"},{"alias_kind":"pith_short_16","alias_value":"K7Q4CSCDPVTSS7CU","created_at":"2026-07-05T06:41:26Z"},{"alias_kind":"pith_short_8","alias_value":"K7Q4CSCD","created_at":"2026-07-05T06:41:26Z"}],"graph_snapshots":[{"event_id":"sha256:61c88809516f41cefba66dd0292595b38a81ba1dd3df74c6e44b45e3463ea409","target":"graph","created_at":"2026-07-05T06:41:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.07473/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Aditya Prasad, Neel Patel, Ramiro Deo-Campo Vuong, Shaddin Dughmi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-08-14T21:57:25Z","title":"On Supermodular Contracts and Dense Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07473","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:710a060722e0f074f6d11d5974c47f520cc7638e47f25dc6f8f995422687d513","target":"record","created_at":"2026-07-05T06:41:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aa5fd582341826b99f24165e00bae075dc8e455bc0903ae280ea8d576606a70e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-08-14T21:57:25Z","title_canon_sha256":"1671ba2a5bbea491d23c9f639c1e57ec2994225b289d45bc8be65492e7e8af32"},"schema_version":"1.0","source":{"id":"2308.07473","kind":"arxiv","version":1}},"canonical_sha256":"57e1c148437d67297c54ae3938056022a3b7a6acfddca3995ff148e9f25edbc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57e1c148437d67297c54ae3938056022a3b7a6acfddca3995ff148e9f25edbc7","first_computed_at":"2026-07-05T06:41:26.247202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:41:26.247202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lFp1RmqI8XjpO4TRrv0apqClPHe/kqaIRed8O2X3L3y5WEL0OJ9sC8OH4ZGKIWBjo2hu40iM0ZjZdgfGAITsDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:41:26.247644Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.07473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:710a060722e0f074f6d11d5974c47f520cc7638e47f25dc6f8f995422687d513","sha256:61c88809516f41cefba66dd0292595b38a81ba1dd3df74c6e44b45e3463ea409"],"state_sha256":"8716cfdda3fcfc0ca1747da9c441bf006ddc6d2b097a79e84647fa393658e7e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7UYuNat4ZU3FZWJDXoNufDBkAPXxbLuJekcAwK4JHwkkYVN23UX/rt/ajPsA2cOJpJDV0UUR5Ceub7zvEmRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:53:58.078513Z","bundle_sha256":"7e100bc02d9eca2347f4de59063b9e1d968973498e785ae110523d0f4a561ffe"}}