{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UK2OCK3FUDQUECBCDWVZVJQ3XI","short_pith_number":"pith:UK2OCK3F","schema_version":"1.0","canonical_sha256":"a2b4e12b65a0e14208221dab9aa61bba3bcd628382e5c945f42d7cc42d3a1c15","source":{"kind":"arxiv","id":"2301.10804","version":1},"attestation_state":"computed","paper":{"title":"Full trajectory optimizing operator inference for reduced-order modeling using differentiable programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["nlin.CD"],"primary_cat":"physics.flu-dyn","authors_text":"Arvind T. Mohan, Daniel Livescu, Datta V. Gaitonde, Surya Chakrabarti","submitted_at":"2023-01-25T19:43:05Z","abstract_excerpt":"Accurate and inexpensive Reduced Order Models (ROMs) for forecasting turbulent flows can facilitate rapid design iterations and thus prove critical for predictive control in engineering problems. Galerkin projection based Reduced Order Models (GP-ROMs), derived by projecting the Navier-Stokes equations on a truncated Proper Orthogonal Decomposition (POD) basis, are popular because of their low computational costs and theoretical foundations. However, the accuracy of traditional GP-ROMs degrades over long time prediction horizons. To address this issue, we extend the recently proposed Neural Ga"},"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":"2301.10804","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"physics.flu-dyn","submitted_at":"2023-01-25T19:43:05Z","cross_cats_sorted":["nlin.CD"],"title_canon_sha256":"8e6d776c04ffca8c3c3f634e17cb7c8fdd6ae003562ac209d535fd19fe46fec2","abstract_canon_sha256":"2827d6bdfb6b7d009ec2abce45e6c14c9f9c4f2b7547523f87c7bd76b3f6c4ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:35:55.161240Z","signature_b64":"CVIRjsaIqLR6fFMbIApyAFWqoS0zQ+pAu89VEV5HQNuY5E+nZBXfJ/lKQYAZ8F3x8MPONM0tsTGWa/MDxDyGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2b4e12b65a0e14208221dab9aa61bba3bcd628382e5c945f42d7cc42d3a1c15","last_reissued_at":"2026-07-05T05:35:55.160773Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:35:55.160773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Full trajectory optimizing operator inference for reduced-order modeling using differentiable programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["nlin.CD"],"primary_cat":"physics.flu-dyn","authors_text":"Arvind T. Mohan, Daniel Livescu, Datta V. Gaitonde, Surya Chakrabarti","submitted_at":"2023-01-25T19:43:05Z","abstract_excerpt":"Accurate and inexpensive Reduced Order Models (ROMs) for forecasting turbulent flows can facilitate rapid design iterations and thus prove critical for predictive control in engineering problems. Galerkin projection based Reduced Order Models (GP-ROMs), derived by projecting the Navier-Stokes equations on a truncated Proper Orthogonal Decomposition (POD) basis, are popular because of their low computational costs and theoretical foundations. However, the accuracy of traditional GP-ROMs degrades over long time prediction horizons. To address this issue, we extend the recently proposed Neural Ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10804","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/2301.10804/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":"2301.10804","created_at":"2026-07-05T05:35:55.160833+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.10804v1","created_at":"2026-07-05T05:35:55.160833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10804","created_at":"2026-07-05T05:35:55.160833+00:00"},{"alias_kind":"pith_short_12","alias_value":"UK2OCK3FUDQU","created_at":"2026-07-05T05:35:55.160833+00:00"},{"alias_kind":"pith_short_16","alias_value":"UK2OCK3FUDQUECBC","created_at":"2026-07-05T05:35:55.160833+00:00"},{"alias_kind":"pith_short_8","alias_value":"UK2OCK3F","created_at":"2026-07-05T05:35:55.160833+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15101","citing_title":"What You See is Not What You Get: Neural Partial Differential Equations and The Illusion of Learning","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UK2OCK3FUDQUECBCDWVZVJQ3XI","json":"https://pith.science/pith/UK2OCK3FUDQUECBCDWVZVJQ3XI.json","graph_json":"https://pith.science/api/pith-number/UK2OCK3FUDQUECBCDWVZVJQ3XI/graph.json","events_json":"https://pith.science/api/pith-number/UK2OCK3FUDQUECBCDWVZVJQ3XI/events.json","paper":"https://pith.science/paper/UK2OCK3F"},"agent_actions":{"view_html":"https://pith.science/pith/UK2OCK3FUDQUECBCDWVZVJQ3XI","download_json":"https://pith.science/pith/UK2OCK3FUDQUECBCDWVZVJQ3XI.json","view_paper":"https://pith.science/paper/UK2OCK3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.10804&json=true","fetch_graph":"https://pith.science/api/pith-number/UK2OCK3FUDQUECBCDWVZVJQ3XI/graph.json","fetch_events":"https://pith.science/api/pith-number/UK2OCK3FUDQUECBCDWVZVJQ3XI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UK2OCK3FUDQUECBCDWVZVJQ3XI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UK2OCK3FUDQUECBCDWVZVJQ3XI/action/storage_attestation","attest_author":"https://pith.science/pith/UK2OCK3FUDQUECBCDWVZVJQ3XI/action/author_attestation","sign_citation":"https://pith.science/pith/UK2OCK3FUDQUECBCDWVZVJQ3XI/action/citation_signature","submit_replication":"https://pith.science/pith/UK2OCK3FUDQUECBCDWVZVJQ3XI/action/replication_record"}},"created_at":"2026-07-05T05:35:55.160833+00:00","updated_at":"2026-07-05T05:35:55.160833+00:00"}