{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:INDADAMHN5W2OYNPKZF43MHPL3","short_pith_number":"pith:INDADAMH","schema_version":"1.0","canonical_sha256":"43460181876f6da761af564bcdb0ef5ee0f2c23989349b8984043fdbbf4cbdf9","source":{"kind":"arxiv","id":"math-ph/0407078","version":1},"attestation_state":"computed","paper":{"title":"Finding Minima in Complex Landscapes: Annealed, Greedy and Reluctant Algorithms","license":"","headline":"","cross_cats":["cs.NA","math.MP","math.NA"],"primary_cat":"math-ph","authors_text":"Cecilia Vernia, Claudio Giberti, Cristian Giardina', Pierluigi Contucci","submitted_at":"2004-07-30T12:48:46Z","abstract_excerpt":"We consider optimization problems for complex systems in which the cost function has a multivalleyed landscape. We introduce a new class of dynamical algorithms which, using a suitable annealing procedure coupled with a balanced greedy-reluctant strategy drive the systems towards the deepest minimum of the cost function. Results are presented for the Sherrington-Kirkpatrick model of spin-glasses."},"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":"math-ph/0407078","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math-ph","submitted_at":"2004-07-30T12:48:46Z","cross_cats_sorted":["cs.NA","math.MP","math.NA"],"title_canon_sha256":"f00ebf54d58cb1bfd5e32e4ca4d5ddfad32f7f7457814a58cf3e32e27898cc09","abstract_canon_sha256":"e65b6458fd7cfd901501b504e7350571579e17e2aceba3a00e46d5f42b574b8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:14.720424Z","signature_b64":"urILcY+8k4jTKqU/LH7kqaVsI/7NdlHDu1Kxl7OOh4SbUhQSH6gRGurBN21AgWUBCW1AEJLnnwI1VXG6NQydBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43460181876f6da761af564bcdb0ef5ee0f2c23989349b8984043fdbbf4cbdf9","last_reissued_at":"2026-06-03T22:06:14.719947Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:14.719947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Minima in Complex Landscapes: Annealed, Greedy and Reluctant Algorithms","license":"","headline":"","cross_cats":["cs.NA","math.MP","math.NA"],"primary_cat":"math-ph","authors_text":"Cecilia Vernia, Claudio Giberti, Cristian Giardina', Pierluigi Contucci","submitted_at":"2004-07-30T12:48:46Z","abstract_excerpt":"We consider optimization problems for complex systems in which the cost function has a multivalleyed landscape. We introduce a new class of dynamical algorithms which, using a suitable annealing procedure coupled with a balanced greedy-reluctant strategy drive the systems towards the deepest minimum of the cost function. Results are presented for the Sherrington-Kirkpatrick model of spin-glasses."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math-ph/0407078","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/math-ph/0407078/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":"math-ph/0407078","created_at":"2026-06-03T22:06:14.720011+00:00"},{"alias_kind":"arxiv_version","alias_value":"math-ph/0407078v1","created_at":"2026-06-03T22:06:14.720011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math-ph/0407078","created_at":"2026-06-03T22:06:14.720011+00:00"},{"alias_kind":"pith_short_12","alias_value":"INDADAMHN5W2","created_at":"2026-06-03T22:06:14.720011+00:00"},{"alias_kind":"pith_short_16","alias_value":"INDADAMHN5W2OYNP","created_at":"2026-06-03T22:06:14.720011+00:00"},{"alias_kind":"pith_short_8","alias_value":"INDADAMH","created_at":"2026-06-03T22:06:14.720011+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/INDADAMHN5W2OYNPKZF43MHPL3","json":"https://pith.science/pith/INDADAMHN5W2OYNPKZF43MHPL3.json","graph_json":"https://pith.science/api/pith-number/INDADAMHN5W2OYNPKZF43MHPL3/graph.json","events_json":"https://pith.science/api/pith-number/INDADAMHN5W2OYNPKZF43MHPL3/events.json","paper":"https://pith.science/paper/INDADAMH"},"agent_actions":{"view_html":"https://pith.science/pith/INDADAMHN5W2OYNPKZF43MHPL3","download_json":"https://pith.science/pith/INDADAMHN5W2OYNPKZF43MHPL3.json","view_paper":"https://pith.science/paper/INDADAMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math-ph/0407078&json=true","fetch_graph":"https://pith.science/api/pith-number/INDADAMHN5W2OYNPKZF43MHPL3/graph.json","fetch_events":"https://pith.science/api/pith-number/INDADAMHN5W2OYNPKZF43MHPL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INDADAMHN5W2OYNPKZF43MHPL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INDADAMHN5W2OYNPKZF43MHPL3/action/storage_attestation","attest_author":"https://pith.science/pith/INDADAMHN5W2OYNPKZF43MHPL3/action/author_attestation","sign_citation":"https://pith.science/pith/INDADAMHN5W2OYNPKZF43MHPL3/action/citation_signature","submit_replication":"https://pith.science/pith/INDADAMHN5W2OYNPKZF43MHPL3/action/replication_record"}},"created_at":"2026-06-03T22:06:14.720011+00:00","updated_at":"2026-06-03T22:06:14.720011+00:00"}