{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HOFRNO2OW6R6FVMKNKZLFPRJOO","short_pith_number":"pith:HOFRNO2O","schema_version":"1.0","canonical_sha256":"3b8b16bb4eb7a3e2d58a6ab2b2be297391e39105fdc385995a815fc278e6ce31","source":{"kind":"arxiv","id":"2311.03694","version":2},"attestation_state":"computed","paper":{"title":"Accelerating Galerkin Reduced-Order Models for Turbulent Flows with Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"physics.flu-dyn","authors_text":"(2) University of Illinois Urbana-Champaign), Edgar Solomonik (2) ((1) Virginia Tech, Paul Fischer (2), Ping-Hsuan Tsai (1)","submitted_at":"2023-11-07T03:47:05Z","abstract_excerpt":"Galerkin-based reduced-order models (G-ROMs) offer efficient and accurate approximations for laminar flows but require hundreds to thousands of modes $N$ to capture the complex dynamics of turbulent flows. This makes standard G-ROMs computationally expensive due to the third-order advection tensor contraction, requiring the storage of $N^3$ entries and the computation of $2N^3$ operations per timestep. As a result, such ROMs are impractical for realistic applications like turbulent flow control. In this work, we consider problems that demand large $N$ values for accurate G-ROMs and propose a n"},"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":"2311.03694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.flu-dyn","submitted_at":"2023-11-07T03:47:05Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"6941ab843cf6c359eac6b7d9699490023c0694dc4a0ff076b2d0e20c43442f94","abstract_canon_sha256":"eceeaceae2fc3953e35cecd1af0c91089143ac9de9be1529e2dbce930da46379"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:38.361268Z","signature_b64":"X1NT0s7jYUzXz7tTSQ+tnDijVGlYCupqR1Y5HcLKI0ScrLjTCRvzxCPDHtW61NOjUtax7jxqwHVCZrG4YnwbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b8b16bb4eb7a3e2d58a6ab2b2be297391e39105fdc385995a815fc278e6ce31","last_reissued_at":"2026-07-05T11:18:38.360773Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:38.360773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Galerkin Reduced-Order Models for Turbulent Flows with Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"physics.flu-dyn","authors_text":"(2) University of Illinois Urbana-Champaign), Edgar Solomonik (2) ((1) Virginia Tech, Paul Fischer (2), Ping-Hsuan Tsai (1)","submitted_at":"2023-11-07T03:47:05Z","abstract_excerpt":"Galerkin-based reduced-order models (G-ROMs) offer efficient and accurate approximations for laminar flows but require hundreds to thousands of modes $N$ to capture the complex dynamics of turbulent flows. This makes standard G-ROMs computationally expensive due to the third-order advection tensor contraction, requiring the storage of $N^3$ entries and the computation of $2N^3$ operations per timestep. As a result, such ROMs are impractical for realistic applications like turbulent flow control. In this work, we consider problems that demand large $N$ values for accurate G-ROMs and propose a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.03694","kind":"arxiv","version":2},"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/2311.03694/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":"2311.03694","created_at":"2026-07-05T11:18:38.360831+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.03694v2","created_at":"2026-07-05T11:18:38.360831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03694","created_at":"2026-07-05T11:18:38.360831+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOFRNO2OW6R6","created_at":"2026-07-05T11:18:38.360831+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOFRNO2OW6R6FVMK","created_at":"2026-07-05T11:18:38.360831+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOFRNO2O","created_at":"2026-07-05T11:18:38.360831+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18310","citing_title":"Verifiability and Limit Consistency of Eddy Viscosity Large Eddy Simulation Reduced Order Models","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HOFRNO2OW6R6FVMKNKZLFPRJOO","json":"https://pith.science/pith/HOFRNO2OW6R6FVMKNKZLFPRJOO.json","graph_json":"https://pith.science/api/pith-number/HOFRNO2OW6R6FVMKNKZLFPRJOO/graph.json","events_json":"https://pith.science/api/pith-number/HOFRNO2OW6R6FVMKNKZLFPRJOO/events.json","paper":"https://pith.science/paper/HOFRNO2O"},"agent_actions":{"view_html":"https://pith.science/pith/HOFRNO2OW6R6FVMKNKZLFPRJOO","download_json":"https://pith.science/pith/HOFRNO2OW6R6FVMKNKZLFPRJOO.json","view_paper":"https://pith.science/paper/HOFRNO2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.03694&json=true","fetch_graph":"https://pith.science/api/pith-number/HOFRNO2OW6R6FVMKNKZLFPRJOO/graph.json","fetch_events":"https://pith.science/api/pith-number/HOFRNO2OW6R6FVMKNKZLFPRJOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOFRNO2OW6R6FVMKNKZLFPRJOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOFRNO2OW6R6FVMKNKZLFPRJOO/action/storage_attestation","attest_author":"https://pith.science/pith/HOFRNO2OW6R6FVMKNKZLFPRJOO/action/author_attestation","sign_citation":"https://pith.science/pith/HOFRNO2OW6R6FVMKNKZLFPRJOO/action/citation_signature","submit_replication":"https://pith.science/pith/HOFRNO2OW6R6FVMKNKZLFPRJOO/action/replication_record"}},"created_at":"2026-07-05T11:18:38.360831+00:00","updated_at":"2026-07-05T11:18:38.360831+00:00"}