{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ETN6UWMRFYAXLLDJFPYD247T6R","short_pith_number":"pith:ETN6UWMR","schema_version":"1.0","canonical_sha256":"24dbea59912e0175ac692bf03d73f3f477f9516a60bb4dd219b6d55fd0d8a02d","source":{"kind":"arxiv","id":"1108.4772","version":3},"attestation_state":"computed","paper":{"title":"A fast algorithm for reversion of power series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Fredrik Johansson","submitted_at":"2011-08-24T07:41:26Z","abstract_excerpt":"We give an algorithm for reversion of formal power series, based on an efficient way to implement the Lagrange inversion formula. Our algorithm requires $O(n^{1/2}(M(n) + MM(n^{1/2})))$ operations where $M(n)$ and $MM(n)$ are the costs of polynomial and matrix multiplication respectively. This matches the asymptotic complexity of an algorithm of Brent and Kung, but we achieve a constant factor speedup whose magnitude depends on the polynomial and matrix multiplication algorithms used. Benchmarks confirm that the algorithm performs well in practice."},"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":"1108.4772","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-08-24T07:41:26Z","cross_cats_sorted":[],"title_canon_sha256":"27113ce71e8fb1b6370be41ab697d840a2acf79fb0d3ad9b123b41a8333f5577","abstract_canon_sha256":"b49b80a71b1c085d6ab0270b0f1efca1ebcca80136e8eceae9ca358ae772c537"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:55.243590Z","signature_b64":"ip35xbK0TZvm4m8NytxVIw9jZCn+6m3PiIPXdnjbYxiVvUca0i1hG7J5DAyeCUBBJZp+Yu7Ovvl7eKyf99pTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24dbea59912e0175ac692bf03d73f3f477f9516a60bb4dd219b6d55fd0d8a02d","last_reissued_at":"2026-05-18T03:05:55.243053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:55.243053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast algorithm for reversion of power series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Fredrik Johansson","submitted_at":"2011-08-24T07:41:26Z","abstract_excerpt":"We give an algorithm for reversion of formal power series, based on an efficient way to implement the Lagrange inversion formula. Our algorithm requires $O(n^{1/2}(M(n) + MM(n^{1/2})))$ operations where $M(n)$ and $MM(n)$ are the costs of polynomial and matrix multiplication respectively. This matches the asymptotic complexity of an algorithm of Brent and Kung, but we achieve a constant factor speedup whose magnitude depends on the polynomial and matrix multiplication algorithms used. Benchmarks confirm that the algorithm performs well in practice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4772","kind":"arxiv","version":3},"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":"1108.4772","created_at":"2026-05-18T03:05:55.243132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.4772v3","created_at":"2026-05-18T03:05:55.243132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4772","created_at":"2026-05-18T03:05:55.243132+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETN6UWMRFYAX","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETN6UWMRFYAXLLDJ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETN6UWMR","created_at":"2026-05-18T12:26:28.662955+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/ETN6UWMRFYAXLLDJFPYD247T6R","json":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R.json","graph_json":"https://pith.science/api/pith-number/ETN6UWMRFYAXLLDJFPYD247T6R/graph.json","events_json":"https://pith.science/api/pith-number/ETN6UWMRFYAXLLDJFPYD247T6R/events.json","paper":"https://pith.science/paper/ETN6UWMR"},"agent_actions":{"view_html":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R","download_json":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R.json","view_paper":"https://pith.science/paper/ETN6UWMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.4772&json=true","fetch_graph":"https://pith.science/api/pith-number/ETN6UWMRFYAXLLDJFPYD247T6R/graph.json","fetch_events":"https://pith.science/api/pith-number/ETN6UWMRFYAXLLDJFPYD247T6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R/action/storage_attestation","attest_author":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R/action/author_attestation","sign_citation":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R/action/citation_signature","submit_replication":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R/action/replication_record"}},"created_at":"2026-05-18T03:05:55.243132+00:00","updated_at":"2026-05-18T03:05:55.243132+00:00"}