{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PQRRSZO4SWQV7F7X5JNEBUJHCZ","short_pith_number":"pith:PQRRSZO4","canonical_record":{"source":{"id":"1103.0041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-28T22:18:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9dc6d77dff4108e8a0a5975dc3908346c7b20f617280dcdde56fafe7eb33655c","abstract_canon_sha256":"01bac7a83e2cc3cff6d87ab428d8cb92c0b6e79b4c9f15588a951e17588201c1"},"schema_version":"1.0"},"canonical_sha256":"7c231965dc95a15f97f7ea5a40d127167d860c214c92f9f2daeb2b13f993e59f","source":{"kind":"arxiv","id":"1103.0041","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0041","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0041v2","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0041","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"PQRRSZO4SWQV","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PQRRSZO4SWQV7F7X","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PQRRSZO4","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PQRRSZO4SWQV7F7X5JNEBUJHCZ","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-28T22:18:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9dc6d77dff4108e8a0a5975dc3908346c7b20f617280dcdde56fafe7eb33655c","abstract_canon_sha256":"01bac7a83e2cc3cff6d87ab428d8cb92c0b6e79b4c9f15588a951e17588201c1"},"schema_version":"1.0"},"canonical_sha256":"7c231965dc95a15f97f7ea5a40d127167d860c214c92f9f2daeb2b13f993e59f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:05.867294Z","signature_b64":"mljR6oIrg56EyFnABujHA68ryi/0KkFpDSgXWbvKv6QvprkBKdzIp/I3Vg+1fzBlecMReBrkwLzS0wA6/TchCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c231965dc95a15f97f7ea5a40d127167d860c214c92f9f2daeb2b13f993e59f","last_reissued_at":"2026-05-18T04:24:05.866657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:05.866657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0041","source_version":2,"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-05-18T04:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VaPfPp8jc+7vv7i5Te7i2dnzqqpMp+Oi8x3ybb2/metw2H1RrWN93UR+ln1XyVqpTIZTZ29QJz0nD41o2NUYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:56:53.913449Z"},"content_sha256":"5a7651bff9c7fc6def10513c0eca77b91e65570396afe8af09c30d998b145bd4","schema_version":"1.0","event_id":"sha256:5a7651bff9c7fc6def10513c0eca77b91e65570396afe8af09c30d998b145bd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PQRRSZO4SWQV7F7X5JNEBUJHCZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Shaddin Dughmi","submitted_at":"2011-02-28T22:18:57Z","abstract_excerpt":"In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of self-interested players with a stake in the set of projects chosen. A public planner must choose a subset of these projects, subject to a resource constraint, with the goal of maximizing social welfare. Combinatorial Public Projects has emerged as one of the paradigmatic problems in Algorithmic Mechanism Design, a field concerned with solving fundamental resource allocation problems in the presence of both selfish behavior and the computational constraint of polynomial-time.\n  We design a polynomi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0041","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":""},"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-05-18T04:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9SBvRuzRhwDXmfXyKRNEuV2rxVSzs1EsnisTxX+eHaNCoVwEo9JeKtTFeIyheeV7Tp6x+VRSOVRMqxjYryADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:56:53.914110Z"},"content_sha256":"df48edb5592b5d61ae3208105eccd57f75755c45dc1ee3d133d11dacab21717f","schema_version":"1.0","event_id":"sha256:df48edb5592b5d61ae3208105eccd57f75755c45dc1ee3d133d11dacab21717f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQRRSZO4SWQV7F7X5JNEBUJHCZ/bundle.json","state_url":"https://pith.science/pith/PQRRSZO4SWQV7F7X5JNEBUJHCZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQRRSZO4SWQV7F7X5JNEBUJHCZ/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-05-26T05:56:53Z","links":{"resolver":"https://pith.science/pith/PQRRSZO4SWQV7F7X5JNEBUJHCZ","bundle":"https://pith.science/pith/PQRRSZO4SWQV7F7X5JNEBUJHCZ/bundle.json","state":"https://pith.science/pith/PQRRSZO4SWQV7F7X5JNEBUJHCZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQRRSZO4SWQV7F7X5JNEBUJHCZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PQRRSZO4SWQV7F7X5JNEBUJHCZ","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":"01bac7a83e2cc3cff6d87ab428d8cb92c0b6e79b4c9f15588a951e17588201c1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-28T22:18:57Z","title_canon_sha256":"9dc6d77dff4108e8a0a5975dc3908346c7b20f617280dcdde56fafe7eb33655c"},"schema_version":"1.0","source":{"id":"1103.0041","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0041","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0041v2","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0041","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"PQRRSZO4SWQV","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PQRRSZO4SWQV7F7X","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PQRRSZO4","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:df48edb5592b5d61ae3208105eccd57f75755c45dc1ee3d133d11dacab21717f","target":"graph","created_at":"2026-05-18T04:24:05Z","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"},"paper":{"abstract_excerpt":"In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of self-interested players with a stake in the set of projects chosen. A public planner must choose a subset of these projects, subject to a resource constraint, with the goal of maximizing social welfare. Combinatorial Public Projects has emerged as one of the paradigmatic problems in Algorithmic Mechanism Design, a field concerned with solving fundamental resource allocation problems in the presence of both selfish behavior and the computational constraint of polynomial-time.\n  We design a polynomi","authors_text":"Shaddin Dughmi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-28T22:18:57Z","title":"A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0041","kind":"arxiv","version":2},"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:5a7651bff9c7fc6def10513c0eca77b91e65570396afe8af09c30d998b145bd4","target":"record","created_at":"2026-05-18T04:24:05Z","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":"01bac7a83e2cc3cff6d87ab428d8cb92c0b6e79b4c9f15588a951e17588201c1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-28T22:18:57Z","title_canon_sha256":"9dc6d77dff4108e8a0a5975dc3908346c7b20f617280dcdde56fafe7eb33655c"},"schema_version":"1.0","source":{"id":"1103.0041","kind":"arxiv","version":2}},"canonical_sha256":"7c231965dc95a15f97f7ea5a40d127167d860c214c92f9f2daeb2b13f993e59f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c231965dc95a15f97f7ea5a40d127167d860c214c92f9f2daeb2b13f993e59f","first_computed_at":"2026-05-18T04:24:05.866657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:05.866657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mljR6oIrg56EyFnABujHA68ryi/0KkFpDSgXWbvKv6QvprkBKdzIp/I3Vg+1fzBlecMReBrkwLzS0wA6/TchCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:05.867294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0041","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a7651bff9c7fc6def10513c0eca77b91e65570396afe8af09c30d998b145bd4","sha256:df48edb5592b5d61ae3208105eccd57f75755c45dc1ee3d133d11dacab21717f"],"state_sha256":"265b81486c4bcd4238bc948ce117c5bea4980b46ddfbcb6ea30539330ad88b7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Va5a8BDBZoYle/Sb3dr+TudqvG7T1lUZbE8kkjjrsj9J5To8PMusoaSCJeRAw5qw+QAC/JDq4KgOozsdpLLvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:56:53.917510Z","bundle_sha256":"361e19133e4f4a14903803b62fa6c90368b62082f1a12d44cd27d900973226a4"}}