{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PF5FS6OMXWUKF4L2YQKPIPZFJT","short_pith_number":"pith:PF5FS6OM","schema_version":"1.0","canonical_sha256":"797a5979ccbda8a2f17ac414f43f254cfeba8808c4696421b5e1c2739ddcef7a","source":{"kind":"arxiv","id":"1605.01118","version":2},"attestation_state":"computed","paper":{"title":"Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anders M.N. Niklasson, Christian F.A. Negre, Georg Hahn, Hristo N. Djidjev, Susan M. Mniszewski, Vivek B. Sardeshmukh","submitted_at":"2016-05-04T00:10:37Z","abstract_excerpt":"We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced algorithms have been published in the literature for such simulations that are based on evaluations of matrix polynomials. We aim at efficiently parallelizing these computations by using a special type of graph partitioning. For this, we represent the zero-nonzero structure of a thresholded matrix as a graph and partition that graph into several components."},"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":"1605.01118","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-04T00:10:37Z","cross_cats_sorted":[],"title_canon_sha256":"2f5c5bdd569500572783d055c9ffa775fc05c327c7b2bd73e8e93f1b6a17fb92","abstract_canon_sha256":"8e041fb5e18b881d08a22b5f2440f890a085cc0d4ccf38dc3b340070977a9342"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:45.344048Z","signature_b64":"TOuUdUlYOg9qPcH/uvnmUCFa7RIH/KI5FZdgDp6HFOSAsqWwfOxF0TaRy1w6Y+oAVDKTaLTyPDXEo7ZoOYFuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"797a5979ccbda8a2f17ac414f43f254cfeba8808c4696421b5e1c2739ddcef7a","last_reissued_at":"2026-05-18T00:24:45.343483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:45.343483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anders M.N. Niklasson, Christian F.A. Negre, Georg Hahn, Hristo N. Djidjev, Susan M. Mniszewski, Vivek B. Sardeshmukh","submitted_at":"2016-05-04T00:10:37Z","abstract_excerpt":"We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced algorithms have been published in the literature for such simulations that are based on evaluations of matrix polynomials. We aim at efficiently parallelizing these computations by using a special type of graph partitioning. For this, we represent the zero-nonzero structure of a thresholded matrix as a graph and partition that graph into several components."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01118","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":"1605.01118","created_at":"2026-05-18T00:24:45.343561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01118v2","created_at":"2026-05-18T00:24:45.343561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01118","created_at":"2026-05-18T00:24:45.343561+00:00"},{"alias_kind":"pith_short_12","alias_value":"PF5FS6OMXWUK","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PF5FS6OMXWUKF4L2","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PF5FS6OM","created_at":"2026-05-18T12:30:39.010887+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/PF5FS6OMXWUKF4L2YQKPIPZFJT","json":"https://pith.science/pith/PF5FS6OMXWUKF4L2YQKPIPZFJT.json","graph_json":"https://pith.science/api/pith-number/PF5FS6OMXWUKF4L2YQKPIPZFJT/graph.json","events_json":"https://pith.science/api/pith-number/PF5FS6OMXWUKF4L2YQKPIPZFJT/events.json","paper":"https://pith.science/paper/PF5FS6OM"},"agent_actions":{"view_html":"https://pith.science/pith/PF5FS6OMXWUKF4L2YQKPIPZFJT","download_json":"https://pith.science/pith/PF5FS6OMXWUKF4L2YQKPIPZFJT.json","view_paper":"https://pith.science/paper/PF5FS6OM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01118&json=true","fetch_graph":"https://pith.science/api/pith-number/PF5FS6OMXWUKF4L2YQKPIPZFJT/graph.json","fetch_events":"https://pith.science/api/pith-number/PF5FS6OMXWUKF4L2YQKPIPZFJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PF5FS6OMXWUKF4L2YQKPIPZFJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PF5FS6OMXWUKF4L2YQKPIPZFJT/action/storage_attestation","attest_author":"https://pith.science/pith/PF5FS6OMXWUKF4L2YQKPIPZFJT/action/author_attestation","sign_citation":"https://pith.science/pith/PF5FS6OMXWUKF4L2YQKPIPZFJT/action/citation_signature","submit_replication":"https://pith.science/pith/PF5FS6OMXWUKF4L2YQKPIPZFJT/action/replication_record"}},"created_at":"2026-05-18T00:24:45.343561+00:00","updated_at":"2026-05-18T00:24:45.343561+00:00"}