{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:J7VZ5MH5LUJZABTDHZJVC5OYP6","short_pith_number":"pith:J7VZ5MH5","schema_version":"1.0","canonical_sha256":"4feb9eb0fd5d139006633e535175d87fac07ba60618378722d48789898c5a2f1","source":{"kind":"arxiv","id":"1302.6677","version":1},"attestation_state":"computed","paper":{"title":"Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashish Sabharwal, Bart Selman, Carla P. Gomes, Stefano Ermon","submitted_at":"2013-02-27T06:45:28Z","abstract_excerpt":"Integration is affected by the curse of dimensionality and quickly becomes intractable as the dimensionality of the problem grows. We propose a randomized algorithm that, with high probability, gives a constant-factor approximation of a general discrete integral defined over an exponentially large set. This algorithm relies on solving only a small number of instances of a discrete combinatorial optimization problem subject to randomly generated parity constraints used as a hash function. As an application, we demonstrate that with a small number of MAP queries we can efficiently approximate th"},"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":"1302.6677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-27T06:45:28Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"8cb8ff6498dae5146ec5ed8158ee7839f8d64e95da31f14162f723d782f9f488","abstract_canon_sha256":"6ce86f05a2c3c0eb2259d3893a57457ae887748725debff2781db2ce78192a57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:19.148427Z","signature_b64":"X3PHhBa7huryzS+QOQcImIo7Q2s617DL3zLN4M48Jxz/iqtbLKEHzzdrgNBuZ5GlsqnNV99YKqXEHO0cYTKdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4feb9eb0fd5d139006633e535175d87fac07ba60618378722d48789898c5a2f1","last_reissued_at":"2026-05-18T03:32:19.147552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:19.147552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashish Sabharwal, Bart Selman, Carla P. Gomes, Stefano Ermon","submitted_at":"2013-02-27T06:45:28Z","abstract_excerpt":"Integration is affected by the curse of dimensionality and quickly becomes intractable as the dimensionality of the problem grows. We propose a randomized algorithm that, with high probability, gives a constant-factor approximation of a general discrete integral defined over an exponentially large set. This algorithm relies on solving only a small number of instances of a discrete combinatorial optimization problem subject to randomly generated parity constraints used as a hash function. As an application, we demonstrate that with a small number of MAP queries we can efficiently approximate th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6677","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":""},"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":"1302.6677","created_at":"2026-05-18T03:32:19.147690+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6677v1","created_at":"2026-05-18T03:32:19.147690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6677","created_at":"2026-05-18T03:32:19.147690+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7VZ5MH5LUJZ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7VZ5MH5LUJZABTD","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7VZ5MH5","created_at":"2026-05-18T12:27:49.015174+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/J7VZ5MH5LUJZABTDHZJVC5OYP6","json":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6.json","graph_json":"https://pith.science/api/pith-number/J7VZ5MH5LUJZABTDHZJVC5OYP6/graph.json","events_json":"https://pith.science/api/pith-number/J7VZ5MH5LUJZABTDHZJVC5OYP6/events.json","paper":"https://pith.science/paper/J7VZ5MH5"},"agent_actions":{"view_html":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6","download_json":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6.json","view_paper":"https://pith.science/paper/J7VZ5MH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6677&json=true","fetch_graph":"https://pith.science/api/pith-number/J7VZ5MH5LUJZABTDHZJVC5OYP6/graph.json","fetch_events":"https://pith.science/api/pith-number/J7VZ5MH5LUJZABTDHZJVC5OYP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6/action/storage_attestation","attest_author":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6/action/author_attestation","sign_citation":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6/action/citation_signature","submit_replication":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6/action/replication_record"}},"created_at":"2026-05-18T03:32:19.147690+00:00","updated_at":"2026-05-18T03:32:19.147690+00:00"}