{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QZO5OGP3EU7OT7LSW6U6OQWMSR","short_pith_number":"pith:QZO5OGP3","schema_version":"1.0","canonical_sha256":"865dd719fb253ee9fd72b7a9e742cc944f1fc64fb0ae67ea647915c30771d2ab","source":{"kind":"arxiv","id":"1301.5414","version":2},"attestation_state":"computed","paper":{"title":"Complexity Estimates for Two Uncoupling Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Alin Bostan (INRIA Saclay - Ile de France), \\'Elie De Panafieu (LIAFA), Fr\\'ed\\'eric Chyzak (INRIA Saclay - Ile de France)","submitted_at":"2013-01-23T07:18:35Z","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 "},"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":"1301.5414","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-01-23T07:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"e35acfb9231bc869b72bf777137a4e4933e80fe6efa5eddf4453a108a2d9dfc9","abstract_canon_sha256":"d7cf843abc7fa23b4ba923cab317cfb745110c88b7d68cd81ee0c95c369acf80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:22.619581Z","signature_b64":"MOmo/oqBz6rasjioE1PKEpdKh2sSQrLlf7wfcdHcVS1FeCAZbe1QhvHiSvD3/4BqdIHTBO1jywzFSklTKsRkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"865dd719fb253ee9fd72b7a9e742cc944f1fc64fb0ae67ea647915c30771d2ab","last_reissued_at":"2026-05-18T03:27:22.618974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:22.618974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Estimates for Two Uncoupling Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Alin Bostan (INRIA Saclay - Ile de France), \\'Elie De Panafieu (LIAFA), Fr\\'ed\\'eric Chyzak (INRIA Saclay - Ile de France)","submitted_at":"2013-01-23T07:18:35Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5414","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.5414","created_at":"2026-05-18T03:27:22.619055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5414v2","created_at":"2026-05-18T03:27:22.619055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5414","created_at":"2026-05-18T03:27:22.619055+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZO5OGP3EU7O","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZO5OGP3EU7OT7LS","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZO5OGP3","created_at":"2026-05-18T12:27:57.521954+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/QZO5OGP3EU7OT7LSW6U6OQWMSR","json":"https://pith.science/pith/QZO5OGP3EU7OT7LSW6U6OQWMSR.json","graph_json":"https://pith.science/api/pith-number/QZO5OGP3EU7OT7LSW6U6OQWMSR/graph.json","events_json":"https://pith.science/api/pith-number/QZO5OGP3EU7OT7LSW6U6OQWMSR/events.json","paper":"https://pith.science/paper/QZO5OGP3"},"agent_actions":{"view_html":"https://pith.science/pith/QZO5OGP3EU7OT7LSW6U6OQWMSR","download_json":"https://pith.science/pith/QZO5OGP3EU7OT7LSW6U6OQWMSR.json","view_paper":"https://pith.science/paper/QZO5OGP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5414&json=true","fetch_graph":"https://pith.science/api/pith-number/QZO5OGP3EU7OT7LSW6U6OQWMSR/graph.json","fetch_events":"https://pith.science/api/pith-number/QZO5OGP3EU7OT7LSW6U6OQWMSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZO5OGP3EU7OT7LSW6U6OQWMSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZO5OGP3EU7OT7LSW6U6OQWMSR/action/storage_attestation","attest_author":"https://pith.science/pith/QZO5OGP3EU7OT7LSW6U6OQWMSR/action/author_attestation","sign_citation":"https://pith.science/pith/QZO5OGP3EU7OT7LSW6U6OQWMSR/action/citation_signature","submit_replication":"https://pith.science/pith/QZO5OGP3EU7OT7LSW6U6OQWMSR/action/replication_record"}},"created_at":"2026-05-18T03:27:22.619055+00:00","updated_at":"2026-05-18T03:27:22.619055+00:00"}