{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QIAKHBMLY2YNPZC37I3H4HUY4L","short_pith_number":"pith:QIAKHBML","schema_version":"1.0","canonical_sha256":"8200a3858bc6b0d7e45bfa367e1e98e2e4c9354419e17d7b5d2f20a617a18326","source":{"kind":"arxiv","id":"2606.12100","version":1},"attestation_state":"computed","paper":{"title":"Quasi-linear Time Multiplication of Sparse Polynomials with Integer Coefficients","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.SC","authors_text":"Qiao-Long Huang, Ruichen Qiu, Xiao-Shan Gao, Yichuan Cao","submitted_at":"2026-06-10T13:56:31Z","abstract_excerpt":"Sparse polynomial multiplication is a fundamental problem in computer algebra and the theory of computation, and the development of a quasi-linear time output-sensitive multiplication algorithm has been posed as an open challenge. In this paper, a counterexample is provided to a previously claimed solution to this open problem for integer coefficients. By employing the existing quasi-linear modular-black-box interpolation algorithm, we are able to provide an algorithm with quasi-linear bit complexity for the integer coefficients setting. Furthermore, in the case of coefficients over a finite f"},"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":"2606.12100","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T13:56:31Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"04d760100ae2fa5f79a26f8b2d0ecdbec8847a15f05f57970a777e1893ad62fe","abstract_canon_sha256":"61a4c193874526b9e900f34e0ba5f04f73c78602424ea1003d1ee81de25e48ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:48.125015Z","signature_b64":"kHDPlpwcUM4UHn9fjWZ13psCxxI0EOkZJIgHmfWVzytJelrAlGza0bpC0Eil78CGlUP56B0HYVIBEhAj6NiIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8200a3858bc6b0d7e45bfa367e1e98e2e4c9354419e17d7b5d2f20a617a18326","last_reissued_at":"2026-06-11T01:10:48.124370Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:48.124370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-linear Time Multiplication of Sparse Polynomials with Integer Coefficients","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.SC","authors_text":"Qiao-Long Huang, Ruichen Qiu, Xiao-Shan Gao, Yichuan Cao","submitted_at":"2026-06-10T13:56:31Z","abstract_excerpt":"Sparse polynomial multiplication is a fundamental problem in computer algebra and the theory of computation, and the development of a quasi-linear time output-sensitive multiplication algorithm has been posed as an open challenge. In this paper, a counterexample is provided to a previously claimed solution to this open problem for integer coefficients. By employing the existing quasi-linear modular-black-box interpolation algorithm, we are able to provide an algorithm with quasi-linear bit complexity for the integer coefficients setting. Furthermore, in the case of coefficients over a finite f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12100","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.12100/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.12100","created_at":"2026-06-11T01:10:48.124476+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12100v1","created_at":"2026-06-11T01:10:48.124476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12100","created_at":"2026-06-11T01:10:48.124476+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIAKHBMLY2YN","created_at":"2026-06-11T01:10:48.124476+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIAKHBMLY2YNPZC3","created_at":"2026-06-11T01:10:48.124476+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIAKHBML","created_at":"2026-06-11T01:10:48.124476+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/QIAKHBMLY2YNPZC37I3H4HUY4L","json":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L.json","graph_json":"https://pith.science/api/pith-number/QIAKHBMLY2YNPZC37I3H4HUY4L/graph.json","events_json":"https://pith.science/api/pith-number/QIAKHBMLY2YNPZC37I3H4HUY4L/events.json","paper":"https://pith.science/paper/QIAKHBML"},"agent_actions":{"view_html":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L","download_json":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L.json","view_paper":"https://pith.science/paper/QIAKHBML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12100&json=true","fetch_graph":"https://pith.science/api/pith-number/QIAKHBMLY2YNPZC37I3H4HUY4L/graph.json","fetch_events":"https://pith.science/api/pith-number/QIAKHBMLY2YNPZC37I3H4HUY4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L/action/storage_attestation","attest_author":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L/action/author_attestation","sign_citation":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L/action/citation_signature","submit_replication":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L/action/replication_record"}},"created_at":"2026-06-11T01:10:48.124476+00:00","updated_at":"2026-06-11T01:10:48.124476+00:00"}