{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2VYZBA67C2YK6TNWESNKZYPNWP","short_pith_number":"pith:2VYZBA67","canonical_record":{"source":{"id":"1707.09668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-30T20:51:26Z","cross_cats_sorted":[],"title_canon_sha256":"1b9cfeab18ca36f35a4f6603d009a25a7e3d911796ac7e95d87865f7a7525dde","abstract_canon_sha256":"021b5c5489ab35621c2aa71b6e5a973074ef5e7b7208fa72b986f9cf09d6bf0a"},"schema_version":"1.0"},"canonical_sha256":"d5719083df16b0af4db6249aace1edb3f3bcbbbf1a65c68cd45f1f036d128e5c","source":{"kind":"arxiv","id":"1707.09668","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09668","created_at":"2026-05-18T00:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09668v1","created_at":"2026-05-18T00:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09668","created_at":"2026-05-18T00:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"2VYZBA67C2YK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2VYZBA67C2YK6TNW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2VYZBA67","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2VYZBA67C2YK6TNWESNKZYPNWP","target":"record","payload":{"canonical_record":{"source":{"id":"1707.09668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-30T20:51:26Z","cross_cats_sorted":[],"title_canon_sha256":"1b9cfeab18ca36f35a4f6603d009a25a7e3d911796ac7e95d87865f7a7525dde","abstract_canon_sha256":"021b5c5489ab35621c2aa71b6e5a973074ef5e7b7208fa72b986f9cf09d6bf0a"},"schema_version":"1.0"},"canonical_sha256":"d5719083df16b0af4db6249aace1edb3f3bcbbbf1a65c68cd45f1f036d128e5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:10.669255Z","signature_b64":"cM+WHiNG21ESxRxuG1tC1aeCNjxCNro6L1gwa7/6dT6iSsjpGlDHea/bobLQ2gtDi1a7gJ00ylRAqV5vqKbCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5719083df16b0af4db6249aace1edb3f3bcbbbf1a65c68cd45f1f036d128e5c","last_reissued_at":"2026-05-18T00:39:10.668731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:10.668731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.09668","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-18T00:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUJ/l5Bu4Ko2+uNBAIAkPD8TJQvrGhLUmCxMmaTEZwSszhmW3X5X2MxbfXJKP5mXITp61LJYWWTAVyq9SsafCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:42:09.928620Z"},"content_sha256":"15b31e13291c76b84f02d62c825495094c52ac01a7bb250b385a2b030d322d68","schema_version":"1.0","event_id":"sha256:15b31e13291c76b84f02d62c825495094c52ac01a7bb250b385a2b030d322d68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2VYZBA67C2YK6TNWESNKZYPNWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Handling Nested Parallelism and Extreme Load Imbalance in an Orbital Analysis Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Benjamin James Gaska, Kat Volk, Mahdi Soltan Mohammadi, Michelle Mills Strout, Neha Jothi","submitted_at":"2017-07-30T20:51:26Z","abstract_excerpt":"Nested parallelism exists in scientific codes that are searching multi-dimensional spaces. However, implementations of nested parallelism often have overhead and load balance issues. The Orbital Analysis code we present exhibits a sparse search space, significant load imbalances, and stopping when the first solution is reached. All these aspects of the algorithm exacerbate the problem of using nested parallelism effectively. In this paper, we present an inspector/executor strategy for chunking such computations into parallel wavefronts. The presented shared memory parallelization is no longer "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09668","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":""},"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-18T00:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5Cn2ejLIPIOdtv7FnX6cjihMEtMqIVfpha7vIDb9i2yYI/B7SDcSLa5dYKv1PNaoX1JdhdQRLtsR6SiDS58Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:42:09.929262Z"},"content_sha256":"ecc3734662e5bc71a7c706ab109c15c640bd1838c928d8365f31bc173f56a7bc","schema_version":"1.0","event_id":"sha256:ecc3734662e5bc71a7c706ab109c15c640bd1838c928d8365f31bc173f56a7bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VYZBA67C2YK6TNWESNKZYPNWP/bundle.json","state_url":"https://pith.science/pith/2VYZBA67C2YK6TNWESNKZYPNWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VYZBA67C2YK6TNWESNKZYPNWP/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-03T18:42:09Z","links":{"resolver":"https://pith.science/pith/2VYZBA67C2YK6TNWESNKZYPNWP","bundle":"https://pith.science/pith/2VYZBA67C2YK6TNWESNKZYPNWP/bundle.json","state":"https://pith.science/pith/2VYZBA67C2YK6TNWESNKZYPNWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VYZBA67C2YK6TNWESNKZYPNWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2VYZBA67C2YK6TNWESNKZYPNWP","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":"021b5c5489ab35621c2aa71b6e5a973074ef5e7b7208fa72b986f9cf09d6bf0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-30T20:51:26Z","title_canon_sha256":"1b9cfeab18ca36f35a4f6603d009a25a7e3d911796ac7e95d87865f7a7525dde"},"schema_version":"1.0","source":{"id":"1707.09668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09668","created_at":"2026-05-18T00:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09668v1","created_at":"2026-05-18T00:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09668","created_at":"2026-05-18T00:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"2VYZBA67C2YK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2VYZBA67C2YK6TNW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2VYZBA67","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:ecc3734662e5bc71a7c706ab109c15c640bd1838c928d8365f31bc173f56a7bc","target":"graph","created_at":"2026-05-18T00:39:10Z","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"},"paper":{"abstract_excerpt":"Nested parallelism exists in scientific codes that are searching multi-dimensional spaces. However, implementations of nested parallelism often have overhead and load balance issues. The Orbital Analysis code we present exhibits a sparse search space, significant load imbalances, and stopping when the first solution is reached. All these aspects of the algorithm exacerbate the problem of using nested parallelism effectively. In this paper, we present an inspector/executor strategy for chunking such computations into parallel wavefronts. The presented shared memory parallelization is no longer ","authors_text":"Benjamin James Gaska, Kat Volk, Mahdi Soltan Mohammadi, Michelle Mills Strout, Neha Jothi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-30T20:51:26Z","title":"Handling Nested Parallelism and Extreme Load Imbalance in an Orbital Analysis Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09668","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:15b31e13291c76b84f02d62c825495094c52ac01a7bb250b385a2b030d322d68","target":"record","created_at":"2026-05-18T00:39:10Z","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":"021b5c5489ab35621c2aa71b6e5a973074ef5e7b7208fa72b986f9cf09d6bf0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-30T20:51:26Z","title_canon_sha256":"1b9cfeab18ca36f35a4f6603d009a25a7e3d911796ac7e95d87865f7a7525dde"},"schema_version":"1.0","source":{"id":"1707.09668","kind":"arxiv","version":1}},"canonical_sha256":"d5719083df16b0af4db6249aace1edb3f3bcbbbf1a65c68cd45f1f036d128e5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5719083df16b0af4db6249aace1edb3f3bcbbbf1a65c68cd45f1f036d128e5c","first_computed_at":"2026-05-18T00:39:10.668731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:10.668731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cM+WHiNG21ESxRxuG1tC1aeCNjxCNro6L1gwa7/6dT6iSsjpGlDHea/bobLQ2gtDi1a7gJ00ylRAqV5vqKbCDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:10.669255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.09668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15b31e13291c76b84f02d62c825495094c52ac01a7bb250b385a2b030d322d68","sha256:ecc3734662e5bc71a7c706ab109c15c640bd1838c928d8365f31bc173f56a7bc"],"state_sha256":"264960b12f047f41400f7be2a8596ac3ea38918929dff7417194e199434c76db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PgdHCBij0bVYH2IkjneEgbvOnZaB/DLJZpHbj/zpsD2Onq4U9W1iH670CyMVW98YOXWN6ueuvRuaUR5UOK6aAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:42:09.932082Z","bundle_sha256":"42e6753459d1f03201f9ff324c16acd8accf27d88fe515499cb01ba494b0d84d"}}