{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SNRYLV2QYZCMYMDQWXRED7SJTE","short_pith_number":"pith:SNRYLV2Q","schema_version":"1.0","canonical_sha256":"936385d750c644cc3070b5e241fe49990889bb382a2c9f4a02fa3bcd57f06684","source":{"kind":"arxiv","id":"1003.1821","version":1},"attestation_state":"computed","paper":{"title":"FP-tree and COFI Based Approach for Mining of Multiple Level Association Rules in Large Databases","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"K. R. Pardasani, Parveen Kumar, Virendra Kumar Shrivastava","submitted_at":"2010-03-09T07:43:36Z","abstract_excerpt":"In recent years, discovery of association rules among itemsets in a large database has been described as an important database-mining problem. The problem of discovering association rules has received considerable research attention and several algorithms for mining frequent itemsets have been developed. Many algorithms have been proposed to discover rules at single concept level. However, mining association rules at multiple concept levels may lead to the discovery of more specific and concrete knowledge from data. The discovery of multiple level association rules is very much useful in many "},"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":"1003.1821","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.OH","submitted_at":"2010-03-09T07:43:36Z","cross_cats_sorted":[],"title_canon_sha256":"86bd9a7ad35ee77e3e164c4d041265fc1b01a7091e8bc78e302292a229bd32a6","abstract_canon_sha256":"a9ab97863a594504a26ac361e179db7ef50abb6a1a5a207b468ead0bc4651c54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.673284Z","signature_b64":"Y+S7X2WaH56CnHocQ+e1BOYmW1iGm3vTtC5aQpZtUR8EVAYM1iGgQx3zZoD/GGHmUGySA+sFJ9GPrfIgp/qoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"936385d750c644cc3070b5e241fe49990889bb382a2c9f4a02fa3bcd57f06684","last_reissued_at":"2026-05-18T00:58:19.672559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.672559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FP-tree and COFI Based Approach for Mining of Multiple Level Association Rules in Large Databases","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"K. R. Pardasani, Parveen Kumar, Virendra Kumar Shrivastava","submitted_at":"2010-03-09T07:43:36Z","abstract_excerpt":"In recent years, discovery of association rules among itemsets in a large database has been described as an important database-mining problem. The problem of discovering association rules has received considerable research attention and several algorithms for mining frequent itemsets have been developed. Many algorithms have been proposed to discover rules at single concept level. However, mining association rules at multiple concept levels may lead to the discovery of more specific and concrete knowledge from data. The discovery of multiple level association rules is very much useful in many "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.1821","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":"1003.1821","created_at":"2026-05-18T00:58:19.672674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.1821v1","created_at":"2026-05-18T00:58:19.672674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1821","created_at":"2026-05-18T00:58:19.672674+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNRYLV2QYZCM","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNRYLV2QYZCMYMDQ","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNRYLV2Q","created_at":"2026-05-18T12:26:13.927090+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/SNRYLV2QYZCMYMDQWXRED7SJTE","json":"https://pith.science/pith/SNRYLV2QYZCMYMDQWXRED7SJTE.json","graph_json":"https://pith.science/api/pith-number/SNRYLV2QYZCMYMDQWXRED7SJTE/graph.json","events_json":"https://pith.science/api/pith-number/SNRYLV2QYZCMYMDQWXRED7SJTE/events.json","paper":"https://pith.science/paper/SNRYLV2Q"},"agent_actions":{"view_html":"https://pith.science/pith/SNRYLV2QYZCMYMDQWXRED7SJTE","download_json":"https://pith.science/pith/SNRYLV2QYZCMYMDQWXRED7SJTE.json","view_paper":"https://pith.science/paper/SNRYLV2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.1821&json=true","fetch_graph":"https://pith.science/api/pith-number/SNRYLV2QYZCMYMDQWXRED7SJTE/graph.json","fetch_events":"https://pith.science/api/pith-number/SNRYLV2QYZCMYMDQWXRED7SJTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNRYLV2QYZCMYMDQWXRED7SJTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNRYLV2QYZCMYMDQWXRED7SJTE/action/storage_attestation","attest_author":"https://pith.science/pith/SNRYLV2QYZCMYMDQWXRED7SJTE/action/author_attestation","sign_citation":"https://pith.science/pith/SNRYLV2QYZCMYMDQWXRED7SJTE/action/citation_signature","submit_replication":"https://pith.science/pith/SNRYLV2QYZCMYMDQWXRED7SJTE/action/replication_record"}},"created_at":"2026-05-18T00:58:19.672674+00:00","updated_at":"2026-05-18T00:58:19.672674+00:00"}