{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R527BKYAFLDTFVY3BSJYNLVVIF","short_pith_number":"pith:R527BKYA","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"},"canonical_sha256":"8f75f0ab002ac732d71b0c9386aeb5414de3049e44c43932a9a662c105156b46","source":{"kind":"arxiv","id":"1808.01703","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01703","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01703v1","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01703","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"pith_short_12","alias_value":"R527BKYAFLDT","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R527BKYAFLDTFVY3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R527BKYA","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R527BKYAFLDTFVY3BSJYNLVVIF","target":"record","payload":{"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"},"canonical_sha256":"8f75f0ab002ac732d71b0c9386aeb5414de3049e44c43932a9a662c105156b46","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"},"source_kind":"arxiv","source_id":"1808.01703","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-18T00:08:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/oxCFTYI6WCR6r5by/oeU5i2N8JJmdsrzhDCSxEn8DfOdopZPYE58pf7Du37Jad7H9pAdM+AtRFbeMB2h7EqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:21:21.517226Z"},"content_sha256":"cf3b9cd2d9554a0e88de556c6526c95f272c05866c771222669b9cdd68f14bc5","schema_version":"1.0","event_id":"sha256:cf3b9cd2d9554a0e88de556c6526c95f272c05866c771222669b9cdd68f14bc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R527BKYAFLDTFVY3BSJYNLVVIF","target":"graph","payload":{"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"},"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-18T00:08:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uyPJ2C8TAKPRMOlOexFtnwWbLEGgu8aHTiq18T6/08uETxH2K42ksZ/Ij25w1XNI7WKAApoIBHR5A/Yg77qRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:21:21.517862Z"},"content_sha256":"135233fbed49b8bf96e15d806a2d6416d7042bc37ba977ae0da1a5c08d70b00a","schema_version":"1.0","event_id":"sha256:135233fbed49b8bf96e15d806a2d6416d7042bc37ba977ae0da1a5c08d70b00a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF/bundle.json","state_url":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R527BKYAFLDTFVY3BSJYNLVVIF/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-26T12:21:21Z","links":{"resolver":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF","bundle":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF/bundle.json","state":"https://pith.science/pith/R527BKYAFLDTFVY3BSJYNLVVIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R527BKYAFLDTFVY3BSJYNLVVIF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R527BKYAFLDTFVY3BSJYNLVVIF","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":"d2ef7cf143266bc1894943e90a17ffc5f0b910ccaa9723134df033e2ece95e12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-08-06T01:01:50Z","title_canon_sha256":"4b9f320e65758ba4675604d09f6ba5012ae7546a75f96ee67fd59c7efa53bc0e"},"schema_version":"1.0","source":{"id":"1808.01703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01703","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01703v1","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01703","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"pith_short_12","alias_value":"R527BKYAFLDT","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R527BKYAFLDTFVY3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R527BKYA","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:135233fbed49b8bf96e15d806a2d6416d7042bc37ba977ae0da1a5c08d70b00a","target":"graph","created_at":"2026-05-18T00:08:52Z","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":"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","authors_text":"Anuar Sharafudinov, J.B.Nation, Justin Cabot-Miller, Kira Adaricheva, Oren Segal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-08-06T01:01:50Z","title":"The Bases of Association Rules of High Confidence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01703","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:cf3b9cd2d9554a0e88de556c6526c95f272c05866c771222669b9cdd68f14bc5","target":"record","created_at":"2026-05-18T00:08:52Z","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":"d2ef7cf143266bc1894943e90a17ffc5f0b910ccaa9723134df033e2ece95e12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-08-06T01:01:50Z","title_canon_sha256":"4b9f320e65758ba4675604d09f6ba5012ae7546a75f96ee67fd59c7efa53bc0e"},"schema_version":"1.0","source":{"id":"1808.01703","kind":"arxiv","version":1}},"canonical_sha256":"8f75f0ab002ac732d71b0c9386aeb5414de3049e44c43932a9a662c105156b46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f75f0ab002ac732d71b0c9386aeb5414de3049e44c43932a9a662c105156b46","first_computed_at":"2026-05-18T00:08:52.097865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:52.097865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ez5MDJkEtOGfkMk/e60gGmkoRyT09f4p7hyjqnof0J/cwQjTBa0rr2mjJMa69najylCXD4fSRdDarv0KGCZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:52.098541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.01703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf3b9cd2d9554a0e88de556c6526c95f272c05866c771222669b9cdd68f14bc5","sha256:135233fbed49b8bf96e15d806a2d6416d7042bc37ba977ae0da1a5c08d70b00a"],"state_sha256":"9184fb2a3b57d8367e7fe91534977331d07e0313c3d7427a20a07b50a07439ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KD09xDTGAhk5SjYBA9RwP4fiMwGjbQ7YM83q1kf16CqLGcCf8yAYv4JkEJJGBXj7/ebC1W0HRommQz6MMwcTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:21:21.521557Z","bundle_sha256":"5d869989661f790e2d394acb28df8f19499070c74deeb54d2f96a19baa751621"}}