{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XHLBC6LBAGTCFVNRQZD3AXIQFW","short_pith_number":"pith:XHLBC6LB","schema_version":"1.0","canonical_sha256":"b9d611796101a622d5b18647b05d102db61ac2c6ef965f5c8d6a4c7b69684cfe","source":{"kind":"arxiv","id":"1602.05914","version":2},"attestation_state":"computed","paper":{"title":"Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Shahar Dobzinski","submitted_at":"2016-02-18T19:08:06Z","abstract_excerpt":"We study a central problem in Algorithmic Mechanism Design: constructing truthful mechanisms for welfare maximization in combinatorial auctions with submodular bidders. Dobzinski, Nisan, and Schapira provided the first mechanism that guarantees a non-trivial approximation ratio of $O(\\log^2 m)$ [STOC'06], where $m$ is the number of items. This was subsequently improved to $O(\\log m\\log \\log m)$ [Dobzinski, APPROX'07] and then to $O(\\log m)$ [Krysta and Vocking, ICALP'12].\n  In this paper we develop the first mechanism that breaks the logarithmic barrier. Specifically, the mechanism provides an"},"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":"1602.05914","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-02-18T19:08:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c28f5ecaf50641c3f8dc5edbd9f6876b9bc90b822d1c67d7a9ce385f8a24dba2","abstract_canon_sha256":"d85b3ae9cdf85ba71b8c53115b5956a7fae845cb3e985c84cbc4b120d08da66a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:11.609507Z","signature_b64":"F7E+n0ZORPtNn+t3v0zv5zSjyocD7yfbSM6zXVUccdU7I35+38DT69dDkuLiPeCPR/S+YfFpC4w0lisMcY4VCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9d611796101a622d5b18647b05d102db61ac2c6ef965f5c8d6a4c7b69684cfe","last_reissued_at":"2026-05-18T00:38:11.608682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:11.608682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Shahar Dobzinski","submitted_at":"2016-02-18T19:08:06Z","abstract_excerpt":"We study a central problem in Algorithmic Mechanism Design: constructing truthful mechanisms for welfare maximization in combinatorial auctions with submodular bidders. Dobzinski, Nisan, and Schapira provided the first mechanism that guarantees a non-trivial approximation ratio of $O(\\log^2 m)$ [STOC'06], where $m$ is the number of items. This was subsequently improved to $O(\\log m\\log \\log m)$ [Dobzinski, APPROX'07] and then to $O(\\log m)$ [Krysta and Vocking, ICALP'12].\n  In this paper we develop the first mechanism that breaks the logarithmic barrier. Specifically, the mechanism provides an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05914","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.05914","created_at":"2026-05-18T00:38:11.608823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05914v2","created_at":"2026-05-18T00:38:11.608823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05914","created_at":"2026-05-18T00:38:11.608823+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHLBC6LBAGTC","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHLBC6LBAGTCFVNR","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHLBC6LB","created_at":"2026-05-18T12:30:51.357362+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/XHLBC6LBAGTCFVNRQZD3AXIQFW","json":"https://pith.science/pith/XHLBC6LBAGTCFVNRQZD3AXIQFW.json","graph_json":"https://pith.science/api/pith-number/XHLBC6LBAGTCFVNRQZD3AXIQFW/graph.json","events_json":"https://pith.science/api/pith-number/XHLBC6LBAGTCFVNRQZD3AXIQFW/events.json","paper":"https://pith.science/paper/XHLBC6LB"},"agent_actions":{"view_html":"https://pith.science/pith/XHLBC6LBAGTCFVNRQZD3AXIQFW","download_json":"https://pith.science/pith/XHLBC6LBAGTCFVNRQZD3AXIQFW.json","view_paper":"https://pith.science/paper/XHLBC6LB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05914&json=true","fetch_graph":"https://pith.science/api/pith-number/XHLBC6LBAGTCFVNRQZD3AXIQFW/graph.json","fetch_events":"https://pith.science/api/pith-number/XHLBC6LBAGTCFVNRQZD3AXIQFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHLBC6LBAGTCFVNRQZD3AXIQFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHLBC6LBAGTCFVNRQZD3AXIQFW/action/storage_attestation","attest_author":"https://pith.science/pith/XHLBC6LBAGTCFVNRQZD3AXIQFW/action/author_attestation","sign_citation":"https://pith.science/pith/XHLBC6LBAGTCFVNRQZD3AXIQFW/action/citation_signature","submit_replication":"https://pith.science/pith/XHLBC6LBAGTCFVNRQZD3AXIQFW/action/replication_record"}},"created_at":"2026-05-18T00:38:11.608823+00:00","updated_at":"2026-05-18T00:38:11.608823+00:00"}