{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:A4NV373GR5U5FSSNBJBBWE737N","short_pith_number":"pith:A4NV373G","schema_version":"1.0","canonical_sha256":"071b5dff668f69d2ca4d0a421b13fbfb6611cf640d31cc2ea23586c9c4c85c22","source":{"kind":"arxiv","id":"2011.03190","version":6},"attestation_state":"computed","paper":{"title":"ReFloat: Low-Cost Floating-Point Processing in ReRAM for Accelerating Iterative Linear Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AR","authors_text":"Fan Chen, Hai Li, Linghao Song, Xuehai Qian, Yiran Chen","submitted_at":"2020-11-06T04:59:25Z","abstract_excerpt":"Resistive random access memory (ReRAM) is a promising technology that can perform low-cost and in-situ matrix-vector multiplication (MVM) in analog domain. Scientific computing requires high-precision floating-point (FP) processing. However, performing floating-point computation in ReRAM is challenging because of high hardware cost and execution time due to the large FP value range. In this work we present ReFloat, a data format and an accelerator architecture, for low-cost and high-performance floating-point processing in ReRAM for iterative linear solvers. ReFloat matches the ReRAM crossbar "},"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":"2011.03190","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2020-11-06T04:59:25Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"43570dc935915e4f0f1bfabb76ffac1d2d50357429cb88d9a21dfff1b8717d4c","abstract_canon_sha256":"5fc89c8b8534035e03d7fad1fae601da8ea89b56e7c9758e519faed6f117d0e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:01:23.210841Z","signature_b64":"jr9McSq1EcSTVrxQE96JsDcEgxuRl6IBKPyIP535MQnsG3KfzoQqzs44c/grdsZ5Ou6V9LwLP4ubxtHI3GxhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"071b5dff668f69d2ca4d0a421b13fbfb6611cf640d31cc2ea23586c9c4c85c22","last_reissued_at":"2026-07-05T07:01:23.210394Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:01:23.210394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReFloat: Low-Cost Floating-Point Processing in ReRAM for Accelerating Iterative Linear Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AR","authors_text":"Fan Chen, Hai Li, Linghao Song, Xuehai Qian, Yiran Chen","submitted_at":"2020-11-06T04:59:25Z","abstract_excerpt":"Resistive random access memory (ReRAM) is a promising technology that can perform low-cost and in-situ matrix-vector multiplication (MVM) in analog domain. Scientific computing requires high-precision floating-point (FP) processing. However, performing floating-point computation in ReRAM is challenging because of high hardware cost and execution time due to the large FP value range. In this work we present ReFloat, a data format and an accelerator architecture, for low-cost and high-performance floating-point processing in ReRAM for iterative linear solvers. ReFloat matches the ReRAM crossbar "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03190","kind":"arxiv","version":6},"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/2011.03190/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":"2011.03190","created_at":"2026-07-05T07:01:23.210453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.03190v6","created_at":"2026-07-05T07:01:23.210453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03190","created_at":"2026-07-05T07:01:23.210453+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4NV373GR5U5","created_at":"2026-07-05T07:01:23.210453+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4NV373GR5U5FSSN","created_at":"2026-07-05T07:01:23.210453+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4NV373G","created_at":"2026-07-05T07:01:23.210453+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A4NV373GR5U5FSSNBJBBWE737N","json":"https://pith.science/pith/A4NV373GR5U5FSSNBJBBWE737N.json","graph_json":"https://pith.science/api/pith-number/A4NV373GR5U5FSSNBJBBWE737N/graph.json","events_json":"https://pith.science/api/pith-number/A4NV373GR5U5FSSNBJBBWE737N/events.json","paper":"https://pith.science/paper/A4NV373G"},"agent_actions":{"view_html":"https://pith.science/pith/A4NV373GR5U5FSSNBJBBWE737N","download_json":"https://pith.science/pith/A4NV373GR5U5FSSNBJBBWE737N.json","view_paper":"https://pith.science/paper/A4NV373G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.03190&json=true","fetch_graph":"https://pith.science/api/pith-number/A4NV373GR5U5FSSNBJBBWE737N/graph.json","fetch_events":"https://pith.science/api/pith-number/A4NV373GR5U5FSSNBJBBWE737N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4NV373GR5U5FSSNBJBBWE737N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4NV373GR5U5FSSNBJBBWE737N/action/storage_attestation","attest_author":"https://pith.science/pith/A4NV373GR5U5FSSNBJBBWE737N/action/author_attestation","sign_citation":"https://pith.science/pith/A4NV373GR5U5FSSNBJBBWE737N/action/citation_signature","submit_replication":"https://pith.science/pith/A4NV373GR5U5FSSNBJBBWE737N/action/replication_record"}},"created_at":"2026-07-05T07:01:23.210453+00:00","updated_at":"2026-07-05T07:01:23.210453+00:00"}