{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PZNPREO22YPQUT4T6VYEJNAOGO","short_pith_number":"pith:PZNPREO2","canonical_record":{"source":{"id":"1501.05296","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SC","submitted_at":"2015-01-21T04:43:58Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"64cd5079efc010cc346094f5d5ff94d6d626ceea38c3005a110611f30bbf6461","abstract_canon_sha256":"47701136bab5166ec37c90882e5c7994d3fcde4773d60e5a0f5d216c1f269d03"},"schema_version":"1.0"},"canonical_sha256":"7e5af891dad61f0a4f93f57044b40e33b70daa500315a7cd3a7b77c7815f255e","source":{"kind":"arxiv","id":"1501.05296","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05296","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05296v3","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05296","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"PZNPREO22YPQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PZNPREO22YPQUT4T","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PZNPREO2","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PZNPREO22YPQUT4T6VYEJNAOGO","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05296","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SC","submitted_at":"2015-01-21T04:43:58Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"64cd5079efc010cc346094f5d5ff94d6d626ceea38c3005a110611f30bbf6461","abstract_canon_sha256":"47701136bab5166ec37c90882e5c7994d3fcde4773d60e5a0f5d216c1f269d03"},"schema_version":"1.0"},"canonical_sha256":"7e5af891dad61f0a4f93f57044b40e33b70daa500315a7cd3a7b77c7815f255e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:54.279411Z","signature_b64":"OMpBOZjrLlGDUGDu1yOSpqFM+ylYMKXapIWt5OJBHZ9X2+o+kX8f14bSrhtGM8D3vu6IIB8cEpAoMwVNYVaZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e5af891dad61f0a4f93f57044b40e33b70daa500315a7cd3a7b77c7815f255e","last_reissued_at":"2026-05-18T02:17:54.278636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:54.278636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05296","source_version":3,"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-18T02:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/iDDmKaEIIBSIEuL13sMYOuIlN7EhDZtIIi0VIDyswFnrJAw1Z1hRqs+mOCEAyUAaVhZ/ROfunpVmhgWjI1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:56:37.840442Z"},"content_sha256":"b3a8a5dcb3224ad6a0ed5f524632cb88fadc9c61bac12be4758ade537213fa6d","schema_version":"1.0","event_id":"sha256:b3a8a5dcb3224ad6a0ed5f524632cb88fadc9c61bac12be4758ade537213fa6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PZNPREO22YPQUT4T6VYEJNAOGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Output-sensitive algorithms for sumset and sparse polynomial multiplication","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.SC","authors_text":"Andrew Arnold, Daniel S. Roche","submitted_at":"2015-01-21T04:43:58Z","abstract_excerpt":"We present randomized algorithms to compute the sumset (Minkowski sum) of two integer sets, and to multiply two univariate integer polynomials given by sparse representations. Our algorithm for sumset has cost softly linear in the combined size of the inputs and output. This is used as part of our sparse multiplication algorithm, whose cost is softly linear in the combined size of the inputs, output, and the sumset of the supports of the inputs. As a subroutine, we present a new method for computing the coefficients of a sparse polynomial, given a set containing its support. Our multiplication"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05296","kind":"arxiv","version":3},"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-18T02:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnHF2b6wJZVvJzd0xbjH2uYUxW+kSd9hF4+Tg3h01dHb3mL+k78907WW3nYP7oAegtX3wTpz3Sv+Zhec908dBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:56:37.841217Z"},"content_sha256":"aeccbc23316779103cc24ec119ff1a94e1a24b6c9d2e8c1d71d194eef4ef57cd","schema_version":"1.0","event_id":"sha256:aeccbc23316779103cc24ec119ff1a94e1a24b6c9d2e8c1d71d194eef4ef57cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZNPREO22YPQUT4T6VYEJNAOGO/bundle.json","state_url":"https://pith.science/pith/PZNPREO22YPQUT4T6VYEJNAOGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZNPREO22YPQUT4T6VYEJNAOGO/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-05-31T12:56:37Z","links":{"resolver":"https://pith.science/pith/PZNPREO22YPQUT4T6VYEJNAOGO","bundle":"https://pith.science/pith/PZNPREO22YPQUT4T6VYEJNAOGO/bundle.json","state":"https://pith.science/pith/PZNPREO22YPQUT4T6VYEJNAOGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZNPREO22YPQUT4T6VYEJNAOGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PZNPREO22YPQUT4T6VYEJNAOGO","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":"47701136bab5166ec37c90882e5c7994d3fcde4773d60e5a0f5d216c1f269d03","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SC","submitted_at":"2015-01-21T04:43:58Z","title_canon_sha256":"64cd5079efc010cc346094f5d5ff94d6d626ceea38c3005a110611f30bbf6461"},"schema_version":"1.0","source":{"id":"1501.05296","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05296","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05296v3","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05296","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"PZNPREO22YPQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PZNPREO22YPQUT4T","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PZNPREO2","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:aeccbc23316779103cc24ec119ff1a94e1a24b6c9d2e8c1d71d194eef4ef57cd","target":"graph","created_at":"2026-05-18T02:17:54Z","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":"We present randomized algorithms to compute the sumset (Minkowski sum) of two integer sets, and to multiply two univariate integer polynomials given by sparse representations. Our algorithm for sumset has cost softly linear in the combined size of the inputs and output. This is used as part of our sparse multiplication algorithm, whose cost is softly linear in the combined size of the inputs, output, and the sumset of the supports of the inputs. As a subroutine, we present a new method for computing the coefficients of a sparse polynomial, given a set containing its support. Our multiplication","authors_text":"Andrew Arnold, Daniel S. Roche","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SC","submitted_at":"2015-01-21T04:43:58Z","title":"Output-sensitive algorithms for sumset and sparse polynomial multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05296","kind":"arxiv","version":3},"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:b3a8a5dcb3224ad6a0ed5f524632cb88fadc9c61bac12be4758ade537213fa6d","target":"record","created_at":"2026-05-18T02:17:54Z","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":"47701136bab5166ec37c90882e5c7994d3fcde4773d60e5a0f5d216c1f269d03","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SC","submitted_at":"2015-01-21T04:43:58Z","title_canon_sha256":"64cd5079efc010cc346094f5d5ff94d6d626ceea38c3005a110611f30bbf6461"},"schema_version":"1.0","source":{"id":"1501.05296","kind":"arxiv","version":3}},"canonical_sha256":"7e5af891dad61f0a4f93f57044b40e33b70daa500315a7cd3a7b77c7815f255e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e5af891dad61f0a4f93f57044b40e33b70daa500315a7cd3a7b77c7815f255e","first_computed_at":"2026-05-18T02:17:54.278636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:54.278636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OMpBOZjrLlGDUGDu1yOSpqFM+ylYMKXapIWt5OJBHZ9X2+o+kX8f14bSrhtGM8D3vu6IIB8cEpAoMwVNYVaZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:54.279411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05296","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3a8a5dcb3224ad6a0ed5f524632cb88fadc9c61bac12be4758ade537213fa6d","sha256:aeccbc23316779103cc24ec119ff1a94e1a24b6c9d2e8c1d71d194eef4ef57cd"],"state_sha256":"142dc345b22623118b7deb31113ef6ef5f51188c8ef3a055663d9a25c1ff6a15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6dnflHq/w2U9o0/ac3jWOZPBhC9rJR9cMixwgCISc2XYqp9LtyeLw4oBr/HMQaeuLlS+yyKALC2x4AoyVWCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:56:37.844740Z","bundle_sha256":"03afd813b11816823ccf5c8d4f4839c8ede3b38c61ae7674b66d92d6381f490e"}}