{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:PN4JFG2K6M5BZ5LJWXWMLUKZIP","short_pith_number":"pith:PN4JFG2K","canonical_record":{"source":{"id":"cond-mat/0512002","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2005-11-30T21:15:11Z","cross_cats_sorted":[],"title_canon_sha256":"b6dfb1c25d3f53df63908c101980e958fb7ba280cd650f1e7158ab7982df736f","abstract_canon_sha256":"bdabfe11ceb84be5fa8af878862e08e4d6fff34387f133d9adca405cd975b736"},"schema_version":"1.0"},"canonical_sha256":"7b78929b4af33a1cf569b5ecc5d15943ff2d9dcf8545bb3594f60c1556de5bf5","source":{"kind":"arxiv","id":"cond-mat/0512002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/0512002","created_at":"2026-07-04T16:54:56Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0512002v1","created_at":"2026-07-04T16:54:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0512002","created_at":"2026-07-04T16:54:56Z"},{"alias_kind":"pith_short_12","alias_value":"PN4JFG2K6M5B","created_at":"2026-07-04T16:54:56Z"},{"alias_kind":"pith_short_16","alias_value":"PN4JFG2K6M5BZ5LJ","created_at":"2026-07-04T16:54:56Z"},{"alias_kind":"pith_short_8","alias_value":"PN4JFG2K","created_at":"2026-07-04T16:54:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:PN4JFG2K6M5BZ5LJWXWMLUKZIP","target":"record","payload":{"canonical_record":{"source":{"id":"cond-mat/0512002","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2005-11-30T21:15:11Z","cross_cats_sorted":[],"title_canon_sha256":"b6dfb1c25d3f53df63908c101980e958fb7ba280cd650f1e7158ab7982df736f","abstract_canon_sha256":"bdabfe11ceb84be5fa8af878862e08e4d6fff34387f133d9adca405cd975b736"},"schema_version":"1.0"},"canonical_sha256":"7b78929b4af33a1cf569b5ecc5d15943ff2d9dcf8545bb3594f60c1556de5bf5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:54:56.531296Z","signature_b64":"3CHZ42Ivcy+3eazt9nKEHHEFpyUabNE7RDaJeie1gtnc/GBfuX6PF+YjREzKVrCmDU47N3m+8VvOsDClGHS0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b78929b4af33a1cf569b5ecc5d15943ff2d9dcf8545bb3594f60c1556de5bf5","last_reissued_at":"2026-07-04T16:54:56.530855Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:54:56.530855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cond-mat/0512002","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-07-04T16:54:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7cIqzLjN4mUSJO0Qzs4Cpm8MNove/RGiEbcjYkxExBu3DRs7RAivgbgxlni/H/L3MFOqw1qQfc3PleJaCFoBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T21:14:33.750054Z"},"content_sha256":"1530abdfa1dbf64fcdb075856945a27fb3d2de447eea51b52117d5f21f3942dd","schema_version":"1.0","event_id":"sha256:1530abdfa1dbf64fcdb075856945a27fb3d2de447eea51b52117d5f21f3942dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:PN4JFG2K6M5BZ5LJWXWMLUKZIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Survey-propagation decimation through distributed local computations","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Cyril FURTLEHNER, Joel Chavas, Marc Mezard, Riccardo Zecchina","submitted_at":"2005-11-30T21:15:11Z","abstract_excerpt":"We discuss the implementation of two distributed solvers of the random K-SAT problem, based on some development of the recently introduced survey-propagation (SP) algorithm. The first solver, called the \"SP diffusion algorithm\", diffuses as dynamical information the maximum bias over the system, so that variable nodes can decide to freeze in a self-organized way, each variable making its decision on the basis of purely local information. The second solver, called the \"SP reinforcement algorithm\", makes use of time-dependent external forcing messages on each variable, which let the variables ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0512002","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cond-mat/0512002/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T16:54:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j84ztMkHFCBKa7AJmH/tTrOm+03JfrWwhcoQK375cqfAqPcUz7qa/2bnpk30BEMZQKJYN/LvkUnsDbKJaqviAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T21:14:33.750547Z"},"content_sha256":"225f07892e4190a6cd03f6ff922d1675f5b7a59a39d22988a3ee39c6ecb315b1","schema_version":"1.0","event_id":"sha256:225f07892e4190a6cd03f6ff922d1675f5b7a59a39d22988a3ee39c6ecb315b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PN4JFG2K6M5BZ5LJWXWMLUKZIP/bundle.json","state_url":"https://pith.science/pith/PN4JFG2K6M5BZ5LJWXWMLUKZIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PN4JFG2K6M5BZ5LJWXWMLUKZIP/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-08-05T21:14:33Z","links":{"resolver":"https://pith.science/pith/PN4JFG2K6M5BZ5LJWXWMLUKZIP","bundle":"https://pith.science/pith/PN4JFG2K6M5BZ5LJWXWMLUKZIP/bundle.json","state":"https://pith.science/pith/PN4JFG2K6M5BZ5LJWXWMLUKZIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PN4JFG2K6M5BZ5LJWXWMLUKZIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:PN4JFG2K6M5BZ5LJWXWMLUKZIP","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":"bdabfe11ceb84be5fa8af878862e08e4d6fff34387f133d9adca405cd975b736","cross_cats_sorted":[],"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2005-11-30T21:15:11Z","title_canon_sha256":"b6dfb1c25d3f53df63908c101980e958fb7ba280cd650f1e7158ab7982df736f"},"schema_version":"1.0","source":{"id":"cond-mat/0512002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/0512002","created_at":"2026-07-04T16:54:56Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0512002v1","created_at":"2026-07-04T16:54:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0512002","created_at":"2026-07-04T16:54:56Z"},{"alias_kind":"pith_short_12","alias_value":"PN4JFG2K6M5B","created_at":"2026-07-04T16:54:56Z"},{"alias_kind":"pith_short_16","alias_value":"PN4JFG2K6M5BZ5LJ","created_at":"2026-07-04T16:54:56Z"},{"alias_kind":"pith_short_8","alias_value":"PN4JFG2K","created_at":"2026-07-04T16:54:56Z"}],"graph_snapshots":[{"event_id":"sha256:225f07892e4190a6cd03f6ff922d1675f5b7a59a39d22988a3ee39c6ecb315b1","target":"graph","created_at":"2026-07-04T16:54:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cond-mat/0512002/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We discuss the implementation of two distributed solvers of the random K-SAT problem, based on some development of the recently introduced survey-propagation (SP) algorithm. The first solver, called the \"SP diffusion algorithm\", diffuses as dynamical information the maximum bias over the system, so that variable nodes can decide to freeze in a self-organized way, each variable making its decision on the basis of purely local information. The second solver, called the \"SP reinforcement algorithm\", makes use of time-dependent external forcing messages on each variable, which let the variables ge","authors_text":"Cyril FURTLEHNER, Joel Chavas, Marc Mezard, Riccardo Zecchina","cross_cats":[],"headline":"","license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2005-11-30T21:15:11Z","title":"Survey-propagation decimation through distributed local computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0512002","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:1530abdfa1dbf64fcdb075856945a27fb3d2de447eea51b52117d5f21f3942dd","target":"record","created_at":"2026-07-04T16:54:56Z","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":"bdabfe11ceb84be5fa8af878862e08e4d6fff34387f133d9adca405cd975b736","cross_cats_sorted":[],"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2005-11-30T21:15:11Z","title_canon_sha256":"b6dfb1c25d3f53df63908c101980e958fb7ba280cd650f1e7158ab7982df736f"},"schema_version":"1.0","source":{"id":"cond-mat/0512002","kind":"arxiv","version":1}},"canonical_sha256":"7b78929b4af33a1cf569b5ecc5d15943ff2d9dcf8545bb3594f60c1556de5bf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b78929b4af33a1cf569b5ecc5d15943ff2d9dcf8545bb3594f60c1556de5bf5","first_computed_at":"2026-07-04T16:54:56.530855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T16:54:56.530855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3CHZ42Ivcy+3eazt9nKEHHEFpyUabNE7RDaJeie1gtnc/GBfuX6PF+YjREzKVrCmDU47N3m+8VvOsDClGHS0CA==","signature_status":"signed_v1","signed_at":"2026-07-04T16:54:56.531296Z","signed_message":"canonical_sha256_bytes"},"source_id":"cond-mat/0512002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1530abdfa1dbf64fcdb075856945a27fb3d2de447eea51b52117d5f21f3942dd","sha256:225f07892e4190a6cd03f6ff922d1675f5b7a59a39d22988a3ee39c6ecb315b1"],"state_sha256":"6848848de78f4b5f1a5f81aec907cc3728e66d642d72e81f3d1235f1314e7fd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Mpuh7ysJU/RJen23W7P9AXdfOq1AMvk677vIeCM5iRmJ1B8NhtW4AY20i1iQdLuzTyi3LK03WlTQ/hnETz7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T21:14:33.755766Z","bundle_sha256":"aa01cdc060fbcd00d3c698ab6d155edc3d6b37ea1358a42bf49e1e750fa649a8"}}