{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4LLFA474JKU6QRUHJY4CXBIF2U","short_pith_number":"pith:4LLFA474","schema_version":"1.0","canonical_sha256":"e2d65073fc4aa9e846874e382b8505d5202c77e5e9421d435c9e09b54928c750","source":{"kind":"arxiv","id":"1805.09442","version":1},"attestation_state":"computed","paper":{"title":"Incomplete Nested Dissection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Peng Zhang, Rasmus Kyng, Richard Peng, Robert Schwieterman","submitted_at":"2018-05-23T22:03:00Z","abstract_excerpt":"We present an asymptotically faster algorithm for solving linear systems in well-structured 3-dimensional truss stiffness matrices. These linear systems arise from linear elasticity problems, and can be viewed as extensions of graph Laplacians into higher dimensions. Faster solvers for the 2-D variants of such systems have been studied using generalizations of tools for solving graph Laplacians [Daitch-Spielman CSC'07, Shklarski-Toledo SIMAX'08].\n  Given a 3-dimensional truss over $n$ vertices which is formed from a union of $k$ convex structures (tetrahedral meshes) with bounded aspect ratios"},"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":"1805.09442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-23T22:03:00Z","cross_cats_sorted":[],"title_canon_sha256":"1830a71e5b448680b4dd5f003ef28ed6e2b4626db1df4c40ebd8d156c8c1812e","abstract_canon_sha256":"ff86a8e75280f89c7d80b51898c614bed06777dca73e5d8453078f3f8261c1ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:03.930570Z","signature_b64":"M6ifQZQvqzN6oCZSmAIQInW+wPxiGCKIZwngXuhpP+Zn0vsjs5c+LLpXJNoL6UEydkbTJDNV5e26MtJziBXlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2d65073fc4aa9e846874e382b8505d5202c77e5e9421d435c9e09b54928c750","last_reissued_at":"2026-05-18T00:15:03.929751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:03.929751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incomplete Nested Dissection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Peng Zhang, Rasmus Kyng, Richard Peng, Robert Schwieterman","submitted_at":"2018-05-23T22:03:00Z","abstract_excerpt":"We present an asymptotically faster algorithm for solving linear systems in well-structured 3-dimensional truss stiffness matrices. These linear systems arise from linear elasticity problems, and can be viewed as extensions of graph Laplacians into higher dimensions. Faster solvers for the 2-D variants of such systems have been studied using generalizations of tools for solving graph Laplacians [Daitch-Spielman CSC'07, Shklarski-Toledo SIMAX'08].\n  Given a 3-dimensional truss over $n$ vertices which is formed from a union of $k$ convex structures (tetrahedral meshes) with bounded aspect ratios"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09442","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.09442","created_at":"2026-05-18T00:15:03.929884+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09442v1","created_at":"2026-05-18T00:15:03.929884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09442","created_at":"2026-05-18T00:15:03.929884+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LLFA474JKU6","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LLFA474JKU6QRUH","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LLFA474","created_at":"2026-05-18T12:32:05.422762+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/4LLFA474JKU6QRUHJY4CXBIF2U","json":"https://pith.science/pith/4LLFA474JKU6QRUHJY4CXBIF2U.json","graph_json":"https://pith.science/api/pith-number/4LLFA474JKU6QRUHJY4CXBIF2U/graph.json","events_json":"https://pith.science/api/pith-number/4LLFA474JKU6QRUHJY4CXBIF2U/events.json","paper":"https://pith.science/paper/4LLFA474"},"agent_actions":{"view_html":"https://pith.science/pith/4LLFA474JKU6QRUHJY4CXBIF2U","download_json":"https://pith.science/pith/4LLFA474JKU6QRUHJY4CXBIF2U.json","view_paper":"https://pith.science/paper/4LLFA474","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09442&json=true","fetch_graph":"https://pith.science/api/pith-number/4LLFA474JKU6QRUHJY4CXBIF2U/graph.json","fetch_events":"https://pith.science/api/pith-number/4LLFA474JKU6QRUHJY4CXBIF2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LLFA474JKU6QRUHJY4CXBIF2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LLFA474JKU6QRUHJY4CXBIF2U/action/storage_attestation","attest_author":"https://pith.science/pith/4LLFA474JKU6QRUHJY4CXBIF2U/action/author_attestation","sign_citation":"https://pith.science/pith/4LLFA474JKU6QRUHJY4CXBIF2U/action/citation_signature","submit_replication":"https://pith.science/pith/4LLFA474JKU6QRUHJY4CXBIF2U/action/replication_record"}},"created_at":"2026-05-18T00:15:03.929884+00:00","updated_at":"2026-05-18T00:15:03.929884+00:00"}