{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5L2QG7UJLZU4COBSDBLND32LX7","short_pith_number":"pith:5L2QG7UJ","canonical_record":{"source":{"id":"1904.11134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T02:59:53Z","cross_cats_sorted":["cs.DB","cs.LG"],"title_canon_sha256":"add16755e1b18108d134de7160f708f754322c429afc24483df81fce95966786","abstract_canon_sha256":"19bec41c89d98e8e732611365fae00c4d1951cd2addcacc629a9c469a6d12285"},"schema_version":"1.0"},"canonical_sha256":"eaf5037e895e69c138321856d1ef4bbfc8d2aa1401020948106b9d2a91055b2f","source":{"kind":"arxiv","id":"1904.11134","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11134","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11134v2","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11134","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"5L2QG7UJLZU4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5L2QG7UJLZU4COBS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5L2QG7UJ","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5L2QG7UJLZU4COBSDBLND32LX7","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T02:59:53Z","cross_cats_sorted":["cs.DB","cs.LG"],"title_canon_sha256":"add16755e1b18108d134de7160f708f754322c429afc24483df81fce95966786","abstract_canon_sha256":"19bec41c89d98e8e732611365fae00c4d1951cd2addcacc629a9c469a6d12285"},"schema_version":"1.0"},"canonical_sha256":"eaf5037e895e69c138321856d1ef4bbfc8d2aa1401020948106b9d2a91055b2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:39.142402Z","signature_b64":"y86usl7HO8hhmLqL1CSI65MjnTJWDrriUSdJirrYm2F//FCJh38kWpAy64CUtYBHDHJqNzEVPkjYBefnXYSBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaf5037e895e69c138321856d1ef4bbfc8d2aa1401020948106b9d2a91055b2f","last_reissued_at":"2026-05-17T23:47:39.141902Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:39.141902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11134","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:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8ZqOZ0XUwa8eXsKGH4DcV+yidcWYB8xqzB8ZuR5Ar897y7/kPQwKSWmM81Zho54VzCoIo1xIltdC27IEzMVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:58:50.046926Z"},"content_sha256":"95875af2f038e4026f79c2015f667b5e00e3490515ce98cbdb9a0dab02850e17","schema_version":"1.0","event_id":"sha256:95875af2f038e4026f79c2015f667b5e00e3490515ce98cbdb9a0dab02850e17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5L2QG7UJLZU4COBSDBLND32LX7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Summarizing Data Succinctly with the Most Informative Itemsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG"],"primary_cat":"cs.DS","authors_text":"Jilles Vreeken, Michael Mampaey, Nikolaj Tatti","submitted_at":"2019-04-25T02:59:53Z","abstract_excerpt":"Knowledge discovery from data is an inherently iterative process. That is, what we know about the data greatly determines our expectations, and therefore, what results we would find interesting and/or surprising. Given new knowledge about the data, our expectations will change. Hence, in order to avoid redundant results, knowledge discovery algorithms ideally should follow such an iterative updating procedure.\n  With this in mind, we introduce a well-founded approach for succinctly summarizing data with the most informative itemsets; using a probabilistic maximum entropy model, we iteratively "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11134","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:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wnBlQXuJ0ennmI4DJiK5sHwT8roc9hwobd+o/PM7ZppF/3+jqD43qvcRbuc03IkE5Ph5FnuPkbvoTKJyC3eAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:58:50.047654Z"},"content_sha256":"be75ec26ae068dc543be68c94dd8886a99857a3c49c3b3d450728d6137c78e9b","schema_version":"1.0","event_id":"sha256:be75ec26ae068dc543be68c94dd8886a99857a3c49c3b3d450728d6137c78e9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5L2QG7UJLZU4COBSDBLND32LX7/bundle.json","state_url":"https://pith.science/pith/5L2QG7UJLZU4COBSDBLND32LX7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5L2QG7UJLZU4COBSDBLND32LX7/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-30T16:58:50Z","links":{"resolver":"https://pith.science/pith/5L2QG7UJLZU4COBSDBLND32LX7","bundle":"https://pith.science/pith/5L2QG7UJLZU4COBSDBLND32LX7/bundle.json","state":"https://pith.science/pith/5L2QG7UJLZU4COBSDBLND32LX7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5L2QG7UJLZU4COBSDBLND32LX7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5L2QG7UJLZU4COBSDBLND32LX7","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":"19bec41c89d98e8e732611365fae00c4d1951cd2addcacc629a9c469a6d12285","cross_cats_sorted":["cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T02:59:53Z","title_canon_sha256":"add16755e1b18108d134de7160f708f754322c429afc24483df81fce95966786"},"schema_version":"1.0","source":{"id":"1904.11134","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11134","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11134v2","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11134","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"5L2QG7UJLZU4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5L2QG7UJLZU4COBS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5L2QG7UJ","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:be75ec26ae068dc543be68c94dd8886a99857a3c49c3b3d450728d6137c78e9b","target":"graph","created_at":"2026-05-17T23:47:39Z","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":"Knowledge discovery from data is an inherently iterative process. That is, what we know about the data greatly determines our expectations, and therefore, what results we would find interesting and/or surprising. Given new knowledge about the data, our expectations will change. Hence, in order to avoid redundant results, knowledge discovery algorithms ideally should follow such an iterative updating procedure.\n  With this in mind, we introduce a well-founded approach for succinctly summarizing data with the most informative itemsets; using a probabilistic maximum entropy model, we iteratively ","authors_text":"Jilles Vreeken, Michael Mampaey, Nikolaj Tatti","cross_cats":["cs.DB","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T02:59:53Z","title":"Summarizing Data Succinctly with the Most Informative Itemsets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11134","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:95875af2f038e4026f79c2015f667b5e00e3490515ce98cbdb9a0dab02850e17","target":"record","created_at":"2026-05-17T23:47:39Z","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":"19bec41c89d98e8e732611365fae00c4d1951cd2addcacc629a9c469a6d12285","cross_cats_sorted":["cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T02:59:53Z","title_canon_sha256":"add16755e1b18108d134de7160f708f754322c429afc24483df81fce95966786"},"schema_version":"1.0","source":{"id":"1904.11134","kind":"arxiv","version":2}},"canonical_sha256":"eaf5037e895e69c138321856d1ef4bbfc8d2aa1401020948106b9d2a91055b2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaf5037e895e69c138321856d1ef4bbfc8d2aa1401020948106b9d2a91055b2f","first_computed_at":"2026-05-17T23:47:39.141902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:39.141902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y86usl7HO8hhmLqL1CSI65MjnTJWDrriUSdJirrYm2F//FCJh38kWpAy64CUtYBHDHJqNzEVPkjYBefnXYSBCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:39.142402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11134","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95875af2f038e4026f79c2015f667b5e00e3490515ce98cbdb9a0dab02850e17","sha256:be75ec26ae068dc543be68c94dd8886a99857a3c49c3b3d450728d6137c78e9b"],"state_sha256":"2c77998071ae4f178002b56a1d495824bbea784935afdbf26eae47fa4e1ebb91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAhqvxY7BVdJSgfFFXZyXPQXLH0TpQxWa1Jf7Wtze9xok9k1i7e4NF08HoXsqpAztfpm29bHLzfB2OTbdLVEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:58:50.051514Z","bundle_sha256":"23de2d544756a5955957a9715e7fa8281e93ec31b68f5a2d7702181b36ba9911"}}