{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FFTQPGDGV3SJR6WLA6QKYMLK3K","short_pith_number":"pith:FFTQPGDG","schema_version":"1.0","canonical_sha256":"2967079866aee498facb07a0ac316adaba759175847c64bde0152fadf1b778ec","source":{"kind":"arxiv","id":"2510.27351","version":1},"attestation_state":"computed","paper":{"title":"ML-Based Optimum Sub-system Size Heuristic for the GPU Implementation of the Tridiagonal Partition Method","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Milena Veneva","submitted_at":"2025-10-31T10:35:03Z","abstract_excerpt":"This paper presents a machine learning (ML)-based heuristic for finding the optimum sub-system size for the CUDA implementation of the parallel partition algorithm. Computational experiments for different system of linear algebraic equation (SLAE) sizes are conducted, and the optimum sub-system size for each of them is found empirically. To estimate a model for the sub-system size, we perform the k-nearest neighbors (kNN) classification method. Statistical analysis of the results is done. By comparing the predicted values with the actual data, the algorithm is deemed to be acceptably good. Nex"},"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":"2510.27351","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-10-31T10:35:03Z","cross_cats_sorted":[],"title_canon_sha256":"7277a0030a3d512d76862cafa41fe16b56d8394853af2ab5833e734b4d8fd203","abstract_canon_sha256":"f9b702feaf1ce0dbd025b24eff4c7ed4f1b7f7f013b690aba474fcf487757d83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:49.047938Z","signature_b64":"1S8J0E7xA3RXy+mMSjlo3O2TJGoort2gbXHaZTa/wJctkm4Lyljme2+eY5PdjzEyXzoUSvvbFkEqq/JPiVtnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2967079866aee498facb07a0ac316adaba759175847c64bde0152fadf1b778ec","last_reissued_at":"2026-05-22T01:03:49.047030Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:49.047030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ML-Based Optimum Sub-system Size Heuristic for the GPU Implementation of the Tridiagonal Partition Method","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Milena Veneva","submitted_at":"2025-10-31T10:35:03Z","abstract_excerpt":"This paper presents a machine learning (ML)-based heuristic for finding the optimum sub-system size for the CUDA implementation of the parallel partition algorithm. Computational experiments for different system of linear algebraic equation (SLAE) sizes are conducted, and the optimum sub-system size for each of them is found empirically. To estimate a model for the sub-system size, we perform the k-nearest neighbors (kNN) classification method. Statistical analysis of the results is done. By comparing the predicted values with the actual data, the algorithm is deemed to be acceptably good. Nex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.27351","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/2510.27351/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":"2510.27351","created_at":"2026-05-22T01:03:49.047143+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.27351v1","created_at":"2026-05-22T01:03:49.047143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.27351","created_at":"2026-05-22T01:03:49.047143+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFTQPGDGV3SJ","created_at":"2026-05-22T01:03:49.047143+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFTQPGDGV3SJR6WL","created_at":"2026-05-22T01:03:49.047143+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFTQPGDG","created_at":"2026-05-22T01:03:49.047143+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/FFTQPGDGV3SJR6WLA6QKYMLK3K","json":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K.json","graph_json":"https://pith.science/api/pith-number/FFTQPGDGV3SJR6WLA6QKYMLK3K/graph.json","events_json":"https://pith.science/api/pith-number/FFTQPGDGV3SJR6WLA6QKYMLK3K/events.json","paper":"https://pith.science/paper/FFTQPGDG"},"agent_actions":{"view_html":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K","download_json":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K.json","view_paper":"https://pith.science/paper/FFTQPGDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.27351&json=true","fetch_graph":"https://pith.science/api/pith-number/FFTQPGDGV3SJR6WLA6QKYMLK3K/graph.json","fetch_events":"https://pith.science/api/pith-number/FFTQPGDGV3SJR6WLA6QKYMLK3K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K/action/storage_attestation","attest_author":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K/action/author_attestation","sign_citation":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K/action/citation_signature","submit_replication":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K/action/replication_record"}},"created_at":"2026-05-22T01:03:49.047143+00:00","updated_at":"2026-05-22T01:03:49.047143+00:00"}