{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:5TRS62O3P5N42PYPYAM556DOHF","short_pith_number":"pith:5TRS62O3","schema_version":"1.0","canonical_sha256":"ece32f69db7f5bcd3f0fc019def86e3964d45f6fa41d00e7cd6bd3fe33586aed","source":{"kind":"arxiv","id":"math/0501388","version":4},"attestation_state":"computed","paper":{"title":"Efficiently Detecting Torsion Points and Subtori","license":"","headline":"","cross_cats":["cs.CC","math.NT"],"primary_cat":"math.AG","authors_text":"J. Maurice Rojas","submitted_at":"2005-01-23T07:43:28Z","abstract_excerpt":"Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse encoding), under a plausible assumption on primes in arithmetic progression. In particular, our hypothesis can still hold even under certain failures of the Generalized Riemann Hypothesis, such as the presence of Siegel-Landau zeroes. Furthermore, we give a similar (but UNconditional) complexity upper bound for n=1. Finally, letting T be any algebraic subgroup"},"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":"math/0501388","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"math.AG","submitted_at":"2005-01-23T07:43:28Z","cross_cats_sorted":["cs.CC","math.NT"],"title_canon_sha256":"b417e5b0adca158d56b4e96e52b1e014e27d3a17e9a71c79f4c53f74a24ab173","abstract_canon_sha256":"60946f4724d46e898c2190fea8e6c0f4b95e994f5a2344120c8ea6e4402bc444"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:35.799463Z","signature_b64":"6IcWduvWN+cPSosr9BxQcIiBTmojsXztrRbf6WmGk6MMW7td41BMe4F896zyeCh1IzVzA3tL//siBwZsQBxZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ece32f69db7f5bcd3f0fc019def86e3964d45f6fa41d00e7cd6bd3fe33586aed","last_reissued_at":"2026-05-18T04:08:35.798868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:35.798868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently Detecting Torsion Points and Subtori","license":"","headline":"","cross_cats":["cs.CC","math.NT"],"primary_cat":"math.AG","authors_text":"J. Maurice Rojas","submitted_at":"2005-01-23T07:43:28Z","abstract_excerpt":"Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse encoding), under a plausible assumption on primes in arithmetic progression. In particular, our hypothesis can still hold even under certain failures of the Generalized Riemann Hypothesis, such as the presence of Siegel-Landau zeroes. Furthermore, we give a similar (but UNconditional) complexity upper bound for n=1. Finally, letting T be any algebraic subgroup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0501388","kind":"arxiv","version":4},"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":"math/0501388","created_at":"2026-05-18T04:08:35.798975+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0501388v4","created_at":"2026-05-18T04:08:35.798975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0501388","created_at":"2026-05-18T04:08:35.798975+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TRS62O3P5N4","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TRS62O3P5N42PYP","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TRS62O3","created_at":"2026-05-18T12:25:53.335082+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/5TRS62O3P5N42PYPYAM556DOHF","json":"https://pith.science/pith/5TRS62O3P5N42PYPYAM556DOHF.json","graph_json":"https://pith.science/api/pith-number/5TRS62O3P5N42PYPYAM556DOHF/graph.json","events_json":"https://pith.science/api/pith-number/5TRS62O3P5N42PYPYAM556DOHF/events.json","paper":"https://pith.science/paper/5TRS62O3"},"agent_actions":{"view_html":"https://pith.science/pith/5TRS62O3P5N42PYPYAM556DOHF","download_json":"https://pith.science/pith/5TRS62O3P5N42PYPYAM556DOHF.json","view_paper":"https://pith.science/paper/5TRS62O3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0501388&json=true","fetch_graph":"https://pith.science/api/pith-number/5TRS62O3P5N42PYPYAM556DOHF/graph.json","fetch_events":"https://pith.science/api/pith-number/5TRS62O3P5N42PYPYAM556DOHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TRS62O3P5N42PYPYAM556DOHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TRS62O3P5N42PYPYAM556DOHF/action/storage_attestation","attest_author":"https://pith.science/pith/5TRS62O3P5N42PYPYAM556DOHF/action/author_attestation","sign_citation":"https://pith.science/pith/5TRS62O3P5N42PYPYAM556DOHF/action/citation_signature","submit_replication":"https://pith.science/pith/5TRS62O3P5N42PYPYAM556DOHF/action/replication_record"}},"created_at":"2026-05-18T04:08:35.798975+00:00","updated_at":"2026-05-18T04:08:35.798975+00:00"}