{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:M54Z24KHXV2QLXBXOH6WAHZS7P","short_pith_number":"pith:M54Z24KH","canonical_record":{"source":{"id":"0709.1667","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2007-09-11T15:48:56Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"title_canon_sha256":"b7baabf5a1f036498af28c333654a97a6306c9c12a4903d05e88f4f4cb1c2521","abstract_canon_sha256":"9e24f35194e04f612b6b7b1dddce329cb81bbbc3df9af7ba39741f03b208433f"},"schema_version":"1.0"},"canonical_sha256":"67799d7147bd7505dc3771fd601f32fbf39b25821f30be8c0b03104b41dc18bc","source":{"kind":"arxiv","id":"0709.1667","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.1667","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"0709.1667v3","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.1667","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"M54Z24KHXV2Q","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"M54Z24KHXV2QLXBX","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"M54Z24KH","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:M54Z24KHXV2QLXBXOH6WAHZS7P","target":"record","payload":{"canonical_record":{"source":{"id":"0709.1667","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2007-09-11T15:48:56Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"title_canon_sha256":"b7baabf5a1f036498af28c333654a97a6306c9c12a4903d05e88f4f4cb1c2521","abstract_canon_sha256":"9e24f35194e04f612b6b7b1dddce329cb81bbbc3df9af7ba39741f03b208433f"},"schema_version":"1.0"},"canonical_sha256":"67799d7147bd7505dc3771fd601f32fbf39b25821f30be8c0b03104b41dc18bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:23.387063Z","signature_b64":"vKEgoQwdqqVqk7YN7r4o04naRm56rp2xjqtRqAPOworc8ZQ23wYGNkcnSZKX79l7rc1LhfRpH6EEbCGLwRWNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67799d7147bd7505dc3771fd601f32fbf39b25821f30be8c0b03104b41dc18bc","last_reissued_at":"2026-05-17T23:44:23.386365Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:23.386365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0709.1667","source_version":3,"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-17T23:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lGX/iIxSz0zAwtOy7HC5VlLDmuW5p1ZUnVEI4jWx40J9SAS2V+tOO3GdtLT61kN4RKn2vbN1oN0iv24S/ITCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:39:15.471722Z"},"content_sha256":"010df579db9b484e57b1b393419a3c1187b8be3f5e724f22ab1221d7ce1b7585","schema_version":"1.0","event_id":"sha256:010df579db9b484e57b1b393419a3c1187b8be3f5e724f22ab1221d7ce1b7585"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:M54Z24KHXV2QLXBXOH6WAHZS7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"primary_cat":"cs.AI","authors_text":"Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian","submitted_at":"2007-09-11T15:48:56Z","abstract_excerpt":"Message passing algorithms have proved surprisingly successful in solving hard constraint satisfaction problems on sparse random graphs. In such applications, variables are fixed sequentially to satisfy the constraints. Message passing is run after each step. Its outcome provides an heuristic to make choices at next step. This approach has been referred to as `decimation,' with reference to analogous procedures in statistical physics.\n  The behavior of decimation procedures is poorly understood. Here we consider a simple randomized decimation algorithm based on belief propagation (BP), and ana"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.1667","kind":"arxiv","version":3},"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-17T23:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNZSFeuqM4XsWD5A+PeuKIQ4OiJN3Oue5E3yDI8WnMTBMRcPrSe06sPOhviUUGXUl9HWT1tuM4QccoVsZe4gAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:39:15.472062Z"},"content_sha256":"fcd2098ca483941e9b73a4ebd209ea6118219ebb6debd6a20776dec146ba8f0f","schema_version":"1.0","event_id":"sha256:fcd2098ca483941e9b73a4ebd209ea6118219ebb6debd6a20776dec146ba8f0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M54Z24KHXV2QLXBXOH6WAHZS7P/bundle.json","state_url":"https://pith.science/pith/M54Z24KHXV2QLXBXOH6WAHZS7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M54Z24KHXV2QLXBXOH6WAHZS7P/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-05-28T14:39:15Z","links":{"resolver":"https://pith.science/pith/M54Z24KHXV2QLXBXOH6WAHZS7P","bundle":"https://pith.science/pith/M54Z24KHXV2QLXBXOH6WAHZS7P/bundle.json","state":"https://pith.science/pith/M54Z24KHXV2QLXBXOH6WAHZS7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M54Z24KHXV2QLXBXOH6WAHZS7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:M54Z24KHXV2QLXBXOH6WAHZS7P","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":"9e24f35194e04f612b6b7b1dddce329cb81bbbc3df9af7ba39741f03b208433f","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2007-09-11T15:48:56Z","title_canon_sha256":"b7baabf5a1f036498af28c333654a97a6306c9c12a4903d05e88f4f4cb1c2521"},"schema_version":"1.0","source":{"id":"0709.1667","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.1667","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"0709.1667v3","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.1667","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"M54Z24KHXV2Q","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"M54Z24KHXV2QLXBX","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"M54Z24KH","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:fcd2098ca483941e9b73a4ebd209ea6118219ebb6debd6a20776dec146ba8f0f","target":"graph","created_at":"2026-05-17T23:44:23Z","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":"Message passing algorithms have proved surprisingly successful in solving hard constraint satisfaction problems on sparse random graphs. In such applications, variables are fixed sequentially to satisfy the constraints. Message passing is run after each step. Its outcome provides an heuristic to make choices at next step. This approach has been referred to as `decimation,' with reference to analogous procedures in statistical physics.\n  The behavior of decimation procedures is poorly understood. Here we consider a simple randomized decimation algorithm based on belief propagation (BP), and ana","authors_text":"Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2007-09-11T15:48:56Z","title":"Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.1667","kind":"arxiv","version":3},"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:010df579db9b484e57b1b393419a3c1187b8be3f5e724f22ab1221d7ce1b7585","target":"record","created_at":"2026-05-17T23:44:23Z","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":"9e24f35194e04f612b6b7b1dddce329cb81bbbc3df9af7ba39741f03b208433f","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2007-09-11T15:48:56Z","title_canon_sha256":"b7baabf5a1f036498af28c333654a97a6306c9c12a4903d05e88f4f4cb1c2521"},"schema_version":"1.0","source":{"id":"0709.1667","kind":"arxiv","version":3}},"canonical_sha256":"67799d7147bd7505dc3771fd601f32fbf39b25821f30be8c0b03104b41dc18bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67799d7147bd7505dc3771fd601f32fbf39b25821f30be8c0b03104b41dc18bc","first_computed_at":"2026-05-17T23:44:23.386365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:23.386365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vKEgoQwdqqVqk7YN7r4o04naRm56rp2xjqtRqAPOworc8ZQ23wYGNkcnSZKX79l7rc1LhfRpH6EEbCGLwRWNAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:23.387063Z","signed_message":"canonical_sha256_bytes"},"source_id":"0709.1667","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:010df579db9b484e57b1b393419a3c1187b8be3f5e724f22ab1221d7ce1b7585","sha256:fcd2098ca483941e9b73a4ebd209ea6118219ebb6debd6a20776dec146ba8f0f"],"state_sha256":"b993d3f1f56e5235c20cee4742fe5b65bc9cb2bf39ca9b75883068c2d6220cfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YmxZ67Xd9WZ4WscjgEI8igUnZZPXF7Tc2RyNeEB4Eh5mDc9QSa6yfZg99pkWy5DoM8Hz+AZaZyTfUjkJyM9wBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:39:15.473993Z","bundle_sha256":"37b9585c57531019e5dccd797024ccd73c09b1dd159b60dbffbc45db3b041217"}}