{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XACPSAERRTSVKF5JWQTEBDOD4C","short_pith_number":"pith:XACPSAER","schema_version":"1.0","canonical_sha256":"b804f900918ce55517a9b426408dc3e08cd9456840d184bdc92824441d7787c2","source":{"kind":"arxiv","id":"2411.07151","version":4},"attestation_state":"computed","paper":{"title":"Model order reduction of parametric dynamical systems by slice sampling tensor completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","physics.comp-ph"],"primary_cat":"math.NA","authors_text":"Alexander V. Mamonov, Maxim A. Olshanskii","submitted_at":"2024-11-11T17:25:02Z","abstract_excerpt":"Recent studies have demonstrated the great potential of reduced order modeling for parametric dynamical systems using low-rank tensor decompositions (LRTD). In particular, within the framework of interpolatory tensorial reduced order models (ROM), LRTD is computed for tensors composed of snapshots of the system's solutions, where each parameter corresponds to a distinct tensor mode. This approach requires full sampling of the parameter domain on a tensor product grid, which suffers from the curse of dimensionality, making it practical only for systems with a small number of parameters. To over"},"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":"2411.07151","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-11-11T17:25:02Z","cross_cats_sorted":["cs.NA","physics.comp-ph"],"title_canon_sha256":"58f9ba466ea0c08a8ce191c9790c5aaa3cc3334c07b00e8210ed1bfaa09cd8f4","abstract_canon_sha256":"210df9e7eeb5b51a3b9b518d9564fb1e2af284ffb6f2855cc3557e79a4081a66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:11:53.405355Z","signature_b64":"2a+veeXaa8Mv8j+HtRxgSWFR3M67+UiH86txI0dhz5Yud35ReMdOK0x2OiYde1dw7L/hMMfbS/CPz0GS2nhRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b804f900918ce55517a9b426408dc3e08cd9456840d184bdc92824441d7787c2","last_reissued_at":"2026-06-23T01:11:53.404828Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:11:53.404828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model order reduction of parametric dynamical systems by slice sampling tensor completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","physics.comp-ph"],"primary_cat":"math.NA","authors_text":"Alexander V. Mamonov, Maxim A. Olshanskii","submitted_at":"2024-11-11T17:25:02Z","abstract_excerpt":"Recent studies have demonstrated the great potential of reduced order modeling for parametric dynamical systems using low-rank tensor decompositions (LRTD). In particular, within the framework of interpolatory tensorial reduced order models (ROM), LRTD is computed for tensors composed of snapshots of the system's solutions, where each parameter corresponds to a distinct tensor mode. This approach requires full sampling of the parameter domain on a tensor product grid, which suffers from the curse of dimensionality, making it practical only for systems with a small number of parameters. To over"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.07151","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/2411.07151/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":"2411.07151","created_at":"2026-06-23T01:11:53.404891+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.07151v4","created_at":"2026-06-23T01:11:53.404891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.07151","created_at":"2026-06-23T01:11:53.404891+00:00"},{"alias_kind":"pith_short_12","alias_value":"XACPSAERRTSV","created_at":"2026-06-23T01:11:53.404891+00:00"},{"alias_kind":"pith_short_16","alias_value":"XACPSAERRTSVKF5J","created_at":"2026-06-23T01:11:53.404891+00:00"},{"alias_kind":"pith_short_8","alias_value":"XACPSAER","created_at":"2026-06-23T01:11:53.404891+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.05134","citing_title":"Matrices over a Hilbert space and their low-rank cross approximation","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XACPSAERRTSVKF5JWQTEBDOD4C","json":"https://pith.science/pith/XACPSAERRTSVKF5JWQTEBDOD4C.json","graph_json":"https://pith.science/api/pith-number/XACPSAERRTSVKF5JWQTEBDOD4C/graph.json","events_json":"https://pith.science/api/pith-number/XACPSAERRTSVKF5JWQTEBDOD4C/events.json","paper":"https://pith.science/paper/XACPSAER"},"agent_actions":{"view_html":"https://pith.science/pith/XACPSAERRTSVKF5JWQTEBDOD4C","download_json":"https://pith.science/pith/XACPSAERRTSVKF5JWQTEBDOD4C.json","view_paper":"https://pith.science/paper/XACPSAER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.07151&json=true","fetch_graph":"https://pith.science/api/pith-number/XACPSAERRTSVKF5JWQTEBDOD4C/graph.json","fetch_events":"https://pith.science/api/pith-number/XACPSAERRTSVKF5JWQTEBDOD4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XACPSAERRTSVKF5JWQTEBDOD4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XACPSAERRTSVKF5JWQTEBDOD4C/action/storage_attestation","attest_author":"https://pith.science/pith/XACPSAERRTSVKF5JWQTEBDOD4C/action/author_attestation","sign_citation":"https://pith.science/pith/XACPSAERRTSVKF5JWQTEBDOD4C/action/citation_signature","submit_replication":"https://pith.science/pith/XACPSAERRTSVKF5JWQTEBDOD4C/action/replication_record"}},"created_at":"2026-06-23T01:11:53.404891+00:00","updated_at":"2026-06-23T01:11:53.404891+00:00"}