{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TQNKHV2SP7MCGAMQCAPWIZIFVB","short_pith_number":"pith:TQNKHV2S","schema_version":"1.0","canonical_sha256":"9c1aa3d7527fd8230190101f646505a8455a288585c2739fb788f0e254deade1","source":{"kind":"arxiv","id":"1008.1284","version":2},"attestation_state":"computed","paper":{"title":"Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"math.NT","authors_text":"Henry Cohn, Nadia Heninger","submitted_at":"2010-08-06T22:02:36Z","abstract_excerpt":"We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding small solutions of polynomial equations modulo integers to analogous problems over polynomial rings, number fields, and function fields. This gives us a unified view of several problems arising naturally in cryptography, coding theory, and the study of lattices. We give (1) a polynomial-time algorithm for finding small solutions of polynomial equations modulo ideals over algebraic number fields, (2) a faster variant of "},"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":"1008.1284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-08-06T22:02:36Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"643c1d8765137d02bcffe9c837a20df722b3e74445653349bd196c976c8a6c34","abstract_canon_sha256":"e93a60c47a4aa3d38592106f614a28330270d567e11fd811331ff90c72c34c64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:57.132267Z","signature_b64":"xYePwE1WgdrsOc0NHWf10gclsfSUu23F8imNaf3qPWfI5zJrOofJEFIhBRdxSo7qIEmuKSijYEdcBhelhD8BAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c1aa3d7527fd8230190101f646505a8455a288585c2739fb788f0e254deade1","last_reissued_at":"2026-05-18T03:19:57.131479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:57.131479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"math.NT","authors_text":"Henry Cohn, Nadia Heninger","submitted_at":"2010-08-06T22:02:36Z","abstract_excerpt":"We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding small solutions of polynomial equations modulo integers to analogous problems over polynomial rings, number fields, and function fields. This gives us a unified view of several problems arising naturally in cryptography, coding theory, and the study of lattices. We give (1) a polynomial-time algorithm for finding small solutions of polynomial equations modulo ideals over algebraic number fields, (2) a faster variant of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1284","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":"1008.1284","created_at":"2026-05-18T03:19:57.131604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1284v2","created_at":"2026-05-18T03:19:57.131604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1284","created_at":"2026-05-18T03:19:57.131604+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQNKHV2SP7MC","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQNKHV2SP7MCGAMQ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQNKHV2S","created_at":"2026-05-18T12:26:15.391820+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/TQNKHV2SP7MCGAMQCAPWIZIFVB","json":"https://pith.science/pith/TQNKHV2SP7MCGAMQCAPWIZIFVB.json","graph_json":"https://pith.science/api/pith-number/TQNKHV2SP7MCGAMQCAPWIZIFVB/graph.json","events_json":"https://pith.science/api/pith-number/TQNKHV2SP7MCGAMQCAPWIZIFVB/events.json","paper":"https://pith.science/paper/TQNKHV2S"},"agent_actions":{"view_html":"https://pith.science/pith/TQNKHV2SP7MCGAMQCAPWIZIFVB","download_json":"https://pith.science/pith/TQNKHV2SP7MCGAMQCAPWIZIFVB.json","view_paper":"https://pith.science/paper/TQNKHV2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1284&json=true","fetch_graph":"https://pith.science/api/pith-number/TQNKHV2SP7MCGAMQCAPWIZIFVB/graph.json","fetch_events":"https://pith.science/api/pith-number/TQNKHV2SP7MCGAMQCAPWIZIFVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQNKHV2SP7MCGAMQCAPWIZIFVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQNKHV2SP7MCGAMQCAPWIZIFVB/action/storage_attestation","attest_author":"https://pith.science/pith/TQNKHV2SP7MCGAMQCAPWIZIFVB/action/author_attestation","sign_citation":"https://pith.science/pith/TQNKHV2SP7MCGAMQCAPWIZIFVB/action/citation_signature","submit_replication":"https://pith.science/pith/TQNKHV2SP7MCGAMQCAPWIZIFVB/action/replication_record"}},"created_at":"2026-05-18T03:19:57.131604+00:00","updated_at":"2026-05-18T03:19:57.131604+00:00"}