{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FM36FEYFSY3MZIUSBKEGE5NLBT","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":"7166f31981d35915370501d402137ecd87122337d001b1028f26240c336f84a8","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2025-07-30T05:30:46Z","title_canon_sha256":"d76371d5be3277f11accfc6df3ab928847073de6c9460ba13090e14c7746927b"},"schema_version":"1.0","source":{"id":"2507.22396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.22396","created_at":"2026-07-05T11:45:41Z"},{"alias_kind":"arxiv_version","alias_value":"2507.22396v1","created_at":"2026-07-05T11:45:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22396","created_at":"2026-07-05T11:45:41Z"},{"alias_kind":"pith_short_12","alias_value":"FM36FEYFSY3M","created_at":"2026-07-05T11:45:41Z"},{"alias_kind":"pith_short_16","alias_value":"FM36FEYFSY3MZIUS","created_at":"2026-07-05T11:45:41Z"},{"alias_kind":"pith_short_8","alias_value":"FM36FEYF","created_at":"2026-07-05T11:45:41Z"}],"graph_snapshots":[{"event_id":"sha256:948b49cf730fdc12bbe681d3fefaeec0ee34598f177f7c73b46623c124363f07","target":"graph","created_at":"2026-07-05T11:45:41Z","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/2507.22396/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study algorithmic aspects of finding $n$-dimensional \\emph{positive} and \\emph{negative} Hopfield ($\\pm$Hop) model ground state free energies. This corresponds to classical maximization of random positive/negative semi-definite quadratic forms over binary $\\left \\{\\pm \\frac{1}{\\sqrt{n}} \\right \\}^n$ vectors. The key algorithmic question is whether these problems can be computationally efficiently approximated within a factor $\\approx 1$. Following the introduction and success of \\emph{Controlled Loosening-up} (CLuP-SK) algorithms in finding near ground state energies of closely related Sher","authors_text":"Mihailo Stojnic","cross_cats":["cs.IT","math.IT","math.OC","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2025-07-30T05:30:46Z","title":"CLuP practically achieves $\\sim 1.77$ positive and $\\sim 0.33$ negative Hopfield model ground state free energy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22396","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:f47e64a5ea493fe2bac1e7fb62d8b97680c2301509f825679cfa01f20b90c6e3","target":"record","created_at":"2026-07-05T11:45:41Z","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":"7166f31981d35915370501d402137ecd87122337d001b1028f26240c336f84a8","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2025-07-30T05:30:46Z","title_canon_sha256":"d76371d5be3277f11accfc6df3ab928847073de6c9460ba13090e14c7746927b"},"schema_version":"1.0","source":{"id":"2507.22396","kind":"arxiv","version":1}},"canonical_sha256":"2b37e293059636cca2920a886275ab0cff875d4f7ac2c10ea554d50c880f2141","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b37e293059636cca2920a886275ab0cff875d4f7ac2c10ea554d50c880f2141","first_computed_at":"2026-07-05T11:45:41.212620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:45:41.212620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UL0ZoUfaTRwMIxxwRyTrIAQ7dDV0ucM1zVs1vMch+bedFwvv4B/e7DZ9v2apAR0h4XslmWHVSEKVS3ogUb4oDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:45:41.213115Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.22396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f47e64a5ea493fe2bac1e7fb62d8b97680c2301509f825679cfa01f20b90c6e3","sha256:948b49cf730fdc12bbe681d3fefaeec0ee34598f177f7c73b46623c124363f07"],"state_sha256":"4b9445592b75cf30ff5e7c9954a1d6242b31a36eb3ed11d7887cb540407265de"}