{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PQQX5BSB7QHX5ZZQ5MZUJARYS6","short_pith_number":"pith:PQQX5BSB","schema_version":"1.0","canonical_sha256":"7c217e8641fc0f7ee730eb334482389791f3a09edfe4af3b54cc9a7407503e69","source":{"kind":"arxiv","id":"1506.04215","version":1},"attestation_state":"computed","paper":{"title":"Parallel sparse interpolation using small primes","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SC","authors_text":"Daniel S. Roche, Mohamed Khochtali, Xisen Tian","submitted_at":"2015-06-13T03:41:43Z","abstract_excerpt":"To interpolate a supersparse polynomial with integer coefficients, two alternative approaches are the Prony-based \"big prime\" technique, which acts over a single large finite field, or the more recently-proposed \"small primes\" technique, which reduces the unknown sparse polynomial to many low-degree dense polynomials. While the latter technique has not yet reached the same theoretical efficiency as Prony-based methods, it has an obvious potential for parallelization. We present a heuristic \"small primes\" interpolation algorithm and report on a low-level C implementation using FLINT and MPI."},"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":"1506.04215","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SC","submitted_at":"2015-06-13T03:41:43Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b6e2fb9c95cbac9f9cf617a37382d3d739899c267acea06cf1c74ca2f27ca5c1","abstract_canon_sha256":"ded9ffcb51f4962882b072f585e871a8c03bf272cd3886016b6049d707d68236"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:55.265862Z","signature_b64":"HA8U1Wm6ZYOD3R10+QRXrMonI9YemhytBTQZW7Hts0l/XSoly6YG3zD4Liws2X7KBvO3J+aeuG3lIg06WOcKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c217e8641fc0f7ee730eb334482389791f3a09edfe4af3b54cc9a7407503e69","last_reissued_at":"2026-05-18T01:49:55.265332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:55.265332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel sparse interpolation using small primes","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SC","authors_text":"Daniel S. Roche, Mohamed Khochtali, Xisen Tian","submitted_at":"2015-06-13T03:41:43Z","abstract_excerpt":"To interpolate a supersparse polynomial with integer coefficients, two alternative approaches are the Prony-based \"big prime\" technique, which acts over a single large finite field, or the more recently-proposed \"small primes\" technique, which reduces the unknown sparse polynomial to many low-degree dense polynomials. While the latter technique has not yet reached the same theoretical efficiency as Prony-based methods, it has an obvious potential for parallelization. We present a heuristic \"small primes\" interpolation algorithm and report on a low-level C implementation using FLINT and MPI."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04215","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":"1506.04215","created_at":"2026-05-18T01:49:55.265422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04215v1","created_at":"2026-05-18T01:49:55.265422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04215","created_at":"2026-05-18T01:49:55.265422+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQQX5BSB7QHX","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQQX5BSB7QHX5ZZQ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQQX5BSB","created_at":"2026-05-18T12:29:37.295048+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/PQQX5BSB7QHX5ZZQ5MZUJARYS6","json":"https://pith.science/pith/PQQX5BSB7QHX5ZZQ5MZUJARYS6.json","graph_json":"https://pith.science/api/pith-number/PQQX5BSB7QHX5ZZQ5MZUJARYS6/graph.json","events_json":"https://pith.science/api/pith-number/PQQX5BSB7QHX5ZZQ5MZUJARYS6/events.json","paper":"https://pith.science/paper/PQQX5BSB"},"agent_actions":{"view_html":"https://pith.science/pith/PQQX5BSB7QHX5ZZQ5MZUJARYS6","download_json":"https://pith.science/pith/PQQX5BSB7QHX5ZZQ5MZUJARYS6.json","view_paper":"https://pith.science/paper/PQQX5BSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04215&json=true","fetch_graph":"https://pith.science/api/pith-number/PQQX5BSB7QHX5ZZQ5MZUJARYS6/graph.json","fetch_events":"https://pith.science/api/pith-number/PQQX5BSB7QHX5ZZQ5MZUJARYS6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQQX5BSB7QHX5ZZQ5MZUJARYS6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQQX5BSB7QHX5ZZQ5MZUJARYS6/action/storage_attestation","attest_author":"https://pith.science/pith/PQQX5BSB7QHX5ZZQ5MZUJARYS6/action/author_attestation","sign_citation":"https://pith.science/pith/PQQX5BSB7QHX5ZZQ5MZUJARYS6/action/citation_signature","submit_replication":"https://pith.science/pith/PQQX5BSB7QHX5ZZQ5MZUJARYS6/action/replication_record"}},"created_at":"2026-05-18T01:49:55.265422+00:00","updated_at":"2026-05-18T01:49:55.265422+00:00"}