{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TGQDQE2CGLP24WR4XX7OROHEG6","short_pith_number":"pith:TGQDQE2C","canonical_record":{"source":{"id":"1804.09798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-25T20:58:41Z","cross_cats_sorted":[],"title_canon_sha256":"df29d3ac02ef5d5e355febb2043be6e8eb3f102ea8c98d4ae2b32c253a4ff816","abstract_canon_sha256":"cd997187cfe0c3f8efa8b14da856300ea649771c47be140a47a02a238c0cd405"},"schema_version":"1.0"},"canonical_sha256":"99a038134232dfae5a3cbdfee8b8e437932db0a238a7897d6e25b194de32fc8c","source":{"kind":"arxiv","id":"1804.09798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09798","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09798v1","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09798","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"pith_short_12","alias_value":"TGQDQE2CGLP2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TGQDQE2CGLP24WR4","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TGQDQE2C","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TGQDQE2CGLP24WR4XX7OROHEG6","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-25T20:58:41Z","cross_cats_sorted":[],"title_canon_sha256":"df29d3ac02ef5d5e355febb2043be6e8eb3f102ea8c98d4ae2b32c253a4ff816","abstract_canon_sha256":"cd997187cfe0c3f8efa8b14da856300ea649771c47be140a47a02a238c0cd405"},"schema_version":"1.0"},"canonical_sha256":"99a038134232dfae5a3cbdfee8b8e437932db0a238a7897d6e25b194de32fc8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:27.876875Z","signature_b64":"tEMOHNiSg8ydPSpfmHJq+yRtSDM4L9InDbdBqjqWiqJby6akHOFrJJtUg9y80bZPXKcyckBDZkLdcjz0i7p/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99a038134232dfae5a3cbdfee8b8e437932db0a238a7897d6e25b194de32fc8c","last_reissued_at":"2026-05-18T00:17:27.876166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:27.876166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09798","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:17:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAyVMHkQ8+1TaRLPhgon+7Gnqkmj6G0xXTJLWT2yGkbJ/p2HyjD5TdMS7tUxE3XK3OAlks8r9KWknFyirSX6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:00:04.611251Z"},"content_sha256":"ad8f63dedf9c920ea7e74ad4e475a0b5f399040124cc2b046c00d802878c551d","schema_version":"1.0","event_id":"sha256:ad8f63dedf9c920ea7e74ad4e475a0b5f399040124cc2b046c00d802878c551d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TGQDQE2CGLP24WR4XX7OROHEG6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric Partitioning and Ordering Strategies for Task Mapping on Parallel Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Karen D. Devine, Kevin Pedretti, Mark A. Taylor, Mehmet Deveci, Sivasankaran Rajamanickam, Umit V.Catalyurek","submitted_at":"2018-04-25T20:58:41Z","abstract_excerpt":"We present a new method for mapping applications' MPI tasks to cores of a parallel computer such that applications' communication time is reduced. We address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network, although our methods generalize to contiguous allocations as well. The goal is to assign tasks to cores so that interdependent tasks are performed by \"nearby\" cores, thus lowering the distance messages must travel, the amount of congestion in the network, and the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09798","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:17:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxS2veBvqLipoe2IiFYbsATQ5jPcdvedlov0Cosg9liIL3LeFsruAKmrNbbXBDfkVqNu+SYAlvD08g57XfL7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:00:04.611620Z"},"content_sha256":"4f6e78d4241d1ba462df919282eff848f97dfc57dc72eb4b1cd2700c2efc3bc3","schema_version":"1.0","event_id":"sha256:4f6e78d4241d1ba462df919282eff848f97dfc57dc72eb4b1cd2700c2efc3bc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGQDQE2CGLP24WR4XX7OROHEG6/bundle.json","state_url":"https://pith.science/pith/TGQDQE2CGLP24WR4XX7OROHEG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGQDQE2CGLP24WR4XX7OROHEG6/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-03T09:00:04Z","links":{"resolver":"https://pith.science/pith/TGQDQE2CGLP24WR4XX7OROHEG6","bundle":"https://pith.science/pith/TGQDQE2CGLP24WR4XX7OROHEG6/bundle.json","state":"https://pith.science/pith/TGQDQE2CGLP24WR4XX7OROHEG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGQDQE2CGLP24WR4XX7OROHEG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TGQDQE2CGLP24WR4XX7OROHEG6","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":"cd997187cfe0c3f8efa8b14da856300ea649771c47be140a47a02a238c0cd405","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-25T20:58:41Z","title_canon_sha256":"df29d3ac02ef5d5e355febb2043be6e8eb3f102ea8c98d4ae2b32c253a4ff816"},"schema_version":"1.0","source":{"id":"1804.09798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09798","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09798v1","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09798","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"pith_short_12","alias_value":"TGQDQE2CGLP2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TGQDQE2CGLP24WR4","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TGQDQE2C","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:4f6e78d4241d1ba462df919282eff848f97dfc57dc72eb4b1cd2700c2efc3bc3","target":"graph","created_at":"2026-05-18T00:17:27Z","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":"We present a new method for mapping applications' MPI tasks to cores of a parallel computer such that applications' communication time is reduced. We address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network, although our methods generalize to contiguous allocations as well. The goal is to assign tasks to cores so that interdependent tasks are performed by \"nearby\" cores, thus lowering the distance messages must travel, the amount of congestion in the network, and the o","authors_text":"Karen D. Devine, Kevin Pedretti, Mark A. Taylor, Mehmet Deveci, Sivasankaran Rajamanickam, Umit V.Catalyurek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-25T20:58:41Z","title":"Geometric Partitioning and Ordering Strategies for Task Mapping on Parallel Computers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09798","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:ad8f63dedf9c920ea7e74ad4e475a0b5f399040124cc2b046c00d802878c551d","target":"record","created_at":"2026-05-18T00:17:27Z","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":"cd997187cfe0c3f8efa8b14da856300ea649771c47be140a47a02a238c0cd405","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-25T20:58:41Z","title_canon_sha256":"df29d3ac02ef5d5e355febb2043be6e8eb3f102ea8c98d4ae2b32c253a4ff816"},"schema_version":"1.0","source":{"id":"1804.09798","kind":"arxiv","version":1}},"canonical_sha256":"99a038134232dfae5a3cbdfee8b8e437932db0a238a7897d6e25b194de32fc8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99a038134232dfae5a3cbdfee8b8e437932db0a238a7897d6e25b194de32fc8c","first_computed_at":"2026-05-18T00:17:27.876166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:27.876166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tEMOHNiSg8ydPSpfmHJq+yRtSDM4L9InDbdBqjqWiqJby6akHOFrJJtUg9y80bZPXKcyckBDZkLdcjz0i7p/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:27.876875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad8f63dedf9c920ea7e74ad4e475a0b5f399040124cc2b046c00d802878c551d","sha256:4f6e78d4241d1ba462df919282eff848f97dfc57dc72eb4b1cd2700c2efc3bc3"],"state_sha256":"471d65a7850bbaa4add24779df6fa394d154c07efa07f9a7366f745fe820d789"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SzfaFEo0wkUUIbovezDgqDQn4JVmbH4r+Yid4wP3Cq8fakgRswjwEuY+GR2HABSlFDHMWIZGZsy63ESYwey4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:00:04.613522Z","bundle_sha256":"efac5b7edc919dea83b72c91cb6861b54fd1e09fcf68195444413e2d48894121"}}