{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VYLNCQJNZYJWE3CI3RWQB275TD","short_pith_number":"pith:VYLNCQJN","canonical_record":{"source":{"id":"1709.00900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-04T11:12:55Z","cross_cats_sorted":[],"title_canon_sha256":"b052c28b77994c07fb815d626a3ed1426dae678b1deb19b26dc1fdadcba7ef96","abstract_canon_sha256":"cba0977ffad1656006907e02dc2951b9cb6dd906fefa7454a0e17fa19cc7f4a4"},"schema_version":"1.0"},"canonical_sha256":"ae16d1412dce13626c48dc6d00ebfd98c8108fb6393b9fbe44c25264d17a405a","source":{"kind":"arxiv","id":"1709.00900","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00900","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00900v1","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00900","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"VYLNCQJNZYJW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VYLNCQJNZYJWE3CI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VYLNCQJN","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VYLNCQJNZYJWE3CI3RWQB275TD","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-04T11:12:55Z","cross_cats_sorted":[],"title_canon_sha256":"b052c28b77994c07fb815d626a3ed1426dae678b1deb19b26dc1fdadcba7ef96","abstract_canon_sha256":"cba0977ffad1656006907e02dc2951b9cb6dd906fefa7454a0e17fa19cc7f4a4"},"schema_version":"1.0"},"canonical_sha256":"ae16d1412dce13626c48dc6d00ebfd98c8108fb6393b9fbe44c25264d17a405a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:04.792602Z","signature_b64":"fQdDqE2iQMtQrp1anOrQrRmSO0xLcxEXVi6dkNlFpFHw+2xPwLxUqEIZ1Lag2m+i13ISe01UyO9F3ZrDerylBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae16d1412dce13626c48dc6d00ebfd98c8108fb6393b9fbe44c25264d17a405a","last_reissued_at":"2026-05-18T00:36:04.792015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:04.792015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00900","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-18T00:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GW2ReqtJDTjctOavXO8mNUl0q6E4rCLWg4JlIpoPIzCK2Y+5+1YK6IIRGXzC5zTRRktPWCXXElRckcPn4YWKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:35:16.204983Z"},"content_sha256":"d3798bb81d92e0c23dfbc5eb03c98b5ddaba0a25dd105f334e347054f9f2f581","schema_version":"1.0","event_id":"sha256:d3798bb81d92e0c23dfbc5eb03c98b5ddaba0a25dd105f334e347054f9f2f581"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VYLNCQJNZYJWE3CI3RWQB275TD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reductions for Frequency-Based Data Mining Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pauli Miettinen, Stefan Neumann","submitted_at":"2017-09-04T11:12:55Z","abstract_excerpt":"Studying the computational complexity of problems is one of the - if not the - fundamental questions in computer science. Yet, surprisingly little is known about the computational complexity of many central problems in data mining. In this paper we study frequency-based problems and propose a new type of reduction that allows us to compare the complexities of the maximal frequent pattern mining problems in different domains (e.g. graphs or sequences). Our results extend those of Kimelfeld and Kolaitis [ACM TODS, 2014] to a broader range of data mining problems. Our results show that, by allowi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00900","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-18T00:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BoAa+t5dXha3EZg6mM23RbDor8cqVo6Y+M4rP1rr+JxSkBvbsZFplKAcN36RuOCvHZNkme8fvvIOAvCNokrpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:35:16.205663Z"},"content_sha256":"a1d0f83ca675e99d23f3a7dc2334e8e515db4ea35fea4f13d3094771f95bd55c","schema_version":"1.0","event_id":"sha256:a1d0f83ca675e99d23f3a7dc2334e8e515db4ea35fea4f13d3094771f95bd55c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYLNCQJNZYJWE3CI3RWQB275TD/bundle.json","state_url":"https://pith.science/pith/VYLNCQJNZYJWE3CI3RWQB275TD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYLNCQJNZYJWE3CI3RWQB275TD/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-07T14:35:16Z","links":{"resolver":"https://pith.science/pith/VYLNCQJNZYJWE3CI3RWQB275TD","bundle":"https://pith.science/pith/VYLNCQJNZYJWE3CI3RWQB275TD/bundle.json","state":"https://pith.science/pith/VYLNCQJNZYJWE3CI3RWQB275TD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYLNCQJNZYJWE3CI3RWQB275TD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VYLNCQJNZYJWE3CI3RWQB275TD","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":"cba0977ffad1656006907e02dc2951b9cb6dd906fefa7454a0e17fa19cc7f4a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-04T11:12:55Z","title_canon_sha256":"b052c28b77994c07fb815d626a3ed1426dae678b1deb19b26dc1fdadcba7ef96"},"schema_version":"1.0","source":{"id":"1709.00900","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00900","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00900v1","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00900","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"VYLNCQJNZYJW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VYLNCQJNZYJWE3CI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VYLNCQJN","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:a1d0f83ca675e99d23f3a7dc2334e8e515db4ea35fea4f13d3094771f95bd55c","target":"graph","created_at":"2026-05-18T00:36:04Z","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":"Studying the computational complexity of problems is one of the - if not the - fundamental questions in computer science. Yet, surprisingly little is known about the computational complexity of many central problems in data mining. In this paper we study frequency-based problems and propose a new type of reduction that allows us to compare the complexities of the maximal frequent pattern mining problems in different domains (e.g. graphs or sequences). Our results extend those of Kimelfeld and Kolaitis [ACM TODS, 2014] to a broader range of data mining problems. Our results show that, by allowi","authors_text":"Pauli Miettinen, Stefan Neumann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-04T11:12:55Z","title":"Reductions for Frequency-Based Data Mining Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00900","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:d3798bb81d92e0c23dfbc5eb03c98b5ddaba0a25dd105f334e347054f9f2f581","target":"record","created_at":"2026-05-18T00:36:04Z","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":"cba0977ffad1656006907e02dc2951b9cb6dd906fefa7454a0e17fa19cc7f4a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-04T11:12:55Z","title_canon_sha256":"b052c28b77994c07fb815d626a3ed1426dae678b1deb19b26dc1fdadcba7ef96"},"schema_version":"1.0","source":{"id":"1709.00900","kind":"arxiv","version":1}},"canonical_sha256":"ae16d1412dce13626c48dc6d00ebfd98c8108fb6393b9fbe44c25264d17a405a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae16d1412dce13626c48dc6d00ebfd98c8108fb6393b9fbe44c25264d17a405a","first_computed_at":"2026-05-18T00:36:04.792015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:04.792015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fQdDqE2iQMtQrp1anOrQrRmSO0xLcxEXVi6dkNlFpFHw+2xPwLxUqEIZ1Lag2m+i13ISe01UyO9F3ZrDerylBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:04.792602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00900","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3798bb81d92e0c23dfbc5eb03c98b5ddaba0a25dd105f334e347054f9f2f581","sha256:a1d0f83ca675e99d23f3a7dc2334e8e515db4ea35fea4f13d3094771f95bd55c"],"state_sha256":"c14b0e31ffa1ccbacf7c20e5b1d8fb071a023737a79e89646dc1a00752986319"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBUaFmx40yxR/rFVvj6mFc/W7k8ZvdjHAoP+xQvbRg67NmSx5yeZV/di99Zm0yeQLZ13T9DnpKPrMAdZxncpBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:35:16.209803Z","bundle_sha256":"13716bb60b49b34b9ef003494036e8dea7a8d3c69b199230ddf21567f982a385"}}