{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QZO5OGP3EU7OT7LSW6U6OQWMSR","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":"d7cf843abc7fa23b4ba923cab317cfb745110c88b7d68cd81ee0c95c369acf80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-01-23T07:18:35Z","title_canon_sha256":"e35acfb9231bc869b72bf777137a4e4933e80fe6efa5eddf4453a108a2d9dfc9"},"schema_version":"1.0","source":{"id":"1301.5414","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5414","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5414v2","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5414","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"pith_short_12","alias_value":"QZO5OGP3EU7O","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QZO5OGP3EU7OT7LS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QZO5OGP3","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:f8473f66201969aab54bad2ae47e6f45f60387642c4c3266463c13354ce4aa57","target":"graph","created_at":"2026-05-18T03:27:22Z","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":"Uncoupling algorithms transform a linear differential system of first order into one or several scalar differential equations. We examine two approaches to uncoupling: the cyclic-vector method (CVM) and the Danilevski-Barkatou-Z\\\"urcher algorithm (DBZ). We give tight size bounds on the scalar equations produced by CVM, and design a fast variant of CVM whose complexity is quasi-optimal with respect to the output size. We exhibit a strong structural link between CVM and DBZ enabling to show that, in the generic case, DBZ has polynomial complexity and that it produces a single equation, strongly ","authors_text":"Alin Bostan (INRIA Saclay - Ile de France), \\'Elie De Panafieu (LIAFA), Fr\\'ed\\'eric Chyzak (INRIA Saclay - Ile de France)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-01-23T07:18:35Z","title":"Complexity Estimates for Two Uncoupling Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5414","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:28165f73cab7723dadcf9b25df61adae4594b39ae6bcbda39834d69c4e2c00a0","target":"record","created_at":"2026-05-18T03:27:22Z","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":"d7cf843abc7fa23b4ba923cab317cfb745110c88b7d68cd81ee0c95c369acf80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-01-23T07:18:35Z","title_canon_sha256":"e35acfb9231bc869b72bf777137a4e4933e80fe6efa5eddf4453a108a2d9dfc9"},"schema_version":"1.0","source":{"id":"1301.5414","kind":"arxiv","version":2}},"canonical_sha256":"865dd719fb253ee9fd72b7a9e742cc944f1fc64fb0ae67ea647915c30771d2ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"865dd719fb253ee9fd72b7a9e742cc944f1fc64fb0ae67ea647915c30771d2ab","first_computed_at":"2026-05-18T03:27:22.618974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:22.618974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MOmo/oqBz6rasjioE1PKEpdKh2sSQrLlf7wfcdHcVS1FeCAZbe1QhvHiSvD3/4BqdIHTBO1jywzFSklTKsRkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:22.619581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5414","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28165f73cab7723dadcf9b25df61adae4594b39ae6bcbda39834d69c4e2c00a0","sha256:f8473f66201969aab54bad2ae47e6f45f60387642c4c3266463c13354ce4aa57"],"state_sha256":"c1337a728cd28df0dcf5d493e9e7c0c23bc27055c9d41ff7938fec155f10f620"}