{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MCDS7V4AQ564JTZFFKZ4CIDWIE","short_pith_number":"pith:MCDS7V4A","canonical_record":{"source":{"id":"1602.08519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T11:32:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b9c6da01c05413e294f454bf2c5535da0ec0b96661e261e5db74ce2d8841dbbb","abstract_canon_sha256":"3ef2406f0507affd3bad6563b02beeb16f9dacfd25fa03b4464d4be104d98fe1"},"schema_version":"1.0"},"canonical_sha256":"60872fd780877dc4cf252ab3c1207641023fe655f1f14348f95b284d5724f9d8","source":{"kind":"arxiv","id":"1602.08519","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08519","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08519v1","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08519","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"MCDS7V4AQ564","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MCDS7V4AQ564JTZF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MCDS7V4A","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MCDS7V4AQ564JTZFFKZ4CIDWIE","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T11:32:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b9c6da01c05413e294f454bf2c5535da0ec0b96661e261e5db74ce2d8841dbbb","abstract_canon_sha256":"3ef2406f0507affd3bad6563b02beeb16f9dacfd25fa03b4464d4be104d98fe1"},"schema_version":"1.0"},"canonical_sha256":"60872fd780877dc4cf252ab3c1207641023fe655f1f14348f95b284d5724f9d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:52.627361Z","signature_b64":"IrLbR371ctBYgqT/W/O6gRRN7HxBc4L8F9fwcT12VNYDZWorNh6YWRvc+i+ZUk8kwVfKwZ+xT0jD/mXyCwAGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60872fd780877dc4cf252ab3c1207641023fe655f1f14348f95b284d5724f9d8","last_reissued_at":"2026-05-18T01:19:52.626902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:52.626902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08519","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-18T01:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4MdUz6zTiulfBuEvcUMpB9n3OhX6KTzWZzUtNartJmdSZqD8ZvzkCtXkopZVst7WBbzfpAQfCjCTGLy1io5pAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:56:07.533658Z"},"content_sha256":"ef9f9ceb3190aeae45b8807ba826e347db677bca175a9af2f97202a5f6195648","schema_version":"1.0","event_id":"sha256:ef9f9ceb3190aeae45b8807ba826e347db677bca175a9af2f97202a5f6195648"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MCDS7V4AQ564JTZFFKZ4CIDWIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysing Survey Propagation Guided Decimation on Random Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Samuel Hetterich","submitted_at":"2016-02-22T11:32:25Z","abstract_excerpt":"Let $\\varPhi$ be a uniformly distributed random $k$-SAT formula with $n$ variables and $m$ clauses. For clauses/variables ratio $m/n \\leq r_{k\\text{-SAT}} \\sim 2^k\\ln2$ the formula $\\varPhi$ is satisfiable with high probability. However, no efficient algorithm is known to provably find a satisfying assignment beyond $m/n \\sim 2k \\ln(k)/k$ with a non-vanishing probability. Non-rigorous statistical mechanics work on $k$-CNF led to the development of a new efficient \"message passing algorithm\" called \\emph{Survey Propagation Guided Decimation} [M\\'ezard et al., Science 2002]. Experiments conducte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08519","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-18T01:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSpF1/HOfrb8hQVqZNs/eEklToEtuJcjfTWzVRa8Bm57SXjCa1Ju832FCAfmKrp4myNF83aBuG3Gtx32If+vAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:56:07.534004Z"},"content_sha256":"44df4697e9dabb3816befdf150fb3fb8226179eab429e193304a40d8de8b1c07","schema_version":"1.0","event_id":"sha256:44df4697e9dabb3816befdf150fb3fb8226179eab429e193304a40d8de8b1c07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCDS7V4AQ564JTZFFKZ4CIDWIE/bundle.json","state_url":"https://pith.science/pith/MCDS7V4AQ564JTZFFKZ4CIDWIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCDS7V4AQ564JTZFFKZ4CIDWIE/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-03T06:56:07Z","links":{"resolver":"https://pith.science/pith/MCDS7V4AQ564JTZFFKZ4CIDWIE","bundle":"https://pith.science/pith/MCDS7V4AQ564JTZFFKZ4CIDWIE/bundle.json","state":"https://pith.science/pith/MCDS7V4AQ564JTZFFKZ4CIDWIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCDS7V4AQ564JTZFFKZ4CIDWIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MCDS7V4AQ564JTZFFKZ4CIDWIE","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":"3ef2406f0507affd3bad6563b02beeb16f9dacfd25fa03b4464d4be104d98fe1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T11:32:25Z","title_canon_sha256":"b9c6da01c05413e294f454bf2c5535da0ec0b96661e261e5db74ce2d8841dbbb"},"schema_version":"1.0","source":{"id":"1602.08519","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08519","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08519v1","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08519","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"MCDS7V4AQ564","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MCDS7V4AQ564JTZF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MCDS7V4A","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:44df4697e9dabb3816befdf150fb3fb8226179eab429e193304a40d8de8b1c07","target":"graph","created_at":"2026-05-18T01:19:52Z","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":"Let $\\varPhi$ be a uniformly distributed random $k$-SAT formula with $n$ variables and $m$ clauses. For clauses/variables ratio $m/n \\leq r_{k\\text{-SAT}} \\sim 2^k\\ln2$ the formula $\\varPhi$ is satisfiable with high probability. However, no efficient algorithm is known to provably find a satisfying assignment beyond $m/n \\sim 2k \\ln(k)/k$ with a non-vanishing probability. Non-rigorous statistical mechanics work on $k$-CNF led to the development of a new efficient \"message passing algorithm\" called \\emph{Survey Propagation Guided Decimation} [M\\'ezard et al., Science 2002]. Experiments conducte","authors_text":"Samuel Hetterich","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T11:32:25Z","title":"Analysing Survey Propagation Guided Decimation on Random Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08519","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:ef9f9ceb3190aeae45b8807ba826e347db677bca175a9af2f97202a5f6195648","target":"record","created_at":"2026-05-18T01:19:52Z","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":"3ef2406f0507affd3bad6563b02beeb16f9dacfd25fa03b4464d4be104d98fe1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T11:32:25Z","title_canon_sha256":"b9c6da01c05413e294f454bf2c5535da0ec0b96661e261e5db74ce2d8841dbbb"},"schema_version":"1.0","source":{"id":"1602.08519","kind":"arxiv","version":1}},"canonical_sha256":"60872fd780877dc4cf252ab3c1207641023fe655f1f14348f95b284d5724f9d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60872fd780877dc4cf252ab3c1207641023fe655f1f14348f95b284d5724f9d8","first_computed_at":"2026-05-18T01:19:52.626902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:52.626902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IrLbR371ctBYgqT/W/O6gRRN7HxBc4L8F9fwcT12VNYDZWorNh6YWRvc+i+ZUk8kwVfKwZ+xT0jD/mXyCwAGBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:52.627361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08519","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef9f9ceb3190aeae45b8807ba826e347db677bca175a9af2f97202a5f6195648","sha256:44df4697e9dabb3816befdf150fb3fb8226179eab429e193304a40d8de8b1c07"],"state_sha256":"36cafd91656bca47c151b2fa9bbc746b13b6beeb92f8ec500c6e5082a045edf8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhvRIY331Sx6TP+LZlVJTsBblt0yE4zSneQm8UbJVEXVxX3mbGNbWI0j+caWNFuTea6U2Z/T9VJDXjduBakUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:56:07.535918Z","bundle_sha256":"7f637b422a84063692d6633d39d206dbe1b5ee892f0b3cdc9f0855762d9d36ac"}}