{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6N7QIRJ77Q4HNSODANQQVMTVKL","short_pith_number":"pith:6N7QIRJ7","canonical_record":{"source":{"id":"1508.05117","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-20T20:41:29Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"e5b7eebdadfc4390234cc64d60d811999775f23c0fb6848cc71b75770504932d","abstract_canon_sha256":"ad5dce25e7774bb0463fc6140302396b5504eb96bf5bbc5b0afd92737bea72fd"},"schema_version":"1.0"},"canonical_sha256":"f37f04453ffc3876c9c303610ab27552cb03a301506a4453f52fa9ab4fb52317","source":{"kind":"arxiv","id":"1508.05117","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05117","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05117v4","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05117","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"6N7QIRJ77Q4H","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6N7QIRJ77Q4HNSOD","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6N7QIRJ7","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6N7QIRJ77Q4HNSODANQQVMTVKL","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05117","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-20T20:41:29Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"e5b7eebdadfc4390234cc64d60d811999775f23c0fb6848cc71b75770504932d","abstract_canon_sha256":"ad5dce25e7774bb0463fc6140302396b5504eb96bf5bbc5b0afd92737bea72fd"},"schema_version":"1.0"},"canonical_sha256":"f37f04453ffc3876c9c303610ab27552cb03a301506a4453f52fa9ab4fb52317","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:08.904714Z","signature_b64":"fgtDkLju+yMbW8xObrnhf4wKEFevaW921oO2gZe6LJLGVidvLuO5kDLCE9w6Eenql/WZtDSDQLkqbASJvmp7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f37f04453ffc3876c9c303610ab27552cb03a301506a4453f52fa9ab4fb52317","last_reissued_at":"2026-05-17T23:58:08.904027Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:08.904027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05117","source_version":4,"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:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D53IjGk6f5S0aIf0MZobRw/LfQzCD4PPiwyzJ+ZkfcqQg9M+z3pxGyW1CLAqXp73mcXm2bUVZGETNBNX+NQRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:01:43.996813Z"},"content_sha256":"76a40eaaf6b839f88df17961a9f447fbab483645838f836895f130da0aa8b103","schema_version":"1.0","event_id":"sha256:76a40eaaf6b839f88df17961a9f447fbab483645838f836895f130da0aa8b103"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6N7QIRJ77Q4HNSODANQQVMTVKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The backtracking survey propagation algorithm for solving random K-SAT problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.CC","authors_text":"Federico Ricci-Tersenghi, Giorgio Parisi, Raffaele Marino","submitted_at":"2015-08-20T20:41:29Z","abstract_excerpt":"Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances. Moreover, it is still unclear what are the key features that make a discrete combinatorial optimization problem hard to solve. Here we study random K-satisfiability problems with $K=3,4$, which are known to be very hard close to the SAT-UNSAT threshold, where problems stop having solutions. We show that the backtracking survey propagation algorithm, in a time practically linear in the problem size, is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05117","kind":"arxiv","version":4},"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:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASxP2uuFfBeMXDSPRfktuFtoB7MAM6QxvDNRaxor/yVzP8E/eBKv859hXT9Yk1uBBjHRJwp65pE77e1NbQkZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:01:43.997153Z"},"content_sha256":"794d2fc3d0c111eda7e7f6dc70349a12b194f25b615a139e926d3dd44067a633","schema_version":"1.0","event_id":"sha256:794d2fc3d0c111eda7e7f6dc70349a12b194f25b615a139e926d3dd44067a633"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6N7QIRJ77Q4HNSODANQQVMTVKL/bundle.json","state_url":"https://pith.science/pith/6N7QIRJ77Q4HNSODANQQVMTVKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6N7QIRJ77Q4HNSODANQQVMTVKL/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-08T15:01:43Z","links":{"resolver":"https://pith.science/pith/6N7QIRJ77Q4HNSODANQQVMTVKL","bundle":"https://pith.science/pith/6N7QIRJ77Q4HNSODANQQVMTVKL/bundle.json","state":"https://pith.science/pith/6N7QIRJ77Q4HNSODANQQVMTVKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6N7QIRJ77Q4HNSODANQQVMTVKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6N7QIRJ77Q4HNSODANQQVMTVKL","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":"ad5dce25e7774bb0463fc6140302396b5504eb96bf5bbc5b0afd92737bea72fd","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-20T20:41:29Z","title_canon_sha256":"e5b7eebdadfc4390234cc64d60d811999775f23c0fb6848cc71b75770504932d"},"schema_version":"1.0","source":{"id":"1508.05117","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05117","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05117v4","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05117","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"6N7QIRJ77Q4H","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6N7QIRJ77Q4HNSOD","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6N7QIRJ7","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:794d2fc3d0c111eda7e7f6dc70349a12b194f25b615a139e926d3dd44067a633","target":"graph","created_at":"2026-05-17T23:58:08Z","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":"Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances. Moreover, it is still unclear what are the key features that make a discrete combinatorial optimization problem hard to solve. Here we study random K-satisfiability problems with $K=3,4$, which are known to be very hard close to the SAT-UNSAT threshold, where problems stop having solutions. We show that the backtracking survey propagation algorithm, in a time practically linear in the problem size, is","authors_text":"Federico Ricci-Tersenghi, Giorgio Parisi, Raffaele Marino","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-20T20:41:29Z","title":"The backtracking survey propagation algorithm for solving random K-SAT problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05117","kind":"arxiv","version":4},"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:76a40eaaf6b839f88df17961a9f447fbab483645838f836895f130da0aa8b103","target":"record","created_at":"2026-05-17T23:58:08Z","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":"ad5dce25e7774bb0463fc6140302396b5504eb96bf5bbc5b0afd92737bea72fd","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-20T20:41:29Z","title_canon_sha256":"e5b7eebdadfc4390234cc64d60d811999775f23c0fb6848cc71b75770504932d"},"schema_version":"1.0","source":{"id":"1508.05117","kind":"arxiv","version":4}},"canonical_sha256":"f37f04453ffc3876c9c303610ab27552cb03a301506a4453f52fa9ab4fb52317","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f37f04453ffc3876c9c303610ab27552cb03a301506a4453f52fa9ab4fb52317","first_computed_at":"2026-05-17T23:58:08.904027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:08.904027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fgtDkLju+yMbW8xObrnhf4wKEFevaW921oO2gZe6LJLGVidvLuO5kDLCE9w6Eenql/WZtDSDQLkqbASJvmp7Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:08.904714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05117","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76a40eaaf6b839f88df17961a9f447fbab483645838f836895f130da0aa8b103","sha256:794d2fc3d0c111eda7e7f6dc70349a12b194f25b615a139e926d3dd44067a633"],"state_sha256":"eaeeea8c754e029cc8e3ecd09273fd98343bca266ecc9a75fd712e5fae4bd3c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ry5sacuHpHOmGSsRYq4txw3vVharzYCSmmouDBLrxmGAQkub0Y6jd8oy+CWS+qPer4Bnh693HwOsE5OGhmKBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:01:43.999031Z","bundle_sha256":"e6999dda57035bae867f1ea88f2fafec8b0136a116426703c6649772da42e547"}}