{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FM36FEYFSY3MZIUSBKEGE5NLBT","short_pith_number":"pith:FM36FEYF","schema_version":"1.0","canonical_sha256":"2b37e293059636cca2920a886275ab0cff875d4f7ac2c10ea554d50c880f2141","source":{"kind":"arxiv","id":"2507.22396","version":1},"attestation_state":"computed","paper":{"title":"CLuP practically achieves $\\sim 1.77$ positive and $\\sim 0.33$ negative Hopfield model ground state free energy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","stat.ML"],"primary_cat":"cond-mat.dis-nn","authors_text":"Mihailo Stojnic","submitted_at":"2025-07-30T05:30:46Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.22396","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2025-07-30T05:30:46Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"title_canon_sha256":"d76371d5be3277f11accfc6df3ab928847073de6c9460ba13090e14c7746927b","abstract_canon_sha256":"7166f31981d35915370501d402137ecd87122337d001b1028f26240c336f84a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:41.213115Z","signature_b64":"UL0ZoUfaTRwMIxxwRyTrIAQ7dDV0ucM1zVs1vMch+bedFwvv4B/e7DZ9v2apAR0h4XslmWHVSEKVS3ogUb4oDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b37e293059636cca2920a886275ab0cff875d4f7ac2c10ea554d50c880f2141","last_reissued_at":"2026-07-05T11:45:41.212620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:41.212620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CLuP practically achieves $\\sim 1.77$ positive and $\\sim 0.33$ negative Hopfield model ground state free energy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","stat.ML"],"primary_cat":"cond-mat.dis-nn","authors_text":"Mihailo Stojnic","submitted_at":"2025-07-30T05:30:46Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22396","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/2507.22396/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.22396","created_at":"2026-07-05T11:45:41.212680+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.22396v1","created_at":"2026-07-05T11:45:41.212680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22396","created_at":"2026-07-05T11:45:41.212680+00:00"},{"alias_kind":"pith_short_12","alias_value":"FM36FEYFSY3M","created_at":"2026-07-05T11:45:41.212680+00:00"},{"alias_kind":"pith_short_16","alias_value":"FM36FEYFSY3MZIUS","created_at":"2026-07-05T11:45:41.212680+00:00"},{"alias_kind":"pith_short_8","alias_value":"FM36FEYF","created_at":"2026-07-05T11:45:41.212680+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19712","citing_title":"Ultrametric OGP - parametric RDT \\emph{symmetric} binary perceptron connection","ref_index":98,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FM36FEYFSY3MZIUSBKEGE5NLBT","json":"https://pith.science/pith/FM36FEYFSY3MZIUSBKEGE5NLBT.json","graph_json":"https://pith.science/api/pith-number/FM36FEYFSY3MZIUSBKEGE5NLBT/graph.json","events_json":"https://pith.science/api/pith-number/FM36FEYFSY3MZIUSBKEGE5NLBT/events.json","paper":"https://pith.science/paper/FM36FEYF"},"agent_actions":{"view_html":"https://pith.science/pith/FM36FEYFSY3MZIUSBKEGE5NLBT","download_json":"https://pith.science/pith/FM36FEYFSY3MZIUSBKEGE5NLBT.json","view_paper":"https://pith.science/paper/FM36FEYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.22396&json=true","fetch_graph":"https://pith.science/api/pith-number/FM36FEYFSY3MZIUSBKEGE5NLBT/graph.json","fetch_events":"https://pith.science/api/pith-number/FM36FEYFSY3MZIUSBKEGE5NLBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FM36FEYFSY3MZIUSBKEGE5NLBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FM36FEYFSY3MZIUSBKEGE5NLBT/action/storage_attestation","attest_author":"https://pith.science/pith/FM36FEYFSY3MZIUSBKEGE5NLBT/action/author_attestation","sign_citation":"https://pith.science/pith/FM36FEYFSY3MZIUSBKEGE5NLBT/action/citation_signature","submit_replication":"https://pith.science/pith/FM36FEYFSY3MZIUSBKEGE5NLBT/action/replication_record"}},"created_at":"2026-07-05T11:45:41.212680+00:00","updated_at":"2026-07-05T11:45:41.212680+00:00"}