{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:72RFESDUE36B2BROWRHGF24ALR","short_pith_number":"pith:72RFESDU","canonical_record":{"source":{"id":"2412.15593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-20T06:32:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d7f4541005cb015537768be1c56acd48f1872ff041b6687e4e6590b7643c8938","abstract_canon_sha256":"e57db9f33308d4606087e91da9b4d9fd4622dbd572749726d7d19fe18f4b5833"},"schema_version":"1.0"},"canonical_sha256":"fea252487426fc1d062eb44e62eb805c5676cd7af23dd596cacd2600cb6bac24","source":{"kind":"arxiv","id":"2412.15593","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.15593","created_at":"2026-07-05T09:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"2412.15593v1","created_at":"2026-07-05T09:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15593","created_at":"2026-07-05T09:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"72RFESDUE36B","created_at":"2026-07-05T09:52:26Z"},{"alias_kind":"pith_short_16","alias_value":"72RFESDUE36B2BRO","created_at":"2026-07-05T09:52:26Z"},{"alias_kind":"pith_short_8","alias_value":"72RFESDU","created_at":"2026-07-05T09:52:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:72RFESDUE36B2BROWRHGF24ALR","target":"record","payload":{"canonical_record":{"source":{"id":"2412.15593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-20T06:32:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d7f4541005cb015537768be1c56acd48f1872ff041b6687e4e6590b7643c8938","abstract_canon_sha256":"e57db9f33308d4606087e91da9b4d9fd4622dbd572749726d7d19fe18f4b5833"},"schema_version":"1.0"},"canonical_sha256":"fea252487426fc1d062eb44e62eb805c5676cd7af23dd596cacd2600cb6bac24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:26.223327Z","signature_b64":"BctjRY5OyNBHgQ52RKzsBfKs1tytmvkap0qqr8l6EZL8ujxZMcH7iChHGZP3niIS1/aJd0soIkq7US1sx8xqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fea252487426fc1d062eb44e62eb805c5676cd7af23dd596cacd2600cb6bac24","last_reissued_at":"2026-07-05T09:52:26.222915Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:26.222915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.15593","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:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmnLv7Vzi/vakmw4hWBS9kYHQ0QSFhtCLB7N+NSJTTib7K25ptv71vZc6LvDoaEjQrced5DW3FQt8NRAZ0j3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:06:25.916548Z"},"content_sha256":"43c99463078af0f479d20927363fd7d48b6c446cffba5058c3b095ba9385aad3","schema_version":"1.0","event_id":"sha256:43c99463078af0f479d20927363fd7d48b6c446cffba5058c3b095ba9385aad3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:72RFESDUE36B2BROWRHGF24ALR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Machine Learning Techniques for Pattern Recognition in High-Dimensional Data Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Pochun Li","submitted_at":"2024-12-20T06:32:05Z","abstract_excerpt":"This paper proposes a frequent pattern data mining algorithm based on support vector machine (SVM), aiming to solve the performance bottleneck of traditional frequent pattern mining algorithms in high-dimensional and sparse data environments. By converting the frequent pattern mining task into a classification problem, the SVM model is introduced to improve the accuracy and robustness of pattern extraction. In terms of method design, the kernel function is used to map the data to a high-dimensional feature space, so as to construct the optimal classification hyperplane, realize the nonlinear s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15593","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.15593/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:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYQm8JhLh8dRQzqNQxZfUsNh+sD5g7ptwVanE2dDBDYXy/IBOL7kqD+daO7ff7qLbveDx13DAT1rVSydExqECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:06:25.917482Z"},"content_sha256":"ed44e9acaf57063a22a23f9a36e21afbe9849a3731824e828f2e7720864f2eb7","schema_version":"1.0","event_id":"sha256:ed44e9acaf57063a22a23f9a36e21afbe9849a3731824e828f2e7720864f2eb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72RFESDUE36B2BROWRHGF24ALR/bundle.json","state_url":"https://pith.science/pith/72RFESDUE36B2BROWRHGF24ALR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72RFESDUE36B2BROWRHGF24ALR/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-09T23:06:25Z","links":{"resolver":"https://pith.science/pith/72RFESDUE36B2BROWRHGF24ALR","bundle":"https://pith.science/pith/72RFESDUE36B2BROWRHGF24ALR/bundle.json","state":"https://pith.science/pith/72RFESDUE36B2BROWRHGF24ALR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72RFESDUE36B2BROWRHGF24ALR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:72RFESDUE36B2BROWRHGF24ALR","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":"e57db9f33308d4606087e91da9b4d9fd4622dbd572749726d7d19fe18f4b5833","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-20T06:32:05Z","title_canon_sha256":"d7f4541005cb015537768be1c56acd48f1872ff041b6687e4e6590b7643c8938"},"schema_version":"1.0","source":{"id":"2412.15593","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.15593","created_at":"2026-07-05T09:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"2412.15593v1","created_at":"2026-07-05T09:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15593","created_at":"2026-07-05T09:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"72RFESDUE36B","created_at":"2026-07-05T09:52:26Z"},{"alias_kind":"pith_short_16","alias_value":"72RFESDUE36B2BRO","created_at":"2026-07-05T09:52:26Z"},{"alias_kind":"pith_short_8","alias_value":"72RFESDU","created_at":"2026-07-05T09:52:26Z"}],"graph_snapshots":[{"event_id":"sha256:ed44e9acaf57063a22a23f9a36e21afbe9849a3731824e828f2e7720864f2eb7","target":"graph","created_at":"2026-07-05T09:52:26Z","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.15593/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes a frequent pattern data mining algorithm based on support vector machine (SVM), aiming to solve the performance bottleneck of traditional frequent pattern mining algorithms in high-dimensional and sparse data environments. By converting the frequent pattern mining task into a classification problem, the SVM model is introduced to improve the accuracy and robustness of pattern extraction. In terms of method design, the kernel function is used to map the data to a high-dimensional feature space, so as to construct the optimal classification hyperplane, realize the nonlinear s","authors_text":"Pochun Li","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-20T06:32:05Z","title":"Machine Learning Techniques for Pattern Recognition in High-Dimensional Data Mining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15593","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:43c99463078af0f479d20927363fd7d48b6c446cffba5058c3b095ba9385aad3","target":"record","created_at":"2026-07-05T09:52:26Z","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":"e57db9f33308d4606087e91da9b4d9fd4622dbd572749726d7d19fe18f4b5833","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-20T06:32:05Z","title_canon_sha256":"d7f4541005cb015537768be1c56acd48f1872ff041b6687e4e6590b7643c8938"},"schema_version":"1.0","source":{"id":"2412.15593","kind":"arxiv","version":1}},"canonical_sha256":"fea252487426fc1d062eb44e62eb805c5676cd7af23dd596cacd2600cb6bac24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fea252487426fc1d062eb44e62eb805c5676cd7af23dd596cacd2600cb6bac24","first_computed_at":"2026-07-05T09:52:26.222915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:52:26.222915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BctjRY5OyNBHgQ52RKzsBfKs1tytmvkap0qqr8l6EZL8ujxZMcH7iChHGZP3niIS1/aJd0soIkq7US1sx8xqBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:52:26.223327Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.15593","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43c99463078af0f479d20927363fd7d48b6c446cffba5058c3b095ba9385aad3","sha256:ed44e9acaf57063a22a23f9a36e21afbe9849a3731824e828f2e7720864f2eb7"],"state_sha256":"691887828c19a3438e952ad8b5907ba21a63a92d54e05267a18e34b88133e097"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ifUaligNZjPZ7DvSWlc40LwOKJnFTTB1jNemCyR7zKUqrt3xZ6jMrXIV5n7AkZ39tNnRiHodOZxxzP1qIFklAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T23:06:25.924584Z","bundle_sha256":"8686cba8aa213f3e14d1305af78955392abdfae0be7d28aad72a84354810dc19"}}