{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LMOZLHYSV46FQBAD5UCEENBAUL","short_pith_number":"pith:LMOZLHYS","schema_version":"1.0","canonical_sha256":"5b1d959f12af3c580403ed04423420a2c4ff5f8152c6f2f4e9975321c778ddea","source":{"kind":"arxiv","id":"1204.1718","version":1},"attestation_state":"computed","paper":{"title":"Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"David Pardo, Maciej Paszynski, Nathan Collier, Victor M. Calo","submitted_at":"2012-04-08T08:07:47Z","abstract_excerpt":"The multi-frontal direct solver is the state-of-the-art algorithm for the direct solution of sparse linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct solver algorithm on linear systems resulting from B-spline-based isogeometric finite elements, where the mesh is a structured grid. Specifically we provide the estimates for systems resulting from $C^{p-1}$ polynomial B-spline spaces and compare them to those obtained using $C^0$ spaces."},"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":"1204.1718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-04-08T08:07:47Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"e307235552402138537106be759d708979b4e7e00bd0a720b2138806acd092f5","abstract_canon_sha256":"7895f840bcae529659174999256da42378db3ea6a9de4a4f712492cca7625ffe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:23.310225Z","signature_b64":"xdxuykd+sRwRf9l2uTRdE0zgmIrOEVUOwNIqT0CtW7OuVvC3kRShtf7t1HJxYYGjcYgkEhdCpOz7pzfLp+6OBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b1d959f12af3c580403ed04423420a2c4ff5f8152c6f2f4e9975321c778ddea","last_reissued_at":"2026-05-18T03:58:23.309703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:23.309703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"David Pardo, Maciej Paszynski, Nathan Collier, Victor M. Calo","submitted_at":"2012-04-08T08:07:47Z","abstract_excerpt":"The multi-frontal direct solver is the state-of-the-art algorithm for the direct solution of sparse linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct solver algorithm on linear systems resulting from B-spline-based isogeometric finite elements, where the mesh is a structured grid. Specifically we provide the estimates for systems resulting from $C^{p-1}$ polynomial B-spline spaces and compare them to those obtained using $C^0$ spaces."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1718","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":"1204.1718","created_at":"2026-05-18T03:58:23.309781+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.1718v1","created_at":"2026-05-18T03:58:23.309781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1718","created_at":"2026-05-18T03:58:23.309781+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMOZLHYSV46F","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMOZLHYSV46FQBAD","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMOZLHYS","created_at":"2026-05-18T12:27:14.488303+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/LMOZLHYSV46FQBAD5UCEENBAUL","json":"https://pith.science/pith/LMOZLHYSV46FQBAD5UCEENBAUL.json","graph_json":"https://pith.science/api/pith-number/LMOZLHYSV46FQBAD5UCEENBAUL/graph.json","events_json":"https://pith.science/api/pith-number/LMOZLHYSV46FQBAD5UCEENBAUL/events.json","paper":"https://pith.science/paper/LMOZLHYS"},"agent_actions":{"view_html":"https://pith.science/pith/LMOZLHYSV46FQBAD5UCEENBAUL","download_json":"https://pith.science/pith/LMOZLHYSV46FQBAD5UCEENBAUL.json","view_paper":"https://pith.science/paper/LMOZLHYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.1718&json=true","fetch_graph":"https://pith.science/api/pith-number/LMOZLHYSV46FQBAD5UCEENBAUL/graph.json","fetch_events":"https://pith.science/api/pith-number/LMOZLHYSV46FQBAD5UCEENBAUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMOZLHYSV46FQBAD5UCEENBAUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMOZLHYSV46FQBAD5UCEENBAUL/action/storage_attestation","attest_author":"https://pith.science/pith/LMOZLHYSV46FQBAD5UCEENBAUL/action/author_attestation","sign_citation":"https://pith.science/pith/LMOZLHYSV46FQBAD5UCEENBAUL/action/citation_signature","submit_replication":"https://pith.science/pith/LMOZLHYSV46FQBAD5UCEENBAUL/action/replication_record"}},"created_at":"2026-05-18T03:58:23.309781+00:00","updated_at":"2026-05-18T03:58:23.309781+00:00"}