{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TNYGX4FUC2SUNQJ6GEJB6F33YR","short_pith_number":"pith:TNYGX4FU","schema_version":"1.0","canonical_sha256":"9b706bf0b416a546c13e31121f177bc467f6c43df5997b576e6c3538ed373e2e","source":{"kind":"arxiv","id":"1802.09588","version":2},"attestation_state":"computed","paper":{"title":"Bounding Multivariate Trigonometric Polynomials with Applications to Filter Bank Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Luke Pfister, Yoram Bresler","submitted_at":"2018-02-26T20:22:40Z","abstract_excerpt":"The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop simple and efficiently computable estimates of the extremal values of a multivariate trigonometric polynomial directly from its samples. We provide an upper bound on the modulus of a complex trigonometric polynomial, and develop upper and lower bounds for real trigonometric polynomials. For a univarite polynomial, these bounds are tighter than existing bounds, an"},"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":"1802.09588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-26T20:22:40Z","cross_cats_sorted":[],"title_canon_sha256":"6bb32619fe4f3751d93d075708f41c9c2c3023938feeab5fcc50ffe0f0049704","abstract_canon_sha256":"da07f34b96d62bf7cfbc1b5e6be706f475cd6cafb708bb78de7bb629fd00588a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:54.545261Z","signature_b64":"44SIrQ4hvt+5mz6aC6IExlf6b1sy+NIyuZFPYiX+ygfl9dyY9kWcA6Djb6gyg5/SqQmqG3XyZAmiBECkU+DTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b706bf0b416a546c13e31121f177bc467f6c43df5997b576e6c3538ed373e2e","last_reissued_at":"2026-05-18T00:08:54.544594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:54.544594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding Multivariate Trigonometric Polynomials with Applications to Filter Bank Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Luke Pfister, Yoram Bresler","submitted_at":"2018-02-26T20:22:40Z","abstract_excerpt":"The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop simple and efficiently computable estimates of the extremal values of a multivariate trigonometric polynomial directly from its samples. We provide an upper bound on the modulus of a complex trigonometric polynomial, and develop upper and lower bounds for real trigonometric polynomials. For a univarite polynomial, these bounds are tighter than existing bounds, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09588","kind":"arxiv","version":2},"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":"1802.09588","created_at":"2026-05-18T00:08:54.544704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09588v2","created_at":"2026-05-18T00:08:54.544704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09588","created_at":"2026-05-18T00:08:54.544704+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNYGX4FUC2SU","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNYGX4FUC2SUNQJ6","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNYGX4FU","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.15537","citing_title":"Matrix inversion polynomials for the quantum singular value transformation","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TNYGX4FUC2SUNQJ6GEJB6F33YR","json":"https://pith.science/pith/TNYGX4FUC2SUNQJ6GEJB6F33YR.json","graph_json":"https://pith.science/api/pith-number/TNYGX4FUC2SUNQJ6GEJB6F33YR/graph.json","events_json":"https://pith.science/api/pith-number/TNYGX4FUC2SUNQJ6GEJB6F33YR/events.json","paper":"https://pith.science/paper/TNYGX4FU"},"agent_actions":{"view_html":"https://pith.science/pith/TNYGX4FUC2SUNQJ6GEJB6F33YR","download_json":"https://pith.science/pith/TNYGX4FUC2SUNQJ6GEJB6F33YR.json","view_paper":"https://pith.science/paper/TNYGX4FU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09588&json=true","fetch_graph":"https://pith.science/api/pith-number/TNYGX4FUC2SUNQJ6GEJB6F33YR/graph.json","fetch_events":"https://pith.science/api/pith-number/TNYGX4FUC2SUNQJ6GEJB6F33YR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNYGX4FUC2SUNQJ6GEJB6F33YR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNYGX4FUC2SUNQJ6GEJB6F33YR/action/storage_attestation","attest_author":"https://pith.science/pith/TNYGX4FUC2SUNQJ6GEJB6F33YR/action/author_attestation","sign_citation":"https://pith.science/pith/TNYGX4FUC2SUNQJ6GEJB6F33YR/action/citation_signature","submit_replication":"https://pith.science/pith/TNYGX4FUC2SUNQJ6GEJB6F33YR/action/replication_record"}},"created_at":"2026-05-18T00:08:54.544704+00:00","updated_at":"2026-05-18T00:08:54.544704+00:00"}