{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:K7MWGFHW2QJD6VBFOHB6EXZETK","short_pith_number":"pith:K7MWGFHW","canonical_record":{"source":{"id":"1101.3603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-01-19T02:59:37Z","cross_cats_sorted":[],"title_canon_sha256":"89ab32bead780d54d8e13810ce7d43888e9d22e94d595e54d421c601e14452f7","abstract_canon_sha256":"fbf2c2502c252e9fd4367d04ee7c66bed480e93cd0f6b0b0435ad8cecd08c977"},"schema_version":"1.0"},"canonical_sha256":"57d96314f6d4123f542571c3e25f249ab183ddb729f5adab5c9cb5602d03cd4b","source":{"kind":"arxiv","id":"1101.3603","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3603","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3603v1","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3603","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"pith_short_12","alias_value":"K7MWGFHW2QJD","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K7MWGFHW2QJD6VBF","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K7MWGFHW","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:K7MWGFHW2QJD6VBFOHB6EXZETK","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-01-19T02:59:37Z","cross_cats_sorted":[],"title_canon_sha256":"89ab32bead780d54d8e13810ce7d43888e9d22e94d595e54d421c601e14452f7","abstract_canon_sha256":"fbf2c2502c252e9fd4367d04ee7c66bed480e93cd0f6b0b0435ad8cecd08c977"},"schema_version":"1.0"},"canonical_sha256":"57d96314f6d4123f542571c3e25f249ab183ddb729f5adab5c9cb5602d03cd4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:21.892227Z","signature_b64":"UXHuQFnYn9Goa/REP8w1oI+oUN1SUiUOtVCN5PcG0nv1RoxZ7clmPGQ9a+DNjSLPWyyyAO3896HF+YZsHBpzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57d96314f6d4123f542571c3e25f249ab183ddb729f5adab5c9cb5602d03cd4b","last_reissued_at":"2026-05-18T04:31:21.891784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:21.891784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3603","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:31:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rllSjREqdrTUKt/nzVwkpCs3Cy5IOHYVfLxKRN9F1jXaylZB/fm8w7VS2Jtpgrres+5EFXIUAKDV0neYMwb7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:25:15.301787Z"},"content_sha256":"c57cce090bcfd162442bc7e1fad8d74040c3597d61debddc8de9640287a6dac3","schema_version":"1.0","event_id":"sha256:c57cce090bcfd162442bc7e1fad8d74040c3597d61debddc8de9640287a6dac3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:K7MWGFHW2QJD6VBFOHB6EXZETK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiplicity Preserving Triangular Set Decomposition of Two Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Jin-San Cheng, Xiao-Shan Gao","submitted_at":"2011-01-19T02:59:37Z","abstract_excerpt":"In this paper, a multiplicity preserving triangular set decomposition algorithm is proposed for a system of two polynomials. The algorithm decomposes the variety defined by the polynomial system into unmixed components represented by triangular sets, which may have negative multiplicities. In the bivariate case, we give a complete algorithm to decompose the system into multiplicity preserving triangular sets with positive multiplicities. We also analyze the complexity of the algorithm in the bivariate case. We implement our algorithm and show the effectiveness of the method with extensive expe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3603","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:31:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojDOwUnTeCUeAqOhYeRGdtj/UTkzIbUikvNeSU3NWj3JF1+tb0B4vjwWxRdyGZ/MOhiYtoZQG8R5+4sDGpRWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:25:15.302475Z"},"content_sha256":"747aac180e4de681b2026cf4d3ac42a09f3f6cfda1c82de9b2565385d11b51a3","schema_version":"1.0","event_id":"sha256:747aac180e4de681b2026cf4d3ac42a09f3f6cfda1c82de9b2565385d11b51a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7MWGFHW2QJD6VBFOHB6EXZETK/bundle.json","state_url":"https://pith.science/pith/K7MWGFHW2QJD6VBFOHB6EXZETK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7MWGFHW2QJD6VBFOHB6EXZETK/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-09T23:25:15Z","links":{"resolver":"https://pith.science/pith/K7MWGFHW2QJD6VBFOHB6EXZETK","bundle":"https://pith.science/pith/K7MWGFHW2QJD6VBFOHB6EXZETK/bundle.json","state":"https://pith.science/pith/K7MWGFHW2QJD6VBFOHB6EXZETK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7MWGFHW2QJD6VBFOHB6EXZETK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:K7MWGFHW2QJD6VBFOHB6EXZETK","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":"fbf2c2502c252e9fd4367d04ee7c66bed480e93cd0f6b0b0435ad8cecd08c977","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-01-19T02:59:37Z","title_canon_sha256":"89ab32bead780d54d8e13810ce7d43888e9d22e94d595e54d421c601e14452f7"},"schema_version":"1.0","source":{"id":"1101.3603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3603","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3603v1","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3603","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"pith_short_12","alias_value":"K7MWGFHW2QJD","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K7MWGFHW2QJD6VBF","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K7MWGFHW","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:747aac180e4de681b2026cf4d3ac42a09f3f6cfda1c82de9b2565385d11b51a3","target":"graph","created_at":"2026-05-18T04:31:21Z","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, a multiplicity preserving triangular set decomposition algorithm is proposed for a system of two polynomials. The algorithm decomposes the variety defined by the polynomial system into unmixed components represented by triangular sets, which may have negative multiplicities. In the bivariate case, we give a complete algorithm to decompose the system into multiplicity preserving triangular sets with positive multiplicities. We also analyze the complexity of the algorithm in the bivariate case. We implement our algorithm and show the effectiveness of the method with extensive expe","authors_text":"Jin-San Cheng, Xiao-Shan Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-01-19T02:59:37Z","title":"Multiplicity Preserving Triangular Set Decomposition of Two Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3603","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:c57cce090bcfd162442bc7e1fad8d74040c3597d61debddc8de9640287a6dac3","target":"record","created_at":"2026-05-18T04:31:21Z","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":"fbf2c2502c252e9fd4367d04ee7c66bed480e93cd0f6b0b0435ad8cecd08c977","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-01-19T02:59:37Z","title_canon_sha256":"89ab32bead780d54d8e13810ce7d43888e9d22e94d595e54d421c601e14452f7"},"schema_version":"1.0","source":{"id":"1101.3603","kind":"arxiv","version":1}},"canonical_sha256":"57d96314f6d4123f542571c3e25f249ab183ddb729f5adab5c9cb5602d03cd4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57d96314f6d4123f542571c3e25f249ab183ddb729f5adab5c9cb5602d03cd4b","first_computed_at":"2026-05-18T04:31:21.891784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:21.891784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UXHuQFnYn9Goa/REP8w1oI+oUN1SUiUOtVCN5PcG0nv1RoxZ7clmPGQ9a+DNjSLPWyyyAO3896HF+YZsHBpzDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:21.892227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c57cce090bcfd162442bc7e1fad8d74040c3597d61debddc8de9640287a6dac3","sha256:747aac180e4de681b2026cf4d3ac42a09f3f6cfda1c82de9b2565385d11b51a3"],"state_sha256":"e7f86ae186bae7b00e13271f13e0504e6546043a33270d9cc412c92dc9cb0545"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1Rub2T59uoEf3CjTak9gZjk5xnHs9yGay+huP9gQDsLrWy+cBObFaXf5nXic6ZqSNqGnWzM/8UEwoTFZqvQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T23:25:15.306390Z","bundle_sha256":"9b0024e349a520fab8264769ae5e7979aef4fe42915da19279b03fed10af32a1"}}