{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:N7GDLD25FS5BGIUYEW4CULRRYN","short_pith_number":"pith:N7GDLD25","schema_version":"1.0","canonical_sha256":"6fcc358f5d2cba13229825b82a2e31c3715c5c8be4a238cefbec6bd2ce200542","source":{"kind":"arxiv","id":"1107.0687","version":1},"attestation_state":"computed","paper":{"title":"Decomposition of Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.AC","authors_text":"Raoul Blankertz","submitted_at":"2011-07-04T17:46:30Z","abstract_excerpt":"This diploma thesis is concerned with functional decomposition $f = g \\circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A bound for the number of minimal collisions is derived. Finally a proof of a conjecture in von zur Gathen, Giesbrecht & Ziegler (2010) is given, which states a classification for a special class of decomposable polynomials."},"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":"1107.0687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-07-04T17:46:30Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"9722fb76df17f6be03adac3beaa834a1811d3882ffdefc8ffb4aa57d7ffe6a5b","abstract_canon_sha256":"66bcc07f98a3c32ae740278e140230915aadba74be4827c56f05693a9bc36495"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:53.579426Z","signature_b64":"GfN2+q+uK16cwDfXDbeWn86awoEee46Q4PWVT2lz6q4fPOJZWv1IU8tjuPdrZGm/W/LEvBcXRx514scNyaf2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fcc358f5d2cba13229825b82a2e31c3715c5c8be4a238cefbec6bd2ce200542","last_reissued_at":"2026-05-18T04:18:53.578983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:53.578983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition of Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.AC","authors_text":"Raoul Blankertz","submitted_at":"2011-07-04T17:46:30Z","abstract_excerpt":"This diploma thesis is concerned with functional decomposition $f = g \\circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A bound for the number of minimal collisions is derived. Finally a proof of a conjecture in von zur Gathen, Giesbrecht & Ziegler (2010) is given, which states a classification for a special class of decomposable polynomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0687","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":"1107.0687","created_at":"2026-05-18T04:18:53.579050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.0687v1","created_at":"2026-05-18T04:18:53.579050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0687","created_at":"2026-05-18T04:18:53.579050+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7GDLD25FS5B","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7GDLD25FS5BGIUY","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7GDLD25","created_at":"2026-05-18T12:26:37.096874+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/N7GDLD25FS5BGIUYEW4CULRRYN","json":"https://pith.science/pith/N7GDLD25FS5BGIUYEW4CULRRYN.json","graph_json":"https://pith.science/api/pith-number/N7GDLD25FS5BGIUYEW4CULRRYN/graph.json","events_json":"https://pith.science/api/pith-number/N7GDLD25FS5BGIUYEW4CULRRYN/events.json","paper":"https://pith.science/paper/N7GDLD25"},"agent_actions":{"view_html":"https://pith.science/pith/N7GDLD25FS5BGIUYEW4CULRRYN","download_json":"https://pith.science/pith/N7GDLD25FS5BGIUYEW4CULRRYN.json","view_paper":"https://pith.science/paper/N7GDLD25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.0687&json=true","fetch_graph":"https://pith.science/api/pith-number/N7GDLD25FS5BGIUYEW4CULRRYN/graph.json","fetch_events":"https://pith.science/api/pith-number/N7GDLD25FS5BGIUYEW4CULRRYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7GDLD25FS5BGIUYEW4CULRRYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7GDLD25FS5BGIUYEW4CULRRYN/action/storage_attestation","attest_author":"https://pith.science/pith/N7GDLD25FS5BGIUYEW4CULRRYN/action/author_attestation","sign_citation":"https://pith.science/pith/N7GDLD25FS5BGIUYEW4CULRRYN/action/citation_signature","submit_replication":"https://pith.science/pith/N7GDLD25FS5BGIUYEW4CULRRYN/action/replication_record"}},"created_at":"2026-05-18T04:18:53.579050+00:00","updated_at":"2026-05-18T04:18:53.579050+00:00"}