{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:J7VZ5MH5LUJZABTDHZJVC5OYP6","short_pith_number":"pith:J7VZ5MH5","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"},"canonical_sha256":"4feb9eb0fd5d139006633e535175d87fac07ba60618378722d48789898c5a2f1","source":{"kind":"arxiv","id":"1302.6677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6677","created_at":"2026-05-18T03:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6677v1","created_at":"2026-05-18T03:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6677","created_at":"2026-05-18T03:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"J7VZ5MH5LUJZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J7VZ5MH5LUJZABTD","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J7VZ5MH5","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:J7VZ5MH5LUJZABTDHZJVC5OYP6","target":"record","payload":{"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"},"canonical_sha256":"4feb9eb0fd5d139006633e535175d87fac07ba60618378722d48789898c5a2f1","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"},"source_kind":"arxiv","source_id":"1302.6677","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-05-18T03:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYrEjrsrsoUn6TNKrGAf1rGPSEenPSIGLZaezQHNFdzNxcNcE7bFZbdj1kzBzeIswZnun8n+DaQiKwcuI6dTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:53:16.352288Z"},"content_sha256":"67dffc929d58fa8c933a1d01ffe17902b11fe80225bbf04d0b206ce9f676ff64","schema_version":"1.0","event_id":"sha256:67dffc929d58fa8c933a1d01ffe17902b11fe80225bbf04d0b206ce9f676ff64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:J7VZ5MH5LUJZABTDHZJVC5OYP6","target":"graph","payload":{"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"},"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-18T03:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tR+4rldLjOkZN5kftQe1jnpoFtp6uog92qhKyyAXt8dvLCr57o33+zCMFJsEjFxd0YfVemITXnkAOZjMi3SfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:53:16.352650Z"},"content_sha256":"3c284b43e09d2d615692ad8d257b05fc38a7ad44dbeb9a094a77618f27dcf490","schema_version":"1.0","event_id":"sha256:3c284b43e09d2d615692ad8d257b05fc38a7ad44dbeb9a094a77618f27dcf490"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6/bundle.json","state_url":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6/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-06-03T05:53:16Z","links":{"resolver":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6","bundle":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6/bundle.json","state":"https://pith.science/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7VZ5MH5LUJZABTDHZJVC5OYP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:J7VZ5MH5LUJZABTDHZJVC5OYP6","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":"6ce86f05a2c3c0eb2259d3893a57457ae887748725debff2781db2ce78192a57","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-27T06:45:28Z","title_canon_sha256":"8cb8ff6498dae5146ec5ed8158ee7839f8d64e95da31f14162f723d782f9f488"},"schema_version":"1.0","source":{"id":"1302.6677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6677","created_at":"2026-05-18T03:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6677v1","created_at":"2026-05-18T03:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6677","created_at":"2026-05-18T03:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"J7VZ5MH5LUJZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J7VZ5MH5LUJZABTD","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J7VZ5MH5","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:3c284b43e09d2d615692ad8d257b05fc38a7ad44dbeb9a094a77618f27dcf490","target":"graph","created_at":"2026-05-18T03:32:19Z","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":"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","authors_text":"Ashish Sabharwal, Bart Selman, Carla P. Gomes, Stefano Ermon","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-27T06:45:28Z","title":"Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6677","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:67dffc929d58fa8c933a1d01ffe17902b11fe80225bbf04d0b206ce9f676ff64","target":"record","created_at":"2026-05-18T03:32:19Z","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":"6ce86f05a2c3c0eb2259d3893a57457ae887748725debff2781db2ce78192a57","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-27T06:45:28Z","title_canon_sha256":"8cb8ff6498dae5146ec5ed8158ee7839f8d64e95da31f14162f723d782f9f488"},"schema_version":"1.0","source":{"id":"1302.6677","kind":"arxiv","version":1}},"canonical_sha256":"4feb9eb0fd5d139006633e535175d87fac07ba60618378722d48789898c5a2f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4feb9eb0fd5d139006633e535175d87fac07ba60618378722d48789898c5a2f1","first_computed_at":"2026-05-18T03:32:19.147552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:19.147552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X3PHhBa7huryzS+QOQcImIo7Q2s617DL3zLN4M48Jxz/iqtbLKEHzzdrgNBuZ5GlsqnNV99YKqXEHO0cYTKdDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:19.148427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.6677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67dffc929d58fa8c933a1d01ffe17902b11fe80225bbf04d0b206ce9f676ff64","sha256:3c284b43e09d2d615692ad8d257b05fc38a7ad44dbeb9a094a77618f27dcf490"],"state_sha256":"8ccc330c568a41479944960a5fbf32791a24a755f8359aa74f0f87c2ed339e41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTlr3EYuSTE9ud4vzY7kajAjCLWgck6rr9bvZdXzqx3k0xFqpstw0ZeoMSzV3lxCWVMmXqAW0JRqjtWeBbumDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:53:16.354618Z","bundle_sha256":"18c4f9bfcc0dee302b307502d698181a7589ab8b2084ffb5610f774ae8b9f0ca"}}