{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:O3GHFRPLYZALVSU2Q7CL3FX4T7","short_pith_number":"pith:O3GHFRPL","canonical_record":{"source":{"id":"1004.5285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-04-29T13:46:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3ce54cfd7efc8a1bd8c918f1097232b41b6456fa4f7f22bfb6d26003f075bc95","abstract_canon_sha256":"fff43d03ff2b77253d304474e30b283a4a695166ccec011212ba8cd000880acc"},"schema_version":"1.0"},"canonical_sha256":"76cc72c5ebc640baca9a87c4bd96fc9fd32fc84bcafbe14bde706016c9f33ebc","source":{"kind":"arxiv","id":"1004.5285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.5285","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1004.5285v1","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.5285","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"O3GHFRPLYZAL","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O3GHFRPLYZALVSU2","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O3GHFRPL","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:O3GHFRPLYZALVSU2Q7CL3FX4T7","target":"record","payload":{"canonical_record":{"source":{"id":"1004.5285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-04-29T13:46:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3ce54cfd7efc8a1bd8c918f1097232b41b6456fa4f7f22bfb6d26003f075bc95","abstract_canon_sha256":"fff43d03ff2b77253d304474e30b283a4a695166ccec011212ba8cd000880acc"},"schema_version":"1.0"},"canonical_sha256":"76cc72c5ebc640baca9a87c4bd96fc9fd32fc84bcafbe14bde706016c9f33ebc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:35.200523Z","signature_b64":"3zncYrbGQwEL8Qu5NBavw1U19zS6wGMrJbpOKjf0v3QoSTSPzqVVc+FyK1JFdSHArnu2QR91bqkj3SAaribaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76cc72c5ebc640baca9a87c4bd96fc9fd32fc84bcafbe14bde706016c9f33ebc","last_reissued_at":"2026-05-18T04:09:35.200037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:35.200037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.5285","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-18T04:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LT/pz9Q7tjh0LzC9HVXjplX6yDud5psr83jg36YfNYgIl8IGSWnyN08QfjoHYGvEYmYVtrat5xEZTw1BzZUhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T09:08:45.690966Z"},"content_sha256":"3e78f1f5ab3a802b2f9ca48bac7ef4e0389874892ad2112084a86279f633adee","schema_version":"1.0","event_id":"sha256:3e78f1f5ab3a802b2f9ca48bac7ef4e0389874892ad2112084a86279f633adee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:O3GHFRPLYZALVSU2Q7CL3FX4T7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Optimal Algorithms for the Decomposition of Multivariate Rational Functions and the Extended L\\\"uroth's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SC","authors_text":"Guillaume Ch\\`eze (IMT)","submitted_at":"2010-04-29T13:46:26Z","abstract_excerpt":"The extended L\\\"uroth's Theorem says that if the transcendence degree of $\\KK(\\mathsf{f}_1,\\dots,\\mathsf{f}_m)/\\KK$ is 1 then there exists $f \\in \\KK(\\underline{X})$ such that $\\KK(\\mathsf{f}_1,\\dots,\\mathsf{f}_m)$ is equal to $\\KK(f)$. In this paper we show how to compute $f$ with a probabilistic algorithm. We also describe a probabilistic and a deterministic algorithm for the decomposition of multivariate rational functions. The probabilistic algorithms proposed in this paper are softly optimal when $n$ is fixed and $d$ tends to infinity. We also give an indecomposability test based on gcd c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.5285","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-18T04:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vSMj3a1c5hR9UucyWAG+OMptm89CXb2DbgmLYh/4F4QCzHd8ZLazjYuqPwwHyvuSGYKASLX246075u6buJ99AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T09:08:45.691307Z"},"content_sha256":"6ed868efe342b8758ba86fbb11b1cb5b399c7a53ea725d4b139f9ababa5d0a23","schema_version":"1.0","event_id":"sha256:6ed868efe342b8758ba86fbb11b1cb5b399c7a53ea725d4b139f9ababa5d0a23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3GHFRPLYZALVSU2Q7CL3FX4T7/bundle.json","state_url":"https://pith.science/pith/O3GHFRPLYZALVSU2Q7CL3FX4T7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3GHFRPLYZALVSU2Q7CL3FX4T7/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-04T09:08:45Z","links":{"resolver":"https://pith.science/pith/O3GHFRPLYZALVSU2Q7CL3FX4T7","bundle":"https://pith.science/pith/O3GHFRPLYZALVSU2Q7CL3FX4T7/bundle.json","state":"https://pith.science/pith/O3GHFRPLYZALVSU2Q7CL3FX4T7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3GHFRPLYZALVSU2Q7CL3FX4T7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:O3GHFRPLYZALVSU2Q7CL3FX4T7","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":"fff43d03ff2b77253d304474e30b283a4a695166ccec011212ba8cd000880acc","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-04-29T13:46:26Z","title_canon_sha256":"3ce54cfd7efc8a1bd8c918f1097232b41b6456fa4f7f22bfb6d26003f075bc95"},"schema_version":"1.0","source":{"id":"1004.5285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.5285","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1004.5285v1","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.5285","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"O3GHFRPLYZAL","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O3GHFRPLYZALVSU2","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O3GHFRPL","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:6ed868efe342b8758ba86fbb11b1cb5b399c7a53ea725d4b139f9ababa5d0a23","target":"graph","created_at":"2026-05-18T04:09:35Z","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":"The extended L\\\"uroth's Theorem says that if the transcendence degree of $\\KK(\\mathsf{f}_1,\\dots,\\mathsf{f}_m)/\\KK$ is 1 then there exists $f \\in \\KK(\\underline{X})$ such that $\\KK(\\mathsf{f}_1,\\dots,\\mathsf{f}_m)$ is equal to $\\KK(f)$. In this paper we show how to compute $f$ with a probabilistic algorithm. We also describe a probabilistic and a deterministic algorithm for the decomposition of multivariate rational functions. The probabilistic algorithms proposed in this paper are softly optimal when $n$ is fixed and $d$ tends to infinity. We also give an indecomposability test based on gcd c","authors_text":"Guillaume Ch\\`eze (IMT)","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-04-29T13:46:26Z","title":"Nearly Optimal Algorithms for the Decomposition of Multivariate Rational Functions and the Extended L\\\"uroth's Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.5285","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:3e78f1f5ab3a802b2f9ca48bac7ef4e0389874892ad2112084a86279f633adee","target":"record","created_at":"2026-05-18T04:09:35Z","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":"fff43d03ff2b77253d304474e30b283a4a695166ccec011212ba8cd000880acc","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-04-29T13:46:26Z","title_canon_sha256":"3ce54cfd7efc8a1bd8c918f1097232b41b6456fa4f7f22bfb6d26003f075bc95"},"schema_version":"1.0","source":{"id":"1004.5285","kind":"arxiv","version":1}},"canonical_sha256":"76cc72c5ebc640baca9a87c4bd96fc9fd32fc84bcafbe14bde706016c9f33ebc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76cc72c5ebc640baca9a87c4bd96fc9fd32fc84bcafbe14bde706016c9f33ebc","first_computed_at":"2026-05-18T04:09:35.200037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:35.200037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3zncYrbGQwEL8Qu5NBavw1U19zS6wGMrJbpOKjf0v3QoSTSPzqVVc+FyK1JFdSHArnu2QR91bqkj3SAaribaAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:35.200523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.5285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e78f1f5ab3a802b2f9ca48bac7ef4e0389874892ad2112084a86279f633adee","sha256:6ed868efe342b8758ba86fbb11b1cb5b399c7a53ea725d4b139f9ababa5d0a23"],"state_sha256":"5466364aff25cf40c77b83b617cb54b11f3f86407b509262aaf0f0f714d08d4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7+F78RAOwQlW64swTg/mCpLkBEh6oiwmj3LryWdhZt09JRXbQXVZfR0XQLRjLv/FeRgKMUZOYvKc2D2quBeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T09:08:45.693294Z","bundle_sha256":"9bddf59dc6e7703d37d3d42cdab34882c22d17528387133e8cff44bc83426080"}}