{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4OXTAN7RVEIZOKMP4OKUIAV77J","short_pith_number":"pith:4OXTAN7R","schema_version":"1.0","canonical_sha256":"e3af3037f1a91197298fe3954402bffa47c62397150e6efe10c318016425e425","source":{"kind":"arxiv","id":"2508.02250","version":2},"attestation_state":"computed","paper":{"title":"Solving Sudoku using oscillatory neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cond-mat.dis-nn","authors_text":"Aida Todri-Sanial, Bram F. Haverkort, Federico Sbravati, Stefan Porfir","submitted_at":"2025-08-04T09:53:30Z","abstract_excerpt":"We explore the capabilities of physical computing with Oscillatory Neural Networks (ONN) to solve combinatorial optimization problems. To solve Sudokus with ONNs, we define a novel mapping strategy that utilizes the unique characteristics of the computation paradigm. The problem is encoded through a puzzle specific graph-embedding, which implements the constraints through different subgraphs. These subgraphs are then combined into a single adjacency matrix, which allows the natural dynamics of the phases of coupled oscillators to find a solution to the puzzle. We model the phase dynamics of th"},"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":"2508.02250","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2025-08-04T09:53:30Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"aeeaf6e708916633f2f2484bce7233aa25aa6157a000b698fbda5c2b7df877ea","abstract_canon_sha256":"4a927165897023c34cc50506e22c0bc9fec934f71b066ff5a3a7826eaa46dfe6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:19.558605Z","signature_b64":"QB9hMUcEPGwDM6eSxtlU4LND3/ScPm2cxXrwcF7Uw1/fxSNLOY9yOU/nFxBg4YyfZfg2rOxyqOEoTnD3FPHbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3af3037f1a91197298fe3954402bffa47c62397150e6efe10c318016425e425","last_reissued_at":"2026-07-08T01:18:19.558010Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:19.558010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Sudoku using oscillatory neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cond-mat.dis-nn","authors_text":"Aida Todri-Sanial, Bram F. Haverkort, Federico Sbravati, Stefan Porfir","submitted_at":"2025-08-04T09:53:30Z","abstract_excerpt":"We explore the capabilities of physical computing with Oscillatory Neural Networks (ONN) to solve combinatorial optimization problems. To solve Sudokus with ONNs, we define a novel mapping strategy that utilizes the unique characteristics of the computation paradigm. The problem is encoded through a puzzle specific graph-embedding, which implements the constraints through different subgraphs. These subgraphs are then combined into a single adjacency matrix, which allows the natural dynamics of the phases of coupled oscillators to find a solution to the puzzle. We model the phase dynamics of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.02250","kind":"arxiv","version":2},"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/2508.02250/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":"2508.02250","created_at":"2026-07-08T01:18:19.558076+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.02250v2","created_at":"2026-07-08T01:18:19.558076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.02250","created_at":"2026-07-08T01:18:19.558076+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OXTAN7RVEIZ","created_at":"2026-07-08T01:18:19.558076+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OXTAN7RVEIZOKMP","created_at":"2026-07-08T01:18:19.558076+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OXTAN7R","created_at":"2026-07-08T01:18:19.558076+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.02491","citing_title":"G-RRM: Guiding Symbolic Solvers with Recurrent Reasoning Models","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4OXTAN7RVEIZOKMP4OKUIAV77J","json":"https://pith.science/pith/4OXTAN7RVEIZOKMP4OKUIAV77J.json","graph_json":"https://pith.science/api/pith-number/4OXTAN7RVEIZOKMP4OKUIAV77J/graph.json","events_json":"https://pith.science/api/pith-number/4OXTAN7RVEIZOKMP4OKUIAV77J/events.json","paper":"https://pith.science/paper/4OXTAN7R"},"agent_actions":{"view_html":"https://pith.science/pith/4OXTAN7RVEIZOKMP4OKUIAV77J","download_json":"https://pith.science/pith/4OXTAN7RVEIZOKMP4OKUIAV77J.json","view_paper":"https://pith.science/paper/4OXTAN7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.02250&json=true","fetch_graph":"https://pith.science/api/pith-number/4OXTAN7RVEIZOKMP4OKUIAV77J/graph.json","fetch_events":"https://pith.science/api/pith-number/4OXTAN7RVEIZOKMP4OKUIAV77J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OXTAN7RVEIZOKMP4OKUIAV77J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OXTAN7RVEIZOKMP4OKUIAV77J/action/storage_attestation","attest_author":"https://pith.science/pith/4OXTAN7RVEIZOKMP4OKUIAV77J/action/author_attestation","sign_citation":"https://pith.science/pith/4OXTAN7RVEIZOKMP4OKUIAV77J/action/citation_signature","submit_replication":"https://pith.science/pith/4OXTAN7RVEIZOKMP4OKUIAV77J/action/replication_record"}},"created_at":"2026-07-08T01:18:19.558076+00:00","updated_at":"2026-07-08T01:18:19.558076+00:00"}