{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZIX4VDFPTGOQ63OGE4VB5WYA3R","short_pith_number":"pith:ZIX4VDFP","canonical_record":{"source":{"id":"1902.06743","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-02-18T16:19:52Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"30eac80dec74647f23e0ed1fc7eeb919e72d31b658d41ab17d2b9a950e487f34","abstract_canon_sha256":"ac364863247850c98f169c2f02e194d6a7a131c1085553afc8d692df4b532c8c"},"schema_version":"1.0"},"canonical_sha256":"ca2fca8caf999d0f6dc6272a1edb00dc693e4116c1eddab6598c023d3d17ffff","source":{"kind":"arxiv","id":"1902.06743","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06743","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06743v2","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06743","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"ZIX4VDFPTGOQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZIX4VDFPTGOQ63OG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZIX4VDFP","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZIX4VDFPTGOQ63OGE4VB5WYA3R","target":"record","payload":{"canonical_record":{"source":{"id":"1902.06743","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-02-18T16:19:52Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"30eac80dec74647f23e0ed1fc7eeb919e72d31b658d41ab17d2b9a950e487f34","abstract_canon_sha256":"ac364863247850c98f169c2f02e194d6a7a131c1085553afc8d692df4b532c8c"},"schema_version":"1.0"},"canonical_sha256":"ca2fca8caf999d0f6dc6272a1edb00dc693e4116c1eddab6598c023d3d17ffff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:53.734327Z","signature_b64":"Tc0akunK1y34qzDBidZtOaZpAEWjWKL6gz0ZTysQeJjrJIk4VVcs4f/bnSa0H7I1evtfa7fFg/K+fFX9UgkvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca2fca8caf999d0f6dc6272a1edb00dc693e4116c1eddab6598c023d3d17ffff","last_reissued_at":"2026-05-17T23:47:53.733787Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:53.733787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.06743","source_version":2,"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-17T23:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qRpn+rNv/K7vYaCcRIb+6C3oW7bycd+k+4Kt9nhZZlhh6a4yTzLDA8TpqlLwAQrGjqLuiG4rwaBRkxAbqN+3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:55:36.981051Z"},"content_sha256":"19ee6dbc12d57a296da83a38674962326ed5cd7a69954b32c7f6edc62d27a633","schema_version":"1.0","event_id":"sha256:19ee6dbc12d57a296da83a38674962326ed5cd7a69954b32c7f6edc62d27a633"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZIX4VDFPTGOQ63OGE4VB5WYA3R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Robust Itemsets Under Subsampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Fabian Moerchen, Nikolaj Tatti, Toon Calders","submitted_at":"2019-02-18T16:19:52Z","abstract_excerpt":"Mining frequent patterns is plagued by the problem of pattern explosion making pattern reduction techniques a key challenge in pattern mining. In this paper we propose a novel theoretical framework for pattern reduction. We do this by measuring the robustness of a property of an itemset such as closedness or non-derivability. The robustness of a property is the probability that this property holds on random subsets of the original data. We study four properties: if an itemset is closed, free, non-derivable or totally shattered, and demonstrate how to compute the robustness analytically without"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06743","kind":"arxiv","version":2},"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-17T23:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dHQUiM4k13wVPvLuKmAeTC/rJHkiYBr/OWjBbuNYLlZlK77v7hp9FL+Oh2wAydRCT5IDX/IXwmIR97a056FAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:55:36.981759Z"},"content_sha256":"712cc9d2d7eb53442187e07b54c866b40f10af33b21aff133b7ee2d213aae46d","schema_version":"1.0","event_id":"sha256:712cc9d2d7eb53442187e07b54c866b40f10af33b21aff133b7ee2d213aae46d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIX4VDFPTGOQ63OGE4VB5WYA3R/bundle.json","state_url":"https://pith.science/pith/ZIX4VDFPTGOQ63OGE4VB5WYA3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIX4VDFPTGOQ63OGE4VB5WYA3R/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-26T10:55:36Z","links":{"resolver":"https://pith.science/pith/ZIX4VDFPTGOQ63OGE4VB5WYA3R","bundle":"https://pith.science/pith/ZIX4VDFPTGOQ63OGE4VB5WYA3R/bundle.json","state":"https://pith.science/pith/ZIX4VDFPTGOQ63OGE4VB5WYA3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIX4VDFPTGOQ63OGE4VB5WYA3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZIX4VDFPTGOQ63OGE4VB5WYA3R","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":"ac364863247850c98f169c2f02e194d6a7a131c1085553afc8d692df4b532c8c","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-02-18T16:19:52Z","title_canon_sha256":"30eac80dec74647f23e0ed1fc7eeb919e72d31b658d41ab17d2b9a950e487f34"},"schema_version":"1.0","source":{"id":"1902.06743","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06743","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06743v2","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06743","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"ZIX4VDFPTGOQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZIX4VDFPTGOQ63OG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZIX4VDFP","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:712cc9d2d7eb53442187e07b54c866b40f10af33b21aff133b7ee2d213aae46d","target":"graph","created_at":"2026-05-17T23:47:53Z","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":"Mining frequent patterns is plagued by the problem of pattern explosion making pattern reduction techniques a key challenge in pattern mining. In this paper we propose a novel theoretical framework for pattern reduction. We do this by measuring the robustness of a property of an itemset such as closedness or non-derivability. The robustness of a property is the probability that this property holds on random subsets of the original data. We study four properties: if an itemset is closed, free, non-derivable or totally shattered, and demonstrate how to compute the robustness analytically without","authors_text":"Fabian Moerchen, Nikolaj Tatti, Toon Calders","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-02-18T16:19:52Z","title":"Finding Robust Itemsets Under Subsampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06743","kind":"arxiv","version":2},"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:19ee6dbc12d57a296da83a38674962326ed5cd7a69954b32c7f6edc62d27a633","target":"record","created_at":"2026-05-17T23:47:53Z","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":"ac364863247850c98f169c2f02e194d6a7a131c1085553afc8d692df4b532c8c","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-02-18T16:19:52Z","title_canon_sha256":"30eac80dec74647f23e0ed1fc7eeb919e72d31b658d41ab17d2b9a950e487f34"},"schema_version":"1.0","source":{"id":"1902.06743","kind":"arxiv","version":2}},"canonical_sha256":"ca2fca8caf999d0f6dc6272a1edb00dc693e4116c1eddab6598c023d3d17ffff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca2fca8caf999d0f6dc6272a1edb00dc693e4116c1eddab6598c023d3d17ffff","first_computed_at":"2026-05-17T23:47:53.733787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:53.733787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tc0akunK1y34qzDBidZtOaZpAEWjWKL6gz0ZTysQeJjrJIk4VVcs4f/bnSa0H7I1evtfa7fFg/K+fFX9UgkvBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:53.734327Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06743","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19ee6dbc12d57a296da83a38674962326ed5cd7a69954b32c7f6edc62d27a633","sha256:712cc9d2d7eb53442187e07b54c866b40f10af33b21aff133b7ee2d213aae46d"],"state_sha256":"fb11f609a116a89bcac783dd600e92e11d8e3957770ce769d20141c89b270477"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7OJSsTksiHOu8+YF+O+JyqVopyRtL2wcOe81uo3NPau23TLrJbXVzhcpUay1TgCM8b+9mKjlIlU6ocGvfjzHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:55:36.985301Z","bundle_sha256":"c8b4524a0552b82965c591d0847469d2cca253a9d44ecefb610362dd96d80f66"}}