{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:L5HXXPLOA4GT6NWRALDBWWSQQF","short_pith_number":"pith:L5HXXPLO","schema_version":"1.0","canonical_sha256":"5f4f7bbd6e070d3f36d102c61b5a50814d9e9fbaa741f577e17ab9b80379a475","source":{"kind":"arxiv","id":"1307.2136","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Encoding for Sigma-Delta Quantization of Finite Frame Expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mark Iwen, Rayan Saab","submitted_at":"2013-07-08T15:53:15Z","abstract_excerpt":"In this paper we investigate encoding the bit-stream resulting from coarse Sigma-Delta quantization of finite frame expansions (i.e., overdetermined representations) of vectors. We show that for a wide range of finite-frames, including random frames and piecewise smooth frames, there exists a simple encoding algorithm ---acting only on the Sigma-Delta bit stream--- and an associated decoding algorithm that together yield an approximation error which decays exponentially in the number of bits used. The encoding strategy consists of applying a discrete random operator to the Sigma-Delta bit stre"},"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":"1307.2136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T15:53:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"24e246d1bfef58ce0c8be7f99ccd74089636717fd95a79bc04e54baf3a104281","abstract_canon_sha256":"6e52d0e0bbc866b27bf76ede727855fef84d3acb3bd9f66627e4ae764514430e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:02.313044Z","signature_b64":"5sKCcEUGI1JGzbA1jJcY4CYYebTxygHlu8wQ5Jz8d2hLdqEImAHqhI14j7Jc8LkTyAPLM5/ZXamg0X5THUuiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f4f7bbd6e070d3f36d102c61b5a50814d9e9fbaa741f577e17ab9b80379a475","last_reissued_at":"2026-05-18T03:19:02.312669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:02.312669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Encoding for Sigma-Delta Quantization of Finite Frame Expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mark Iwen, Rayan Saab","submitted_at":"2013-07-08T15:53:15Z","abstract_excerpt":"In this paper we investigate encoding the bit-stream resulting from coarse Sigma-Delta quantization of finite frame expansions (i.e., overdetermined representations) of vectors. We show that for a wide range of finite-frames, including random frames and piecewise smooth frames, there exists a simple encoding algorithm ---acting only on the Sigma-Delta bit stream--- and an associated decoding algorithm that together yield an approximation error which decays exponentially in the number of bits used. The encoding strategy consists of applying a discrete random operator to the Sigma-Delta bit stre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2136","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":"1307.2136","created_at":"2026-05-18T03:19:02.312726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2136v1","created_at":"2026-05-18T03:19:02.312726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2136","created_at":"2026-05-18T03:19:02.312726+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5HXXPLOA4GT","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5HXXPLOA4GT6NWR","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5HXXPLO","created_at":"2026-05-18T12:27:51.066281+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/L5HXXPLOA4GT6NWRALDBWWSQQF","json":"https://pith.science/pith/L5HXXPLOA4GT6NWRALDBWWSQQF.json","graph_json":"https://pith.science/api/pith-number/L5HXXPLOA4GT6NWRALDBWWSQQF/graph.json","events_json":"https://pith.science/api/pith-number/L5HXXPLOA4GT6NWRALDBWWSQQF/events.json","paper":"https://pith.science/paper/L5HXXPLO"},"agent_actions":{"view_html":"https://pith.science/pith/L5HXXPLOA4GT6NWRALDBWWSQQF","download_json":"https://pith.science/pith/L5HXXPLOA4GT6NWRALDBWWSQQF.json","view_paper":"https://pith.science/paper/L5HXXPLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2136&json=true","fetch_graph":"https://pith.science/api/pith-number/L5HXXPLOA4GT6NWRALDBWWSQQF/graph.json","fetch_events":"https://pith.science/api/pith-number/L5HXXPLOA4GT6NWRALDBWWSQQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5HXXPLOA4GT6NWRALDBWWSQQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5HXXPLOA4GT6NWRALDBWWSQQF/action/storage_attestation","attest_author":"https://pith.science/pith/L5HXXPLOA4GT6NWRALDBWWSQQF/action/author_attestation","sign_citation":"https://pith.science/pith/L5HXXPLOA4GT6NWRALDBWWSQQF/action/citation_signature","submit_replication":"https://pith.science/pith/L5HXXPLOA4GT6NWRALDBWWSQQF/action/replication_record"}},"created_at":"2026-05-18T03:19:02.312726+00:00","updated_at":"2026-05-18T03:19:02.312726+00:00"}