{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DVYFLEVXEUGS5OZ6KJ7YZWR7UL","short_pith_number":"pith:DVYFLEVX","schema_version":"1.0","canonical_sha256":"1d705592b7250d2ebb3e527f8cda3fa2c7ffa7dfd11d17b1c1f5ecc8ed733625","source":{"kind":"arxiv","id":"1010.4519","version":1},"attestation_state":"computed","paper":{"title":"Linear equations over multiplicative groups, recurrences, and mixing I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"David Masser, Harm Derksen","submitted_at":"2010-10-21T16:38:25Z","abstract_excerpt":"Let K be a field of positive characteristic. When V is a linear variety in K^n and G is a finitely generated subgroup of K^*, we show how to compute the intersection of V and G^n effectively using heights. We calculate all the estimates explicitly. A special case provides the effective solution of the S-unit equation in n variables."},"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":"1010.4519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-10-21T16:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"bbff014b9663af053fa6647a8affb4370578197c3e891c230e12eabf5eb6b04c","abstract_canon_sha256":"80346ab8745e685bb3479446dc3321e7645698550460fc61594b9284592b288a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:01.633761Z","signature_b64":"jZ9ZhJMX2O0BJ/7nT8xglTHbP8xWe0G0wR8P563Ip3DuxnuEV6J9lgU9Gi7gUJk3r9uJJRxb5YKB8/9PwNQTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d705592b7250d2ebb3e527f8cda3fa2c7ffa7dfd11d17b1c1f5ecc8ed733625","last_reissued_at":"2026-05-18T02:58:01.633191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:01.633191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear equations over multiplicative groups, recurrences, and mixing I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"David Masser, Harm Derksen","submitted_at":"2010-10-21T16:38:25Z","abstract_excerpt":"Let K be a field of positive characteristic. When V is a linear variety in K^n and G is a finitely generated subgroup of K^*, we show how to compute the intersection of V and G^n effectively using heights. We calculate all the estimates explicitly. A special case provides the effective solution of the S-unit equation in n variables."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4519","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":"1010.4519","created_at":"2026-05-18T02:58:01.633277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.4519v1","created_at":"2026-05-18T02:58:01.633277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4519","created_at":"2026-05-18T02:58:01.633277+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVYFLEVXEUGS","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVYFLEVXEUGS5OZ6","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVYFLEVX","created_at":"2026-05-18T12:26:06.534383+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/DVYFLEVXEUGS5OZ6KJ7YZWR7UL","json":"https://pith.science/pith/DVYFLEVXEUGS5OZ6KJ7YZWR7UL.json","graph_json":"https://pith.science/api/pith-number/DVYFLEVXEUGS5OZ6KJ7YZWR7UL/graph.json","events_json":"https://pith.science/api/pith-number/DVYFLEVXEUGS5OZ6KJ7YZWR7UL/events.json","paper":"https://pith.science/paper/DVYFLEVX"},"agent_actions":{"view_html":"https://pith.science/pith/DVYFLEVXEUGS5OZ6KJ7YZWR7UL","download_json":"https://pith.science/pith/DVYFLEVXEUGS5OZ6KJ7YZWR7UL.json","view_paper":"https://pith.science/paper/DVYFLEVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.4519&json=true","fetch_graph":"https://pith.science/api/pith-number/DVYFLEVXEUGS5OZ6KJ7YZWR7UL/graph.json","fetch_events":"https://pith.science/api/pith-number/DVYFLEVXEUGS5OZ6KJ7YZWR7UL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVYFLEVXEUGS5OZ6KJ7YZWR7UL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVYFLEVXEUGS5OZ6KJ7YZWR7UL/action/storage_attestation","attest_author":"https://pith.science/pith/DVYFLEVXEUGS5OZ6KJ7YZWR7UL/action/author_attestation","sign_citation":"https://pith.science/pith/DVYFLEVXEUGS5OZ6KJ7YZWR7UL/action/citation_signature","submit_replication":"https://pith.science/pith/DVYFLEVXEUGS5OZ6KJ7YZWR7UL/action/replication_record"}},"created_at":"2026-05-18T02:58:01.633277+00:00","updated_at":"2026-05-18T02:58:01.633277+00:00"}