{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:L6WHYJ2ZMXTZTHSPHML76EOCPC","short_pith_number":"pith:L6WHYJ2Z","schema_version":"1.0","canonical_sha256":"5fac7c275965e7999e4f3b17ff11c278b0e2fb34fda0aced6231ada88fb72333","source":{"kind":"arxiv","id":"cs/0611101","version":1},"attestation_state":"computed","paper":{"title":"Fourier meets M\\\"{o}bius: fast subset convolution","license":"","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Mikko Koivisto, Petteri Kaski, Thore Husfeldt","submitted_at":"2006-11-21T08:34:30Z","abstract_excerpt":"We present a fast algorithm for the subset convolution problem: given functions f and g defined on the lattice of subsets of an n-element set N, compute their subset convolution f*g, defined for all S\\subseteq N by (f * g)(S) = \\sum_{T \\subseteq S}f(T) g(S\\setminus T), where addition and multiplication is carried out in an arbitrary ring. Via M\\\"{o}bius transform and inversion, our algorithm evaluates the subset convolution in O(n^2 2^n) additions and multiplications, substantially improving upon the straightforward O(3^n) algorithm. Specifically, if the input functions have an integer range {"},"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":"cs/0611101","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2006-11-21T08:34:30Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"49c397c74aefac9f0914ac818d7e065ac032ec27b3a59940015e35ebb4f598d1","abstract_canon_sha256":"b3d54d4f738aece6e00ac85c1fa5e12977a12801e1552a0daefa33335fc826f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:54.242690Z","signature_b64":"sduw5p4zHCkrkehu4InnGKMy0Z9sQ1gdCq28Kp7dDQs+X3WKcGzhQW7MUh7cmHQLyeBap2qHed9GbPke7pcZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fac7c275965e7999e4f3b17ff11c278b0e2fb34fda0aced6231ada88fb72333","last_reissued_at":"2026-05-18T01:08:54.242057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:54.242057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fourier meets M\\\"{o}bius: fast subset convolution","license":"","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Mikko Koivisto, Petteri Kaski, Thore Husfeldt","submitted_at":"2006-11-21T08:34:30Z","abstract_excerpt":"We present a fast algorithm for the subset convolution problem: given functions f and g defined on the lattice of subsets of an n-element set N, compute their subset convolution f*g, defined for all S\\subseteq N by (f * g)(S) = \\sum_{T \\subseteq S}f(T) g(S\\setminus T), where addition and multiplication is carried out in an arbitrary ring. Via M\\\"{o}bius transform and inversion, our algorithm evaluates the subset convolution in O(n^2 2^n) additions and multiplications, substantially improving upon the straightforward O(3^n) algorithm. Specifically, if the input functions have an integer range {"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0611101","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":"cs/0611101","created_at":"2026-05-18T01:08:54.242148+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0611101v1","created_at":"2026-05-18T01:08:54.242148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0611101","created_at":"2026-05-18T01:08:54.242148+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6WHYJ2ZMXTZ","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6WHYJ2ZMXTZTHSP","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6WHYJ2Z","created_at":"2026-05-18T12:25:54.717736+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/L6WHYJ2ZMXTZTHSPHML76EOCPC","json":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC.json","graph_json":"https://pith.science/api/pith-number/L6WHYJ2ZMXTZTHSPHML76EOCPC/graph.json","events_json":"https://pith.science/api/pith-number/L6WHYJ2ZMXTZTHSPHML76EOCPC/events.json","paper":"https://pith.science/paper/L6WHYJ2Z"},"agent_actions":{"view_html":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC","download_json":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC.json","view_paper":"https://pith.science/paper/L6WHYJ2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0611101&json=true","fetch_graph":"https://pith.science/api/pith-number/L6WHYJ2ZMXTZTHSPHML76EOCPC/graph.json","fetch_events":"https://pith.science/api/pith-number/L6WHYJ2ZMXTZTHSPHML76EOCPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC/action/storage_attestation","attest_author":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC/action/author_attestation","sign_citation":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC/action/citation_signature","submit_replication":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC/action/replication_record"}},"created_at":"2026-05-18T01:08:54.242148+00:00","updated_at":"2026-05-18T01:08:54.242148+00:00"}