{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:67UL7V24A2KL6A6Y57SQ334TSN","short_pith_number":"pith:67UL7V24","canonical_record":{"source":{"id":"1009.4597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-23T12:53:25Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"24d8b280e27986b0d563a03da66e4663b4ba7ce0981ea307f120da822df8f70b","abstract_canon_sha256":"53633ac672c25f81569f579baea11bd0cce83e42e3066cc982997b82c404fe44"},"schema_version":"1.0"},"canonical_sha256":"f7e8bfd75c0694bf03d8efe50def939378475f145ee331b23c0228e61ee89e5d","source":{"kind":"arxiv","id":"1009.4597","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4597","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4597v2","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4597","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"67UL7V24A2KL","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"67UL7V24A2KL6A6Y","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"67UL7V24","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:67UL7V24A2KL6A6Y57SQ334TSN","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-23T12:53:25Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"24d8b280e27986b0d563a03da66e4663b4ba7ce0981ea307f120da822df8f70b","abstract_canon_sha256":"53633ac672c25f81569f579baea11bd0cce83e42e3066cc982997b82c404fe44"},"schema_version":"1.0"},"canonical_sha256":"f7e8bfd75c0694bf03d8efe50def939378475f145ee331b23c0228e61ee89e5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:56.613235Z","signature_b64":"ajFb5MAiD++Y7dWCv5+Na4v7WTrh9Xu9jpWoQFLzl3jCHqkcRgw1MYEa0A5/U8KzrS9N6WKDomuwuLVseu6qBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7e8bfd75c0694bf03d8efe50def939378475f145ee331b23c0228e61ee89e5d","last_reissued_at":"2026-05-18T03:13:56.612473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:56.612473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4597","source_version":2,"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-05-18T03:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+T9S2NbAGQrchVu11ASlXSYE1OWyRIsMffnbR4dzaPOtlAAKuKJRpnzc6hqI24qXSAhQ8PLLuJ29Va6xS40hBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:16:34.330046Z"},"content_sha256":"2695d1b360e52ee24881a698e9d6b3fce4b2f05a1455fe31bedfd6e7c20958fe","schema_version":"1.0","event_id":"sha256:2695d1b360e52ee24881a698e9d6b3fce4b2f05a1455fe31bedfd6e7c20958fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:67UL7V24A2KL6A6Y57SQ334TSN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Polynomial Multiplication in Chebyshev Basis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.CC","authors_text":"Pascal Giorgi (LIRMM)","submitted_at":"2010-09-23T12:53:25Z","abstract_excerpt":"In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's multiplication scheme to improve upon the naive method but without being able to get rid of its quadratic complexity. In this paper, we extend their result by providing a reduction scheme which allows to multiply polynomial in Chebyshev basis by using algorithms from the monomial basis case and therefore get the same asymptotic complexity estimate. Our reducti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4597","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"},"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-05-18T03:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ak0pNHwUz+HX4YG+B2FHETYG46kPU7F5oJZDtsfvlU8+4GJKGOxcUcacNpe4QKsMI9Dmd3a3zCZHUkA1TdvbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:16:34.330426Z"},"content_sha256":"2d671607c609f23e16048891d898bdbf5e1699087579cdb0be49706a7cb3f2ca","schema_version":"1.0","event_id":"sha256:2d671607c609f23e16048891d898bdbf5e1699087579cdb0be49706a7cb3f2ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67UL7V24A2KL6A6Y57SQ334TSN/bundle.json","state_url":"https://pith.science/pith/67UL7V24A2KL6A6Y57SQ334TSN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67UL7V24A2KL6A6Y57SQ334TSN/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-07-01T23:16:34Z","links":{"resolver":"https://pith.science/pith/67UL7V24A2KL6A6Y57SQ334TSN","bundle":"https://pith.science/pith/67UL7V24A2KL6A6Y57SQ334TSN/bundle.json","state":"https://pith.science/pith/67UL7V24A2KL6A6Y57SQ334TSN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67UL7V24A2KL6A6Y57SQ334TSN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:67UL7V24A2KL6A6Y57SQ334TSN","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":"53633ac672c25f81569f579baea11bd0cce83e42e3066cc982997b82c404fe44","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-23T12:53:25Z","title_canon_sha256":"24d8b280e27986b0d563a03da66e4663b4ba7ce0981ea307f120da822df8f70b"},"schema_version":"1.0","source":{"id":"1009.4597","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4597","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4597v2","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4597","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"67UL7V24A2KL","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"67UL7V24A2KL6A6Y","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"67UL7V24","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:2d671607c609f23e16048891d898bdbf5e1699087579cdb0be49706a7cb3f2ca","target":"graph","created_at":"2026-05-18T03:13:56Z","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"},"paper":{"abstract_excerpt":"In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's multiplication scheme to improve upon the naive method but without being able to get rid of its quadratic complexity. In this paper, we extend their result by providing a reduction scheme which allows to multiply polynomial in Chebyshev basis by using algorithms from the monomial basis case and therefore get the same asymptotic complexity estimate. Our reducti","authors_text":"Pascal Giorgi (LIRMM)","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-23T12:53:25Z","title":"On Polynomial Multiplication in Chebyshev Basis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4597","kind":"arxiv","version":2},"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:2695d1b360e52ee24881a698e9d6b3fce4b2f05a1455fe31bedfd6e7c20958fe","target":"record","created_at":"2026-05-18T03:13:56Z","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":"53633ac672c25f81569f579baea11bd0cce83e42e3066cc982997b82c404fe44","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-23T12:53:25Z","title_canon_sha256":"24d8b280e27986b0d563a03da66e4663b4ba7ce0981ea307f120da822df8f70b"},"schema_version":"1.0","source":{"id":"1009.4597","kind":"arxiv","version":2}},"canonical_sha256":"f7e8bfd75c0694bf03d8efe50def939378475f145ee331b23c0228e61ee89e5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7e8bfd75c0694bf03d8efe50def939378475f145ee331b23c0228e61ee89e5d","first_computed_at":"2026-05-18T03:13:56.612473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:56.612473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ajFb5MAiD++Y7dWCv5+Na4v7WTrh9Xu9jpWoQFLzl3jCHqkcRgw1MYEa0A5/U8KzrS9N6WKDomuwuLVseu6qBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:56.613235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4597","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2695d1b360e52ee24881a698e9d6b3fce4b2f05a1455fe31bedfd6e7c20958fe","sha256:2d671607c609f23e16048891d898bdbf5e1699087579cdb0be49706a7cb3f2ca"],"state_sha256":"8524cadb33a038bb973e2b4a34b114b5e4578a0a67ae6d1a43e10cf8ae936aaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h7MHFRdB+PgDQnIc7Rlo3Eqtd5UL/X0mrXxGh7gCuYAoPKqHkNnTtoEMQZ1pN16y8/J/Umx9rdK52wkM3MkxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:16:34.332764Z","bundle_sha256":"fb4c85c4c0f32552dfe2e1e2d37e2a453f614157b1c225fd5fcd882a394eed8c"}}