{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JBSF6OZVEYOPNUTURPK7QCVY7D","short_pith_number":"pith:JBSF6OZV","canonical_record":{"source":{"id":"1207.5466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-23T17:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"07b47042f4190c2ce67bb2dc3d35fc21a056bb3367d58ec371da2503b838991e","abstract_canon_sha256":"1c2072509dc5b25955d3eb504ae7c40405b95a215500b8e2cbb9324a943d6038"},"schema_version":"1.0"},"canonical_sha256":"48645f3b35261cf6d2748bd5f80ab8f8cbea90e796368263159621417b8d272d","source":{"kind":"arxiv","id":"1207.5466","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5466","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5466v1","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5466","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"pith_short_12","alias_value":"JBSF6OZVEYOP","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JBSF6OZVEYOPNUTU","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JBSF6OZV","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JBSF6OZVEYOPNUTURPK7QCVY7D","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-23T17:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"07b47042f4190c2ce67bb2dc3d35fc21a056bb3367d58ec371da2503b838991e","abstract_canon_sha256":"1c2072509dc5b25955d3eb504ae7c40405b95a215500b8e2cbb9324a943d6038"},"schema_version":"1.0"},"canonical_sha256":"48645f3b35261cf6d2748bd5f80ab8f8cbea90e796368263159621417b8d272d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:23.359433Z","signature_b64":"oWosNmHlXL6zH6hKFfF5V4GrKdlM1FJrc3zL9lcApvBdNpuo0ubndc+36gmNeDrxQSHJ/eU6YEhEwTI9BwFtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48645f3b35261cf6d2748bd5f80ab8f8cbea90e796368263159621417b8d272d","last_reissued_at":"2026-05-18T03:50:23.358719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:23.358719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5466","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-18T03:50:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VouQfbGUrqiq2Ejp7anDVlqUYZMP9KtDxLZIF8TnwwE4o04y9KPxaW6VXii1WuL5Vi4eUv8UbuKk5QKQgpZxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:33:31.994844Z"},"content_sha256":"b81f1713020fbc0c541ce2e5a0263c1b13f272ecb815f898723cbaf7627cbced","schema_version":"1.0","event_id":"sha256:b81f1713020fbc0c541ce2e5a0263c1b13f272ecb815f898723cbaf7627cbced"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JBSF6OZVEYOPNUTURPK7QCVY7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Xintao Wu, Yongge Wang","submitted_at":"2012-07-23T17:57:47Z","abstract_excerpt":"In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data sets. The characteristics that could be used for this purpose include the frequent itemsets and association rules. The problem of generating synthetic basket data sets from frequent itemsets is generally referred to as inverse frequent itemset mining. In this paper, we show that the problem of approximate inverse frequent itemset mining is {\\bf NP}-complete. Then we propose and analyze an approximate algorithm for app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5466","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-18T03:50:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VuQb76QKDq/2L1uGdl5T7UrrdUWFm6Qu0G3DN0tagUiyADD3EEUokw81uIBavwWVZVSPfvcVnWTuXmQ2Kx97DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:33:31.995184Z"},"content_sha256":"e7d7f3383e53a294f3510fe8c2522111d7d5da5d56128229b019daa4eca4fb2e","schema_version":"1.0","event_id":"sha256:e7d7f3383e53a294f3510fe8c2522111d7d5da5d56128229b019daa4eca4fb2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBSF6OZVEYOPNUTURPK7QCVY7D/bundle.json","state_url":"https://pith.science/pith/JBSF6OZVEYOPNUTURPK7QCVY7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBSF6OZVEYOPNUTURPK7QCVY7D/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-05T17:33:31Z","links":{"resolver":"https://pith.science/pith/JBSF6OZVEYOPNUTURPK7QCVY7D","bundle":"https://pith.science/pith/JBSF6OZVEYOPNUTURPK7QCVY7D/bundle.json","state":"https://pith.science/pith/JBSF6OZVEYOPNUTURPK7QCVY7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBSF6OZVEYOPNUTURPK7QCVY7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JBSF6OZVEYOPNUTURPK7QCVY7D","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":"1c2072509dc5b25955d3eb504ae7c40405b95a215500b8e2cbb9324a943d6038","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-23T17:57:47Z","title_canon_sha256":"07b47042f4190c2ce67bb2dc3d35fc21a056bb3367d58ec371da2503b838991e"},"schema_version":"1.0","source":{"id":"1207.5466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5466","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5466v1","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5466","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"pith_short_12","alias_value":"JBSF6OZVEYOP","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JBSF6OZVEYOPNUTU","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JBSF6OZV","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:e7d7f3383e53a294f3510fe8c2522111d7d5da5d56128229b019daa4eca4fb2e","target":"graph","created_at":"2026-05-18T03:50:23Z","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 order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data sets. The characteristics that could be used for this purpose include the frequent itemsets and association rules. The problem of generating synthetic basket data sets from frequent itemsets is generally referred to as inverse frequent itemset mining. In this paper, we show that the problem of approximate inverse frequent itemset mining is {\\bf NP}-complete. Then we propose and analyze an approximate algorithm for app","authors_text":"Xintao Wu, Yongge Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-23T17:57:47Z","title":"Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5466","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:b81f1713020fbc0c541ce2e5a0263c1b13f272ecb815f898723cbaf7627cbced","target":"record","created_at":"2026-05-18T03:50:23Z","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":"1c2072509dc5b25955d3eb504ae7c40405b95a215500b8e2cbb9324a943d6038","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-23T17:57:47Z","title_canon_sha256":"07b47042f4190c2ce67bb2dc3d35fc21a056bb3367d58ec371da2503b838991e"},"schema_version":"1.0","source":{"id":"1207.5466","kind":"arxiv","version":1}},"canonical_sha256":"48645f3b35261cf6d2748bd5f80ab8f8cbea90e796368263159621417b8d272d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48645f3b35261cf6d2748bd5f80ab8f8cbea90e796368263159621417b8d272d","first_computed_at":"2026-05-18T03:50:23.358719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:23.358719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oWosNmHlXL6zH6hKFfF5V4GrKdlM1FJrc3zL9lcApvBdNpuo0ubndc+36gmNeDrxQSHJ/eU6YEhEwTI9BwFtDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:23.359433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b81f1713020fbc0c541ce2e5a0263c1b13f272ecb815f898723cbaf7627cbced","sha256:e7d7f3383e53a294f3510fe8c2522111d7d5da5d56128229b019daa4eca4fb2e"],"state_sha256":"bf7b147afb1015b4c0efef4e221d971debd806d6be5edf3b95edb1fa823eb983"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Eb+/4KznGuL2fUBc1K6gjDEV0zvlgEAv3HGlSyhaLtd/YfVK0MbGAyjeSbNwkde9keKI1ccSN/nbBuf+uodDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:33:31.997413Z","bundle_sha256":"3e62d8b0ded5a482fbc8ec075938deb116360547ad5c5f020084b059c73c117d"}}