{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2SATK7322CNJBLQMDBF6O3W4QW","short_pith_number":"pith:2SATK732","canonical_record":{"source":{"id":"2605.23247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T05:31:15Z","cross_cats_sorted":[],"title_canon_sha256":"f57b84e32c6153728e790370f9ee8b725a2ed3c2c60a49cba4c814f87496d257","abstract_canon_sha256":"8b3fc7ef0002eae27d3318930c8031433a887272d7ea468f6c693a159433b8e2"},"schema_version":"1.0"},"canonical_sha256":"d481357f7ad09a90ae0c184be76edc85bb4bce2a9d3ce476b0dc7b608a42d3ee","source":{"kind":"arxiv","id":"2605.23247","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23247","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23247v1","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23247","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"2SATK7322CNJ","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_16","alias_value":"2SATK7322CNJBLQM","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_8","alias_value":"2SATK732","created_at":"2026-05-25T02:01:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2SATK7322CNJBLQMDBF6O3W4QW","target":"record","payload":{"canonical_record":{"source":{"id":"2605.23247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T05:31:15Z","cross_cats_sorted":[],"title_canon_sha256":"f57b84e32c6153728e790370f9ee8b725a2ed3c2c60a49cba4c814f87496d257","abstract_canon_sha256":"8b3fc7ef0002eae27d3318930c8031433a887272d7ea468f6c693a159433b8e2"},"schema_version":"1.0"},"canonical_sha256":"d481357f7ad09a90ae0c184be76edc85bb4bce2a9d3ce476b0dc7b608a42d3ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:45.546974Z","signature_b64":"hP7wh/P64kZMtSzxCYIeDK5VZpGBsatZZp8XLL8PcpdttIORfNuHBz3Tp/wx/y5insRV7HFjm79kEJAKkBHaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d481357f7ad09a90ae0c184be76edc85bb4bce2a9d3ce476b0dc7b608a42d3ee","last_reissued_at":"2026-05-25T02:01:45.546399Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:45.546399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.23247","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-25T02:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5gJ2oOIlStxj31eHudvL8zgPk7iaGAWfsZeZSYgGkWDOBqjb1nAfpju28U+qLfAGZ0s3XnBoCIUO8OPM/GJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:12:37.960152Z"},"content_sha256":"051e59169754f968a7b8486f4be996caf2113dbd51bf204cac4993f6b6b90362","schema_version":"1.0","event_id":"sha256:051e59169754f968a7b8486f4be996caf2113dbd51bf204cac4993f6b6b90362"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2SATK7322CNJBLQMDBF6O3W4QW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Divisible Load Processing Through Machine Learning: A Practical Framework for Large-Scale Workloads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bharadwaj Veeravalli","submitted_at":"2026-05-22T05:31:15Z","abstract_excerpt":"In this paper, we introduce the first machine learning framework for predicting optimal processing times in Single-Level Tree Network (SLTN) architectures for the Divisible Load Theory (DLT) paradigm. Using a feedforward neural network(FNN) with 16 engineered features, we train a model on 100,000 synthetically generated configurations to predict optimal processing times without explicit formulation of DLT equations. The model achieves 97-99% accuracy (R-square factor) with mean absolute percentage error of 1-5%, demonstrating that neural networks can effectively learn complex load distribution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23247","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/2605.23247/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-25T02:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImjnwTJzsPsFyYtx/GH6Fp6u5wpQ0geZn64cj25Z9D+UHPUDFRqZjW+oJde3FXqgN2nR6NB6057TJnmSkkEIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:12:37.960931Z"},"content_sha256":"8da3ec8d447236d062d2bea79929e3afa949434a4639d9e872f0e17302444237","schema_version":"1.0","event_id":"sha256:8da3ec8d447236d062d2bea79929e3afa949434a4639d9e872f0e17302444237"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SATK7322CNJBLQMDBF6O3W4QW/bundle.json","state_url":"https://pith.science/pith/2SATK7322CNJBLQMDBF6O3W4QW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SATK7322CNJBLQMDBF6O3W4QW/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-11T21:12:37Z","links":{"resolver":"https://pith.science/pith/2SATK7322CNJBLQMDBF6O3W4QW","bundle":"https://pith.science/pith/2SATK7322CNJBLQMDBF6O3W4QW/bundle.json","state":"https://pith.science/pith/2SATK7322CNJBLQMDBF6O3W4QW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SATK7322CNJBLQMDBF6O3W4QW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2SATK7322CNJBLQMDBF6O3W4QW","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":"8b3fc7ef0002eae27d3318930c8031433a887272d7ea468f6c693a159433b8e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T05:31:15Z","title_canon_sha256":"f57b84e32c6153728e790370f9ee8b725a2ed3c2c60a49cba4c814f87496d257"},"schema_version":"1.0","source":{"id":"2605.23247","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23247","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23247v1","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23247","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"2SATK7322CNJ","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_16","alias_value":"2SATK7322CNJBLQM","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_8","alias_value":"2SATK732","created_at":"2026-05-25T02:01:45Z"}],"graph_snapshots":[{"event_id":"sha256:8da3ec8d447236d062d2bea79929e3afa949434a4639d9e872f0e17302444237","target":"graph","created_at":"2026-05-25T02:01:45Z","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/2605.23247/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we introduce the first machine learning framework for predicting optimal processing times in Single-Level Tree Network (SLTN) architectures for the Divisible Load Theory (DLT) paradigm. Using a feedforward neural network(FNN) with 16 engineered features, we train a model on 100,000 synthetically generated configurations to predict optimal processing times without explicit formulation of DLT equations. The model achieves 97-99% accuracy (R-square factor) with mean absolute percentage error of 1-5%, demonstrating that neural networks can effectively learn complex load distribution","authors_text":"Bharadwaj Veeravalli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T05:31:15Z","title":"Accelerating Divisible Load Processing Through Machine Learning: A Practical Framework for Large-Scale Workloads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23247","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:051e59169754f968a7b8486f4be996caf2113dbd51bf204cac4993f6b6b90362","target":"record","created_at":"2026-05-25T02:01:45Z","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":"8b3fc7ef0002eae27d3318930c8031433a887272d7ea468f6c693a159433b8e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T05:31:15Z","title_canon_sha256":"f57b84e32c6153728e790370f9ee8b725a2ed3c2c60a49cba4c814f87496d257"},"schema_version":"1.0","source":{"id":"2605.23247","kind":"arxiv","version":1}},"canonical_sha256":"d481357f7ad09a90ae0c184be76edc85bb4bce2a9d3ce476b0dc7b608a42d3ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d481357f7ad09a90ae0c184be76edc85bb4bce2a9d3ce476b0dc7b608a42d3ee","first_computed_at":"2026-05-25T02:01:45.546399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:45.546399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hP7wh/P64kZMtSzxCYIeDK5VZpGBsatZZp8XLL8PcpdttIORfNuHBz3Tp/wx/y5insRV7HFjm79kEJAKkBHaBw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:45.546974Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23247","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:051e59169754f968a7b8486f4be996caf2113dbd51bf204cac4993f6b6b90362","sha256:8da3ec8d447236d062d2bea79929e3afa949434a4639d9e872f0e17302444237"],"state_sha256":"272afb743f6a25a3dd6e9b3faf9e08e6e671dcf4bbf23486bf28f41ffb560a9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9lrSHOBcsa2ac81MBr211USNWOcayRapHYZ6lJX22DkiJhfEHnirtH4cZrNHjLec/wUgZszfNpCD8iJSiwb2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:12:37.965239Z","bundle_sha256":"86208d564d25fd1ec0cac7ca4a52afcb2af8a9dac58eff9e406a51bb49ea9c3d"}}