{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:L6WHYJ2ZMXTZTHSPHML76EOCPC","short_pith_number":"pith:L6WHYJ2Z","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"},"canonical_sha256":"5fac7c275965e7999e4f3b17ff11c278b0e2fb34fda0aced6231ada88fb72333","source":{"kind":"arxiv","id":"cs/0611101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0611101","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0611101v1","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0611101","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"L6WHYJ2ZMXTZ","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"L6WHYJ2ZMXTZTHSP","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"L6WHYJ2Z","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:L6WHYJ2ZMXTZTHSPHML76EOCPC","target":"record","payload":{"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"},"canonical_sha256":"5fac7c275965e7999e4f3b17ff11c278b0e2fb34fda0aced6231ada88fb72333","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"},"source_kind":"arxiv","source_id":"cs/0611101","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-05-18T01:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10FEyCoVLe8T7WtdZffrqPARgpxrKCYp5by4eEwZaNUzqNezewRd9/wFS09l4qXdy9hiwUYChLXCCHcj4FubDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:56:26.601854Z"},"content_sha256":"ee57359b417c551b1fa481c9ab757112e09d7df14f380a2fd45268fc6a460b0d","schema_version":"1.0","event_id":"sha256:ee57359b417c551b1fa481c9ab757112e09d7df14f380a2fd45268fc6a460b0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:L6WHYJ2ZMXTZTHSPHML76EOCPC","target":"graph","payload":{"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"},"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-18T01:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1AR1pndrxj7oB/vx/A1F4epMRGfZ7RHHdksOs4EXavqBqcWSmiQ7Hiq75FBKbhB6UcFJJOvzWNGY4frrktdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:56:26.602560Z"},"content_sha256":"8832335c95698e0585e8051d5013595b7b75505bd7b0d390bd6b03f32408a452","schema_version":"1.0","event_id":"sha256:8832335c95698e0585e8051d5013595b7b75505bd7b0d390bd6b03f32408a452"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC/bundle.json","state_url":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC/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-25T17:56:26Z","links":{"resolver":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC","bundle":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC/bundle.json","state":"https://pith.science/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6WHYJ2ZMXTZTHSPHML76EOCPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:L6WHYJ2ZMXTZTHSPHML76EOCPC","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":"b3d54d4f738aece6e00ac85c1fa5e12977a12801e1552a0daefa33335fc826f8","cross_cats_sorted":["cs.DM","math.CO"],"license":"","primary_cat":"cs.DS","submitted_at":"2006-11-21T08:34:30Z","title_canon_sha256":"49c397c74aefac9f0914ac818d7e065ac032ec27b3a59940015e35ebb4f598d1"},"schema_version":"1.0","source":{"id":"cs/0611101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0611101","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0611101v1","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0611101","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"L6WHYJ2ZMXTZ","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"L6WHYJ2ZMXTZTHSP","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"L6WHYJ2Z","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:8832335c95698e0585e8051d5013595b7b75505bd7b0d390bd6b03f32408a452","target":"graph","created_at":"2026-05-18T01:08: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 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 {","authors_text":"Andreas Bj\\\"orklund, Mikko Koivisto, Petteri Kaski, Thore Husfeldt","cross_cats":["cs.DM","math.CO"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2006-11-21T08:34:30Z","title":"Fourier meets M\\\"{o}bius: fast subset convolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0611101","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:ee57359b417c551b1fa481c9ab757112e09d7df14f380a2fd45268fc6a460b0d","target":"record","created_at":"2026-05-18T01:08: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":"b3d54d4f738aece6e00ac85c1fa5e12977a12801e1552a0daefa33335fc826f8","cross_cats_sorted":["cs.DM","math.CO"],"license":"","primary_cat":"cs.DS","submitted_at":"2006-11-21T08:34:30Z","title_canon_sha256":"49c397c74aefac9f0914ac818d7e065ac032ec27b3a59940015e35ebb4f598d1"},"schema_version":"1.0","source":{"id":"cs/0611101","kind":"arxiv","version":1}},"canonical_sha256":"5fac7c275965e7999e4f3b17ff11c278b0e2fb34fda0aced6231ada88fb72333","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fac7c275965e7999e4f3b17ff11c278b0e2fb34fda0aced6231ada88fb72333","first_computed_at":"2026-05-18T01:08:54.242057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:54.242057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sduw5p4zHCkrkehu4InnGKMy0Z9sQ1gdCq28Kp7dDQs+X3WKcGzhQW7MUh7cmHQLyeBap2qHed9GbPke7pcZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:54.242690Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0611101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee57359b417c551b1fa481c9ab757112e09d7df14f380a2fd45268fc6a460b0d","sha256:8832335c95698e0585e8051d5013595b7b75505bd7b0d390bd6b03f32408a452"],"state_sha256":"59c24c37676b0d3db5f426623e1fd90c8561135c89b45a78636dc03ac1d704bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjPCc5Xop3CVeKAwy9K0qPC3ekOghjnbvTdZl41PgsCSW5Wea5MRc/RIK9dG2SvJZt/Q+ERPiW2BVQVMeOXrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:56:26.606585Z","bundle_sha256":"8c110e5d799ade276437dbb28be303b0ec5fbd84182e9c8a0eafa3ba81b5157e"}}