{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VFY7GMEURC7K5GAHHUV4RU336Q","short_pith_number":"pith:VFY7GMEU","canonical_record":{"source":{"id":"2412.19420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-27T03:13:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f432db969ac524967a438e065199554685eeb22a1fe3ef3d7766f5ffedf88b9e","abstract_canon_sha256":"869c81855459240eae3c6008c28493aefb7cd0d885ce94c24f0162462f61dd34"},"schema_version":"1.0"},"canonical_sha256":"a971f3309488beae98073d2bc8d37bf4379afef037e461dbecdeaf96973cc7b5","source":{"kind":"arxiv","id":"2412.19420","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.19420","created_at":"2026-07-05T09:54:35Z"},{"alias_kind":"arxiv_version","alias_value":"2412.19420v1","created_at":"2026-07-05T09:54:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19420","created_at":"2026-07-05T09:54:35Z"},{"alias_kind":"pith_short_12","alias_value":"VFY7GMEURC7K","created_at":"2026-07-05T09:54:35Z"},{"alias_kind":"pith_short_16","alias_value":"VFY7GMEURC7K5GAH","created_at":"2026-07-05T09:54:35Z"},{"alias_kind":"pith_short_8","alias_value":"VFY7GMEU","created_at":"2026-07-05T09:54:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VFY7GMEURC7K5GAHHUV4RU336Q","target":"record","payload":{"canonical_record":{"source":{"id":"2412.19420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-27T03:13:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f432db969ac524967a438e065199554685eeb22a1fe3ef3d7766f5ffedf88b9e","abstract_canon_sha256":"869c81855459240eae3c6008c28493aefb7cd0d885ce94c24f0162462f61dd34"},"schema_version":"1.0"},"canonical_sha256":"a971f3309488beae98073d2bc8d37bf4379afef037e461dbecdeaf96973cc7b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:35.335602Z","signature_b64":"ldl2+4zQrXrB0AxUwoSNSDYdJlJuPrZ8Yz1HdVxmqKXKB2kSZcIyxjiiysWnsd0nibJVBXvx2UTjPNLT81AwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a971f3309488beae98073d2bc8d37bf4379afef037e461dbecdeaf96973cc7b5","last_reissued_at":"2026-07-05T09:54:35.335139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:35.335139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.19420","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-07-05T09:54:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPHf7AYSRer9OQNyZA1TmmOwmVkz7a7EFy/GkSb8PhAWzUX57uiQqy/MpDnsAiaDEK8oIIR5lrSSS5JDizrgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:41:37.005174Z"},"content_sha256":"461e14c2341ba9fd59bbc8d6dbe96dbc55d6dddc29dc6d0cb563b821a126aca0","schema_version":"1.0","event_id":"sha256:461e14c2341ba9fd59bbc8d6dbe96dbc55d6dddc29dc6d0cb563b821a126aca0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VFY7GMEURC7K5GAHHUV4RU336Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Quanchao Lu, Tingyi Ruan, Xiaoxuan Sun, Xuan Li, Yankaiqi Li","submitted_at":"2024-12-27T03:13:13Z","abstract_excerpt":"This paper proposes a frequent itemset mining algorithm based on the Boolean matrix method, aiming to solve the storage and computational bottlenecks of traditional frequent pattern mining algorithms in high-dimensional and large-scale transaction databases. By representing the itemsets in the transaction database as Boolean matrices, the algorithm uses Boolean logic operations such as AND and OR to efficiently calculate the support of the itemsets, avoiding the generation and storage of a large number of candidates itemsets in traditional algorithms. The algorithm recursively mines frequent i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19420","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/2412.19420/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"},"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-07-05T09:54:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30AD/imnwKeaZD/+Y3yGjEAciSBawhrbiRgKDj8WK0oz3cJ1caDW6KVmrLRSX7CfXPMqN3Jn3RU49iTWCPe2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:41:37.016292Z"},"content_sha256":"9917f48258c4fe94b979f2caecfb5df05d1856a14f3c8070532f41f20ddef641","schema_version":"1.0","event_id":"sha256:9917f48258c4fe94b979f2caecfb5df05d1856a14f3c8070532f41f20ddef641"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFY7GMEURC7K5GAHHUV4RU336Q/bundle.json","state_url":"https://pith.science/pith/VFY7GMEURC7K5GAHHUV4RU336Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFY7GMEURC7K5GAHHUV4RU336Q/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-08-10T01:41:37Z","links":{"resolver":"https://pith.science/pith/VFY7GMEURC7K5GAHHUV4RU336Q","bundle":"https://pith.science/pith/VFY7GMEURC7K5GAHHUV4RU336Q/bundle.json","state":"https://pith.science/pith/VFY7GMEURC7K5GAHHUV4RU336Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFY7GMEURC7K5GAHHUV4RU336Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VFY7GMEURC7K5GAHHUV4RU336Q","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":"869c81855459240eae3c6008c28493aefb7cd0d885ce94c24f0162462f61dd34","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-27T03:13:13Z","title_canon_sha256":"f432db969ac524967a438e065199554685eeb22a1fe3ef3d7766f5ffedf88b9e"},"schema_version":"1.0","source":{"id":"2412.19420","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.19420","created_at":"2026-07-05T09:54:35Z"},{"alias_kind":"arxiv_version","alias_value":"2412.19420v1","created_at":"2026-07-05T09:54:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19420","created_at":"2026-07-05T09:54:35Z"},{"alias_kind":"pith_short_12","alias_value":"VFY7GMEURC7K","created_at":"2026-07-05T09:54:35Z"},{"alias_kind":"pith_short_16","alias_value":"VFY7GMEURC7K5GAH","created_at":"2026-07-05T09:54:35Z"},{"alias_kind":"pith_short_8","alias_value":"VFY7GMEU","created_at":"2026-07-05T09:54:35Z"}],"graph_snapshots":[{"event_id":"sha256:9917f48258c4fe94b979f2caecfb5df05d1856a14f3c8070532f41f20ddef641","target":"graph","created_at":"2026-07-05T09:54:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.19420/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes a frequent itemset mining algorithm based on the Boolean matrix method, aiming to solve the storage and computational bottlenecks of traditional frequent pattern mining algorithms in high-dimensional and large-scale transaction databases. By representing the itemsets in the transaction database as Boolean matrices, the algorithm uses Boolean logic operations such as AND and OR to efficiently calculate the support of the itemsets, avoiding the generation and storage of a large number of candidates itemsets in traditional algorithms. The algorithm recursively mines frequent i","authors_text":"Quanchao Lu, Tingyi Ruan, Xiaoxuan Sun, Xuan Li, Yankaiqi Li","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19420","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:461e14c2341ba9fd59bbc8d6dbe96dbc55d6dddc29dc6d0cb563b821a126aca0","target":"record","created_at":"2026-07-05T09:54:35Z","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":"869c81855459240eae3c6008c28493aefb7cd0d885ce94c24f0162462f61dd34","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-27T03:13:13Z","title_canon_sha256":"f432db969ac524967a438e065199554685eeb22a1fe3ef3d7766f5ffedf88b9e"},"schema_version":"1.0","source":{"id":"2412.19420","kind":"arxiv","version":1}},"canonical_sha256":"a971f3309488beae98073d2bc8d37bf4379afef037e461dbecdeaf96973cc7b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a971f3309488beae98073d2bc8d37bf4379afef037e461dbecdeaf96973cc7b5","first_computed_at":"2026-07-05T09:54:35.335139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:54:35.335139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ldl2+4zQrXrB0AxUwoSNSDYdJlJuPrZ8Yz1HdVxmqKXKB2kSZcIyxjiiysWnsd0nibJVBXvx2UTjPNLT81AwBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:54:35.335602Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.19420","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:461e14c2341ba9fd59bbc8d6dbe96dbc55d6dddc29dc6d0cb563b821a126aca0","sha256:9917f48258c4fe94b979f2caecfb5df05d1856a14f3c8070532f41f20ddef641"],"state_sha256":"f2d0668ab6c9e19f564a1938b379dacf8e92c5c2143a9b4b616f5b9b1ea97df7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ykhPTqKDusD0Q1eeVuzKPMfpj6m9ND15yzTrUaLPagGCN+vpAXSfXIFaX5nwB0b4LIM5HWDDqFcg9qFGLk3dAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T01:41:37.032502Z","bundle_sha256":"6b1d1a0cf0436c75495dce953a3d12fe2faf312b7124b7c6937ee460c3443853"}}