{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:P5LPKJXHTTN54EKSIN4O2Y3MRX","short_pith_number":"pith:P5LPKJXH","schema_version":"1.0","canonical_sha256":"7f56f526e79cdbde11524378ed636c8de5111986cf73a88b9e178f92d087a344","source":{"kind":"arxiv","id":"2503.12275","version":1},"attestation_state":"computed","paper":{"title":"Deciding Connectivity in Symmetric Semi-Algebraic Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.AG"],"primary_cat":"cs.SC","authors_text":"Cordian.Riener, Robin Schabert, Thi Xuan Vu","submitted_at":"2025-03-15T22:18:01Z","abstract_excerpt":"A semi-algebraic set is a subset of $\\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same connected component. We focus on the case where the defining equations and inequalities are invariant under the natural action of the symmetric group and where each polynomial has degree at most \\( d \\), with \\( d < n \\) (where \\( n \\) denotes the number of variables). Exploiting this symmetry, we develop and analyze algorithms for two key tasks. First, we present "},"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":"2503.12275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2025-03-15T22:18:01Z","cross_cats_sorted":["cs.CG","math.AG"],"title_canon_sha256":"794838c8e867233961fdc5d360d47f62239d896e1aeb4fedf9be44a80d5a59d2","abstract_canon_sha256":"2213c959a993c87e8ec13ea0a52ff26d3ecceb31605fe818b36bb2127cf103c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:09.176593Z","signature_b64":"3S7HIEukvdy0X+rwH/3D7DidSr6zV/Y76rLOpzGAbo7C8pVHKh1fv6g/dlnxnNoiQLHlJ6d1l90VYIitBmIbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f56f526e79cdbde11524378ed636c8de5111986cf73a88b9e178f92d087a344","last_reissued_at":"2026-07-05T10:32:09.176114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:09.176114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding Connectivity in Symmetric Semi-Algebraic Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.AG"],"primary_cat":"cs.SC","authors_text":"Cordian.Riener, Robin Schabert, Thi Xuan Vu","submitted_at":"2025-03-15T22:18:01Z","abstract_excerpt":"A semi-algebraic set is a subset of $\\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same connected component. We focus on the case where the defining equations and inequalities are invariant under the natural action of the symmetric group and where each polynomial has degree at most \\( d \\), with \\( d < n \\) (where \\( n \\) denotes the number of variables). Exploiting this symmetry, we develop and analyze algorithms for two key tasks. First, we present "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.12275","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.12275/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":"2503.12275","created_at":"2026-07-05T10:32:09.176165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.12275v1","created_at":"2026-07-05T10:32:09.176165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.12275","created_at":"2026-07-05T10:32:09.176165+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5LPKJXHTTN5","created_at":"2026-07-05T10:32:09.176165+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5LPKJXHTTN54EKS","created_at":"2026-07-05T10:32:09.176165+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5LPKJXH","created_at":"2026-07-05T10:32:09.176165+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22514","citing_title":"A Symbolic Homotopy Algorithm for Solving Composable Polynomial Systems","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P5LPKJXHTTN54EKSIN4O2Y3MRX","json":"https://pith.science/pith/P5LPKJXHTTN54EKSIN4O2Y3MRX.json","graph_json":"https://pith.science/api/pith-number/P5LPKJXHTTN54EKSIN4O2Y3MRX/graph.json","events_json":"https://pith.science/api/pith-number/P5LPKJXHTTN54EKSIN4O2Y3MRX/events.json","paper":"https://pith.science/paper/P5LPKJXH"},"agent_actions":{"view_html":"https://pith.science/pith/P5LPKJXHTTN54EKSIN4O2Y3MRX","download_json":"https://pith.science/pith/P5LPKJXHTTN54EKSIN4O2Y3MRX.json","view_paper":"https://pith.science/paper/P5LPKJXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.12275&json=true","fetch_graph":"https://pith.science/api/pith-number/P5LPKJXHTTN54EKSIN4O2Y3MRX/graph.json","fetch_events":"https://pith.science/api/pith-number/P5LPKJXHTTN54EKSIN4O2Y3MRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5LPKJXHTTN54EKSIN4O2Y3MRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5LPKJXHTTN54EKSIN4O2Y3MRX/action/storage_attestation","attest_author":"https://pith.science/pith/P5LPKJXHTTN54EKSIN4O2Y3MRX/action/author_attestation","sign_citation":"https://pith.science/pith/P5LPKJXHTTN54EKSIN4O2Y3MRX/action/citation_signature","submit_replication":"https://pith.science/pith/P5LPKJXHTTN54EKSIN4O2Y3MRX/action/replication_record"}},"created_at":"2026-07-05T10:32:09.176165+00:00","updated_at":"2026-07-05T10:32:09.176165+00:00"}