{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ETN6UWMRFYAXLLDJFPYD247T6R","short_pith_number":"pith:ETN6UWMR","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"},"canonical_sha256":"24dbea59912e0175ac692bf03d73f3f477f9516a60bb4dd219b6d55fd0d8a02d","source":{"kind":"arxiv","id":"1108.4772","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4772","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4772v3","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4772","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"ETN6UWMRFYAX","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"ETN6UWMRFYAXLLDJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"ETN6UWMR","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ETN6UWMRFYAXLLDJFPYD247T6R","target":"record","payload":{"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"},"canonical_sha256":"24dbea59912e0175ac692bf03d73f3f477f9516a60bb4dd219b6d55fd0d8a02d","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"},"source_kind":"arxiv","source_id":"1108.4772","source_version":3,"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-18T03:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2HAaTd1n8qKOLsyH7HpN8bbz8LPpAw6aFYhRTFUymbVws4U0VRbAZF7FPwBDV9L55eSdtwRwdI5EjEVL0IqFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:56:55.055637Z"},"content_sha256":"db6a0970075979d173d37d7ba0098c0044c2877a94f2dfa00529779a65654ccf","schema_version":"1.0","event_id":"sha256:db6a0970075979d173d37d7ba0098c0044c2877a94f2dfa00529779a65654ccf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ETN6UWMRFYAXLLDJFPYD247T6R","target":"graph","payload":{"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"},"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-18T03:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1IpNl5Hw12WMAO3bkifZwF6J2YsfYniUB488+PUVE1rISseQxIA8Q8g9iG8gsLXfMfKWBKr0nmhnSlIc89f+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:56:55.056286Z"},"content_sha256":"bb96bac0657f582c3a90bb9828267667a1d9f7f74ab41a9146932f2606155fd5","schema_version":"1.0","event_id":"sha256:bb96bac0657f582c3a90bb9828267667a1d9f7f74ab41a9146932f2606155fd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R/bundle.json","state_url":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETN6UWMRFYAXLLDJFPYD247T6R/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-26T17:56:55Z","links":{"resolver":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R","bundle":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R/bundle.json","state":"https://pith.science/pith/ETN6UWMRFYAXLLDJFPYD247T6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETN6UWMRFYAXLLDJFPYD247T6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ETN6UWMRFYAXLLDJFPYD247T6R","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":"b49b80a71b1c085d6ab0270b0f1efca1ebcca80136e8eceae9ca358ae772c537","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-08-24T07:41:26Z","title_canon_sha256":"27113ce71e8fb1b6370be41ab697d840a2acf79fb0d3ad9b123b41a8333f5577"},"schema_version":"1.0","source":{"id":"1108.4772","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4772","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4772v3","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4772","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"ETN6UWMRFYAX","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"ETN6UWMRFYAXLLDJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"ETN6UWMR","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:bb96bac0657f582c3a90bb9828267667a1d9f7f74ab41a9146932f2606155fd5","target":"graph","created_at":"2026-05-18T03:05:55Z","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":"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.","authors_text":"Fredrik Johansson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-08-24T07:41:26Z","title":"A fast algorithm for reversion of power series"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4772","kind":"arxiv","version":3},"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:db6a0970075979d173d37d7ba0098c0044c2877a94f2dfa00529779a65654ccf","target":"record","created_at":"2026-05-18T03:05:55Z","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":"b49b80a71b1c085d6ab0270b0f1efca1ebcca80136e8eceae9ca358ae772c537","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-08-24T07:41:26Z","title_canon_sha256":"27113ce71e8fb1b6370be41ab697d840a2acf79fb0d3ad9b123b41a8333f5577"},"schema_version":"1.0","source":{"id":"1108.4772","kind":"arxiv","version":3}},"canonical_sha256":"24dbea59912e0175ac692bf03d73f3f477f9516a60bb4dd219b6d55fd0d8a02d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24dbea59912e0175ac692bf03d73f3f477f9516a60bb4dd219b6d55fd0d8a02d","first_computed_at":"2026-05-18T03:05:55.243053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:55.243053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ip35xbK0TZvm4m8NytxVIw9jZCn+6m3PiIPXdnjbYxiVvUca0i1hG7J5DAyeCUBBJZp+Yu7Ovvl7eKyf99pTCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:55.243590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4772","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db6a0970075979d173d37d7ba0098c0044c2877a94f2dfa00529779a65654ccf","sha256:bb96bac0657f582c3a90bb9828267667a1d9f7f74ab41a9146932f2606155fd5"],"state_sha256":"1d43082ce2cccef6f7cb988957d557cec6f9cfc703dbdbf5ccfbaa6d775b07df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/mLPgU1fbaS6aihIwDFl4uZOMHi0ERNMCsbrFDDcHXGCmkDZ79ytoUGiwE+5miEJN+P0DYwep3K8JI85yCYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:56:55.059687Z","bundle_sha256":"3a7e947224ae013c946e38c596e99a09e0bed0191cfe760a958094ecec938d58"}}