{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R527BKYAFLDTFVY3BSJYNLVVIF","short_pith_number":"pith:R527BKYA","schema_version":"1.0","canonical_sha256":"8f75f0ab002ac732d71b0c9386aeb5414de3049e44c43932a9a662c105156b46","source":{"kind":"arxiv","id":"1808.01703","version":1},"attestation_state":"computed","paper":{"title":"The Bases of Association Rules of High Confidence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Anuar Sharafudinov, J.B.Nation, Justin Cabot-Miller, Kira Adaricheva, Oren Segal","submitted_at":"2018-08-06T01:01:50Z","abstract_excerpt":"We develop a new approach for distributed computing of the association rules of high confidence in a binary table. It is derived from the D-basis algorithm in K. Adaricheva and J.B. Nation (TCS 2017), which is performed on multiple sub-tables of a table given by removing several rows at a time. The set of rules is then aggregated using the same approach as the D-basis is retrieved from a larger set of implications. This allows to obtain a basis of association rules of high confidence, which can be used for ranking all attributes of the table with respect to a given fixed attribute using the re"},"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":"1808.01703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-08-06T01:01:50Z","cross_cats_sorted":[],"title_canon_sha256":"4b9f320e65758ba4675604d09f6ba5012ae7546a75f96ee67fd59c7efa53bc0e","abstract_canon_sha256":"d2ef7cf143266bc1894943e90a17ffc5f0b910ccaa9723134df033e2ece95e12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:52.098541Z","signature_b64":"8ez5MDJkEtOGfkMk/e60gGmkoRyT09f4p7hyjqnof0J/cwQjTBa0rr2mjJMa69najylCXD4fSRdDarv0KGCZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f75f0ab002ac732d71b0c9386aeb5414de3049e44c43932a9a662c105156b46","last_reissued_at":"2026-05-18T00:08:52.097865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:52.097865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Bases of Association Rules of High Confidence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Anuar Sharafudinov, J.B.Nation, Justin Cabot-Miller, Kira Adaricheva, Oren Segal","submitted_at":"2018-08-06T01:01:50Z","abstract_excerpt":"We develop a new approach for distributed computing of the association rules of high confidence in a binary table. It is derived from the D-basis algorithm in K. Adaricheva and J.B. Nation (TCS 2017), which is performed on multiple sub-tables of a table given by removing several rows at a time. The set of rules is then aggregated using the same approach as the D-basis is retrieved from a larger set of implications. This allows to obtain a basis of association rules of high confidence, which can be used for ranking all attributes of the table with respect to a given fixed attribute using the re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01703","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":"1808.01703","created_at":"2026-05-18T00:08:52.097963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.01703v1","created_at":"2026-05-18T00:08:52.097963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01703","created_at":"2026-05-18T00:08:52.097963+00:00"},{"alias_kind":"pith_short_12","alias_value":"R527BKYAFLDT","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R527BKYAFLDTFVY3","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R527BKYA","created_at":"2026-05-18T12:32:50.500415+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/R527BKYAFLDTFVY3BSJYNLVVIF","json":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF.json","graph_json":"https://pith.science/api/pith-number/R527BKYAFLDTFVY3BSJYNLVVIF/graph.json","events_json":"https://pith.science/api/pith-number/R527BKYAFLDTFVY3BSJYNLVVIF/events.json","paper":"https://pith.science/paper/R527BKYA"},"agent_actions":{"view_html":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF","download_json":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF.json","view_paper":"https://pith.science/paper/R527BKYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.01703&json=true","fetch_graph":"https://pith.science/api/pith-number/R527BKYAFLDTFVY3BSJYNLVVIF/graph.json","fetch_events":"https://pith.science/api/pith-number/R527BKYAFLDTFVY3BSJYNLVVIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF/action/storage_attestation","attest_author":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF/action/author_attestation","sign_citation":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF/action/citation_signature","submit_replication":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF/action/replication_record"}},"created_at":"2026-05-18T00:08:52.097963+00:00","updated_at":"2026-05-18T00:08:52.097963+00:00"}