{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WT3X76EAQCOG6RNGJJAIRC2QZ3","short_pith_number":"pith:WT3X76EA","schema_version":"1.0","canonical_sha256":"b4f77ff880809c6f45a64a40888b50ced4f76c6aa42c9e5167f6f5b1aa8d46a8","source":{"kind":"arxiv","id":"1007.3653","version":2},"attestation_state":"computed","paper":{"title":"Complexity reduction of C-algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.CA","authors_text":"Islam Boussaada, Magali Bardet","submitted_at":"2010-07-21T13:25:52Z","abstract_excerpt":"The C-Algorithm introduced in [Chouikha2007] is designed to determine isochronous centers for Lienard-type differential systems, in the general real analytic case. However, it has a large complexity that prevents computations, even in the quartic polynomial case.\n  The main result of this paper is an efficient algorithmic implementation of C-Algorithm, called ReCA (Reduced C-Algorithm). Moreover, an adapted version of it is proposed in the rational case. It is called RCA (Rational C-Algorithm) and is widely used in [BardetBoussaadaChouikhaStrelcyn2010] and [BoussaadaChouikhaStrelcyn2010] to fi"},"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":"1007.3653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2010-07-21T13:25:52Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"5f887d20b9024144c6999d1cd692b734b3b702d154e6890eba71424606b2aba5","abstract_canon_sha256":"c7990e2bcba84a21a1b237b352472a7320f1f5c026e8c29a18cbc1455af1a07d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:59.885866Z","signature_b64":"QnUwaeTKDyOH5Sg3oa7YkZJy5+tR0CUibw2cWYHPGXJTar7g39VkPmbywIXhtpDYVndyCa4AmIkbnPjNHqN0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f77ff880809c6f45a64a40888b50ced4f76c6aa42c9e5167f6f5b1aa8d46a8","last_reissued_at":"2026-05-18T03:04:59.885417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:59.885417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity reduction of C-algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.CA","authors_text":"Islam Boussaada, Magali Bardet","submitted_at":"2010-07-21T13:25:52Z","abstract_excerpt":"The C-Algorithm introduced in [Chouikha2007] is designed to determine isochronous centers for Lienard-type differential systems, in the general real analytic case. However, it has a large complexity that prevents computations, even in the quartic polynomial case.\n  The main result of this paper is an efficient algorithmic implementation of C-Algorithm, called ReCA (Reduced C-Algorithm). Moreover, an adapted version of it is proposed in the rational case. It is called RCA (Rational C-Algorithm) and is widely used in [BardetBoussaadaChouikhaStrelcyn2010] and [BoussaadaChouikhaStrelcyn2010] to fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3653","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":"1007.3653","created_at":"2026-05-18T03:04:59.885481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.3653v2","created_at":"2026-05-18T03:04:59.885481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3653","created_at":"2026-05-18T03:04:59.885481+00:00"},{"alias_kind":"pith_short_12","alias_value":"WT3X76EAQCOG","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"WT3X76EAQCOG6RNG","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"WT3X76EA","created_at":"2026-05-18T12:26:17.028572+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/WT3X76EAQCOG6RNGJJAIRC2QZ3","json":"https://pith.science/pith/WT3X76EAQCOG6RNGJJAIRC2QZ3.json","graph_json":"https://pith.science/api/pith-number/WT3X76EAQCOG6RNGJJAIRC2QZ3/graph.json","events_json":"https://pith.science/api/pith-number/WT3X76EAQCOG6RNGJJAIRC2QZ3/events.json","paper":"https://pith.science/paper/WT3X76EA"},"agent_actions":{"view_html":"https://pith.science/pith/WT3X76EAQCOG6RNGJJAIRC2QZ3","download_json":"https://pith.science/pith/WT3X76EAQCOG6RNGJJAIRC2QZ3.json","view_paper":"https://pith.science/paper/WT3X76EA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.3653&json=true","fetch_graph":"https://pith.science/api/pith-number/WT3X76EAQCOG6RNGJJAIRC2QZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/WT3X76EAQCOG6RNGJJAIRC2QZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WT3X76EAQCOG6RNGJJAIRC2QZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WT3X76EAQCOG6RNGJJAIRC2QZ3/action/storage_attestation","attest_author":"https://pith.science/pith/WT3X76EAQCOG6RNGJJAIRC2QZ3/action/author_attestation","sign_citation":"https://pith.science/pith/WT3X76EAQCOG6RNGJJAIRC2QZ3/action/citation_signature","submit_replication":"https://pith.science/pith/WT3X76EAQCOG6RNGJJAIRC2QZ3/action/replication_record"}},"created_at":"2026-05-18T03:04:59.885481+00:00","updated_at":"2026-05-18T03:04:59.885481+00:00"}