{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZKYSJIWMIEZOAB3Q6UN5JPMOE7","short_pith_number":"pith:ZKYSJIWM","canonical_record":{"source":{"id":"1511.05634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-11-18T01:03:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a9a1dc2ba47dfaa6db24aa76236255973a235c0f6b56632a347267420042ba42","abstract_canon_sha256":"da71e90083b11370b69c1fe61db910883905b0684cb1cbba873289d337bcab88"},"schema_version":"1.0"},"canonical_sha256":"cab124a2cc4132e00770f51bd4bd8e27d9f0dafbebc02870ad91c77b328fa7f5","source":{"kind":"arxiv","id":"1511.05634","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05634","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05634v2","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05634","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZKYSJIWMIEZO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZKYSJIWMIEZOAB3Q","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZKYSJIWM","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZKYSJIWMIEZOAB3Q6UN5JPMOE7","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-11-18T01:03:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a9a1dc2ba47dfaa6db24aa76236255973a235c0f6b56632a347267420042ba42","abstract_canon_sha256":"da71e90083b11370b69c1fe61db910883905b0684cb1cbba873289d337bcab88"},"schema_version":"1.0"},"canonical_sha256":"cab124a2cc4132e00770f51bd4bd8e27d9f0dafbebc02870ad91c77b328fa7f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:01.144708Z","signature_b64":"0/wGABQmEXTcstcxYDMus+a5pAJaJLFY6oxcQzsYa3cPOp5XQa0io+Xvh3xMoIA5YQ58Ha9LEQHvn0o5czVAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cab124a2cc4132e00770f51bd4bd8e27d9f0dafbebc02870ad91c77b328fa7f5","last_reissued_at":"2026-05-18T01:20:01.144036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:01.144036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05634","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-18T01:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y1G8Gg1begUrZ325G2dWI0wMzxdw3UGLpTfOXZ456EXh0ls+HPc/J02hfB2X5edQLJnxNuouD5TQYzKzTsLFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:38:53.674980Z"},"content_sha256":"3925ea8fea7a80eb3915d1261a581a658e85ea6dcdd094f56bf5ce0d36708203","schema_version":"1.0","event_id":"sha256:3925ea8fea7a80eb3915d1261a581a658e85ea6dcdd094f56bf5ce0d36708203"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZKYSJIWMIEZOAB3Q6UN5JPMOE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local entropy as a measure for sampling solutions in Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alessandro Ingrosso, Carlo Baldassi, Carlo Lucibello, Luca Saglietti, Riccardo Zecchina","submitted_at":"2015-11-18T01:03:59Z","abstract_excerpt":"We introduce a novel Entropy-driven Monte Carlo (EdMC) strategy to efficiently sample solutions of random Constraint Satisfaction Problems (CSPs). First, we extend a recent result that, using a large-deviation analysis, shows that the geometry of the space of solutions of the Binary Perceptron Learning Problem (a prototypical CSP), contains regions of very high-density of solutions. Despite being sub-dominant, these regions can be found by optimizing a local entropy measure. Building on these results, we construct a fast solver that relies exclusively on a local entropy estimate, and can be ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05634","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-18T01:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pIIP1Vg1CVhSHolrHArL60r9+xFa1V9bn4m2bBUM/y6EX3v6JJ58fRrvB6OcHL+fBnfy+FrAdyZPg9Q80RNIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:38:53.675349Z"},"content_sha256":"3c4a74b5036e174a65852fc5eb5824ff8de993e46c96d2681510b6802ca47968","schema_version":"1.0","event_id":"sha256:3c4a74b5036e174a65852fc5eb5824ff8de993e46c96d2681510b6802ca47968"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKYSJIWMIEZOAB3Q6UN5JPMOE7/bundle.json","state_url":"https://pith.science/pith/ZKYSJIWMIEZOAB3Q6UN5JPMOE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKYSJIWMIEZOAB3Q6UN5JPMOE7/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-12T08:38:53Z","links":{"resolver":"https://pith.science/pith/ZKYSJIWMIEZOAB3Q6UN5JPMOE7","bundle":"https://pith.science/pith/ZKYSJIWMIEZOAB3Q6UN5JPMOE7/bundle.json","state":"https://pith.science/pith/ZKYSJIWMIEZOAB3Q6UN5JPMOE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKYSJIWMIEZOAB3Q6UN5JPMOE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZKYSJIWMIEZOAB3Q6UN5JPMOE7","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":"da71e90083b11370b69c1fe61db910883905b0684cb1cbba873289d337bcab88","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-11-18T01:03:59Z","title_canon_sha256":"a9a1dc2ba47dfaa6db24aa76236255973a235c0f6b56632a347267420042ba42"},"schema_version":"1.0","source":{"id":"1511.05634","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05634","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05634v2","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05634","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZKYSJIWMIEZO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZKYSJIWMIEZOAB3Q","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZKYSJIWM","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:3c4a74b5036e174a65852fc5eb5824ff8de993e46c96d2681510b6802ca47968","target":"graph","created_at":"2026-05-18T01:20:01Z","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":"We introduce a novel Entropy-driven Monte Carlo (EdMC) strategy to efficiently sample solutions of random Constraint Satisfaction Problems (CSPs). First, we extend a recent result that, using a large-deviation analysis, shows that the geometry of the space of solutions of the Binary Perceptron Learning Problem (a prototypical CSP), contains regions of very high-density of solutions. Despite being sub-dominant, these regions can be found by optimizing a local entropy measure. Building on these results, we construct a fast solver that relies exclusively on a local entropy estimate, and can be ap","authors_text":"Alessandro Ingrosso, Carlo Baldassi, Carlo Lucibello, Luca Saglietti, Riccardo Zecchina","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-11-18T01:03:59Z","title":"Local entropy as a measure for sampling solutions in Constraint Satisfaction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05634","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:3925ea8fea7a80eb3915d1261a581a658e85ea6dcdd094f56bf5ce0d36708203","target":"record","created_at":"2026-05-18T01:20:01Z","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":"da71e90083b11370b69c1fe61db910883905b0684cb1cbba873289d337bcab88","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-11-18T01:03:59Z","title_canon_sha256":"a9a1dc2ba47dfaa6db24aa76236255973a235c0f6b56632a347267420042ba42"},"schema_version":"1.0","source":{"id":"1511.05634","kind":"arxiv","version":2}},"canonical_sha256":"cab124a2cc4132e00770f51bd4bd8e27d9f0dafbebc02870ad91c77b328fa7f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cab124a2cc4132e00770f51bd4bd8e27d9f0dafbebc02870ad91c77b328fa7f5","first_computed_at":"2026-05-18T01:20:01.144036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:01.144036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0/wGABQmEXTcstcxYDMus+a5pAJaJLFY6oxcQzsYa3cPOp5XQa0io+Xvh3xMoIA5YQ58Ha9LEQHvn0o5czVAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:01.144708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05634","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3925ea8fea7a80eb3915d1261a581a658e85ea6dcdd094f56bf5ce0d36708203","sha256:3c4a74b5036e174a65852fc5eb5824ff8de993e46c96d2681510b6802ca47968"],"state_sha256":"632b37437b865ee2e31b27b38d6b6ce24fec2e36cc23daf3880429e58299be78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mjxqZX/LNiVkTMJkPRDOP3Vkiw5aUNmarRL012yJc9haA+MqUUA3iTRkJPP8G5mXe6xib4zIgg00MU95XDtUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T08:38:53.677322Z","bundle_sha256":"f965e6ecc224306a9a02bfb97b3225d675b4eb55b48dbe3f8c85ce259190577d"}}