{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:F6DHSHVUS4JS6JOOLCGTZUHZ2L","short_pith_number":"pith:F6DHSHVU","schema_version":"1.0","canonical_sha256":"2f86791eb497132f25ce588d3cd0f9d2c5b08e534300fcfd06a7600a28831270","source":{"kind":"arxiv","id":"1908.01338","version":1},"attestation_state":"computed","paper":{"title":"A Data Structure Perspective to the RDD-based Apriori Algorithm on Spark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Pankaj Singh, P. K. Mishra, Rakhi Garg, Sudhakar Singh","submitted_at":"2019-08-04T13:13:28Z","abstract_excerpt":"During the recent years, a number of efficient and scalable frequent itemset mining algorithms for big data analytics have been proposed by many researchers. Initially, MapReduce-based frequent itemset mining algorithms on Hadoop cluster were proposed. Although, Hadoop has been developed as a cluster computing system for handling and processing big data, but the performance of Hadoop does not meet the expectation for the iterative algorithms of data mining, due to its high I/O, and writing and then reading intermediate results in the disk. Consequently, Spark has been developed as another clus"},"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":"1908.01338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-04T13:13:28Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"a3dbaff6714e7b1d3199d9b9a4c129207081215ed97231788642fe3a40b5cda5","abstract_canon_sha256":"e36df53d87ff71f77827bba5915d0b0f7a366102100d20f477f5b49911735b5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:29.301856Z","signature_b64":"i0XtIVzkLK9YGNAunu1adc8vj+Zah+t60DeuuegdE4c09FWBQvHjdzZFzEF8XIT1CCLKeud1yO34Dy2p+f23Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f86791eb497132f25ce588d3cd0f9d2c5b08e534300fcfd06a7600a28831270","last_reissued_at":"2026-07-04T23:51:29.301327Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:29.301327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Data Structure Perspective to the RDD-based Apriori Algorithm on Spark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Pankaj Singh, P. K. Mishra, Rakhi Garg, Sudhakar Singh","submitted_at":"2019-08-04T13:13:28Z","abstract_excerpt":"During the recent years, a number of efficient and scalable frequent itemset mining algorithms for big data analytics have been proposed by many researchers. Initially, MapReduce-based frequent itemset mining algorithms on Hadoop cluster were proposed. Although, Hadoop has been developed as a cluster computing system for handling and processing big data, but the performance of Hadoop does not meet the expectation for the iterative algorithms of data mining, due to its high I/O, and writing and then reading intermediate results in the disk. Consequently, Spark has been developed as another clus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01338","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01338/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.01338","created_at":"2026-07-04T23:51:29.301391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01338v1","created_at":"2026-07-04T23:51:29.301391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01338","created_at":"2026-07-04T23:51:29.301391+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6DHSHVUS4JS","created_at":"2026-07-04T23:51:29.301391+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6DHSHVUS4JS6JOO","created_at":"2026-07-04T23:51:29.301391+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6DHSHVU","created_at":"2026-07-04T23:51:29.301391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09209","citing_title":"Quantum Computing and Data Processing for Frequent Itemset Mining","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09209","citing_title":"Quantum Computing and Data Processing for Frequent Itemset Mining","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F6DHSHVUS4JS6JOOLCGTZUHZ2L","json":"https://pith.science/pith/F6DHSHVUS4JS6JOOLCGTZUHZ2L.json","graph_json":"https://pith.science/api/pith-number/F6DHSHVUS4JS6JOOLCGTZUHZ2L/graph.json","events_json":"https://pith.science/api/pith-number/F6DHSHVUS4JS6JOOLCGTZUHZ2L/events.json","paper":"https://pith.science/paper/F6DHSHVU"},"agent_actions":{"view_html":"https://pith.science/pith/F6DHSHVUS4JS6JOOLCGTZUHZ2L","download_json":"https://pith.science/pith/F6DHSHVUS4JS6JOOLCGTZUHZ2L.json","view_paper":"https://pith.science/paper/F6DHSHVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01338&json=true","fetch_graph":"https://pith.science/api/pith-number/F6DHSHVUS4JS6JOOLCGTZUHZ2L/graph.json","fetch_events":"https://pith.science/api/pith-number/F6DHSHVUS4JS6JOOLCGTZUHZ2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6DHSHVUS4JS6JOOLCGTZUHZ2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6DHSHVUS4JS6JOOLCGTZUHZ2L/action/storage_attestation","attest_author":"https://pith.science/pith/F6DHSHVUS4JS6JOOLCGTZUHZ2L/action/author_attestation","sign_citation":"https://pith.science/pith/F6DHSHVUS4JS6JOOLCGTZUHZ2L/action/citation_signature","submit_replication":"https://pith.science/pith/F6DHSHVUS4JS6JOOLCGTZUHZ2L/action/replication_record"}},"created_at":"2026-07-04T23:51:29.301391+00:00","updated_at":"2026-07-04T23:51:29.301391+00:00"}