{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EAKRWY2X74ZAKLPXS3Q67SHNUO","short_pith_number":"pith:EAKRWY2X","schema_version":"1.0","canonical_sha256":"20151b6357ff32052df796e1efc8eda3b714364db35b0cb8c0d971f235f4a83d","source":{"kind":"arxiv","id":"1809.05859","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Errors for Efficiency: A Survey from Circuits to Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.PL"],"primary_cat":"cs.AR","authors_text":"Adrian Sampson, Alexandros Daglis, Andreas Gerstlauer, Armin Alaghi, Babak Falsafi, Damien Zufferey, Djordje Jevdjic, Eva Darulova, Ghayoor Gillani, Lara Dolecek, Mattia Cacciotti, Michael Carbin, Natalie Enright Jerger, Phillip Stanley-Marbell, Sasa Misailovic, Thierry Moreau","submitted_at":"2018-09-16T11:55:33Z","abstract_excerpt":"When a computational task tolerates a relaxation of its specification or when an algorithm tolerates the effects of noise in its execution, hardware, programming languages, and system software can trade deviations from correct behavior for lower resource usage. We present, for the first time, a synthesis of research results on computing systems that only make as many errors as their users can tolerate, from across the disciplines of computer aided design of circuits, digital system design, computer architecture, programming languages, operating systems, and information theory.\n  Rather than ov"},"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":"1809.05859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-09-16T11:55:33Z","cross_cats_sorted":["cs.ET","cs.PL"],"title_canon_sha256":"c78be2df25f3372831a2f5eb396e986fcaf0ac93d0179ffb87704cf7087556c7","abstract_canon_sha256":"b9a68ebf6c647db26ad36254cbb5bf39f6b3c701ba3d42762c3ed14bf65ebe2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:36.296890Z","signature_b64":"79fUniycf0zz/lNszt6spo86RqlEYMYu14vMaREq2NFPKgzmj2waCb7iZsV53pm5bMS2QU+FYIjyUzotKdTEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20151b6357ff32052df796e1efc8eda3b714364db35b0cb8c0d971f235f4a83d","last_reissued_at":"2026-05-18T00:05:36.296389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:36.296389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Errors for Efficiency: A Survey from Circuits to Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.PL"],"primary_cat":"cs.AR","authors_text":"Adrian Sampson, Alexandros Daglis, Andreas Gerstlauer, Armin Alaghi, Babak Falsafi, Damien Zufferey, Djordje Jevdjic, Eva Darulova, Ghayoor Gillani, Lara Dolecek, Mattia Cacciotti, Michael Carbin, Natalie Enright Jerger, Phillip Stanley-Marbell, Sasa Misailovic, Thierry Moreau","submitted_at":"2018-09-16T11:55:33Z","abstract_excerpt":"When a computational task tolerates a relaxation of its specification or when an algorithm tolerates the effects of noise in its execution, hardware, programming languages, and system software can trade deviations from correct behavior for lower resource usage. We present, for the first time, a synthesis of research results on computing systems that only make as many errors as their users can tolerate, from across the disciplines of computer aided design of circuits, digital system design, computer architecture, programming languages, operating systems, and information theory.\n  Rather than ov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05859","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":""},"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":"1809.05859","created_at":"2026-05-18T00:05:36.296462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05859v1","created_at":"2026-05-18T00:05:36.296462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05859","created_at":"2026-05-18T00:05:36.296462+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAKRWY2X74ZA","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAKRWY2X74ZAKLPX","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAKRWY2X","created_at":"2026-05-18T12:32:22.470017+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/EAKRWY2X74ZAKLPXS3Q67SHNUO","json":"https://pith.science/pith/EAKRWY2X74ZAKLPXS3Q67SHNUO.json","graph_json":"https://pith.science/api/pith-number/EAKRWY2X74ZAKLPXS3Q67SHNUO/graph.json","events_json":"https://pith.science/api/pith-number/EAKRWY2X74ZAKLPXS3Q67SHNUO/events.json","paper":"https://pith.science/paper/EAKRWY2X"},"agent_actions":{"view_html":"https://pith.science/pith/EAKRWY2X74ZAKLPXS3Q67SHNUO","download_json":"https://pith.science/pith/EAKRWY2X74ZAKLPXS3Q67SHNUO.json","view_paper":"https://pith.science/paper/EAKRWY2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05859&json=true","fetch_graph":"https://pith.science/api/pith-number/EAKRWY2X74ZAKLPXS3Q67SHNUO/graph.json","fetch_events":"https://pith.science/api/pith-number/EAKRWY2X74ZAKLPXS3Q67SHNUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAKRWY2X74ZAKLPXS3Q67SHNUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAKRWY2X74ZAKLPXS3Q67SHNUO/action/storage_attestation","attest_author":"https://pith.science/pith/EAKRWY2X74ZAKLPXS3Q67SHNUO/action/author_attestation","sign_citation":"https://pith.science/pith/EAKRWY2X74ZAKLPXS3Q67SHNUO/action/citation_signature","submit_replication":"https://pith.science/pith/EAKRWY2X74ZAKLPXS3Q67SHNUO/action/replication_record"}},"created_at":"2026-05-18T00:05:36.296462+00:00","updated_at":"2026-05-18T00:05:36.296462+00:00"}