{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FYZRYS4XBUC2LPH5ZTT55X7ZJW","short_pith_number":"pith:FYZRYS4X","schema_version":"1.0","canonical_sha256":"2e331c4b970d05a5bcfdcce7dedff94d981f7f73b3ead09464e70fbad455670f","source":{"kind":"arxiv","id":"1705.07779","version":1},"attestation_state":"computed","paper":{"title":"Cost-Performance Tradeoffs in Fusing Unreliable Computational Units","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Andrew C. Singer, Lav R. Varshney, Maxim Raginsky, Mehmet A. Donmez","submitted_at":"2017-05-22T14:47:06Z","abstract_excerpt":"We investigate fusing several unreliable computational units that perform the same task. We model an unreliable computational outcome as an additive perturbation to its error-free result in terms of its fidelity and cost. We analyze performance of repetition-based strategies that distribute cost across several unreliable units and fuse their outcomes. When the cost is a convex function of fidelity, the optimal repetition-based strategy in terms of incurred cost while achieving a target mean-square error (MSE) performance may fuse several computational units. For concave and linear costs, a sin"},"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":"1705.07779","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-05-22T14:47:06Z","cross_cats_sorted":[],"title_canon_sha256":"8186f1ec2bbed828bf8ee4e0a95f521d795d7b9b52493fef1b9c7b3005471637","abstract_canon_sha256":"ee9baaf25bc701168f1912483069cc77d8559df82dfba5443a4819022b012eb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:04.595831Z","signature_b64":"Nx7afG7gszL/cudb8bxZwYo8iujHSJBJVZfjboI48mE2nXrdElgCzA+sWwCGsDLi7ikpLm0Pj9oy8eM6+34nBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e331c4b970d05a5bcfdcce7dedff94d981f7f73b3ead09464e70fbad455670f","last_reissued_at":"2026-05-18T00:44:04.595162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:04.595162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cost-Performance Tradeoffs in Fusing Unreliable Computational Units","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Andrew C. Singer, Lav R. Varshney, Maxim Raginsky, Mehmet A. Donmez","submitted_at":"2017-05-22T14:47:06Z","abstract_excerpt":"We investigate fusing several unreliable computational units that perform the same task. We model an unreliable computational outcome as an additive perturbation to its error-free result in terms of its fidelity and cost. We analyze performance of repetition-based strategies that distribute cost across several unreliable units and fuse their outcomes. When the cost is a convex function of fidelity, the optimal repetition-based strategy in terms of incurred cost while achieving a target mean-square error (MSE) performance may fuse several computational units. For concave and linear costs, a sin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07779","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":"1705.07779","created_at":"2026-05-18T00:44:04.595258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07779v1","created_at":"2026-05-18T00:44:04.595258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07779","created_at":"2026-05-18T00:44:04.595258+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYZRYS4XBUC2","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYZRYS4XBUC2LPH5","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYZRYS4X","created_at":"2026-05-18T12:31:15.632608+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/FYZRYS4XBUC2LPH5ZTT55X7ZJW","json":"https://pith.science/pith/FYZRYS4XBUC2LPH5ZTT55X7ZJW.json","graph_json":"https://pith.science/api/pith-number/FYZRYS4XBUC2LPH5ZTT55X7ZJW/graph.json","events_json":"https://pith.science/api/pith-number/FYZRYS4XBUC2LPH5ZTT55X7ZJW/events.json","paper":"https://pith.science/paper/FYZRYS4X"},"agent_actions":{"view_html":"https://pith.science/pith/FYZRYS4XBUC2LPH5ZTT55X7ZJW","download_json":"https://pith.science/pith/FYZRYS4XBUC2LPH5ZTT55X7ZJW.json","view_paper":"https://pith.science/paper/FYZRYS4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07779&json=true","fetch_graph":"https://pith.science/api/pith-number/FYZRYS4XBUC2LPH5ZTT55X7ZJW/graph.json","fetch_events":"https://pith.science/api/pith-number/FYZRYS4XBUC2LPH5ZTT55X7ZJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYZRYS4XBUC2LPH5ZTT55X7ZJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYZRYS4XBUC2LPH5ZTT55X7ZJW/action/storage_attestation","attest_author":"https://pith.science/pith/FYZRYS4XBUC2LPH5ZTT55X7ZJW/action/author_attestation","sign_citation":"https://pith.science/pith/FYZRYS4XBUC2LPH5ZTT55X7ZJW/action/citation_signature","submit_replication":"https://pith.science/pith/FYZRYS4XBUC2LPH5ZTT55X7ZJW/action/replication_record"}},"created_at":"2026-05-18T00:44:04.595258+00:00","updated_at":"2026-05-18T00:44:04.595258+00:00"}