{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:I2CS7NNVRANSUGOVUDNYFOVSU3","short_pith_number":"pith:I2CS7NNV","schema_version":"1.0","canonical_sha256":"46852fb5b5881b2a19d5a0db82bab2a6d7746febb800bc5d2c523e51d9f5705b","source":{"kind":"arxiv","id":"1702.06809","version":1},"attestation_state":"computed","paper":{"title":"Toward a chaotic adjoint for LES","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.CD"],"primary_cat":"physics.flu-dyn","authors_text":"Georgios Rigas, Luca Magri, Pablo Fernandez, Patrick J. Blonigan, Qiqi Wang, Scott M. Murman","submitted_at":"2017-02-22T14:16:43Z","abstract_excerpt":"Adjoint-based sensitivity analysis methods are powerful tools for engineers who use flow simulations for design. However, the conventional adjoint method breaks down for scale-resolving simulations like large-eddy simulation (LES) or direct numerical simulation (DNS), which exhibit the chaotic dynamics inherent in turbulent flows. Sensitivity analysis based on least-squares shadowing (LSS) avoids the issues encountered by conventional methods, but has a high computational cost. The following report outlines a new, more computationally efficient formulation of LSS, non-intrusive LSS, and estima"},"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":"1702.06809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.flu-dyn","submitted_at":"2017-02-22T14:16:43Z","cross_cats_sorted":["nlin.CD"],"title_canon_sha256":"8723992d56cfb2c747a64da31ee029cf77364e13d679bdd61d7c6103eb13981f","abstract_canon_sha256":"12b748bc18658597aeb379fbcf956d7669a9ac0b3a15125a5ef361b84f5a3c4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:10.387886Z","signature_b64":"H+WyRCsDUDcj8MYtqdh9GFtQqAYHCOSgq4NUcQL/TWKmT47MBhia5mEuer/WH8d1tay/JZY4GXknRVJ7nA4pAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46852fb5b5881b2a19d5a0db82bab2a6d7746febb800bc5d2c523e51d9f5705b","last_reissued_at":"2026-05-18T00:50:10.387388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:10.387388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward a chaotic adjoint for LES","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.CD"],"primary_cat":"physics.flu-dyn","authors_text":"Georgios Rigas, Luca Magri, Pablo Fernandez, Patrick J. Blonigan, Qiqi Wang, Scott M. Murman","submitted_at":"2017-02-22T14:16:43Z","abstract_excerpt":"Adjoint-based sensitivity analysis methods are powerful tools for engineers who use flow simulations for design. However, the conventional adjoint method breaks down for scale-resolving simulations like large-eddy simulation (LES) or direct numerical simulation (DNS), which exhibit the chaotic dynamics inherent in turbulent flows. Sensitivity analysis based on least-squares shadowing (LSS) avoids the issues encountered by conventional methods, but has a high computational cost. The following report outlines a new, more computationally efficient formulation of LSS, non-intrusive LSS, and estima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06809","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":""},"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":"1702.06809","created_at":"2026-05-18T00:50:10.387460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06809v1","created_at":"2026-05-18T00:50:10.387460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06809","created_at":"2026-05-18T00:50:10.387460+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2CS7NNVRANS","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2CS7NNVRANSUGOV","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2CS7NNV","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.09375","citing_title":"Efficient Gradient-Enhanced Bayesian Optimizer with Comparisons to Conjugate-Gradient and Quasi-Newton Optimizers for Unconstrained Local Optimization","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2CS7NNVRANSUGOVUDNYFOVSU3","json":"https://pith.science/pith/I2CS7NNVRANSUGOVUDNYFOVSU3.json","graph_json":"https://pith.science/api/pith-number/I2CS7NNVRANSUGOVUDNYFOVSU3/graph.json","events_json":"https://pith.science/api/pith-number/I2CS7NNVRANSUGOVUDNYFOVSU3/events.json","paper":"https://pith.science/paper/I2CS7NNV"},"agent_actions":{"view_html":"https://pith.science/pith/I2CS7NNVRANSUGOVUDNYFOVSU3","download_json":"https://pith.science/pith/I2CS7NNVRANSUGOVUDNYFOVSU3.json","view_paper":"https://pith.science/paper/I2CS7NNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06809&json=true","fetch_graph":"https://pith.science/api/pith-number/I2CS7NNVRANSUGOVUDNYFOVSU3/graph.json","fetch_events":"https://pith.science/api/pith-number/I2CS7NNVRANSUGOVUDNYFOVSU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2CS7NNVRANSUGOVUDNYFOVSU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2CS7NNVRANSUGOVUDNYFOVSU3/action/storage_attestation","attest_author":"https://pith.science/pith/I2CS7NNVRANSUGOVUDNYFOVSU3/action/author_attestation","sign_citation":"https://pith.science/pith/I2CS7NNVRANSUGOVUDNYFOVSU3/action/citation_signature","submit_replication":"https://pith.science/pith/I2CS7NNVRANSUGOVUDNYFOVSU3/action/replication_record"}},"created_at":"2026-05-18T00:50:10.387460+00:00","updated_at":"2026-05-18T00:50:10.387460+00:00"}