{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QA4FD2UW5HXD2XJACNLJOKIGXB","short_pith_number":"pith:QA4FD2UW","canonical_record":{"source":{"id":"1109.4323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-09-20T15:34:04Z","cross_cats_sorted":[],"title_canon_sha256":"d324dd3aaabbbb17bb6d40c90cd77104a80735f809e8cc7729f00e1fab9e5def","abstract_canon_sha256":"059f8df1847c62779092b2e50a9858084732de167bfcd29e9733aa507d8cfbd8"},"schema_version":"1.0"},"canonical_sha256":"803851ea96e9ee3d5d201356972906b842107f211f4a4b7441c2ab3b11d995a6","source":{"kind":"arxiv","id":"1109.4323","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4323","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4323v1","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4323","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"QA4FD2UW5HXD","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QA4FD2UW5HXD2XJA","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QA4FD2UW","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QA4FD2UW5HXD2XJACNLJOKIGXB","target":"record","payload":{"canonical_record":{"source":{"id":"1109.4323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-09-20T15:34:04Z","cross_cats_sorted":[],"title_canon_sha256":"d324dd3aaabbbb17bb6d40c90cd77104a80735f809e8cc7729f00e1fab9e5def","abstract_canon_sha256":"059f8df1847c62779092b2e50a9858084732de167bfcd29e9733aa507d8cfbd8"},"schema_version":"1.0"},"canonical_sha256":"803851ea96e9ee3d5d201356972906b842107f211f4a4b7441c2ab3b11d995a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:43.552728Z","signature_b64":"azag6dT5Uotp1IySWMx3gJFvTZhcSTKE94YqnjEquvhCIALmmodY6sJv0k5ukP0eJre99lFa9WHixf8csRWyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"803851ea96e9ee3d5d201356972906b842107f211f4a4b7441c2ab3b11d995a6","last_reissued_at":"2026-05-18T04:12:43.552056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:43.552056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.4323","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:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"veYIad8B8McthoU3PVgK5yV3aykHfTQ4/iGTwGYHPbgKCe4VY6HwWOxxaRWscpre5eIyuj0iv++d4V02k8TtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:05:11.294780Z"},"content_sha256":"b005ff6dd1bf62e86b81fb1acbf0d1bffa08518b45d9ba62e53fe47b954cf190","schema_version":"1.0","event_id":"sha256:b005ff6dd1bf62e86b81fb1acbf0d1bffa08518b45d9ba62e53fe47b954cf190"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QA4FD2UW5HXD2XJACNLJOKIGXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of computing with zero-dimensional triangular sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Adrien Poteaux, \\'Eric Schost","submitted_at":"2011-09-20T15:34:04Z","abstract_excerpt":"We study the complexity of some fundamental operations for triangular sets in dimension zero. Using Las-Vegas algorithms, we prove that one can perform such operations as change of order, equiprojectable decomposition, or quasi-inverse computation with a cost that is essentially that of modular composition. Over an abstract field, this leads to a subquadratic cost (with respect to the degree of the underlying algebraic set). Over a finite field, in a boolean RAM model, we obtain a quasi-linear running time using Kedlaya and Umans' algorithm for modular composition. Conversely, we also show how"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4323","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:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EYutCnAn5udo56/IIXNRIddowetZ9fG1YBxpB0G2S7w10SFaZcZHM9wC36ksFLI/2wInYfVSZwOJUqLigElfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:05:11.295118Z"},"content_sha256":"6c25c35d7d60a1bf0008493e20f06416c87a391ee2d1a117652dbdae19ddb2e1","schema_version":"1.0","event_id":"sha256:6c25c35d7d60a1bf0008493e20f06416c87a391ee2d1a117652dbdae19ddb2e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QA4FD2UW5HXD2XJACNLJOKIGXB/bundle.json","state_url":"https://pith.science/pith/QA4FD2UW5HXD2XJACNLJOKIGXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QA4FD2UW5HXD2XJACNLJOKIGXB/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-06-22T11:05:11Z","links":{"resolver":"https://pith.science/pith/QA4FD2UW5HXD2XJACNLJOKIGXB","bundle":"https://pith.science/pith/QA4FD2UW5HXD2XJACNLJOKIGXB/bundle.json","state":"https://pith.science/pith/QA4FD2UW5HXD2XJACNLJOKIGXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QA4FD2UW5HXD2XJACNLJOKIGXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QA4FD2UW5HXD2XJACNLJOKIGXB","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":"059f8df1847c62779092b2e50a9858084732de167bfcd29e9733aa507d8cfbd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-09-20T15:34:04Z","title_canon_sha256":"d324dd3aaabbbb17bb6d40c90cd77104a80735f809e8cc7729f00e1fab9e5def"},"schema_version":"1.0","source":{"id":"1109.4323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4323","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4323v1","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4323","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"QA4FD2UW5HXD","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QA4FD2UW5HXD2XJA","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QA4FD2UW","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:6c25c35d7d60a1bf0008493e20f06416c87a391ee2d1a117652dbdae19ddb2e1","target":"graph","created_at":"2026-05-18T04:12:43Z","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":"We study the complexity of some fundamental operations for triangular sets in dimension zero. Using Las-Vegas algorithms, we prove that one can perform such operations as change of order, equiprojectable decomposition, or quasi-inverse computation with a cost that is essentially that of modular composition. Over an abstract field, this leads to a subquadratic cost (with respect to the degree of the underlying algebraic set). Over a finite field, in a boolean RAM model, we obtain a quasi-linear running time using Kedlaya and Umans' algorithm for modular composition. Conversely, we also show how","authors_text":"Adrien Poteaux, \\'Eric Schost","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-09-20T15:34:04Z","title":"On the complexity of computing with zero-dimensional triangular sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4323","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:b005ff6dd1bf62e86b81fb1acbf0d1bffa08518b45d9ba62e53fe47b954cf190","target":"record","created_at":"2026-05-18T04:12:43Z","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":"059f8df1847c62779092b2e50a9858084732de167bfcd29e9733aa507d8cfbd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-09-20T15:34:04Z","title_canon_sha256":"d324dd3aaabbbb17bb6d40c90cd77104a80735f809e8cc7729f00e1fab9e5def"},"schema_version":"1.0","source":{"id":"1109.4323","kind":"arxiv","version":1}},"canonical_sha256":"803851ea96e9ee3d5d201356972906b842107f211f4a4b7441c2ab3b11d995a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"803851ea96e9ee3d5d201356972906b842107f211f4a4b7441c2ab3b11d995a6","first_computed_at":"2026-05-18T04:12:43.552056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:43.552056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"azag6dT5Uotp1IySWMx3gJFvTZhcSTKE94YqnjEquvhCIALmmodY6sJv0k5ukP0eJre99lFa9WHixf8csRWyCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:43.552728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b005ff6dd1bf62e86b81fb1acbf0d1bffa08518b45d9ba62e53fe47b954cf190","sha256:6c25c35d7d60a1bf0008493e20f06416c87a391ee2d1a117652dbdae19ddb2e1"],"state_sha256":"83640e32fb02dfe08ca505bedf15832288ae57bab806d9e3a87c83b938f9a7e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rU4MOEQMkbaIPJJaCBZPNzJe6GgNjTANaQ7d7mVyyC55kFVoE3t2MRoJXLWFgsQhInJUl/ccqcD1g9lWkyXqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:05:11.297107Z","bundle_sha256":"c1ce4cab28ec64b449993b949d2c70896982408284531b22b0a2fced2f9c79d6"}}