{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YL5UCFRTFCVOUXC2QWEFA447GO","short_pith_number":"pith:YL5UCFRT","schema_version":"1.0","canonical_sha256":"c2fb41163328aaea5c5a858850739f339d28ef205d402a258400cbad9ca7b905","source":{"kind":"arxiv","id":"1802.01752","version":1},"attestation_state":"computed","paper":{"title":"On the chordality of polynomial sets in triangular decomposition in top-down style","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Chenqi Mou, Yang Bai","submitted_at":"2018-02-06T01:12:56Z","abstract_excerpt":"In this paper the chordal graph structures of polynomial sets appearing in triangular decomposition in top-down style are studied when the input polynomial set to decompose has a chordal associated graph. In particular, we prove that the associated graph of one specific triangular set computed in any algorithm for triangular decomposition in top-down style is a subgraph of the chordal graph of the input polynomial set and that all the polynomial sets including all the computed triangular sets appearing in one specific simply-structured algorithm for triangular decomposition in top-down style ("},"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":"1802.01752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-06T01:12:56Z","cross_cats_sorted":[],"title_canon_sha256":"cdae55ff76bee6d3cd45115fda22afa6e2666a667b9e82f186b6e30d52b614aa","abstract_canon_sha256":"a795fd3800a735ec1a1ac9b8f87efdf0202296a38157b3a9eb42db82627060ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:21.387970Z","signature_b64":"0nHvEsEB6oq3WcLjQh6dw4iki7a+nj5r26Yv49W4vgIQJQQ8k8hoxIlbSZPiZY7Upea745oSWIIU79vTZqpKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2fb41163328aaea5c5a858850739f339d28ef205d402a258400cbad9ca7b905","last_reissued_at":"2026-05-18T00:24:21.387527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:21.387527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the chordality of polynomial sets in triangular decomposition in top-down style","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Chenqi Mou, Yang Bai","submitted_at":"2018-02-06T01:12:56Z","abstract_excerpt":"In this paper the chordal graph structures of polynomial sets appearing in triangular decomposition in top-down style are studied when the input polynomial set to decompose has a chordal associated graph. In particular, we prove that the associated graph of one specific triangular set computed in any algorithm for triangular decomposition in top-down style is a subgraph of the chordal graph of the input polynomial set and that all the polynomial sets including all the computed triangular sets appearing in one specific simply-structured algorithm for triangular decomposition in top-down style ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01752","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.01752","created_at":"2026-05-18T00:24:21.387593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01752v1","created_at":"2026-05-18T00:24:21.387593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01752","created_at":"2026-05-18T00:24:21.387593+00:00"},{"alias_kind":"pith_short_12","alias_value":"YL5UCFRTFCVO","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YL5UCFRTFCVOUXC2","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YL5UCFRT","created_at":"2026-05-18T12:33:04.347982+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/YL5UCFRTFCVOUXC2QWEFA447GO","json":"https://pith.science/pith/YL5UCFRTFCVOUXC2QWEFA447GO.json","graph_json":"https://pith.science/api/pith-number/YL5UCFRTFCVOUXC2QWEFA447GO/graph.json","events_json":"https://pith.science/api/pith-number/YL5UCFRTFCVOUXC2QWEFA447GO/events.json","paper":"https://pith.science/paper/YL5UCFRT"},"agent_actions":{"view_html":"https://pith.science/pith/YL5UCFRTFCVOUXC2QWEFA447GO","download_json":"https://pith.science/pith/YL5UCFRTFCVOUXC2QWEFA447GO.json","view_paper":"https://pith.science/paper/YL5UCFRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01752&json=true","fetch_graph":"https://pith.science/api/pith-number/YL5UCFRTFCVOUXC2QWEFA447GO/graph.json","fetch_events":"https://pith.science/api/pith-number/YL5UCFRTFCVOUXC2QWEFA447GO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YL5UCFRTFCVOUXC2QWEFA447GO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YL5UCFRTFCVOUXC2QWEFA447GO/action/storage_attestation","attest_author":"https://pith.science/pith/YL5UCFRTFCVOUXC2QWEFA447GO/action/author_attestation","sign_citation":"https://pith.science/pith/YL5UCFRTFCVOUXC2QWEFA447GO/action/citation_signature","submit_replication":"https://pith.science/pith/YL5UCFRTFCVOUXC2QWEFA447GO/action/replication_record"}},"created_at":"2026-05-18T00:24:21.387593+00:00","updated_at":"2026-05-18T00:24:21.387593+00:00"}