{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WJW5QXOYRTZ6TUMTFYC27XYI2Q","short_pith_number":"pith:WJW5QXOY","schema_version":"1.0","canonical_sha256":"b26dd85dd88cf3e9d1932e05afdf08d413eff6b78efbf31a3a3e406a01f2c7bb","source":{"kind":"arxiv","id":"2403.06436","version":2},"attestation_state":"computed","paper":{"title":"Designing a K-state P-bit Engine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","physics.app-ph"],"primary_cat":"cs.ET","authors_text":"Abir Hasan, Mohammad Khairul Bashar, Nikhil Shukla","submitted_at":"2024-03-11T05:09:44Z","abstract_excerpt":"Probabilistic bit (p-bit)-based compute engines utilize the unique capability of a p-bit to probabilistically switch between two states to solve computationally challenging problems. However, when solving problems that require more than two states (e.g., problems such as Max-3-Cut, verifying if a graph is K-partite (K>2) etc.), additional pre-processing steps such as graph reduction are required to make the problem compatible with a two-state p-bit platform. Moreover, this not only increases the problem size by entailing the use of auxiliary variables but can also degrade the solution quality."},"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":"2403.06436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2024-03-11T05:09:44Z","cross_cats_sorted":["math.OC","physics.app-ph"],"title_canon_sha256":"c219e009a890a236e12179dd405fda731062f4f9ded7c7a240ab9b79e29fca72","abstract_canon_sha256":"dec6a4487b0b52e2f94cb124642071cda1c6d285f54dc6f5a555b3c680320aad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:38.293909Z","signature_b64":"H8xuQGCtZHhs9viZ06aTSEPxxOULiDsaEHQCONaV0Avc+kCSGPpPOV8LNC1bhTQb1K/7gi6fiNllb4HsoqsVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b26dd85dd88cf3e9d1932e05afdf08d413eff6b78efbf31a3a3e406a01f2c7bb","last_reissued_at":"2026-07-05T08:01:38.293363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:38.293363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing a K-state P-bit Engine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","physics.app-ph"],"primary_cat":"cs.ET","authors_text":"Abir Hasan, Mohammad Khairul Bashar, Nikhil Shukla","submitted_at":"2024-03-11T05:09:44Z","abstract_excerpt":"Probabilistic bit (p-bit)-based compute engines utilize the unique capability of a p-bit to probabilistically switch between two states to solve computationally challenging problems. However, when solving problems that require more than two states (e.g., problems such as Max-3-Cut, verifying if a graph is K-partite (K>2) etc.), additional pre-processing steps such as graph reduction are required to make the problem compatible with a two-state p-bit platform. Moreover, this not only increases the problem size by entailing the use of auxiliary variables but can also degrade the solution quality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06436","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/2403.06436/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":"2403.06436","created_at":"2026-07-05T08:01:38.293424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.06436v2","created_at":"2026-07-05T08:01:38.293424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06436","created_at":"2026-07-05T08:01:38.293424+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJW5QXOYRTZ6","created_at":"2026-07-05T08:01:38.293424+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJW5QXOYRTZ6TUMT","created_at":"2026-07-05T08:01:38.293424+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJW5QXOY","created_at":"2026-07-05T08:01:38.293424+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25203","citing_title":"Leveraging Population Dynamics to Steer Efficient Search in Large-Scale Combinatorial Optimization","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WJW5QXOYRTZ6TUMTFYC27XYI2Q","json":"https://pith.science/pith/WJW5QXOYRTZ6TUMTFYC27XYI2Q.json","graph_json":"https://pith.science/api/pith-number/WJW5QXOYRTZ6TUMTFYC27XYI2Q/graph.json","events_json":"https://pith.science/api/pith-number/WJW5QXOYRTZ6TUMTFYC27XYI2Q/events.json","paper":"https://pith.science/paper/WJW5QXOY"},"agent_actions":{"view_html":"https://pith.science/pith/WJW5QXOYRTZ6TUMTFYC27XYI2Q","download_json":"https://pith.science/pith/WJW5QXOYRTZ6TUMTFYC27XYI2Q.json","view_paper":"https://pith.science/paper/WJW5QXOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.06436&json=true","fetch_graph":"https://pith.science/api/pith-number/WJW5QXOYRTZ6TUMTFYC27XYI2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/WJW5QXOYRTZ6TUMTFYC27XYI2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJW5QXOYRTZ6TUMTFYC27XYI2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJW5QXOYRTZ6TUMTFYC27XYI2Q/action/storage_attestation","attest_author":"https://pith.science/pith/WJW5QXOYRTZ6TUMTFYC27XYI2Q/action/author_attestation","sign_citation":"https://pith.science/pith/WJW5QXOYRTZ6TUMTFYC27XYI2Q/action/citation_signature","submit_replication":"https://pith.science/pith/WJW5QXOYRTZ6TUMTFYC27XYI2Q/action/replication_record"}},"created_at":"2026-07-05T08:01:38.293424+00:00","updated_at":"2026-07-05T08:01:38.293424+00:00"}