{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TRNNPKH2SOLH6MUDATTN2WQHXZ","short_pith_number":"pith:TRNNPKH2","schema_version":"1.0","canonical_sha256":"9c5ad7a8fa93967f328304e6dd5a07be6e0aa1173b5081ac6950d8b669e178d2","source":{"kind":"arxiv","id":"1009.3214","version":2},"attestation_state":"computed","paper":{"title":"Computing sparse multiples of polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.SC","authors_text":"Daniel S. Roche, Hrushikesh Tilak, Mark Giesbrecht","submitted_at":"2010-09-16T16:21:15Z","abstract_excerpt":"We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t non-zero terms, and if so, to find such an h. When F=Q and t is constant, we give a polynomial-time algorithm in d and the size of coefficients in h. When F is a finite field, we show that the problem is at least as hard as determining the multiplicative order of elements in an extension field of F (a problem thought to have complexity similar to that of factoring "},"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":"1009.3214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-09-16T16:21:15Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"13417a3950004ee8a17ca1c995434cc380fcee7f5105eca99529184117571204","abstract_canon_sha256":"27b39507857c68645ddda6f4cf253172e38a05c287f7f2bce7858342796750c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:11.627545Z","signature_b64":"X7Mup75PnUdYXljVcZNtOt5R5J5AtYhvMOnqO2R2HLLDie3+Q+M9tKpmNRQPdo+50XNldZN7g4BTzQiQaU3QBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c5ad7a8fa93967f328304e6dd5a07be6e0aa1173b5081ac6950d8b669e178d2","last_reissued_at":"2026-05-18T04:32:11.627005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:11.627005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing sparse multiples of polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.SC","authors_text":"Daniel S. Roche, Hrushikesh Tilak, Mark Giesbrecht","submitted_at":"2010-09-16T16:21:15Z","abstract_excerpt":"We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t non-zero terms, and if so, to find such an h. When F=Q and t is constant, we give a polynomial-time algorithm in d and the size of coefficients in h. When F is a finite field, we show that the problem is at least as hard as determining the multiplicative order of elements in an extension field of F (a problem thought to have complexity similar to that of factoring "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3214","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":"1009.3214","created_at":"2026-05-18T04:32:11.627072+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3214v2","created_at":"2026-05-18T04:32:11.627072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3214","created_at":"2026-05-18T04:32:11.627072+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRNNPKH2SOLH","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRNNPKH2SOLH6MUD","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRNNPKH2","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/TRNNPKH2SOLH6MUDATTN2WQHXZ","json":"https://pith.science/pith/TRNNPKH2SOLH6MUDATTN2WQHXZ.json","graph_json":"https://pith.science/api/pith-number/TRNNPKH2SOLH6MUDATTN2WQHXZ/graph.json","events_json":"https://pith.science/api/pith-number/TRNNPKH2SOLH6MUDATTN2WQHXZ/events.json","paper":"https://pith.science/paper/TRNNPKH2"},"agent_actions":{"view_html":"https://pith.science/pith/TRNNPKH2SOLH6MUDATTN2WQHXZ","download_json":"https://pith.science/pith/TRNNPKH2SOLH6MUDATTN2WQHXZ.json","view_paper":"https://pith.science/paper/TRNNPKH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3214&json=true","fetch_graph":"https://pith.science/api/pith-number/TRNNPKH2SOLH6MUDATTN2WQHXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TRNNPKH2SOLH6MUDATTN2WQHXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRNNPKH2SOLH6MUDATTN2WQHXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRNNPKH2SOLH6MUDATTN2WQHXZ/action/storage_attestation","attest_author":"https://pith.science/pith/TRNNPKH2SOLH6MUDATTN2WQHXZ/action/author_attestation","sign_citation":"https://pith.science/pith/TRNNPKH2SOLH6MUDATTN2WQHXZ/action/citation_signature","submit_replication":"https://pith.science/pith/TRNNPKH2SOLH6MUDATTN2WQHXZ/action/replication_record"}},"created_at":"2026-05-18T04:32:11.627072+00:00","updated_at":"2026-05-18T04:32:11.627072+00:00"}