{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J7SLGATVUSDVFEQ2TUJWPSAVE4","short_pith_number":"pith:J7SLGATV","schema_version":"1.0","canonical_sha256":"4fe4b30275a48752921a9d1367c815271da52aa2afafdf0bb4d1fbf3935dbbec","source":{"kind":"arxiv","id":"1804.02317","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Value-Deviation-Bounded Integer Codes for Approximate Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.ET","math.IT"],"primary_cat":"cs.IT","authors_text":"Paul Hurley, Phillip Stanley-Marbell","submitted_at":"2018-04-06T15:10:29Z","abstract_excerpt":"When computing systems can tolerate the effects of errors or erasures in their communicated data values, they can trade this tolerance for improved resource efficiency. One method for enabling this tradeoff in the I/O subsystems of computing systems, is to use channel codes that reduce the power needed to send bits on a channel in exchange for bounded errors and erasures on numeric program values---value-deviation-bounded (VDB) codes. Unlike rate distortion codes, which guarantee a bound on the expected value of channel distortion, the probabilistic VDB codes we present guarantee any desired t"},"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":"1804.02317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-06T15:10:29Z","cross_cats_sorted":["cs.AR","cs.ET","math.IT"],"title_canon_sha256":"ddfeb083a6c24ad344652f783597aacc655b8cb3fb302635f90d1be6ad8934a3","abstract_canon_sha256":"3bc97808c6410e9aba9aa69fbd3322b1c04810e5f57c1d121a3d302c2e7cdf98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:39.185015Z","signature_b64":"NHGYcnaWvCkb4RXTSwnBt+wYA6i5z8pTp6/reTJZCjxdFkSfcoVs4BBW37xU3KlV4J6jIhVXE1wTLNBoS00SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fe4b30275a48752921a9d1367c815271da52aa2afafdf0bb4d1fbf3935dbbec","last_reissued_at":"2026-05-18T00:05:39.184523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:39.184523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Value-Deviation-Bounded Integer Codes for Approximate Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.ET","math.IT"],"primary_cat":"cs.IT","authors_text":"Paul Hurley, Phillip Stanley-Marbell","submitted_at":"2018-04-06T15:10:29Z","abstract_excerpt":"When computing systems can tolerate the effects of errors or erasures in their communicated data values, they can trade this tolerance for improved resource efficiency. One method for enabling this tradeoff in the I/O subsystems of computing systems, is to use channel codes that reduce the power needed to send bits on a channel in exchange for bounded errors and erasures on numeric program values---value-deviation-bounded (VDB) codes. Unlike rate distortion codes, which guarantee a bound on the expected value of channel distortion, the probabilistic VDB codes we present guarantee any desired t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02317","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":"1804.02317","created_at":"2026-05-18T00:05:39.184607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02317v1","created_at":"2026-05-18T00:05:39.184607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02317","created_at":"2026-05-18T00:05:39.184607+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7SLGATVUSDV","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7SLGATVUSDVFEQ2","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7SLGATV","created_at":"2026-05-18T12:32:31.084164+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/J7SLGATVUSDVFEQ2TUJWPSAVE4","json":"https://pith.science/pith/J7SLGATVUSDVFEQ2TUJWPSAVE4.json","graph_json":"https://pith.science/api/pith-number/J7SLGATVUSDVFEQ2TUJWPSAVE4/graph.json","events_json":"https://pith.science/api/pith-number/J7SLGATVUSDVFEQ2TUJWPSAVE4/events.json","paper":"https://pith.science/paper/J7SLGATV"},"agent_actions":{"view_html":"https://pith.science/pith/J7SLGATVUSDVFEQ2TUJWPSAVE4","download_json":"https://pith.science/pith/J7SLGATVUSDVFEQ2TUJWPSAVE4.json","view_paper":"https://pith.science/paper/J7SLGATV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02317&json=true","fetch_graph":"https://pith.science/api/pith-number/J7SLGATVUSDVFEQ2TUJWPSAVE4/graph.json","fetch_events":"https://pith.science/api/pith-number/J7SLGATVUSDVFEQ2TUJWPSAVE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7SLGATVUSDVFEQ2TUJWPSAVE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7SLGATVUSDVFEQ2TUJWPSAVE4/action/storage_attestation","attest_author":"https://pith.science/pith/J7SLGATVUSDVFEQ2TUJWPSAVE4/action/author_attestation","sign_citation":"https://pith.science/pith/J7SLGATVUSDVFEQ2TUJWPSAVE4/action/citation_signature","submit_replication":"https://pith.science/pith/J7SLGATVUSDVFEQ2TUJWPSAVE4/action/replication_record"}},"created_at":"2026-05-18T00:05:39.184607+00:00","updated_at":"2026-05-18T00:05:39.184607+00:00"}