{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:K53FMQ27ABJ6T6MC2DSAJOPPEX","short_pith_number":"pith:K53FMQ27","schema_version":"1.0","canonical_sha256":"577656435f0053e9f982d0e404b9ef25f49180b8ab9cb59047b531c166dac44f","source":{"kind":"arxiv","id":"1103.4778","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.4778","created_at":"2026-05-18T04:26:00.867235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.4778v1","created_at":"2026-05-18T04:26:00.867235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4778","created_at":"2026-05-18T04:26:00.867235+00:00"},{"alias_kind":"pith_short_12","alias_value":"K53FMQ27ABJ6","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"K53FMQ27ABJ6T6MC","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"K53FMQ27","created_at":"2026-05-18T12:26:32.869790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX","json":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX.json","graph_json":"https://pith.science/api/pith-number/K53FMQ27ABJ6T6MC2DSAJOPPEX/graph.json","events_json":"https://pith.science/api/pith-number/K53FMQ27ABJ6T6MC2DSAJOPPEX/events.json","paper":"https://pith.science/paper/K53FMQ27"},"agent_actions":{"view_html":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX","download_json":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX.json","view_paper":"https://pith.science/paper/K53FMQ27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.4778&json=true","fetch_graph":"https://pith.science/api/pith-number/K53FMQ27ABJ6T6MC2DSAJOPPEX/graph.json","fetch_events":"https://pith.science/api/pith-number/K53FMQ27ABJ6T6MC2DSAJOPPEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX/action/storage_attestation","attest_author":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX/action/author_attestation","sign_citation":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX/action/citation_signature","submit_replication":"https://pith.science/pith/K53FMQ27ABJ6T6MC2DSAJOPPEX/action/replication_record"}},"created_at":"2026-05-18T04:26:00.867235+00:00","updated_at":"2026-05-18T04:26:00.867235+00:00"}