{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IMI75AUBNKPMRYCQT5N2EXX4NM","short_pith_number":"pith:IMI75AUB","schema_version":"1.0","canonical_sha256":"4311fe82816a9ec8e0509f5ba25efc6b007788f73fbf55f7883fdf2b3f1aa0a9","source":{"kind":"arxiv","id":"1606.02825","version":2},"attestation_state":"computed","paper":{"title":"Arbitrage-Free Combinatorial Market Making via Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Miroslav Dud\\'ik, S\\'ebastien Lahaie, Sivaraman Balakrishnan","submitted_at":"2016-06-09T04:59:50Z","abstract_excerpt":"We present a new combinatorial market maker that operates arbitrage-free combinatorial prediction markets specified by integer programs. Although the problem of arbitrage-free pricing, while maintaining a bound on the subsidy provided by the market maker, is #P-hard in the worst case, we posit that the typical case might be amenable to modern integer programming (IP) solvers. At the crux of our method is the Frank-Wolfe (conditional gradient) algorithm which is used to implement a Bregman projection aligned with the market maker's cost function, using an IP solver as an oracle. We demonstrate "},"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":"1606.02825","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-06-09T04:59:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0a5864b5666a2443327a41af251148cca5cd2e10a7e1d9d96bba949739379d8d","abstract_canon_sha256":"22406e049f5a9e83999f5806857b2e02d05b32386584262c66a55635a476147b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:37.600583Z","signature_b64":"cxc3hG4DlEeOOkIBO+6uEacKwmzUz7hrcodm2MRZbmmjoFp7rIwDx60wT986fmIjeTIxvy0fFC8DLMMy5VHgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4311fe82816a9ec8e0509f5ba25efc6b007788f73fbf55f7883fdf2b3f1aa0a9","last_reissued_at":"2026-05-18T01:12:37.600037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:37.600037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arbitrage-Free Combinatorial Market Making via Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Miroslav Dud\\'ik, S\\'ebastien Lahaie, Sivaraman Balakrishnan","submitted_at":"2016-06-09T04:59:50Z","abstract_excerpt":"We present a new combinatorial market maker that operates arbitrage-free combinatorial prediction markets specified by integer programs. Although the problem of arbitrage-free pricing, while maintaining a bound on the subsidy provided by the market maker, is #P-hard in the worst case, we posit that the typical case might be amenable to modern integer programming (IP) solvers. At the crux of our method is the Frank-Wolfe (conditional gradient) algorithm which is used to implement a Bregman projection aligned with the market maker's cost function, using an IP solver as an oracle. We demonstrate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02825","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":"1606.02825","created_at":"2026-05-18T01:12:37.600122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02825v2","created_at":"2026-05-18T01:12:37.600122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02825","created_at":"2026-05-18T01:12:37.600122+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMI75AUBNKPM","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMI75AUBNKPMRYCQ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMI75AUB","created_at":"2026-05-18T12:30:22.444734+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/IMI75AUBNKPMRYCQT5N2EXX4NM","json":"https://pith.science/pith/IMI75AUBNKPMRYCQT5N2EXX4NM.json","graph_json":"https://pith.science/api/pith-number/IMI75AUBNKPMRYCQT5N2EXX4NM/graph.json","events_json":"https://pith.science/api/pith-number/IMI75AUBNKPMRYCQT5N2EXX4NM/events.json","paper":"https://pith.science/paper/IMI75AUB"},"agent_actions":{"view_html":"https://pith.science/pith/IMI75AUBNKPMRYCQT5N2EXX4NM","download_json":"https://pith.science/pith/IMI75AUBNKPMRYCQT5N2EXX4NM.json","view_paper":"https://pith.science/paper/IMI75AUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02825&json=true","fetch_graph":"https://pith.science/api/pith-number/IMI75AUBNKPMRYCQT5N2EXX4NM/graph.json","fetch_events":"https://pith.science/api/pith-number/IMI75AUBNKPMRYCQT5N2EXX4NM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMI75AUBNKPMRYCQT5N2EXX4NM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMI75AUBNKPMRYCQT5N2EXX4NM/action/storage_attestation","attest_author":"https://pith.science/pith/IMI75AUBNKPMRYCQT5N2EXX4NM/action/author_attestation","sign_citation":"https://pith.science/pith/IMI75AUBNKPMRYCQT5N2EXX4NM/action/citation_signature","submit_replication":"https://pith.science/pith/IMI75AUBNKPMRYCQT5N2EXX4NM/action/replication_record"}},"created_at":"2026-05-18T01:12:37.600122+00:00","updated_at":"2026-05-18T01:12:37.600122+00:00"}