{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AKINUSG7LPRUG5OL7E3NF7WBD3","short_pith_number":"pith:AKINUSG7","schema_version":"1.0","canonical_sha256":"0290da48df5be34375cbf936d2fec11ec5a544037425ef080ea8d84296dfb2fd","source":{"kind":"arxiv","id":"2109.09897","version":1},"attestation_state":"computed","paper":{"title":"An Oscillator-based MaxSAT solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.app-ph"],"primary_cat":"cs.ET","authors_text":"Ahmedullah Aziz, Antik Mallick, Chonghan Lee, Feng Shi, Jaykumar Vaidya, Mohammad Khairul Bashar, Nazmul Amin, Nikhil Shukla, R S Surya Kanthi, Shamiul Alam, Vijaykrishnan Narayanan","submitted_at":"2021-09-21T00:44:39Z","abstract_excerpt":"The quest to solve hard combinatorial optimization problems efficiently -- still a longstanding challenge for traditional digital computers -- has inspired the exploration of many alternate computing models and platforms. As a case in point, oscillator networks offer a potentially promising energy efficient and scalable option. However, prior oscillator-based combinatorial optimization solvers have primarily focused on quadratic combinatorial optimization problems that consider only pairwise interaction among the oscillators. In this work, we propose a new computational model based on the maxi"},"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":"2109.09897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2021-09-21T00:44:39Z","cross_cats_sorted":["physics.app-ph"],"title_canon_sha256":"d0dda7b625852bf8fca87a434f3450342f4a6c267fafe918783a75e3bc646a84","abstract_canon_sha256":"33c3cc798df7362db1e72e611f1db9d26f5c7366f94926ea68d3feaae123d989"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:55.654611Z","signature_b64":"oH45ypJVnkX80AKHXDlfhFGE2VbZGdG2UfpKb8xc4vSR2/WkNUNJgQ78COMgJYRah5nABjRUqOdzOvaajgdzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0290da48df5be34375cbf936d2fec11ec5a544037425ef080ea8d84296dfb2fd","last_reissued_at":"2026-07-05T03:15:55.654126Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:55.654126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Oscillator-based MaxSAT solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.app-ph"],"primary_cat":"cs.ET","authors_text":"Ahmedullah Aziz, Antik Mallick, Chonghan Lee, Feng Shi, Jaykumar Vaidya, Mohammad Khairul Bashar, Nazmul Amin, Nikhil Shukla, R S Surya Kanthi, Shamiul Alam, Vijaykrishnan Narayanan","submitted_at":"2021-09-21T00:44:39Z","abstract_excerpt":"The quest to solve hard combinatorial optimization problems efficiently -- still a longstanding challenge for traditional digital computers -- has inspired the exploration of many alternate computing models and platforms. As a case in point, oscillator networks offer a potentially promising energy efficient and scalable option. However, prior oscillator-based combinatorial optimization solvers have primarily focused on quadratic combinatorial optimization problems that consider only pairwise interaction among the oscillators. In this work, we propose a new computational model based on the maxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09897","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/2109.09897/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":"2109.09897","created_at":"2026-07-05T03:15:55.654176+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.09897v1","created_at":"2026-07-05T03:15:55.654176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09897","created_at":"2026-07-05T03:15:55.654176+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKINUSG7LPRU","created_at":"2026-07-05T03:15:55.654176+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKINUSG7LPRUG5OL","created_at":"2026-07-05T03:15:55.654176+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKINUSG7","created_at":"2026-07-05T03:15:55.654176+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.20680","citing_title":"Overcoming Quadratic Hardware Scaling for a Fully Connected Digital Oscillatory Neural Network","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AKINUSG7LPRUG5OL7E3NF7WBD3","json":"https://pith.science/pith/AKINUSG7LPRUG5OL7E3NF7WBD3.json","graph_json":"https://pith.science/api/pith-number/AKINUSG7LPRUG5OL7E3NF7WBD3/graph.json","events_json":"https://pith.science/api/pith-number/AKINUSG7LPRUG5OL7E3NF7WBD3/events.json","paper":"https://pith.science/paper/AKINUSG7"},"agent_actions":{"view_html":"https://pith.science/pith/AKINUSG7LPRUG5OL7E3NF7WBD3","download_json":"https://pith.science/pith/AKINUSG7LPRUG5OL7E3NF7WBD3.json","view_paper":"https://pith.science/paper/AKINUSG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.09897&json=true","fetch_graph":"https://pith.science/api/pith-number/AKINUSG7LPRUG5OL7E3NF7WBD3/graph.json","fetch_events":"https://pith.science/api/pith-number/AKINUSG7LPRUG5OL7E3NF7WBD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKINUSG7LPRUG5OL7E3NF7WBD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKINUSG7LPRUG5OL7E3NF7WBD3/action/storage_attestation","attest_author":"https://pith.science/pith/AKINUSG7LPRUG5OL7E3NF7WBD3/action/author_attestation","sign_citation":"https://pith.science/pith/AKINUSG7LPRUG5OL7E3NF7WBD3/action/citation_signature","submit_replication":"https://pith.science/pith/AKINUSG7LPRUG5OL7E3NF7WBD3/action/replication_record"}},"created_at":"2026-07-05T03:15:55.654176+00:00","updated_at":"2026-07-05T03:15:55.654176+00:00"}