{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:K7Z4FNH5LMH6Q63NOPQ3ZLRNI5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bac0d5318219b0507378a767f7ae5813b6f062e9b309543cca2c576d9c9d4a95","cross_cats_sorted":["cs.CE","cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2022-03-29T05:20:17Z","title_canon_sha256":"84ffabb5d4f31e4ef4172ac85565b1fc1a658c3d55e85758cc1f93b0f58d873a"},"schema_version":"1.0","source":{"id":"2203.16494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.16494","created_at":"2026-07-05T08:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"2203.16494v1","created_at":"2026-07-05T08:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.16494","created_at":"2026-07-05T08:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"K7Z4FNH5LMH6","created_at":"2026-07-05T08:51:39Z"},{"alias_kind":"pith_short_16","alias_value":"K7Z4FNH5LMH6Q63N","created_at":"2026-07-05T08:51:39Z"},{"alias_kind":"pith_short_8","alias_value":"K7Z4FNH5","created_at":"2026-07-05T08:51:39Z"}],"graph_snapshots":[{"event_id":"sha256:8065d22457d300a1d03819ebf865f337b5136465c45383a641a9a689d1bf067e","target":"graph","created_at":"2026-07-05T08:51:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.16494/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce a points selection algorithm developed by Shin and Xiu [SIAM J. Sci. Comput., 38 (2016), pp. A385--A411], as a hyper-reduction method. The selection algorithm is originally proposed as a stochastic collocation ","authors_text":"Dylan Matthew Copeland, Jessica T. Lauzon, Kevin Huynh, Siu Wun Cheung, Yeonjong Shin, Youngsoo Choi","cross_cats":["cs.CE","cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2022-03-29T05:20:17Z","title":"S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.16494","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3d24072f2a92a8070ced6daa5902c74529df03e8ae8f5f76efe37b18c31fef05","target":"record","created_at":"2026-07-05T08:51:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bac0d5318219b0507378a767f7ae5813b6f062e9b309543cca2c576d9c9d4a95","cross_cats_sorted":["cs.CE","cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2022-03-29T05:20:17Z","title_canon_sha256":"84ffabb5d4f31e4ef4172ac85565b1fc1a658c3d55e85758cc1f93b0f58d873a"},"schema_version":"1.0","source":{"id":"2203.16494","kind":"arxiv","version":1}},"canonical_sha256":"57f3c2b4fd5b0fe87b6d73e1bcae2d474419d019f675145ab57d2a498f24b606","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57f3c2b4fd5b0fe87b6d73e1bcae2d474419d019f675145ab57d2a498f24b606","first_computed_at":"2026-07-05T08:51:39.862606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:51:39.862606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GVYFFnhwQNnzPFmd3K/WNU4MqFeIxEcbS9B8PLGK3L7jYT0opUD3iuJw5dKvD7Qt7doH9vQKj6h/tQemnH0xBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:51:39.863033Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.16494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d24072f2a92a8070ced6daa5902c74529df03e8ae8f5f76efe37b18c31fef05","sha256:8065d22457d300a1d03819ebf865f337b5136465c45383a641a9a689d1bf067e"],"state_sha256":"088253151c0f5d9b24b62f8a3390a224935e0527ea5ad43af67ac30825f30b02"}