{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:IDWBG44A3W6L3H35LATZP6NGRL","short_pith_number":"pith:IDWBG44A","schema_version":"1.0","canonical_sha256":"40ec137380ddbcbd9f7d582797f9a68aed8caeecfb31f4de59d4487325f79ac6","source":{"kind":"arxiv","id":"0806.3911","version":1},"attestation_state":"computed","paper":{"title":"Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.GT","authors_text":"Dmitrii V. Pasechnik, Marie-Fran\\c{c}oise Roy, Saugata Basu","submitted_at":"2008-06-24T14:54:07Z","abstract_excerpt":"Let $\\R$ be a real closed field, $ {\\mathcal Q} \\subset \\R[Y_1,...,Y_\\ell,X_1,...,X_k], $ with $ \\deg_{Y}(Q) \\leq 2, \\deg_{X}(Q) \\leq d, Q \\in {\\mathcal Q}, #({\\mathcal Q})=m$, and $ {\\mathcal P} \\subset \\R[X_1,...,X_k] $ with $\\deg_{X}(P) \\leq d, P \\in {\\mathcal P}, #({\\mathcal P})=s$. Let $S \\subset \\R^{\\ell+k}$ be a semi-algebraic set defined by a Boolean formula without negations, with atoms $P=0, P \\geq 0, P \\leq 0, P \\in {\\mathcal P} \\cup {\\mathcal Q}$. We describe an algorithm for computing the the Betti numbers of $S$. The complexity of the algorithm is bounded by $(\\ell s m d)^{2^{O(m"},"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":"0806.3911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2008-06-24T14:54:07Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"1036ebbe093b95ca6c90516427ab9f2f910c8a07667636fd3d1742174553e641","abstract_canon_sha256":"4be6e8f42301ff59535fbad777aa7e9c7dcc7792dee72c4f5d54a9e7c212e050"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:00.299961Z","signature_b64":"7pA5k0wnoedl5LwrUW+7R6hlt0w85KerA1q4Vt7WBeyo7xOwg1pJIPL+o36iyTT3L5OGiW3rtbldIKFfeuK+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40ec137380ddbcbd9f7d582797f9a68aed8caeecfb31f4de59d4487325f79ac6","last_reissued_at":"2026-05-18T04:39:00.299462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:00.299462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.GT","authors_text":"Dmitrii V. Pasechnik, Marie-Fran\\c{c}oise Roy, Saugata Basu","submitted_at":"2008-06-24T14:54:07Z","abstract_excerpt":"Let $\\R$ be a real closed field, $ {\\mathcal Q} \\subset \\R[Y_1,...,Y_\\ell,X_1,...,X_k], $ with $ \\deg_{Y}(Q) \\leq 2, \\deg_{X}(Q) \\leq d, Q \\in {\\mathcal Q}, #({\\mathcal Q})=m$, and $ {\\mathcal P} \\subset \\R[X_1,...,X_k] $ with $\\deg_{X}(P) \\leq d, P \\in {\\mathcal P}, #({\\mathcal P})=s$. Let $S \\subset \\R^{\\ell+k}$ be a semi-algebraic set defined by a Boolean formula without negations, with atoms $P=0, P \\geq 0, P \\leq 0, P \\in {\\mathcal P} \\cup {\\mathcal Q}$. We describe an algorithm for computing the the Betti numbers of $S$. The complexity of the algorithm is bounded by $(\\ell s m d)^{2^{O(m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.3911","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":"0806.3911","created_at":"2026-05-18T04:39:00.299541+00:00"},{"alias_kind":"arxiv_version","alias_value":"0806.3911v1","created_at":"2026-05-18T04:39:00.299541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.3911","created_at":"2026-05-18T04:39:00.299541+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDWBG44A3W6L","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDWBG44A3W6L3H35","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDWBG44A","created_at":"2026-05-18T12:25:57.157939+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/IDWBG44A3W6L3H35LATZP6NGRL","json":"https://pith.science/pith/IDWBG44A3W6L3H35LATZP6NGRL.json","graph_json":"https://pith.science/api/pith-number/IDWBG44A3W6L3H35LATZP6NGRL/graph.json","events_json":"https://pith.science/api/pith-number/IDWBG44A3W6L3H35LATZP6NGRL/events.json","paper":"https://pith.science/paper/IDWBG44A"},"agent_actions":{"view_html":"https://pith.science/pith/IDWBG44A3W6L3H35LATZP6NGRL","download_json":"https://pith.science/pith/IDWBG44A3W6L3H35LATZP6NGRL.json","view_paper":"https://pith.science/paper/IDWBG44A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0806.3911&json=true","fetch_graph":"https://pith.science/api/pith-number/IDWBG44A3W6L3H35LATZP6NGRL/graph.json","fetch_events":"https://pith.science/api/pith-number/IDWBG44A3W6L3H35LATZP6NGRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDWBG44A3W6L3H35LATZP6NGRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDWBG44A3W6L3H35LATZP6NGRL/action/storage_attestation","attest_author":"https://pith.science/pith/IDWBG44A3W6L3H35LATZP6NGRL/action/author_attestation","sign_citation":"https://pith.science/pith/IDWBG44A3W6L3H35LATZP6NGRL/action/citation_signature","submit_replication":"https://pith.science/pith/IDWBG44A3W6L3H35LATZP6NGRL/action/replication_record"}},"created_at":"2026-05-18T04:39:00.299541+00:00","updated_at":"2026-05-18T04:39:00.299541+00:00"}