{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:JPOF3D4HIH4S5RZ7373AYDDVDH","short_pith_number":"pith:JPOF3D4H","canonical_record":{"source":{"id":"1011.0972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-11-03T19:01:48Z","cross_cats_sorted":["cs.DS","math.AC"],"title_canon_sha256":"86163a48c56bafb97d0d2149ea56d9647ea8db04a1db677c3374dc39bbfeb111","abstract_canon_sha256":"ce3eef5581dc1e5e68ea752e23075bace50ed98a1fcb83b0ab22e37c0b451a91"},"schema_version":"1.0"},"canonical_sha256":"4bdc5d8f8741f92ec73fdff60c0c7519ee632435e5100ca8678143dfaa773204","source":{"kind":"arxiv","id":"1011.0972","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0972","created_at":"2026-05-18T02:58:01Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0972v1","created_at":"2026-05-18T02:58:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0972","created_at":"2026-05-18T02:58:01Z"},{"alias_kind":"pith_short_12","alias_value":"JPOF3D4HIH4S","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JPOF3D4HIH4S5RZ7","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JPOF3D4H","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:JPOF3D4HIH4S5RZ7373AYDDVDH","target":"record","payload":{"canonical_record":{"source":{"id":"1011.0972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-11-03T19:01:48Z","cross_cats_sorted":["cs.DS","math.AC"],"title_canon_sha256":"86163a48c56bafb97d0d2149ea56d9647ea8db04a1db677c3374dc39bbfeb111","abstract_canon_sha256":"ce3eef5581dc1e5e68ea752e23075bace50ed98a1fcb83b0ab22e37c0b451a91"},"schema_version":"1.0"},"canonical_sha256":"4bdc5d8f8741f92ec73fdff60c0c7519ee632435e5100ca8678143dfaa773204","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:01.557281Z","signature_b64":"rhp+yzo0V3Ze77IBT+XJOiDVnWkr/vQ6r+FhhQxksm18ynltil1hrP4dgTB7XRFwy71jF0eypJ/ov4p+KXsXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bdc5d8f8741f92ec73fdff60c0c7519ee632435e5100ca8678143dfaa773204","last_reissued_at":"2026-05-18T02:58:01.556568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:01.556568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.0972","source_version":1,"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-18T02:58:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0xQ4KCwPZGmoQd8ppHz5M69atjPeMDSu98gXDxa/tyU4Wcq47mzTrS6bN2KB/xF3EGuGtC8IlNSfekxl1D+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T05:26:11.338667Z"},"content_sha256":"bdbcc8935c27e935d8d3944a9a457d1768ae139d73fcbad96bf3fded87482fab","schema_version":"1.0","event_id":"sha256:bdbcc8935c27e935d8d3944a9a457d1768ae139d73fcbad96bf3fded87482fab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:JPOF3D4HIH4S5RZ7373AYDDVDH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A recombination algorithm for the decomposition of multivariate rational functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.AC"],"primary_cat":"cs.SC","authors_text":"Guillaume Ch\\`eze (IMT)","submitted_at":"2010-11-03T19:01:48Z","abstract_excerpt":"In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombination strategy is the used of Darboux polynomials. We study the complexity of this strategy and we show that this method improves the previous ones. In appendix, we explain how the strategy proposed recently by J. Berthomieu and G. Lecerf for the sparse factorization can be used in the decomposition setting. Then we deduce a decomposition algorithm in the sparse bivariate case and we give its complexity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0972","kind":"arxiv","version":1},"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-18T02:58:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kg2aob3PT5f85M1Fdvq2aO+a6w1VD0KLqkbuAaU9dtg0fl46mOMAIB+TYGjDzpOGC18TnWXZiIh9v4VH48ZZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T05:26:11.339233Z"},"content_sha256":"a9a857bddb6b5d2d46aa0ac56b0c38a193d1e76066c5b67724d96faa30acf123","schema_version":"1.0","event_id":"sha256:a9a857bddb6b5d2d46aa0ac56b0c38a193d1e76066c5b67724d96faa30acf123"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPOF3D4HIH4S5RZ7373AYDDVDH/bundle.json","state_url":"https://pith.science/pith/JPOF3D4HIH4S5RZ7373AYDDVDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPOF3D4HIH4S5RZ7373AYDDVDH/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-07-04T05:26:11Z","links":{"resolver":"https://pith.science/pith/JPOF3D4HIH4S5RZ7373AYDDVDH","bundle":"https://pith.science/pith/JPOF3D4HIH4S5RZ7373AYDDVDH/bundle.json","state":"https://pith.science/pith/JPOF3D4HIH4S5RZ7373AYDDVDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPOF3D4HIH4S5RZ7373AYDDVDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:JPOF3D4HIH4S5RZ7373AYDDVDH","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":"ce3eef5581dc1e5e68ea752e23075bace50ed98a1fcb83b0ab22e37c0b451a91","cross_cats_sorted":["cs.DS","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-11-03T19:01:48Z","title_canon_sha256":"86163a48c56bafb97d0d2149ea56d9647ea8db04a1db677c3374dc39bbfeb111"},"schema_version":"1.0","source":{"id":"1011.0972","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0972","created_at":"2026-05-18T02:58:01Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0972v1","created_at":"2026-05-18T02:58:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0972","created_at":"2026-05-18T02:58:01Z"},{"alias_kind":"pith_short_12","alias_value":"JPOF3D4HIH4S","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JPOF3D4HIH4S5RZ7","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JPOF3D4H","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:a9a857bddb6b5d2d46aa0ac56b0c38a193d1e76066c5b67724d96faa30acf123","target":"graph","created_at":"2026-05-18T02:58:01Z","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":"In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombination strategy is the used of Darboux polynomials. We study the complexity of this strategy and we show that this method improves the previous ones. In appendix, we explain how the strategy proposed recently by J. Berthomieu and G. Lecerf for the sparse factorization can be used in the decomposition setting. Then we deduce a decomposition algorithm in the sparse bivariate case and we give its complexity","authors_text":"Guillaume Ch\\`eze (IMT)","cross_cats":["cs.DS","math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-11-03T19:01:48Z","title":"A recombination algorithm for the decomposition of multivariate rational functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0972","kind":"arxiv","version":1},"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:bdbcc8935c27e935d8d3944a9a457d1768ae139d73fcbad96bf3fded87482fab","target":"record","created_at":"2026-05-18T02:58:01Z","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":"ce3eef5581dc1e5e68ea752e23075bace50ed98a1fcb83b0ab22e37c0b451a91","cross_cats_sorted":["cs.DS","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-11-03T19:01:48Z","title_canon_sha256":"86163a48c56bafb97d0d2149ea56d9647ea8db04a1db677c3374dc39bbfeb111"},"schema_version":"1.0","source":{"id":"1011.0972","kind":"arxiv","version":1}},"canonical_sha256":"4bdc5d8f8741f92ec73fdff60c0c7519ee632435e5100ca8678143dfaa773204","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bdc5d8f8741f92ec73fdff60c0c7519ee632435e5100ca8678143dfaa773204","first_computed_at":"2026-05-18T02:58:01.556568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:01.556568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rhp+yzo0V3Ze77IBT+XJOiDVnWkr/vQ6r+FhhQxksm18ynltil1hrP4dgTB7XRFwy71jF0eypJ/ov4p+KXsXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:01.557281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0972","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdbcc8935c27e935d8d3944a9a457d1768ae139d73fcbad96bf3fded87482fab","sha256:a9a857bddb6b5d2d46aa0ac56b0c38a193d1e76066c5b67724d96faa30acf123"],"state_sha256":"74b6a1fd75da68854fc6015b04ba495c5f0d3994aab74f1cb0e0da565671e36d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTgPn3UG8dcd3yboN1xQvYWdGOwFmgTtwAmSM3N6UE303/tDloQVeQOj3nIAfXY9uQbcc6UlyQjsShTjU7tYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T05:26:11.342062Z","bundle_sha256":"c7255cb5a409922cc87d5aacf01b1b28d0c5844adeaebe32d1b80e7d396d39bb"}}