{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:W3LT3XF7YW7SWGCWUJ24M43NUM","short_pith_number":"pith:W3LT3XF7","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"},"canonical_sha256":"b6d73ddcbfc5bf2b1856a275c6736da323fe1bf710f76a3901c96378565695f5","source":{"kind":"arxiv","id":"0901.0054","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.0054","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"arxiv_version","alias_value":"0901.0054v2","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0054","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"pith_short_12","alias_value":"W3LT3XF7YW7S","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"W3LT3XF7YW7SWGCW","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"W3LT3XF7","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:W3LT3XF7YW7SWGCWUJ24M43NUM","target":"record","payload":{"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"},"canonical_sha256":"b6d73ddcbfc5bf2b1856a275c6736da323fe1bf710f76a3901c96378565695f5","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"},"source_kind":"arxiv","source_id":"0901.0054","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"233mZ/z69IvPgcBswgVFUQxNQlBL8x+zSoGdXxaeKvNzO9YZnp98OCCRh13Krecz8+159/8pyhDf2OEuCCheAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:11:18.882922Z"},"content_sha256":"2e2a39d9143a1db0d57dad753550fd6ff446352f671bcc7244dd50b49fcb8b8b","schema_version":"1.0","event_id":"sha256:2e2a39d9143a1db0d57dad753550fd6ff446352f671bcc7244dd50b49fcb8b8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:W3LT3XF7YW7SWGCWUJ24M43NUM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRsvVqT5KjgVB5GSlQPD8I+c48MKw2WrlHC71pTElPKB3QwhUVAF6mS8UIjO/otSfZl4/wSb7lPDwIRZrUphDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:11:18.883263Z"},"content_sha256":"2cc7ed6fa3ba592163dd2769d37f58c84bbec2322e73d396a7401390c42265d3","schema_version":"1.0","event_id":"sha256:2cc7ed6fa3ba592163dd2769d37f58c84bbec2322e73d396a7401390c42265d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM/bundle.json","state_url":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3LT3XF7YW7SWGCWUJ24M43NUM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T06:11:18Z","links":{"resolver":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM","bundle":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM/bundle.json","state":"https://pith.science/pith/W3LT3XF7YW7SWGCWUJ24M43NUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3LT3XF7YW7SWGCWUJ24M43NUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:W3LT3XF7YW7SWGCWUJ24M43NUM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a41bf6dac82d0f6af0e6adf4dbeb09e467175111d8fd9680a6616cbd9aac5b85","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2008-12-31T18:54:13Z","title_canon_sha256":"49ffa34ccccd8b9f8f5a81a4ed0961dded4b682b46907ee9e0ff98dc09ee93ee"},"schema_version":"1.0","source":{"id":"0901.0054","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.0054","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"arxiv_version","alias_value":"0901.0054v2","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0054","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"pith_short_12","alias_value":"W3LT3XF7YW7S","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"W3LT3XF7YW7SWGCW","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"W3LT3XF7","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:2cc7ed6fa3ba592163dd2769d37f58c84bbec2322e73d396a7401390c42265d3","target":"graph","created_at":"2026-05-17T23:53:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Joachim von zur Gathen","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2008-12-31T18:54:13Z","title":"Counting decomposable univariate polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0054","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2e2a39d9143a1db0d57dad753550fd6ff446352f671bcc7244dd50b49fcb8b8b","target":"record","created_at":"2026-05-17T23:53:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a41bf6dac82d0f6af0e6adf4dbeb09e467175111d8fd9680a6616cbd9aac5b85","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2008-12-31T18:54:13Z","title_canon_sha256":"49ffa34ccccd8b9f8f5a81a4ed0961dded4b682b46907ee9e0ff98dc09ee93ee"},"schema_version":"1.0","source":{"id":"0901.0054","kind":"arxiv","version":2}},"canonical_sha256":"b6d73ddcbfc5bf2b1856a275c6736da323fe1bf710f76a3901c96378565695f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6d73ddcbfc5bf2b1856a275c6736da323fe1bf710f76a3901c96378565695f5","first_computed_at":"2026-05-17T23:53:39.419776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:39.419776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QvZYW0Vh/IJgo0eOir5FmKn6PpwfP12VL9IttNyDlQbfFjLdwDXPpTBNJT5hKYyiTPTAQ2jls8PcU+o/a7TYBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:39.420428Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.0054","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e2a39d9143a1db0d57dad753550fd6ff446352f671bcc7244dd50b49fcb8b8b","sha256:2cc7ed6fa3ba592163dd2769d37f58c84bbec2322e73d396a7401390c42265d3"],"state_sha256":"aac3eb0fd5d9b426b3d0f6504a260dcd59bf77ee453c5d2adf1fb5d4c56cf444"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l5qRYfuII2mLiDfx/jatUZDpw9OTdj2MT7KBkeFw9obGJFu12/zOTN06n9a5DtUr7xKdKboe9nl8Rr6YHDLHAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:11:18.885254Z","bundle_sha256":"5e1f8fa02eebc48efd3b59461218506668d786d3df7ebfe7a75f27febce400c8"}}