{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:W6SM23G7FNO2ZYGREQ3YS25J5I","short_pith_number":"pith:W6SM23G7","schema_version":"1.0","canonical_sha256":"b7a4cd6cdf2b5dace0d12437896ba9ea0bdede58d47c5a44658775af396f71e7","source":{"kind":"arxiv","id":"1406.2560","version":1},"attestation_state":"computed","paper":{"title":"Coppersmith-Rivlin type inequalities and the order of vanishing of polynomials at 1","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Tamas Erdelyi","submitted_at":"2014-06-10T14:06:14Z","abstract_excerpt":"We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain extensions of the Coppersmith-Rivlin inequality is explored."},"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":"1406.2560","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NT","submitted_at":"2014-06-10T14:06:14Z","cross_cats_sorted":[],"title_canon_sha256":"fe891556b41343b063090d5d7638e8c53c2636c93bd085c5b34d9f77ccf94744","abstract_canon_sha256":"f1c9de04e8c9faa80dad48a9c52b860677090984cd774fdbd26eb7110fb666e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:01.431014Z","signature_b64":"5Fzic/ZjmGZS7q7NRfY10hJGiOxpueVggv/kB+umoBnASvwrnpHUbsieLlldBNDqxj1cby6AyKW6MTroWquCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7a4cd6cdf2b5dace0d12437896ba9ea0bdede58d47c5a44658775af396f71e7","last_reissued_at":"2026-05-18T02:50:01.430548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:01.430548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coppersmith-Rivlin type inequalities and the order of vanishing of polynomials at 1","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Tamas Erdelyi","submitted_at":"2014-06-10T14:06:14Z","abstract_excerpt":"We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain extensions of the Coppersmith-Rivlin inequality is explored."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2560","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":"1406.2560","created_at":"2026-05-18T02:50:01.430611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2560v1","created_at":"2026-05-18T02:50:01.430611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2560","created_at":"2026-05-18T02:50:01.430611+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6SM23G7FNO2","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6SM23G7FNO2ZYGR","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6SM23G7","created_at":"2026-05-18T12:28:54.890064+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/W6SM23G7FNO2ZYGREQ3YS25J5I","json":"https://pith.science/pith/W6SM23G7FNO2ZYGREQ3YS25J5I.json","graph_json":"https://pith.science/api/pith-number/W6SM23G7FNO2ZYGREQ3YS25J5I/graph.json","events_json":"https://pith.science/api/pith-number/W6SM23G7FNO2ZYGREQ3YS25J5I/events.json","paper":"https://pith.science/paper/W6SM23G7"},"agent_actions":{"view_html":"https://pith.science/pith/W6SM23G7FNO2ZYGREQ3YS25J5I","download_json":"https://pith.science/pith/W6SM23G7FNO2ZYGREQ3YS25J5I.json","view_paper":"https://pith.science/paper/W6SM23G7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2560&json=true","fetch_graph":"https://pith.science/api/pith-number/W6SM23G7FNO2ZYGREQ3YS25J5I/graph.json","fetch_events":"https://pith.science/api/pith-number/W6SM23G7FNO2ZYGREQ3YS25J5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6SM23G7FNO2ZYGREQ3YS25J5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6SM23G7FNO2ZYGREQ3YS25J5I/action/storage_attestation","attest_author":"https://pith.science/pith/W6SM23G7FNO2ZYGREQ3YS25J5I/action/author_attestation","sign_citation":"https://pith.science/pith/W6SM23G7FNO2ZYGREQ3YS25J5I/action/citation_signature","submit_replication":"https://pith.science/pith/W6SM23G7FNO2ZYGREQ3YS25J5I/action/replication_record"}},"created_at":"2026-05-18T02:50:01.430611+00:00","updated_at":"2026-05-18T02:50:01.430611+00:00"}