{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UUPXSI4YJXRYIZW5OLAPBZGBDO","short_pith_number":"pith:UUPXSI4Y","schema_version":"1.0","canonical_sha256":"a51f7923984de38466dd72c0f0e4c11ba76c853ce32ac218b1ad4e214fcf1a55","source":{"kind":"arxiv","id":"2201.12858","version":1},"attestation_state":"computed","paper":{"title":"Spintronics-compatible approach to solving maximum satisfiability problems with probabilistic computing, invertible logic and parallel tempering","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.mes-hall","authors_text":"Andrea Grimaldi, Giovanni Finocchio, Kerem Camsari, Luis S\\'anchez-Tejerina1, Mario Carpentieri, Navid Anjum Aadit, Stefano Chiappini","submitted_at":"2022-01-30T16:05:23Z","abstract_excerpt":"The search of hardware-compatible strategies for solving NP-hard combinatorial optimization problems (COPs) is an important challenge of today s computing research because of their wide range of applications in real world optimization problems. Here, we introduce an unconventional scalable approach to face maximum satisfiability problems (Max-SAT) which combines probabilistic computing with p-bits, parallel tempering, and the concept of invertible logic gates. We theoretically show the spintronic implementation of this approach based on a coupled set of Landau-Lifshitz-Gilbert equations, showi"},"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":"2201.12858","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cond-mat.mes-hall","submitted_at":"2022-01-30T16:05:23Z","cross_cats_sorted":[],"title_canon_sha256":"9560820104724d9014b145b1a31048557a7c3ddc7d22a955ea376535f74c1777","abstract_canon_sha256":"fed518a9586f64e5ddce775378086fe47f5eddef5f2e5feaccd8764f1d7b4bec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:59:27.534010Z","signature_b64":"WF1S5b1vyaGiy8H8bknZWNiqt3F3cc2OeY8OBlGuO7+54J8EpJ7UjPHgIPD3lK0eKXCFq6+cIoayqJYpC0QyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a51f7923984de38466dd72c0f0e4c11ba76c853ce32ac218b1ad4e214fcf1a55","last_reissued_at":"2026-07-05T03:59:27.533567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:59:27.533567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spintronics-compatible approach to solving maximum satisfiability problems with probabilistic computing, invertible logic and parallel tempering","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.mes-hall","authors_text":"Andrea Grimaldi, Giovanni Finocchio, Kerem Camsari, Luis S\\'anchez-Tejerina1, Mario Carpentieri, Navid Anjum Aadit, Stefano Chiappini","submitted_at":"2022-01-30T16:05:23Z","abstract_excerpt":"The search of hardware-compatible strategies for solving NP-hard combinatorial optimization problems (COPs) is an important challenge of today s computing research because of their wide range of applications in real world optimization problems. Here, we introduce an unconventional scalable approach to face maximum satisfiability problems (Max-SAT) which combines probabilistic computing with p-bits, parallel tempering, and the concept of invertible logic gates. We theoretically show the spintronic implementation of this approach based on a coupled set of Landau-Lifshitz-Gilbert equations, showi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12858","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/2201.12858/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":"2201.12858","created_at":"2026-07-05T03:59:27.533625+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12858v1","created_at":"2026-07-05T03:59:27.533625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12858","created_at":"2026-07-05T03:59:27.533625+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUPXSI4YJXRY","created_at":"2026-07-05T03:59:27.533625+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUPXSI4YJXRYIZW5","created_at":"2026-07-05T03:59:27.533625+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUPXSI4Y","created_at":"2026-07-05T03:59:27.533625+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/UUPXSI4YJXRYIZW5OLAPBZGBDO","json":"https://pith.science/pith/UUPXSI4YJXRYIZW5OLAPBZGBDO.json","graph_json":"https://pith.science/api/pith-number/UUPXSI4YJXRYIZW5OLAPBZGBDO/graph.json","events_json":"https://pith.science/api/pith-number/UUPXSI4YJXRYIZW5OLAPBZGBDO/events.json","paper":"https://pith.science/paper/UUPXSI4Y"},"agent_actions":{"view_html":"https://pith.science/pith/UUPXSI4YJXRYIZW5OLAPBZGBDO","download_json":"https://pith.science/pith/UUPXSI4YJXRYIZW5OLAPBZGBDO.json","view_paper":"https://pith.science/paper/UUPXSI4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12858&json=true","fetch_graph":"https://pith.science/api/pith-number/UUPXSI4YJXRYIZW5OLAPBZGBDO/graph.json","fetch_events":"https://pith.science/api/pith-number/UUPXSI4YJXRYIZW5OLAPBZGBDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUPXSI4YJXRYIZW5OLAPBZGBDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUPXSI4YJXRYIZW5OLAPBZGBDO/action/storage_attestation","attest_author":"https://pith.science/pith/UUPXSI4YJXRYIZW5OLAPBZGBDO/action/author_attestation","sign_citation":"https://pith.science/pith/UUPXSI4YJXRYIZW5OLAPBZGBDO/action/citation_signature","submit_replication":"https://pith.science/pith/UUPXSI4YJXRYIZW5OLAPBZGBDO/action/replication_record"}},"created_at":"2026-07-05T03:59:27.533625+00:00","updated_at":"2026-07-05T03:59:27.533625+00:00"}