{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:43N7W3HXHLUKATEF6KLRK2WSPK","short_pith_number":"pith:43N7W3HX","canonical_record":{"source":{"id":"2605.12734","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-12T20:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"28c7794ecab77e26baba15e7d3fd083118fb5d24346e2a8c08e389c1cc3ed9f5","abstract_canon_sha256":"c35f691e42dd01c8887def4233b2dbca0efda75a73b7d47ddf3598f81c581885"},"schema_version":"1.0"},"canonical_sha256":"e6dbfb6cf73ae8a04c85f297156ad27aa8e222b1f5978fd7b430df0b7a350cc3","source":{"kind":"arxiv","id":"2605.12734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12734","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12734v1","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12734","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"43N7W3HXHLUK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"43N7W3HXHLUKATEF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"43N7W3HX","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:43N7W3HXHLUKATEF6KLRK2WSPK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12734","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-12T20:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"28c7794ecab77e26baba15e7d3fd083118fb5d24346e2a8c08e389c1cc3ed9f5","abstract_canon_sha256":"c35f691e42dd01c8887def4233b2dbca0efda75a73b7d47ddf3598f81c581885"},"schema_version":"1.0"},"canonical_sha256":"e6dbfb6cf73ae8a04c85f297156ad27aa8e222b1f5978fd7b430df0b7a350cc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:49.203687Z","signature_b64":"26Ure9f5LsSQzM4gfJpe3DsgwcaqLDbZuFlJTiunhw1/2n1NfGJY8o0m+31beBPtiBdKj0Vxbflau9Kje/K8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6dbfb6cf73ae8a04c85f297156ad27aa8e222b1f5978fd7b430df0b7a350cc3","last_reissued_at":"2026-05-18T03:09:49.202829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:49.202829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12734","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-18T03:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2bL3H6d9cOi1NrssSmbKQ7HZH2HJNV2c5y7hu7lP4WWf13jaeJ8Yp0hkJkB+VQ8+X/d8kipidJwHbJvOk/1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:32:37.774686Z"},"content_sha256":"90b0c8a3a1e94adb2183bfae5730a536e4f3ed32f3d953bf23b28affc2d91b63","schema_version":"1.0","event_id":"sha256:90b0c8a3a1e94adb2183bfae5730a536e4f3ed32f3d953bf23b28affc2d91b63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:43N7W3HXHLUKATEF6KLRK2WSPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Portable Support for Overdecomposition on Distributed Memory GPGPU Platforms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Techniques enable efficient overdecomposition on mixed-vendor GPGPU clusters and networks.","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aditya Bhosale, Anant Jain, Laxmikant Kale, Peddoju Sateesh Kumar, Ritvik Rao, Shourya Goel","submitted_at":"2026-05-12T20:37:44Z","abstract_excerpt":"Overdecomposition has emerged as a powerful and sometimes essential technique in parallel programming. Many application domains or frameworks, including those based on adaptive mesh refinements, or tree codes use it. Charm++ is a parallel programming system which has demonstrated the utility of overdecomposition for many applications and in multiple contexts. However, the emergence of GPGPUs as a dominant compute component has created some real and perceived challenges for this paradigm, especially regarding the higher overhead brought about by overpartitioning -- having multiple objects assig"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We address this issue as well as the issue of portability by developing techniques and software that demonstrate that overdecomposition can be efficiently and productively supported on combinations of GPU vendor types, and interconnection networks.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The higher overhead brought about by overpartitioning on GPGPUs can be mitigated by the developed techniques without losing the utility of overdecomposition.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Charm++ techniques enable efficient overdecomposition on multi-vendor GPGPU distributed systems.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Techniques enable efficient overdecomposition on mixed-vendor GPGPU clusters and networks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9be2124b78b38e3be9ad5c5181e3b72689785fabb69f6c3d4c71b4d607ed148c"},"source":{"id":"2605.12734","kind":"arxiv","version":1},"verdict":{"id":"167b22e4-b301-4d69-b874-5a6fb54ee19d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:45:03.156339Z","strongest_claim":"We address this issue as well as the issue of portability by developing techniques and software that demonstrate that overdecomposition can be efficiently and productively supported on combinations of GPU vendor types, and interconnection networks.","one_line_summary":"Charm++ techniques enable efficient overdecomposition on multi-vendor GPGPU distributed systems.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The higher overhead brought about by overpartitioning on GPGPUs can be mitigated by the developed techniques without losing the utility of overdecomposition.","pith_extraction_headline":"Techniques enable efficient overdecomposition on mixed-vendor GPGPU clusters and networks."},"references":{"count":300,"sample":[{"doi":"10.1145/3712285.3759881","year":2025,"title":"Fine-grained automated failure management for extreme-scale gpu accelerated systems","work_id":"aaa2b7ae-d79c-4c86-9916-d45468ec034c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"and Kale, Laxmikant V","work_id":"3d028e6b-6f33-4566-9b44-3729ce2966a6","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.jpdc.2014.07.003","year":2014,"title":"Kokkos: Enabling manycore performance portability through polymorphic memory access patterns","work_id":"5222d6c2-1d39-412d-8fe8-15946f66710a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.21105/joss.02352","year":2020,"title":"and Lelbach, Bryce Adelstein and Amini, Parsa and Berge, Agustín and Biddiscombe, John and Brandt, Steven R","work_id":"c2244f02-69b9-45b6-9af4-c1ad94cc7388","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis , articleno =","work_id":"ca8b654b-8019-464e-a6c7-0c317750853e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":300,"snapshot_sha256":"1e0534e9574600c30051b3c2a392c804871cadd3d46c43e8c9b63c2d35010f5f","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":"167b22e4-b301-4d69-b874-5a6fb54ee19d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qit/aY0Xz+kssqP10ho13NOiFRoX8Yxs2G+lxM6YoyBxSTt6Fic+nIq6y9Oksg8GGTpASG5c0sUUHxB0ANUPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:32:37.775456Z"},"content_sha256":"70a8366588675db792a81b08652dcbc4a22b2378b5e17b594cc3d6ebdadc385e","schema_version":"1.0","event_id":"sha256:70a8366588675db792a81b08652dcbc4a22b2378b5e17b594cc3d6ebdadc385e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43N7W3HXHLUKATEF6KLRK2WSPK/bundle.json","state_url":"https://pith.science/pith/43N7W3HXHLUKATEF6KLRK2WSPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43N7W3HXHLUKATEF6KLRK2WSPK/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-05-22T17:32:37Z","links":{"resolver":"https://pith.science/pith/43N7W3HXHLUKATEF6KLRK2WSPK","bundle":"https://pith.science/pith/43N7W3HXHLUKATEF6KLRK2WSPK/bundle.json","state":"https://pith.science/pith/43N7W3HXHLUKATEF6KLRK2WSPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43N7W3HXHLUKATEF6KLRK2WSPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:43N7W3HXHLUKATEF6KLRK2WSPK","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":"c35f691e42dd01c8887def4233b2dbca0efda75a73b7d47ddf3598f81c581885","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-12T20:37:44Z","title_canon_sha256":"28c7794ecab77e26baba15e7d3fd083118fb5d24346e2a8c08e389c1cc3ed9f5"},"schema_version":"1.0","source":{"id":"2605.12734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12734","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12734v1","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12734","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"43N7W3HXHLUK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"43N7W3HXHLUKATEF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"43N7W3HX","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:70a8366588675db792a81b08652dcbc4a22b2378b5e17b594cc3d6ebdadc385e","target":"graph","created_at":"2026-05-18T03:09: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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We address this issue as well as the issue of portability by developing techniques and software that demonstrate that overdecomposition can be efficiently and productively supported on combinations of GPU vendor types, and interconnection networks."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The higher overhead brought about by overpartitioning on GPGPUs can be mitigated by the developed techniques without losing the utility of overdecomposition."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Charm++ techniques enable efficient overdecomposition on multi-vendor GPGPU distributed systems."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Techniques enable efficient overdecomposition on mixed-vendor GPGPU clusters and networks."}],"snapshot_sha256":"9be2124b78b38e3be9ad5c5181e3b72689785fabb69f6c3d4c71b4d607ed148c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Overdecomposition has emerged as a powerful and sometimes essential technique in parallel programming. Many application domains or frameworks, including those based on adaptive mesh refinements, or tree codes use it. Charm++ is a parallel programming system which has demonstrated the utility of overdecomposition for many applications and in multiple contexts. However, the emergence of GPGPUs as a dominant compute component has created some real and perceived challenges for this paradigm, especially regarding the higher overhead brought about by overpartitioning -- having multiple objects assig","authors_text":"Aditya Bhosale, Anant Jain, Laxmikant Kale, Peddoju Sateesh Kumar, Ritvik Rao, Shourya Goel","cross_cats":[],"headline":"Techniques enable efficient overdecomposition on mixed-vendor GPGPU clusters and networks.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-12T20:37:44Z","title":"Efficient and Portable Support for Overdecomposition on Distributed Memory GPGPU Platforms"},"references":{"count":300,"internal_anchors":0,"resolved_work":300,"sample":[{"cited_arxiv_id":"","doi":"10.1145/3712285.3759881","is_internal_anchor":false,"ref_index":1,"title":"Fine-grained automated failure management for extreme-scale gpu accelerated systems","work_id":"aaa2b7ae-d79c-4c86-9916-d45468ec034c","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"and Kale, Laxmikant V","work_id":"3d028e6b-6f33-4566-9b44-3729ce2966a6","year":null},{"cited_arxiv_id":"","doi":"10.1016/j.jpdc.2014.07.003","is_internal_anchor":false,"ref_index":3,"title":"Kokkos: Enabling manycore performance portability through polymorphic memory access patterns","work_id":"5222d6c2-1d39-412d-8fe8-15946f66710a","year":2014},{"cited_arxiv_id":"","doi":"10.21105/joss.02352","is_internal_anchor":false,"ref_index":4,"title":"and Lelbach, Bryce Adelstein and Amini, Parsa and Berge, Agustín and Biddiscombe, John and Brandt, Steven R","work_id":"c2244f02-69b9-45b6-9af4-c1ad94cc7388","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis , articleno =","work_id":"ca8b654b-8019-464e-a6c7-0c317750853e","year":2012}],"snapshot_sha256":"1e0534e9574600c30051b3c2a392c804871cadd3d46c43e8c9b63c2d35010f5f"},"source":{"id":"2605.12734","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:45:03.156339Z","id":"167b22e4-b301-4d69-b874-5a6fb54ee19d","model_set":{"reader":"grok-4.3"},"one_line_summary":"Charm++ techniques enable efficient overdecomposition on multi-vendor GPGPU distributed systems.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Techniques enable efficient overdecomposition on mixed-vendor GPGPU clusters and networks.","strongest_claim":"We address this issue as well as the issue of portability by developing techniques and software that demonstrate that overdecomposition can be efficiently and productively supported on combinations of GPU vendor types, and interconnection networks.","weakest_assumption":"The higher overhead brought about by overpartitioning on GPGPUs can be mitigated by the developed techniques without losing the utility of overdecomposition."}},"verdict_id":"167b22e4-b301-4d69-b874-5a6fb54ee19d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:90b0c8a3a1e94adb2183bfae5730a536e4f3ed32f3d953bf23b28affc2d91b63","target":"record","created_at":"2026-05-18T03:09: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":"c35f691e42dd01c8887def4233b2dbca0efda75a73b7d47ddf3598f81c581885","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-12T20:37:44Z","title_canon_sha256":"28c7794ecab77e26baba15e7d3fd083118fb5d24346e2a8c08e389c1cc3ed9f5"},"schema_version":"1.0","source":{"id":"2605.12734","kind":"arxiv","version":1}},"canonical_sha256":"e6dbfb6cf73ae8a04c85f297156ad27aa8e222b1f5978fd7b430df0b7a350cc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6dbfb6cf73ae8a04c85f297156ad27aa8e222b1f5978fd7b430df0b7a350cc3","first_computed_at":"2026-05-18T03:09:49.202829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:49.202829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"26Ure9f5LsSQzM4gfJpe3DsgwcaqLDbZuFlJTiunhw1/2n1NfGJY8o0m+31beBPtiBdKj0Vxbflau9Kje/K8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:49.203687Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90b0c8a3a1e94adb2183bfae5730a536e4f3ed32f3d953bf23b28affc2d91b63","sha256:70a8366588675db792a81b08652dcbc4a22b2378b5e17b594cc3d6ebdadc385e"],"state_sha256":"61a6f7e2ef1f97ff47c7eda483a16df545903f786dcf118a6131e13daab28ec7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3blqXiWmMgWXs3obM7DhrkEcsUWDbwgR+UYrZJ2kWFqWp4WTC6/fjCSPG9AeKWp73iHQfwB+mrmzUlu7voswDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T17:32:37.778930Z","bundle_sha256":"9eae803fa547fa073f8e23e672d61148d46225315d76f3de770477a5e3225d0f"}}