{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:5LVTAVVVR3LZU2FA2DN7REBXZC","short_pith_number":"pith:5LVTAVVV","schema_version":"1.0","canonical_sha256":"eaeb3056b58ed79a68a0d0dbf89037c8b40d3493c480fbe16c10ab91504000c5","source":{"kind":"arxiv","id":"2011.02162","version":2},"attestation_state":"computed","paper":{"title":"Connectivity in Semi-Algebraic Sets I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.AG","authors_text":"Eric Schost, Hoon Hong, James Rohal, Mohab Safey El Din","submitted_at":"2020-11-04T07:24:31Z","abstract_excerpt":"A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two given points in a semi-algebraic set are connected; that is, whether the two points lie in the same connected component. In particular, we consider the semi-algebraic set defined by f <> 0 where f is a given polynomial with integer coefficients. The motivation comes from the observation that many important or non-trivial problems in science and engineering can "},"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":"2011.02162","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2020-11-04T07:24:31Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"57acbaa69127bc30bbbe3cfabd3c9532bfbb99b91a20c5a42078e6f53d293768","abstract_canon_sha256":"597bc865e8f07b3a75148a0f6cd90987ce168cb765d8e2777513e16dda2f1979"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:22.762187Z","signature_b64":"HJRmf0W0KfQxOOUFUFhFGBrlvZ+dxs0LoP+LrHvTkTJo3UC0VMQtYMGIqIFAmem6TyWdaeLTD+cWKoAnAPU4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaeb3056b58ed79a68a0d0dbf89037c8b40d3493c480fbe16c10ab91504000c5","last_reissued_at":"2026-07-05T01:51:22.761739Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:22.761739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectivity in Semi-Algebraic Sets I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.AG","authors_text":"Eric Schost, Hoon Hong, James Rohal, Mohab Safey El Din","submitted_at":"2020-11-04T07:24:31Z","abstract_excerpt":"A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two given points in a semi-algebraic set are connected; that is, whether the two points lie in the same connected component. In particular, we consider the semi-algebraic set defined by f <> 0 where f is a given polynomial with integer coefficients. The motivation comes from the observation that many important or non-trivial problems in science and engineering can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.02162","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.02162/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.02162","created_at":"2026-07-05T01:51:22.761796+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.02162v2","created_at":"2026-07-05T01:51:22.761796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.02162","created_at":"2026-07-05T01:51:22.761796+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LVTAVVVR3LZ","created_at":"2026-07-05T01:51:22.761796+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LVTAVVVR3LZU2FA","created_at":"2026-07-05T01:51:22.761796+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LVTAVVV","created_at":"2026-07-05T01:51:22.761796+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.00128","citing_title":"Routing functions for parameter space decomposition to describe stability landscapes of ecological models","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5LVTAVVVR3LZU2FA2DN7REBXZC","json":"https://pith.science/pith/5LVTAVVVR3LZU2FA2DN7REBXZC.json","graph_json":"https://pith.science/api/pith-number/5LVTAVVVR3LZU2FA2DN7REBXZC/graph.json","events_json":"https://pith.science/api/pith-number/5LVTAVVVR3LZU2FA2DN7REBXZC/events.json","paper":"https://pith.science/paper/5LVTAVVV"},"agent_actions":{"view_html":"https://pith.science/pith/5LVTAVVVR3LZU2FA2DN7REBXZC","download_json":"https://pith.science/pith/5LVTAVVVR3LZU2FA2DN7REBXZC.json","view_paper":"https://pith.science/paper/5LVTAVVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.02162&json=true","fetch_graph":"https://pith.science/api/pith-number/5LVTAVVVR3LZU2FA2DN7REBXZC/graph.json","fetch_events":"https://pith.science/api/pith-number/5LVTAVVVR3LZU2FA2DN7REBXZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LVTAVVVR3LZU2FA2DN7REBXZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LVTAVVVR3LZU2FA2DN7REBXZC/action/storage_attestation","attest_author":"https://pith.science/pith/5LVTAVVVR3LZU2FA2DN7REBXZC/action/author_attestation","sign_citation":"https://pith.science/pith/5LVTAVVVR3LZU2FA2DN7REBXZC/action/citation_signature","submit_replication":"https://pith.science/pith/5LVTAVVVR3LZU2FA2DN7REBXZC/action/replication_record"}},"created_at":"2026-07-05T01:51:22.761796+00:00","updated_at":"2026-07-05T01:51:22.761796+00:00"}