{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YYT6YC5R2UYIWPGNB7SCA2RXBJ","short_pith_number":"pith:YYT6YC5R","schema_version":"1.0","canonical_sha256":"c627ec0bb1d5308b3ccd0fe4206a370a5ad4c6cc78c95fedecad3783fa6b33df","source":{"kind":"arxiv","id":"1809.02666","version":2},"attestation_state":"computed","paper":{"title":"A general-purpose hierarchical mesh partitioning method with node balancing strategies for large-scale numerical simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.MS","authors_text":"Andrew E. Slaughter, Cody J. Permann, Derek R. Gaston, Fande Kong, John W. Peterson, Richard C. Martineau, Roy H. Stogner","submitted_at":"2018-09-07T20:40:26Z","abstract_excerpt":"Large-scale parallel numerical simulations are essential for a wide range of engineering problems that involve complex, coupled physical processes interacting across a broad range of spatial and temporal scales. The data structures involved in such simulations (meshes, sparse matrices, etc.) are frequently represented as graphs, and these graphs must be optimally partitioned across the available computational resources in order for the underlying calculations to scale efficiently. Partitions which minimize the number of graph edges that are cut (edge-cuts) while simultaneously maintaining a ba"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1809.02666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-09-07T20:40:26Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0f5c05b185b3cb792511aa28a8515021a3225569be3cc5dbe08c4c8b1a702bae","abstract_canon_sha256":"a724346ea4cc7a879c411038b04b5b2d0232b24ff24a08724f5f781f0a561945"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:41.028064Z","signature_b64":"GNIMyEoi++/hDTRXn3m0UCjSkW0LO/v2+GLGnGjwwtpoz8Jy6KNuHOkDW7Mbv1D9ruXRVoLPDuQNtDmqbjU2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c627ec0bb1d5308b3ccd0fe4206a370a5ad4c6cc78c95fedecad3783fa6b33df","last_reissued_at":"2026-05-18T00:03:41.027401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:41.027401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A general-purpose hierarchical mesh partitioning method with node balancing strategies for large-scale numerical simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.MS","authors_text":"Andrew E. Slaughter, Cody J. Permann, Derek R. Gaston, Fande Kong, John W. Peterson, Richard C. Martineau, Roy H. Stogner","submitted_at":"2018-09-07T20:40:26Z","abstract_excerpt":"Large-scale parallel numerical simulations are essential for a wide range of engineering problems that involve complex, coupled physical processes interacting across a broad range of spatial and temporal scales. The data structures involved in such simulations (meshes, sparse matrices, etc.) are frequently represented as graphs, and these graphs must be optimally partitioned across the available computational resources in order for the underlying calculations to scale efficiently. Partitions which minimize the number of graph edges that are cut (edge-cuts) while simultaneously maintaining a ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02666","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.02666","created_at":"2026-05-18T00:03:41.027507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02666v2","created_at":"2026-05-18T00:03:41.027507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02666","created_at":"2026-05-18T00:03:41.027507+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYT6YC5R2UYI","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYT6YC5R2UYIWPGN","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYT6YC5R","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YYT6YC5R2UYIWPGNB7SCA2RXBJ","json":"https://pith.science/pith/YYT6YC5R2UYIWPGNB7SCA2RXBJ.json","graph_json":"https://pith.science/api/pith-number/YYT6YC5R2UYIWPGNB7SCA2RXBJ/graph.json","events_json":"https://pith.science/api/pith-number/YYT6YC5R2UYIWPGNB7SCA2RXBJ/events.json","paper":"https://pith.science/paper/YYT6YC5R"},"agent_actions":{"view_html":"https://pith.science/pith/YYT6YC5R2UYIWPGNB7SCA2RXBJ","download_json":"https://pith.science/pith/YYT6YC5R2UYIWPGNB7SCA2RXBJ.json","view_paper":"https://pith.science/paper/YYT6YC5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02666&json=true","fetch_graph":"https://pith.science/api/pith-number/YYT6YC5R2UYIWPGNB7SCA2RXBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/YYT6YC5R2UYIWPGNB7SCA2RXBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYT6YC5R2UYIWPGNB7SCA2RXBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYT6YC5R2UYIWPGNB7SCA2RXBJ/action/storage_attestation","attest_author":"https://pith.science/pith/YYT6YC5R2UYIWPGNB7SCA2RXBJ/action/author_attestation","sign_citation":"https://pith.science/pith/YYT6YC5R2UYIWPGNB7SCA2RXBJ/action/citation_signature","submit_replication":"https://pith.science/pith/YYT6YC5R2UYIWPGNB7SCA2RXBJ/action/replication_record"}},"created_at":"2026-05-18T00:03:41.027507+00:00","updated_at":"2026-05-18T00:03:41.027507+00:00"}