{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FFTQPGDGV3SJR6WLA6QKYMLK3K","short_pith_number":"pith:FFTQPGDG","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"},"canonical_sha256":"2967079866aee498facb07a0ac316adaba759175847c64bde0152fadf1b778ec","source":{"kind":"arxiv","id":"2510.27351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.27351","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"2510.27351v1","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.27351","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"FFTQPGDGV3SJ","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_16","alias_value":"FFTQPGDGV3SJR6WL","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_8","alias_value":"FFTQPGDG","created_at":"2026-05-22T01:03:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FFTQPGDGV3SJR6WLA6QKYMLK3K","target":"record","payload":{"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"},"canonical_sha256":"2967079866aee498facb07a0ac316adaba759175847c64bde0152fadf1b778ec","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"},"source_kind":"arxiv","source_id":"2510.27351","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-05-22T01:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWkFyCkhkYHYZGB1CR6Z6doZyWBazyDQoIifuC6ZoP/rTxDVaE9bfMdH4niCtz9kkHx0J/mT+9bT0WDnmPobCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:18:05.613481Z"},"content_sha256":"d8255005fd1304f504b8b6fedc741703f265d88800bf4cecd2deb31ae5351ba2","schema_version":"1.0","event_id":"sha256:d8255005fd1304f504b8b6fedc741703f265d88800bf4cecd2deb31ae5351ba2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FFTQPGDGV3SJR6WLA6QKYMLK3K","target":"graph","payload":{"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"},"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-05-22T01:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VmcBJ/peU4jLEXZbXZBJbgnZwMPhFsiykDnwy+gqw/bwrm/ra+Mml6aecQsv7vLY/pj+OcZCaUQKBA0WTamtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:18:05.613861Z"},"content_sha256":"fd3adf819c11fa0b4456cfb28c962525f06e0ff452c85a013ab7bb7695f5f7e8","schema_version":"1.0","event_id":"sha256:fd3adf819c11fa0b4456cfb28c962525f06e0ff452c85a013ab7bb7695f5f7e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K/bundle.json","state_url":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K/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-06-03T19:18:05Z","links":{"resolver":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K","bundle":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K/bundle.json","state":"https://pith.science/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFTQPGDGV3SJR6WLA6QKYMLK3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FFTQPGDGV3SJR6WLA6QKYMLK3K","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":"f9b702feaf1ce0dbd025b24eff4c7ed4f1b7f7f013b690aba474fcf487757d83","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-10-31T10:35:03Z","title_canon_sha256":"7277a0030a3d512d76862cafa41fe16b56d8394853af2ab5833e734b4d8fd203"},"schema_version":"1.0","source":{"id":"2510.27351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.27351","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"2510.27351v1","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.27351","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"FFTQPGDGV3SJ","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_16","alias_value":"FFTQPGDGV3SJR6WL","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_8","alias_value":"FFTQPGDG","created_at":"2026-05-22T01:03:49Z"}],"graph_snapshots":[{"event_id":"sha256:fd3adf819c11fa0b4456cfb28c962525f06e0ff452c85a013ab7bb7695f5f7e8","target":"graph","created_at":"2026-05-22T01:03:49Z","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/2510.27351/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Milena Veneva","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-10-31T10:35:03Z","title":"ML-Based Optimum Sub-system Size Heuristic for the GPU Implementation of the Tridiagonal Partition Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.27351","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:d8255005fd1304f504b8b6fedc741703f265d88800bf4cecd2deb31ae5351ba2","target":"record","created_at":"2026-05-22T01:03:49Z","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":"f9b702feaf1ce0dbd025b24eff4c7ed4f1b7f7f013b690aba474fcf487757d83","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-10-31T10:35:03Z","title_canon_sha256":"7277a0030a3d512d76862cafa41fe16b56d8394853af2ab5833e734b4d8fd203"},"schema_version":"1.0","source":{"id":"2510.27351","kind":"arxiv","version":1}},"canonical_sha256":"2967079866aee498facb07a0ac316adaba759175847c64bde0152fadf1b778ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2967079866aee498facb07a0ac316adaba759175847c64bde0152fadf1b778ec","first_computed_at":"2026-05-22T01:03:49.047030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:49.047030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1S8J0E7xA3RXy+mMSjlo3O2TJGoort2gbXHaZTa/wJctkm4Lyljme2+eY5PdjzEyXzoUSvvbFkEqq/JPiVtnCQ==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:49.047938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.27351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8255005fd1304f504b8b6fedc741703f265d88800bf4cecd2deb31ae5351ba2","sha256:fd3adf819c11fa0b4456cfb28c962525f06e0ff452c85a013ab7bb7695f5f7e8"],"state_sha256":"703b5558bc4eb804f61fdb8e94522dd54ada82c33fddfa1a3a780e96a8249b75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nT0pnez11P+SgCYHkpMCWDd70hXrlHQ2+rC3/5Yx/2OZyYmXHTzHBhASQf6Zs56neujum4ZpkAOLuhXmLk/bCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:18:05.615931Z","bundle_sha256":"01e6078fe6f9440fc1a7d2aebb1f50bebdeb917183de62b30690de6d6e76d019"}}