{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:K53FMQ27ABJ6T6MC2DSAJOPPEX","short_pith_number":"pith:K53FMQ27","canonical_record":{"source":{"id":"1103.4778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-24T14:45:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3ffabd0ce08e715657892380968881643f0dbd4f8bdb67d7405f13a371615d78","abstract_canon_sha256":"e6a02cedc5ee29ad55c4bc245f1a1799bc48c87447d5a1745579cd7353e96ff5"},"schema_version":"1.0"},"canonical_sha256":"577656435f0053e9f982d0e404b9ef25f49180b8ab9cb59047b531c166dac44f","source":{"kind":"arxiv","id":"1103.4778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4778","created_at":"2026-05-18T04:26:00Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4778v1","created_at":"2026-05-18T04:26:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4778","created_at":"2026-05-18T04:26:00Z"},{"alias_kind":"pith_short_12","alias_value":"K53FMQ27ABJ6","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K53FMQ27ABJ6T6MC","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K53FMQ27","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:K53FMQ27ABJ6T6MC2DSAJOPPEX","target":"record","payload":{"canonical_record":{"source":{"id":"1103.4778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-24T14:45:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3ffabd0ce08e715657892380968881643f0dbd4f8bdb67d7405f13a371615d78","abstract_canon_sha256":"e6a02cedc5ee29ad55c4bc245f1a1799bc48c87447d5a1745579cd7353e96ff5"},"schema_version":"1.0"},"canonical_sha256":"577656435f0053e9f982d0e404b9ef25f49180b8ab9cb59047b531c166dac44f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:00.867552Z","signature_b64":"azgsY7+Pqv5wSaXk03gPtNS+Tmrwt3a3LatGe8XgyELzKOkuzBHplolzWbAJ2s6t5BgLjZxJikg/Hqvd/6BNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"577656435f0053e9f982d0e404b9ef25f49180b8ab9cb59047b531c166dac44f","last_reissued_at":"2026-05-18T04:26:00.867178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:00.867178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.4778","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-18T04:26:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x1e15Ly6Tp2l/GscMlHMOUcX0Kw8bcrptKgAOz2z3MeXU3CVW/7fdmBft2UWVbHyKGT1oCYR8/2JszpWQNWkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:28:22.711407Z"},"content_sha256":"6d82ed6009afe0994eaa417cea55b8a4960475ae736e52a400876576b7a2c28e","schema_version":"1.0","event_id":"sha256:6d82ed6009afe0994eaa417cea55b8a4960475ae736e52a400876576b7a2c28e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:K53FMQ27ABJ6T6MC2DSAJOPPEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Formal and Computational Properties of the Confidence Boost of Association Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Jos\\'e L. Balc\\'azar","submitted_at":"2011-03-24T14:45:50Z","abstract_excerpt":"Some existing notions of redundancy among association rules allow for a logical-style characterization and lead to irredundant bases of absolutely minimum size. One can push the intuition of redundancy further and find an intuitive notion of interest of an association rule, in terms of its \"novelty\" with respect to other rules. Namely: an irredundant rule is so because its confidence is higher than what the rest of the rules would suggest; then, one can ask: how much higher? We propose to measure such a sort of \"novelty\" through the confidence boost of a rule, which encompasses two previous si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4778","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-18T04:26:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/lKPrUF10a4efEYeYoexXRhpgyNYIxJPeC339nBkxsf1dvBzdI08IbqZgrtZQUFHC5tn1kM4i1jFSwFVlnA7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:28:22.712161Z"},"content_sha256":"e3ef032e191ad87351d9a142564a1245f6b3710f4ef06b6366ca57f780f4dbb0","schema_version":"1.0","event_id":"sha256:e3ef032e191ad87351d9a142564a1245f6b3710f4ef06b6366ca57f780f4dbb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX/bundle.json","state_url":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX/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-10T01:28:22Z","links":{"resolver":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX","bundle":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX/bundle.json","state":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:K53FMQ27ABJ6T6MC2DSAJOPPEX","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":"e6a02cedc5ee29ad55c4bc245f1a1799bc48c87447d5a1745579cd7353e96ff5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-24T14:45:50Z","title_canon_sha256":"3ffabd0ce08e715657892380968881643f0dbd4f8bdb67d7405f13a371615d78"},"schema_version":"1.0","source":{"id":"1103.4778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4778","created_at":"2026-05-18T04:26:00Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4778v1","created_at":"2026-05-18T04:26:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4778","created_at":"2026-05-18T04:26:00Z"},{"alias_kind":"pith_short_12","alias_value":"K53FMQ27ABJ6","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K53FMQ27ABJ6T6MC","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K53FMQ27","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:e3ef032e191ad87351d9a142564a1245f6b3710f4ef06b6366ca57f780f4dbb0","target":"graph","created_at":"2026-05-18T04:26:00Z","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":"Some existing notions of redundancy among association rules allow for a logical-style characterization and lead to irredundant bases of absolutely minimum size. One can push the intuition of redundancy further and find an intuitive notion of interest of an association rule, in terms of its \"novelty\" with respect to other rules. Namely: an irredundant rule is so because its confidence is higher than what the rest of the rules would suggest; then, one can ask: how much higher? We propose to measure such a sort of \"novelty\" through the confidence boost of a rule, which encompasses two previous si","authors_text":"Jos\\'e L. Balc\\'azar","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-24T14:45:50Z","title":"Formal and Computational Properties of the Confidence Boost of Association Rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4778","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:6d82ed6009afe0994eaa417cea55b8a4960475ae736e52a400876576b7a2c28e","target":"record","created_at":"2026-05-18T04:26:00Z","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":"e6a02cedc5ee29ad55c4bc245f1a1799bc48c87447d5a1745579cd7353e96ff5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-24T14:45:50Z","title_canon_sha256":"3ffabd0ce08e715657892380968881643f0dbd4f8bdb67d7405f13a371615d78"},"schema_version":"1.0","source":{"id":"1103.4778","kind":"arxiv","version":1}},"canonical_sha256":"577656435f0053e9f982d0e404b9ef25f49180b8ab9cb59047b531c166dac44f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"577656435f0053e9f982d0e404b9ef25f49180b8ab9cb59047b531c166dac44f","first_computed_at":"2026-05-18T04:26:00.867178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:00.867178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"azgsY7+Pqv5wSaXk03gPtNS+Tmrwt3a3LatGe8XgyELzKOkuzBHplolzWbAJ2s6t5BgLjZxJikg/Hqvd/6BNBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:00.867552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.4778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d82ed6009afe0994eaa417cea55b8a4960475ae736e52a400876576b7a2c28e","sha256:e3ef032e191ad87351d9a142564a1245f6b3710f4ef06b6366ca57f780f4dbb0"],"state_sha256":"ef934850fa55123bc339f9afc3101796ace19ba0eb79b01ae106b455e0c2a940"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mpWdiNerfpO1QppcISsUV5DXCM/MfewAb00HCE67/T63Y6bbMXrmDOVyBjUFMns+u16D6l7dWE0o57a2tlKxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:28:22.717239Z","bundle_sha256":"71c47a38accc328a9b3289e4ef993682bc819d720a2f0e02b59149d9c3288d13"}}