{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WUX5TC3FSBLPNTFNFJUJPWDIOJ","short_pith_number":"pith:WUX5TC3F","schema_version":"1.0","canonical_sha256":"b52fd98b659056f6ccad2a6897d8687256d1c8e737f776fac4c61a6e16cef61a","source":{"kind":"arxiv","id":"1101.3720","version":1},"attestation_state":"computed","paper":{"title":"Sparse binary cyclotomic polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Bartlomiej Bzdega","submitted_at":"2011-01-19T16:12:01Z","abstract_excerpt":"We derive a lower and an upper bound for the number of binary cyclotomic polynomials $\\Phi_m$ with at most $m^{1/2+\\epsilon}$ nonzero terms."},"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":"1101.3720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-01-19T16:12:01Z","cross_cats_sorted":[],"title_canon_sha256":"a66950d3103cad08d98ec81f35d1fede8decece62ee87a0568c793c4e1d040b7","abstract_canon_sha256":"2e77a196f9c877aae39595f56ae6e2e05320323650f877fc34e493f07c5697b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:58.707235Z","signature_b64":"nmVkIODqlc1LrM6rhhZncJi+XtrVdb46zSoRRfK8OGVtIM454xa1zDn17tukAsI7eeIqkEbPSEYkIcjFjmyRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b52fd98b659056f6ccad2a6897d8687256d1c8e737f776fac4c61a6e16cef61a","last_reissued_at":"2026-05-18T03:51:58.706410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:58.706410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse binary cyclotomic polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Bartlomiej Bzdega","submitted_at":"2011-01-19T16:12:01Z","abstract_excerpt":"We derive a lower and an upper bound for the number of binary cyclotomic polynomials $\\Phi_m$ with at most $m^{1/2+\\epsilon}$ nonzero terms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3720","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":"1101.3720","created_at":"2026-05-18T03:51:58.706543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.3720v1","created_at":"2026-05-18T03:51:58.706543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3720","created_at":"2026-05-18T03:51:58.706543+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUX5TC3FSBLP","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUX5TC3FSBLPNTFN","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUX5TC3F","created_at":"2026-05-18T12:26:44.992195+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/WUX5TC3FSBLPNTFNFJUJPWDIOJ","json":"https://pith.science/pith/WUX5TC3FSBLPNTFNFJUJPWDIOJ.json","graph_json":"https://pith.science/api/pith-number/WUX5TC3FSBLPNTFNFJUJPWDIOJ/graph.json","events_json":"https://pith.science/api/pith-number/WUX5TC3FSBLPNTFNFJUJPWDIOJ/events.json","paper":"https://pith.science/paper/WUX5TC3F"},"agent_actions":{"view_html":"https://pith.science/pith/WUX5TC3FSBLPNTFNFJUJPWDIOJ","download_json":"https://pith.science/pith/WUX5TC3FSBLPNTFNFJUJPWDIOJ.json","view_paper":"https://pith.science/paper/WUX5TC3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.3720&json=true","fetch_graph":"https://pith.science/api/pith-number/WUX5TC3FSBLPNTFNFJUJPWDIOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WUX5TC3FSBLPNTFNFJUJPWDIOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUX5TC3FSBLPNTFNFJUJPWDIOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUX5TC3FSBLPNTFNFJUJPWDIOJ/action/storage_attestation","attest_author":"https://pith.science/pith/WUX5TC3FSBLPNTFNFJUJPWDIOJ/action/author_attestation","sign_citation":"https://pith.science/pith/WUX5TC3FSBLPNTFNFJUJPWDIOJ/action/citation_signature","submit_replication":"https://pith.science/pith/WUX5TC3FSBLPNTFNFJUJPWDIOJ/action/replication_record"}},"created_at":"2026-05-18T03:51:58.706543+00:00","updated_at":"2026-05-18T03:51:58.706543+00:00"}