{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:W3LT3XF7YW7SWGCWUJ24M43NUM","short_pith_number":"pith:W3LT3XF7","schema_version":"1.0","canonical_sha256":"b6d73ddcbfc5bf2b1856a275c6736da323fe1bf710f76a3901c96378565695f5","source":{"kind":"arxiv","id":"0901.0054","version":2},"attestation_state":"computed","paper":{"title":"Counting decomposable univariate polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Joachim von zur Gathen","submitted_at":"2008-12-31T18:54:13Z","abstract_excerpt":"A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number over a finite field. The tame case, where the field characteristic p does not divide the degree n of f, is reasonably well understood, and we obtain exponentially decreasing error bounds. The wild case, where p divides n, is more challenging and our error bounds are weaker."},"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":"0901.0054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2008-12-31T18:54:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"49ffa34ccccd8b9f8f5a81a4ed0961dded4b682b46907ee9e0ff98dc09ee93ee","abstract_canon_sha256":"a41bf6dac82d0f6af0e6adf4dbeb09e467175111d8fd9680a6616cbd9aac5b85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:39.420428Z","signature_b64":"QvZYW0Vh/IJgo0eOir5FmKn6PpwfP12VL9IttNyDlQbfFjLdwDXPpTBNJT5hKYyiTPTAQ2jls8PcU+o/a7TYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6d73ddcbfc5bf2b1856a275c6736da323fe1bf710f76a3901c96378565695f5","last_reissued_at":"2026-05-17T23:53:39.419776Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:39.419776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting decomposable univariate polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Joachim von zur Gathen","submitted_at":"2008-12-31T18:54:13Z","abstract_excerpt":"A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number over a finite field. The tame case, where the field characteristic p does not divide the degree n of f, is reasonably well understood, and we obtain exponentially decreasing error bounds. The wild case, where p divides n, is more challenging and our error bounds are weaker."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0054","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":"0901.0054","created_at":"2026-05-17T23:53:39.419892+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.0054v2","created_at":"2026-05-17T23:53:39.419892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0054","created_at":"2026-05-17T23:53:39.419892+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3LT3XF7YW7S","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3LT3XF7YW7SWGCW","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3LT3XF7","created_at":"2026-05-18T12:25:58.018023+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/W3LT3XF7YW7SWGCWUJ24M43NUM","json":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM.json","graph_json":"https://pith.science/api/pith-number/W3LT3XF7YW7SWGCWUJ24M43NUM/graph.json","events_json":"https://pith.science/api/pith-number/W3LT3XF7YW7SWGCWUJ24M43NUM/events.json","paper":"https://pith.science/paper/W3LT3XF7"},"agent_actions":{"view_html":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM","download_json":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM.json","view_paper":"https://pith.science/paper/W3LT3XF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.0054&json=true","fetch_graph":"https://pith.science/api/pith-number/W3LT3XF7YW7SWGCWUJ24M43NUM/graph.json","fetch_events":"https://pith.science/api/pith-number/W3LT3XF7YW7SWGCWUJ24M43NUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM/action/storage_attestation","attest_author":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM/action/author_attestation","sign_citation":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM/action/citation_signature","submit_replication":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM/action/replication_record"}},"created_at":"2026-05-17T23:53:39.419892+00:00","updated_at":"2026-05-17T23:53:39.419892+00:00"}