{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RCVBVDY6QWNNM2QHRW4ECWSGN2","short_pith_number":"pith:RCVBVDY6","schema_version":"1.0","canonical_sha256":"88aa1a8f1e859ad66a078db8415a466eb63c8e037cdc261baa592c555444f974","source":{"kind":"arxiv","id":"1908.00820","version":1},"attestation_state":"computed","paper":{"title":"An Adaptive Pole-Matching Method for Interpolating Reduced-Order Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Lihong Feng, Peter Benner, Yao Yue","submitted_at":"2019-08-02T12:12:50Z","abstract_excerpt":"An adaptive parametric reduced-order modeling method based on interpolating poles of reduced-order models is proposed in this paper. To guarantee correct interpolation, a pole-matching process is conducted to determine which poles of two reduced-order models correspond to the same parametric pole. First, the pole-matching in the scenario of parameter perturbation is discussed. It is formulated as a combinatorial optimization problem and solved by a branch and bound algorithm. Then, an adaptive framework is proposed to build repository ROMs at adaptively chosen parameter values, which well repr"},"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":"1908.00820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-08-02T12:12:50Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"1b928f911394d8a5f893ca7592e05d12056f9743d1b6dad2ceaa4cb112211969","abstract_canon_sha256":"ad93a538e17f653a1a164c56c7d5bd5eca07254f5bca970176a8d854085d0ae7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:09.776160Z","signature_b64":"Ah7EDAmyjY5S9yKL+0w+Cn9t7PA/8jUULrLvkI3bN6S711WgRzGKq1Ldgs2e8jPz64+OaOnISaErwwpcfB8FCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88aa1a8f1e859ad66a078db8415a466eb63c8e037cdc261baa592c555444f974","last_reissued_at":"2026-07-04T23:51:09.775674Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:09.775674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Adaptive Pole-Matching Method for Interpolating Reduced-Order Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Lihong Feng, Peter Benner, Yao Yue","submitted_at":"2019-08-02T12:12:50Z","abstract_excerpt":"An adaptive parametric reduced-order modeling method based on interpolating poles of reduced-order models is proposed in this paper. To guarantee correct interpolation, a pole-matching process is conducted to determine which poles of two reduced-order models correspond to the same parametric pole. First, the pole-matching in the scenario of parameter perturbation is discussed. It is formulated as a combinatorial optimization problem and solved by a branch and bound algorithm. Then, an adaptive framework is proposed to build repository ROMs at adaptively chosen parameter values, which well repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00820","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.00820/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":"1908.00820","created_at":"2026-07-04T23:51:09.775758+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.00820v1","created_at":"2026-07-04T23:51:09.775758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00820","created_at":"2026-07-04T23:51:09.775758+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCVBVDY6QWNN","created_at":"2026-07-04T23:51:09.775758+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCVBVDY6QWNNM2QH","created_at":"2026-07-04T23:51:09.775758+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCVBVDY6","created_at":"2026-07-04T23:51:09.775758+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/RCVBVDY6QWNNM2QHRW4ECWSGN2","json":"https://pith.science/pith/RCVBVDY6QWNNM2QHRW4ECWSGN2.json","graph_json":"https://pith.science/api/pith-number/RCVBVDY6QWNNM2QHRW4ECWSGN2/graph.json","events_json":"https://pith.science/api/pith-number/RCVBVDY6QWNNM2QHRW4ECWSGN2/events.json","paper":"https://pith.science/paper/RCVBVDY6"},"agent_actions":{"view_html":"https://pith.science/pith/RCVBVDY6QWNNM2QHRW4ECWSGN2","download_json":"https://pith.science/pith/RCVBVDY6QWNNM2QHRW4ECWSGN2.json","view_paper":"https://pith.science/paper/RCVBVDY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.00820&json=true","fetch_graph":"https://pith.science/api/pith-number/RCVBVDY6QWNNM2QHRW4ECWSGN2/graph.json","fetch_events":"https://pith.science/api/pith-number/RCVBVDY6QWNNM2QHRW4ECWSGN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCVBVDY6QWNNM2QHRW4ECWSGN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCVBVDY6QWNNM2QHRW4ECWSGN2/action/storage_attestation","attest_author":"https://pith.science/pith/RCVBVDY6QWNNM2QHRW4ECWSGN2/action/author_attestation","sign_citation":"https://pith.science/pith/RCVBVDY6QWNNM2QHRW4ECWSGN2/action/citation_signature","submit_replication":"https://pith.science/pith/RCVBVDY6QWNNM2QHRW4ECWSGN2/action/replication_record"}},"created_at":"2026-07-04T23:51:09.775758+00:00","updated_at":"2026-07-04T23:51:09.775758+00:00"}