{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3WQBANNSHJYPEZI5LDXM37F7R2","short_pith_number":"pith:3WQBANNS","schema_version":"1.0","canonical_sha256":"dda01035b23a70f2651d58eecdfcbf8e9e50899705e02084512417c35644b360","source":{"kind":"arxiv","id":"2403.06321","version":4},"attestation_state":"computed","paper":{"title":"Vertex Block Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Anka He Chen, Cem Yuksel, Yin Yang, Ziheng Liu","submitted_at":"2024-03-10T21:43:29Z","abstract_excerpt":"We introduce vertex block descent, a block coordinate descent solution for the variational form of implicit Euler through vertex-level Gauss-Seidel iterations. It operates with local vertex position updates that achieve reductions in global variational energy with maximized parallelism. This forms a physics solver that can achieve numerical convergence with unconditional stability and exceptional computation performance. It can also fit in a given computation budget by simply limiting the iteration count while maintaining its stability and superior convergence rate.\n  We present and evaluate o"},"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":"2403.06321","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GR","submitted_at":"2024-03-10T21:43:29Z","cross_cats_sorted":[],"title_canon_sha256":"88641f25589496fc94248622392e9f0d433a098dda5eb366336f3aed41f383fd","abstract_canon_sha256":"f237c1f484b440f8195bffedd38647bc25adbaa1afef46077b6c632e5cbd8dac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:21.517379Z","signature_b64":"uiU7mql4oKGQ/9LkbXeP910BCoDbMkwkCepPVB2lemCpAYWGqK8PyVzRJSp2ws6DCrPU8YFpa1BEBqpE0wJhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dda01035b23a70f2651d58eecdfcbf8e9e50899705e02084512417c35644b360","last_reissued_at":"2026-07-05T08:26:21.516911Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:21.516911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex Block Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Anka He Chen, Cem Yuksel, Yin Yang, Ziheng Liu","submitted_at":"2024-03-10T21:43:29Z","abstract_excerpt":"We introduce vertex block descent, a block coordinate descent solution for the variational form of implicit Euler through vertex-level Gauss-Seidel iterations. It operates with local vertex position updates that achieve reductions in global variational energy with maximized parallelism. This forms a physics solver that can achieve numerical convergence with unconditional stability and exceptional computation performance. It can also fit in a given computation budget by simply limiting the iteration count while maintaining its stability and superior convergence rate.\n  We present and evaluate o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06321","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.06321/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.06321","created_at":"2026-07-05T08:26:21.516964+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.06321v4","created_at":"2026-07-05T08:26:21.516964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06321","created_at":"2026-07-05T08:26:21.516964+00:00"},{"alias_kind":"pith_short_12","alias_value":"3WQBANNSHJYP","created_at":"2026-07-05T08:26:21.516964+00:00"},{"alias_kind":"pith_short_16","alias_value":"3WQBANNSHJYPEZI5","created_at":"2026-07-05T08:26:21.516964+00:00"},{"alias_kind":"pith_short_8","alias_value":"3WQBANNS","created_at":"2026-07-05T08:26:21.516964+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.04831","citing_title":"Isaac Lab: A GPU-Accelerated Simulation Framework for Multi-Modal Robot Learning","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3WQBANNSHJYPEZI5LDXM37F7R2","json":"https://pith.science/pith/3WQBANNSHJYPEZI5LDXM37F7R2.json","graph_json":"https://pith.science/api/pith-number/3WQBANNSHJYPEZI5LDXM37F7R2/graph.json","events_json":"https://pith.science/api/pith-number/3WQBANNSHJYPEZI5LDXM37F7R2/events.json","paper":"https://pith.science/paper/3WQBANNS"},"agent_actions":{"view_html":"https://pith.science/pith/3WQBANNSHJYPEZI5LDXM37F7R2","download_json":"https://pith.science/pith/3WQBANNSHJYPEZI5LDXM37F7R2.json","view_paper":"https://pith.science/paper/3WQBANNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.06321&json=true","fetch_graph":"https://pith.science/api/pith-number/3WQBANNSHJYPEZI5LDXM37F7R2/graph.json","fetch_events":"https://pith.science/api/pith-number/3WQBANNSHJYPEZI5LDXM37F7R2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3WQBANNSHJYPEZI5LDXM37F7R2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3WQBANNSHJYPEZI5LDXM37F7R2/action/storage_attestation","attest_author":"https://pith.science/pith/3WQBANNSHJYPEZI5LDXM37F7R2/action/author_attestation","sign_citation":"https://pith.science/pith/3WQBANNSHJYPEZI5LDXM37F7R2/action/citation_signature","submit_replication":"https://pith.science/pith/3WQBANNSHJYPEZI5LDXM37F7R2/action/replication_record"}},"created_at":"2026-07-05T08:26:21.516964+00:00","updated_at":"2026-07-05T08:26:21.516964+00:00"}