{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JIFPH4CZBYYYTQCVCKWJH7Q5GK","short_pith_number":"pith:JIFPH4CZ","schema_version":"1.0","canonical_sha256":"4a0af3f0590e3189c05512ac93fe1d32802d03a8fde28e8f03c0d5f9fe1fd688","source":{"kind":"arxiv","id":"1706.00900","version":1},"attestation_state":"computed","paper":{"title":"Optimal Envelope Approximation in Fourier Basis with Applications in TV White Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","math.IT"],"primary_cat":"cs.IT","authors_text":"Animesh Kumar","submitted_at":"2017-06-03T06:39:13Z","abstract_excerpt":"Lowpass envelope approximation of smooth continuous-variable signals are introduced in this work. Envelope approximations are necessary when a given signal has to be approximated always to a larger value (such as in TV white space protection regions). In this work, a near-optimal approximate algorithm for finding a signal's envelope, while minimizing a mean-squared cost function, is detailed. The sparse (lowpass) signal approximation is obtained in the linear Fourier series basis. This approximate algorithm works by discretizing the envelope property from an infinite number of points to a larg"},"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":"1706.00900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-03T06:39:13Z","cross_cats_sorted":["cs.CE","math.IT"],"title_canon_sha256":"adf021c00d17b4a8f839bb977821dd82f3e341bb54e2de90b1ccf5cbaeb5d461","abstract_canon_sha256":"cab7bc44d6509a051aad66d1e7a3fc7da605bd6baba8b88fc2a4c5a3de32c637"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:07.488949Z","signature_b64":"Y/GmtCkGnt7z9qxmdc4cUjdWzdEXahbOTfLauY4stOLFy9AA3gSss0I+TaK779tI0IPHQ+aA/LCa6B/Avl0xAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a0af3f0590e3189c05512ac93fe1d32802d03a8fde28e8f03c0d5f9fe1fd688","last_reissued_at":"2026-05-18T00:43:07.488169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:07.488169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Envelope Approximation in Fourier Basis with Applications in TV White Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","math.IT"],"primary_cat":"cs.IT","authors_text":"Animesh Kumar","submitted_at":"2017-06-03T06:39:13Z","abstract_excerpt":"Lowpass envelope approximation of smooth continuous-variable signals are introduced in this work. Envelope approximations are necessary when a given signal has to be approximated always to a larger value (such as in TV white space protection regions). In this work, a near-optimal approximate algorithm for finding a signal's envelope, while minimizing a mean-squared cost function, is detailed. The sparse (lowpass) signal approximation is obtained in the linear Fourier series basis. This approximate algorithm works by discretizing the envelope property from an infinite number of points to a larg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00900","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":"1706.00900","created_at":"2026-05-18T00:43:07.488293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00900v1","created_at":"2026-05-18T00:43:07.488293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00900","created_at":"2026-05-18T00:43:07.488293+00:00"},{"alias_kind":"pith_short_12","alias_value":"JIFPH4CZBYYY","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JIFPH4CZBYYYTQCV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JIFPH4CZ","created_at":"2026-05-18T12:31:24.725408+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/JIFPH4CZBYYYTQCVCKWJH7Q5GK","json":"https://pith.science/pith/JIFPH4CZBYYYTQCVCKWJH7Q5GK.json","graph_json":"https://pith.science/api/pith-number/JIFPH4CZBYYYTQCVCKWJH7Q5GK/graph.json","events_json":"https://pith.science/api/pith-number/JIFPH4CZBYYYTQCVCKWJH7Q5GK/events.json","paper":"https://pith.science/paper/JIFPH4CZ"},"agent_actions":{"view_html":"https://pith.science/pith/JIFPH4CZBYYYTQCVCKWJH7Q5GK","download_json":"https://pith.science/pith/JIFPH4CZBYYYTQCVCKWJH7Q5GK.json","view_paper":"https://pith.science/paper/JIFPH4CZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00900&json=true","fetch_graph":"https://pith.science/api/pith-number/JIFPH4CZBYYYTQCVCKWJH7Q5GK/graph.json","fetch_events":"https://pith.science/api/pith-number/JIFPH4CZBYYYTQCVCKWJH7Q5GK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JIFPH4CZBYYYTQCVCKWJH7Q5GK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JIFPH4CZBYYYTQCVCKWJH7Q5GK/action/storage_attestation","attest_author":"https://pith.science/pith/JIFPH4CZBYYYTQCVCKWJH7Q5GK/action/author_attestation","sign_citation":"https://pith.science/pith/JIFPH4CZBYYYTQCVCKWJH7Q5GK/action/citation_signature","submit_replication":"https://pith.science/pith/JIFPH4CZBYYYTQCVCKWJH7Q5GK/action/replication_record"}},"created_at":"2026-05-18T00:43:07.488293+00:00","updated_at":"2026-05-18T00:43:07.488293+00:00"}