{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3T5EIVGOG3AKLURKDVLBJN7IGN","short_pith_number":"pith:3T5EIVGO","schema_version":"1.0","canonical_sha256":"dcfa4454ce36c0a5d22a1d5614b7e83366d7291266adc536cb69c7cad7b307fa","source":{"kind":"arxiv","id":"2401.16202","version":1},"attestation_state":"computed","paper":{"title":"FPIA: Field-Programmable Ising Arrays with In-Memory Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.AR","authors_text":"Dmitri B. Strukov, Ethan Sifferman, George Higgins Hutchinson, Tinish Bhattacharya","submitted_at":"2024-01-29T14:58:32Z","abstract_excerpt":"Ising Machine is a promising computing approach for solving combinatorial optimization problems. It is naturally suited for energy-saving and compact in-memory computing implementations with emerging memories. A na\\\"ive in-memory computing implementation of a quadratic Ising Machine requires an array of coupling weights that grows quadratically with problem size. However, the resources in such an approach are used inefficiently due to sparsity in practical optimization problems. We first show that this issue can be addressed by partitioning a coupling array into smaller sub-arrays. This techni"},"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":"2401.16202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-01-29T14:58:32Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"45b2d21e4bc7604c7d64981ea97040e2ef849178d03ebb77c74e67510c103665","abstract_canon_sha256":"27efacac710a309f3d861d3b57e154b2d3cafd710af167714a64cf783970813d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:45.658230Z","signature_b64":"fCdPW2aD028X7CHAxVQbMKP2calTf9VnT3B1q+9aBkd1g2Op/33qqRhNF0N9NAfEGGagcEG+yw6azw+M0YigDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcfa4454ce36c0a5d22a1d5614b7e83366d7291266adc536cb69c7cad7b307fa","last_reissued_at":"2026-07-05T07:38:45.657809Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:45.657809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FPIA: Field-Programmable Ising Arrays with In-Memory Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.AR","authors_text":"Dmitri B. Strukov, Ethan Sifferman, George Higgins Hutchinson, Tinish Bhattacharya","submitted_at":"2024-01-29T14:58:32Z","abstract_excerpt":"Ising Machine is a promising computing approach for solving combinatorial optimization problems. It is naturally suited for energy-saving and compact in-memory computing implementations with emerging memories. A na\\\"ive in-memory computing implementation of a quadratic Ising Machine requires an array of coupling weights that grows quadratically with problem size. However, the resources in such an approach are used inefficiently due to sparsity in practical optimization problems. We first show that this issue can be addressed by partitioning a coupling array into smaller sub-arrays. This techni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.16202","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/2401.16202/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":"2401.16202","created_at":"2026-07-05T07:38:45.657856+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.16202v1","created_at":"2026-07-05T07:38:45.657856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.16202","created_at":"2026-07-05T07:38:45.657856+00:00"},{"alias_kind":"pith_short_12","alias_value":"3T5EIVGOG3AK","created_at":"2026-07-05T07:38:45.657856+00:00"},{"alias_kind":"pith_short_16","alias_value":"3T5EIVGOG3AKLURK","created_at":"2026-07-05T07:38:45.657856+00:00"},{"alias_kind":"pith_short_8","alias_value":"3T5EIVGO","created_at":"2026-07-05T07:38:45.657856+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10463","citing_title":"Solving the compute crisis with physics-based ASICs","ref_index":92,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3T5EIVGOG3AKLURKDVLBJN7IGN","json":"https://pith.science/pith/3T5EIVGOG3AKLURKDVLBJN7IGN.json","graph_json":"https://pith.science/api/pith-number/3T5EIVGOG3AKLURKDVLBJN7IGN/graph.json","events_json":"https://pith.science/api/pith-number/3T5EIVGOG3AKLURKDVLBJN7IGN/events.json","paper":"https://pith.science/paper/3T5EIVGO"},"agent_actions":{"view_html":"https://pith.science/pith/3T5EIVGOG3AKLURKDVLBJN7IGN","download_json":"https://pith.science/pith/3T5EIVGOG3AKLURKDVLBJN7IGN.json","view_paper":"https://pith.science/paper/3T5EIVGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.16202&json=true","fetch_graph":"https://pith.science/api/pith-number/3T5EIVGOG3AKLURKDVLBJN7IGN/graph.json","fetch_events":"https://pith.science/api/pith-number/3T5EIVGOG3AKLURKDVLBJN7IGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3T5EIVGOG3AKLURKDVLBJN7IGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3T5EIVGOG3AKLURKDVLBJN7IGN/action/storage_attestation","attest_author":"https://pith.science/pith/3T5EIVGOG3AKLURKDVLBJN7IGN/action/author_attestation","sign_citation":"https://pith.science/pith/3T5EIVGOG3AKLURKDVLBJN7IGN/action/citation_signature","submit_replication":"https://pith.science/pith/3T5EIVGOG3AKLURKDVLBJN7IGN/action/replication_record"}},"created_at":"2026-07-05T07:38:45.657856+00:00","updated_at":"2026-07-05T07:38:45.657856+00:00"}