{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FSCSGYVOW4NIZFH3T3S442KIAP","short_pith_number":"pith:FSCSGYVO","canonical_record":{"source":{"id":"1712.04166","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-12-12T08:21:47Z","cross_cats_sorted":[],"title_canon_sha256":"506bc81e180970f63a90af0d2e35317c22f778fb73de3adad013860d1b725336","abstract_canon_sha256":"3165ca62c0d4361eb64f497c011c21c742ab369dbc554304324d646c0cb91823"},"schema_version":"1.0"},"canonical_sha256":"2c852362aeb71a8c94fb9ee5ce694803dcdcdaa278b38ed8954d2c5cdc22c56e","source":{"kind":"arxiv","id":"1712.04166","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04166","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04166v3","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04166","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"FSCSGYVOW4NI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FSCSGYVOW4NIZFH3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FSCSGYVO","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FSCSGYVOW4NIZFH3T3S442KIAP","target":"record","payload":{"canonical_record":{"source":{"id":"1712.04166","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-12-12T08:21:47Z","cross_cats_sorted":[],"title_canon_sha256":"506bc81e180970f63a90af0d2e35317c22f778fb73de3adad013860d1b725336","abstract_canon_sha256":"3165ca62c0d4361eb64f497c011c21c742ab369dbc554304324d646c0cb91823"},"schema_version":"1.0"},"canonical_sha256":"2c852362aeb71a8c94fb9ee5ce694803dcdcdaa278b38ed8954d2c5cdc22c56e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:43.696104Z","signature_b64":"mPn18nhvmXD13yy1AEjZ28mT16bg0kSScTXGiHcpkban7VBDyUFuHtLnzgrnGfVQ9JgR0wm8CDT+nECtCI8fBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c852362aeb71a8c94fb9ee5ce694803dcdcdaa278b38ed8954d2c5cdc22c56e","last_reissued_at":"2026-05-18T00:01:43.695489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:43.695489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.04166","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HKrew3ypt4STLyL6lDFNML1QagpBvO9uSnP+njhr43bWLXh6ANQ11PcQTvFVSHVUISt5Pj2NLCo9bex0pnyLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:37:49.419150Z"},"content_sha256":"60f2fad9ab4f2d2c729f98bd1b04234b9ac2ae87fb0d3c06343e017d9d5ec1dd","schema_version":"1.0","event_id":"sha256:60f2fad9ab4f2d2c729f98bd1b04234b9ac2ae87fb0d3c06343e017d9d5ec1dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FSCSGYVOW4NIZFH3T3S442KIAP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted p-bits for FPGA implementation of probabilistic circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Ahmed Zeeshan Pervaiz, Brian M. Sutton, Kerem Y. Camsari, Lakshmi Anirudh Ghantasala","submitted_at":"2017-12-12T08:21:47Z","abstract_excerpt":"Probabilistic spin logic (PSL) is a recently proposed computing paradigm based on unstable stochastic units called probabilistic bits (p-bits) that can be correlated to form probabilistic circuits (p-circuits). These p-circuits can be used to solve problems of optimization, inference and also to implement precise Boolean functions in an \"inverted\" mode, where a given Boolean circuit can operate in reverse to find the input combinations that are consistent with a given output. In this paper we present a scalable FPGA implementation of such invertible p-circuits. We implement a \"weighted\" p-bit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04166","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7GXFtJvhdmj71wRKqF9uyG508/UvJQQPn4/MM/NmRp2qyDTG6TDvJ3kwCSMBLMj+xmKgN+fydm8cXdtkTI1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:37:49.419822Z"},"content_sha256":"359b5319f9101b56769a21ea126b086185fee366da81288842a3d04ba68b1842","schema_version":"1.0","event_id":"sha256:359b5319f9101b56769a21ea126b086185fee366da81288842a3d04ba68b1842"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FSCSGYVOW4NIZFH3T3S442KIAP/bundle.json","state_url":"https://pith.science/pith/FSCSGYVOW4NIZFH3T3S442KIAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FSCSGYVOW4NIZFH3T3S442KIAP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T17:37:49Z","links":{"resolver":"https://pith.science/pith/FSCSGYVOW4NIZFH3T3S442KIAP","bundle":"https://pith.science/pith/FSCSGYVOW4NIZFH3T3S442KIAP/bundle.json","state":"https://pith.science/pith/FSCSGYVOW4NIZFH3T3S442KIAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FSCSGYVOW4NIZFH3T3S442KIAP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FSCSGYVOW4NIZFH3T3S442KIAP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3165ca62c0d4361eb64f497c011c21c742ab369dbc554304324d646c0cb91823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-12-12T08:21:47Z","title_canon_sha256":"506bc81e180970f63a90af0d2e35317c22f778fb73de3adad013860d1b725336"},"schema_version":"1.0","source":{"id":"1712.04166","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04166","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04166v3","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04166","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"FSCSGYVOW4NI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FSCSGYVOW4NIZFH3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FSCSGYVO","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:359b5319f9101b56769a21ea126b086185fee366da81288842a3d04ba68b1842","target":"graph","created_at":"2026-05-18T00:01:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Probabilistic spin logic (PSL) is a recently proposed computing paradigm based on unstable stochastic units called probabilistic bits (p-bits) that can be correlated to form probabilistic circuits (p-circuits). These p-circuits can be used to solve problems of optimization, inference and also to implement precise Boolean functions in an \"inverted\" mode, where a given Boolean circuit can operate in reverse to find the input combinations that are consistent with a given output. In this paper we present a scalable FPGA implementation of such invertible p-circuits. We implement a \"weighted\" p-bit ","authors_text":"Ahmed Zeeshan Pervaiz, Brian M. Sutton, Kerem Y. Camsari, Lakshmi Anirudh Ghantasala","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-12-12T08:21:47Z","title":"Weighted p-bits for FPGA implementation of probabilistic circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04166","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:60f2fad9ab4f2d2c729f98bd1b04234b9ac2ae87fb0d3c06343e017d9d5ec1dd","target":"record","created_at":"2026-05-18T00:01:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3165ca62c0d4361eb64f497c011c21c742ab369dbc554304324d646c0cb91823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-12-12T08:21:47Z","title_canon_sha256":"506bc81e180970f63a90af0d2e35317c22f778fb73de3adad013860d1b725336"},"schema_version":"1.0","source":{"id":"1712.04166","kind":"arxiv","version":3}},"canonical_sha256":"2c852362aeb71a8c94fb9ee5ce694803dcdcdaa278b38ed8954d2c5cdc22c56e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c852362aeb71a8c94fb9ee5ce694803dcdcdaa278b38ed8954d2c5cdc22c56e","first_computed_at":"2026-05-18T00:01:43.695489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:43.695489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mPn18nhvmXD13yy1AEjZ28mT16bg0kSScTXGiHcpkban7VBDyUFuHtLnzgrnGfVQ9JgR0wm8CDT+nECtCI8fBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:43.696104Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04166","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60f2fad9ab4f2d2c729f98bd1b04234b9ac2ae87fb0d3c06343e017d9d5ec1dd","sha256:359b5319f9101b56769a21ea126b086185fee366da81288842a3d04ba68b1842"],"state_sha256":"4e8a7aee4b1868382650ca026d149f2cc8368101394b9f7ca89dde6186f1facd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L09pnSEOpDT4ig6FhsPZeMMNq3vdlvgq4pd9TrwY6B7ZYe+5QXhMeOp38e3t4qUtzXAmhFjxCORWvuAJa1lbAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:37:49.423421Z","bundle_sha256":"ca06629bd91d2ca11cb78c6a6a878245c51edac73c6c191716e97b056478040a"}}