{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QIAKHBMLY2YNPZC37I3H4HUY4L","short_pith_number":"pith:QIAKHBML","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"},"canonical_sha256":"8200a3858bc6b0d7e45bfa367e1e98e2e4c9354419e17d7b5d2f20a617a18326","source":{"kind":"arxiv","id":"2606.12100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12100","created_at":"2026-06-11T01:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12100v1","created_at":"2026-06-11T01:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12100","created_at":"2026-06-11T01:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"QIAKHBMLY2YN","created_at":"2026-06-11T01:10:48Z"},{"alias_kind":"pith_short_16","alias_value":"QIAKHBMLY2YNPZC3","created_at":"2026-06-11T01:10:48Z"},{"alias_kind":"pith_short_8","alias_value":"QIAKHBML","created_at":"2026-06-11T01:10:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QIAKHBMLY2YNPZC37I3H4HUY4L","target":"record","payload":{"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"},"canonical_sha256":"8200a3858bc6b0d7e45bfa367e1e98e2e4c9354419e17d7b5d2f20a617a18326","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"},"source_kind":"arxiv","source_id":"2606.12100","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTb8U1d9hFfNj0fWDgDd/SQV2axhF8k5Apd/J/U2e+tXja6jVEqXfL3DyVtEw5mxnACL4ZWkHspZ0fQObbcACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:11:25.107849Z"},"content_sha256":"edbc2cf3a4399da77f7c8e5e5aec7bb38c3332a6c06e69590a027ae081f21e61","schema_version":"1.0","event_id":"sha256:edbc2cf3a4399da77f7c8e5e5aec7bb38c3332a6c06e69590a027ae081f21e61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QIAKHBMLY2YNPZC37I3H4HUY4L","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZ37/ZdU3WCnb9IearllmDmEHKhmDoEDEHlYuK6zJXulNBvXMVITJ1F2rAkOOk3M6n9t2H2g+YqStTLUnYOMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:11:25.108208Z"},"content_sha256":"4ed18c8d7cede256811dc6855677a1fbd9dc21c4a02ca6ba62ebf6d093f76dea","schema_version":"1.0","event_id":"sha256:4ed18c8d7cede256811dc6855677a1fbd9dc21c4a02ca6ba62ebf6d093f76dea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L/bundle.json","state_url":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIAKHBMLY2YNPZC37I3H4HUY4L/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T17:11:25Z","links":{"resolver":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L","bundle":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L/bundle.json","state":"https://pith.science/pith/QIAKHBMLY2YNPZC37I3H4HUY4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIAKHBMLY2YNPZC37I3H4HUY4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QIAKHBMLY2YNPZC37I3H4HUY4L","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"61a4c193874526b9e900f34e0ba5f04f73c78602424ea1003d1ee81de25e48ba","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T13:56:31Z","title_canon_sha256":"04d760100ae2fa5f79a26f8b2d0ecdbec8847a15f05f57970a777e1893ad62fe"},"schema_version":"1.0","source":{"id":"2606.12100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12100","created_at":"2026-06-11T01:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12100v1","created_at":"2026-06-11T01:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12100","created_at":"2026-06-11T01:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"QIAKHBMLY2YN","created_at":"2026-06-11T01:10:48Z"},{"alias_kind":"pith_short_16","alias_value":"QIAKHBMLY2YNPZC3","created_at":"2026-06-11T01:10:48Z"},{"alias_kind":"pith_short_8","alias_value":"QIAKHBML","created_at":"2026-06-11T01:10:48Z"}],"graph_snapshots":[{"event_id":"sha256:4ed18c8d7cede256811dc6855677a1fbd9dc21c4a02ca6ba62ebf6d093f76dea","target":"graph","created_at":"2026-06-11T01:10:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.12100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Qiao-Long Huang, Ruichen Qiu, Xiao-Shan Gao, Yichuan Cao","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T13:56:31Z","title":"Quasi-linear Time Multiplication of Sparse Polynomials with Integer Coefficients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12100","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:edbc2cf3a4399da77f7c8e5e5aec7bb38c3332a6c06e69590a027ae081f21e61","target":"record","created_at":"2026-06-11T01:10:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"61a4c193874526b9e900f34e0ba5f04f73c78602424ea1003d1ee81de25e48ba","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T13:56:31Z","title_canon_sha256":"04d760100ae2fa5f79a26f8b2d0ecdbec8847a15f05f57970a777e1893ad62fe"},"schema_version":"1.0","source":{"id":"2606.12100","kind":"arxiv","version":1}},"canonical_sha256":"8200a3858bc6b0d7e45bfa367e1e98e2e4c9354419e17d7b5d2f20a617a18326","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8200a3858bc6b0d7e45bfa367e1e98e2e4c9354419e17d7b5d2f20a617a18326","first_computed_at":"2026-06-11T01:10:48.124370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:10:48.124370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kHDPlpwcUM4UHn9fjWZ13psCxxI0EOkZJIgHmfWVzytJelrAlGza0bpC0Eil78CGlUP56B0HYVIBEhAj6NiIAw==","signature_status":"signed_v1","signed_at":"2026-06-11T01:10:48.125015Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.12100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edbc2cf3a4399da77f7c8e5e5aec7bb38c3332a6c06e69590a027ae081f21e61","sha256:4ed18c8d7cede256811dc6855677a1fbd9dc21c4a02ca6ba62ebf6d093f76dea"],"state_sha256":"5d8aa90bb8fec375f83e9ec3bcc1fe931d6467ea39e88faca46aeff40a48ae1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zOqz+7pbQh2gXuuwWdV6XqeMMYg+xt68SoDO38H0EzjkRNBwmjHHHNfk0a+g8xXQmloobvNndb9VqULv19OzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:11:25.110203Z","bundle_sha256":"f6df25ac47497272c2a1405268dc88e2a9c5e8b7493bca98716ad8e4d1109c5e"}}