{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GBQEURZY2ISWIUTPU5BWIKA67L","short_pith_number":"pith:GBQEURZY","schema_version":"1.0","canonical_sha256":"30604a4738d22564526fa74364281efad93d0454ebd801a071d0e310dea7103c","source":{"kind":"arxiv","id":"1404.0442","version":3},"attestation_state":"computed","paper":{"title":"Adaptive $h$-refinement for reduced-order models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"Kevin Carlberg","submitted_at":"2014-04-02T03:29:43Z","abstract_excerpt":"This work presents a method to adaptively refine reduced-order models \\emph{a posteriori} without requiring additional full-order-model solves. The technique is analogous to mesh-adaptive $h$-refinement: it enriches the reduced-basis space online by `splitting' a given basis vector into several vectors with disjoint support. The splitting scheme is defined by a tree structure constructed offline via recursive $k$-means clustering of the state variables using snapshot data. The method identifies the vectors to split online using a dual-weighted-residual approach that aims to reduce error in an "},"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":"1404.0442","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-04-02T03:29:43Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"86c5aa7bc9e1f263f58c61e7777adfa2cf32378792296989143c1e51cf64d287","abstract_canon_sha256":"aa67f0eaac09d2797f68c23ceb78cc4d21a447c91adf51f412db2774ccadfd16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:49.890705Z","signature_b64":"14UBOqT30t8OZ7Gcx0s/NFo06sUN5EOhZJ8qI4PUovfXHR81l6s2OApmzHM2NkGgwmgrR5gWy1T+0sMpQ3ooAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30604a4738d22564526fa74364281efad93d0454ebd801a071d0e310dea7103c","last_reissued_at":"2026-05-18T02:18:49.889861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:49.889861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive $h$-refinement for reduced-order models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"Kevin Carlberg","submitted_at":"2014-04-02T03:29:43Z","abstract_excerpt":"This work presents a method to adaptively refine reduced-order models \\emph{a posteriori} without requiring additional full-order-model solves. The technique is analogous to mesh-adaptive $h$-refinement: it enriches the reduced-basis space online by `splitting' a given basis vector into several vectors with disjoint support. The splitting scheme is defined by a tree structure constructed offline via recursive $k$-means clustering of the state variables using snapshot data. The method identifies the vectors to split online using a dual-weighted-residual approach that aims to reduce error in an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0442","kind":"arxiv","version":3},"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":"1404.0442","created_at":"2026-05-18T02:18:49.889988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0442v3","created_at":"2026-05-18T02:18:49.889988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0442","created_at":"2026-05-18T02:18:49.889988+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBQEURZY2ISW","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBQEURZY2ISWIUTP","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBQEURZY","created_at":"2026-05-18T12:28:30.664211+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/GBQEURZY2ISWIUTPU5BWIKA67L","json":"https://pith.science/pith/GBQEURZY2ISWIUTPU5BWIKA67L.json","graph_json":"https://pith.science/api/pith-number/GBQEURZY2ISWIUTPU5BWIKA67L/graph.json","events_json":"https://pith.science/api/pith-number/GBQEURZY2ISWIUTPU5BWIKA67L/events.json","paper":"https://pith.science/paper/GBQEURZY"},"agent_actions":{"view_html":"https://pith.science/pith/GBQEURZY2ISWIUTPU5BWIKA67L","download_json":"https://pith.science/pith/GBQEURZY2ISWIUTPU5BWIKA67L.json","view_paper":"https://pith.science/paper/GBQEURZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0442&json=true","fetch_graph":"https://pith.science/api/pith-number/GBQEURZY2ISWIUTPU5BWIKA67L/graph.json","fetch_events":"https://pith.science/api/pith-number/GBQEURZY2ISWIUTPU5BWIKA67L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBQEURZY2ISWIUTPU5BWIKA67L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBQEURZY2ISWIUTPU5BWIKA67L/action/storage_attestation","attest_author":"https://pith.science/pith/GBQEURZY2ISWIUTPU5BWIKA67L/action/author_attestation","sign_citation":"https://pith.science/pith/GBQEURZY2ISWIUTPU5BWIKA67L/action/citation_signature","submit_replication":"https://pith.science/pith/GBQEURZY2ISWIUTPU5BWIKA67L/action/replication_record"}},"created_at":"2026-05-18T02:18:49.889988+00:00","updated_at":"2026-05-18T02:18:49.889988+00:00"}