{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:FNJL544IZAGCJQVEU4V3YYBA3I","short_pith_number":"pith:FNJL544I","schema_version":"1.0","canonical_sha256":"2b52bef388c80c24c2a4a72bbc6020da055b5ea5831dc4d67697f470ea8e9bbc","source":{"kind":"arxiv","id":"0901.1848","version":2},"attestation_state":"computed","paper":{"title":"Detecting lacunary perfect powers and computing their roots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Daniel S. Roche, Mark Giesbrecht","submitted_at":"2009-01-13T18:44:43Z","abstract_excerpt":"We consider solutions to the equation f = h^r for polynomials f and h and integer r > 1. Given a polynomial f in the lacunary (also called sparse or super-sparse) representation, we first show how to determine if f can be written as h^r and, if so, to find such an r. This is a Monte Carlo randomized algorithm whose cost is polynomial in the number of non-zero terms of f and in log(deg f), i.e., polynomial in the size of the lacunary representation, and it works over GF(q)[x] (for large characteristic) as well as Q[x]. We also give two deterministic algorithms to compute the perfect root h give"},"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":"0901.1848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2009-01-13T18:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"40dfdebc020f6c23fd52c780cd386898037b7332570e3b8f4f1505bb93a0d58b","abstract_canon_sha256":"ab0bc8eb14b098c9763d09da785f31b5a713132dc876ed3797fea0ed8061960e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:56.582246Z","signature_b64":"QirQwQ9HmEnC2I7rt2Ju0waDw98wy/61/nhqpTBbC3zRZvK9czzOWuIKE3APeFdgy9lYE5i6fRDHhC/kIQsiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b52bef388c80c24c2a4a72bbc6020da055b5ea5831dc4d67697f470ea8e9bbc","last_reissued_at":"2026-05-18T02:24:56.581009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:56.581009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting lacunary perfect powers and computing their roots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Daniel S. Roche, Mark Giesbrecht","submitted_at":"2009-01-13T18:44:43Z","abstract_excerpt":"We consider solutions to the equation f = h^r for polynomials f and h and integer r > 1. Given a polynomial f in the lacunary (also called sparse or super-sparse) representation, we first show how to determine if f can be written as h^r and, if so, to find such an r. This is a Monte Carlo randomized algorithm whose cost is polynomial in the number of non-zero terms of f and in log(deg f), i.e., polynomial in the size of the lacunary representation, and it works over GF(q)[x] (for large characteristic) as well as Q[x]. We also give two deterministic algorithms to compute the perfect root h give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.1848","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":""},"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":"0901.1848","created_at":"2026-05-18T02:24:56.581412+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.1848v2","created_at":"2026-05-18T02:24:56.581412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.1848","created_at":"2026-05-18T02:24:56.581412+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNJL544IZAGC","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNJL544IZAGCJQVE","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNJL544I","created_at":"2026-05-18T12:25:59.703012+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/FNJL544IZAGCJQVEU4V3YYBA3I","json":"https://pith.science/pith/FNJL544IZAGCJQVEU4V3YYBA3I.json","graph_json":"https://pith.science/api/pith-number/FNJL544IZAGCJQVEU4V3YYBA3I/graph.json","events_json":"https://pith.science/api/pith-number/FNJL544IZAGCJQVEU4V3YYBA3I/events.json","paper":"https://pith.science/paper/FNJL544I"},"agent_actions":{"view_html":"https://pith.science/pith/FNJL544IZAGCJQVEU4V3YYBA3I","download_json":"https://pith.science/pith/FNJL544IZAGCJQVEU4V3YYBA3I.json","view_paper":"https://pith.science/paper/FNJL544I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.1848&json=true","fetch_graph":"https://pith.science/api/pith-number/FNJL544IZAGCJQVEU4V3YYBA3I/graph.json","fetch_events":"https://pith.science/api/pith-number/FNJL544IZAGCJQVEU4V3YYBA3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNJL544IZAGCJQVEU4V3YYBA3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNJL544IZAGCJQVEU4V3YYBA3I/action/storage_attestation","attest_author":"https://pith.science/pith/FNJL544IZAGCJQVEU4V3YYBA3I/action/author_attestation","sign_citation":"https://pith.science/pith/FNJL544IZAGCJQVEU4V3YYBA3I/action/citation_signature","submit_replication":"https://pith.science/pith/FNJL544IZAGCJQVEU4V3YYBA3I/action/replication_record"}},"created_at":"2026-05-18T02:24:56.581412+00:00","updated_at":"2026-05-18T02:24:56.581412+00:00"}