{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F4HVNGAV4QKAOPAX6BZUEPIAY2","short_pith_number":"pith:F4HVNGAV","canonical_record":{"source":{"id":"1805.06124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-16T04:29:33Z","cross_cats_sorted":["gr-qc","math.NA"],"title_canon_sha256":"28882ccd8ea3870d14979a0a91c8382e69f655c04e744b6cc80a6968233df8b8","abstract_canon_sha256":"641b55270cd6b814a19b67891c47c90ed7740f27dc6318ede1889b85e387a20d"},"schema_version":"1.0"},"canonical_sha256":"2f0f569815e414073c17f073423d00c699e5fa234d4a2f99a000df7f97b6443b","source":{"kind":"arxiv","id":"1805.06124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06124","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06124v1","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06124","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"F4HVNGAV4QKA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F4HVNGAV4QKAOPAX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F4HVNGAV","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F4HVNGAV4QKAOPAX6BZUEPIAY2","target":"record","payload":{"canonical_record":{"source":{"id":"1805.06124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-16T04:29:33Z","cross_cats_sorted":["gr-qc","math.NA"],"title_canon_sha256":"28882ccd8ea3870d14979a0a91c8382e69f655c04e744b6cc80a6968233df8b8","abstract_canon_sha256":"641b55270cd6b814a19b67891c47c90ed7740f27dc6318ede1889b85e387a20d"},"schema_version":"1.0"},"canonical_sha256":"2f0f569815e414073c17f073423d00c699e5fa234d4a2f99a000df7f97b6443b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:14.287521Z","signature_b64":"Z4h3ABsGPV/TnNxIz+QUYlKXx8fuKDVuzZ0+L6lKlwjrVXdNeQ1OaukNIfDhGksVIxQOWGX7O0WQPho4sa9dDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f0f569815e414073c17f073423d00c699e5fa234d4a2f99a000df7f97b6443b","last_reissued_at":"2026-05-17T23:58:14.286940Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:14.286940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.06124","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQmIIFarK8/gHEgbVB+qwPT8Qs/evG/YlcfoSNyZUumzE1X+gh1aB0Bwzj8hPlOJElbZSpOySGaDoXRBt4UtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:57:06.971411Z"},"content_sha256":"c6ab1e76072fc8a070cd5666115ed6c2a34a73717a9fccdc43f373354e6a6e94","schema_version":"1.0","event_id":"sha256:c6ab1e76072fc8a070cd5666115ed6c2a34a73717a9fccdc43f373354e6a6e94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F4HVNGAV4QKAOPAX6BZUEPIAY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on QR-Based Model Reduction: Algorithm, Software, and Gravitational Wave Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["gr-qc","math.NA"],"primary_cat":"cs.DC","authors_text":"Dangxing Chen, Harbir Antil, Scott E. Field","submitted_at":"2018-05-16T04:29:33Z","abstract_excerpt":"While the proper orthogonal decomposition (POD) is optimal under certain norms it's also expensive to compute. For large matrix sizes, it is well known that the QR decomposition provides a tractable alternative. Under the assumption that it is rank--revealing QR (RRQR), the approximation error incurred is similar to the POD error and, furthermore, we show the existence of an RRQR with exactly same error estimate as POD. To numerically realize an RRQR decomposition, we will discuss the (iterative) modified Gram Schmidt with pivoting (MGS) and reduced basis method by employing a greedy strategy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06124","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+Wn8RVS2JtjrhPRKP+RYnZz++5T7tR376fLpN1xKo4mcAMBpigS8oFDvNFP2QxiYCnYpCixV9Wyh69iURGNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:57:06.971772Z"},"content_sha256":"a0364aa8365577c836018b47350474d72e709910d971677e0ae2b9fe210290e8","schema_version":"1.0","event_id":"sha256:a0364aa8365577c836018b47350474d72e709910d971677e0ae2b9fe210290e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4HVNGAV4QKAOPAX6BZUEPIAY2/bundle.json","state_url":"https://pith.science/pith/F4HVNGAV4QKAOPAX6BZUEPIAY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4HVNGAV4QKAOPAX6BZUEPIAY2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T19:57:06Z","links":{"resolver":"https://pith.science/pith/F4HVNGAV4QKAOPAX6BZUEPIAY2","bundle":"https://pith.science/pith/F4HVNGAV4QKAOPAX6BZUEPIAY2/bundle.json","state":"https://pith.science/pith/F4HVNGAV4QKAOPAX6BZUEPIAY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4HVNGAV4QKAOPAX6BZUEPIAY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F4HVNGAV4QKAOPAX6BZUEPIAY2","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":"641b55270cd6b814a19b67891c47c90ed7740f27dc6318ede1889b85e387a20d","cross_cats_sorted":["gr-qc","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-16T04:29:33Z","title_canon_sha256":"28882ccd8ea3870d14979a0a91c8382e69f655c04e744b6cc80a6968233df8b8"},"schema_version":"1.0","source":{"id":"1805.06124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06124","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06124v1","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06124","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"F4HVNGAV4QKA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F4HVNGAV4QKAOPAX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F4HVNGAV","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:a0364aa8365577c836018b47350474d72e709910d971677e0ae2b9fe210290e8","target":"graph","created_at":"2026-05-17T23:58:14Z","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"},"paper":{"abstract_excerpt":"While the proper orthogonal decomposition (POD) is optimal under certain norms it's also expensive to compute. For large matrix sizes, it is well known that the QR decomposition provides a tractable alternative. Under the assumption that it is rank--revealing QR (RRQR), the approximation error incurred is similar to the POD error and, furthermore, we show the existence of an RRQR with exactly same error estimate as POD. To numerically realize an RRQR decomposition, we will discuss the (iterative) modified Gram Schmidt with pivoting (MGS) and reduced basis method by employing a greedy strategy.","authors_text":"Dangxing Chen, Harbir Antil, Scott E. Field","cross_cats":["gr-qc","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-16T04:29:33Z","title":"A Note on QR-Based Model Reduction: Algorithm, Software, and Gravitational Wave Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06124","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:c6ab1e76072fc8a070cd5666115ed6c2a34a73717a9fccdc43f373354e6a6e94","target":"record","created_at":"2026-05-17T23:58:14Z","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":"641b55270cd6b814a19b67891c47c90ed7740f27dc6318ede1889b85e387a20d","cross_cats_sorted":["gr-qc","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-16T04:29:33Z","title_canon_sha256":"28882ccd8ea3870d14979a0a91c8382e69f655c04e744b6cc80a6968233df8b8"},"schema_version":"1.0","source":{"id":"1805.06124","kind":"arxiv","version":1}},"canonical_sha256":"2f0f569815e414073c17f073423d00c699e5fa234d4a2f99a000df7f97b6443b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f0f569815e414073c17f073423d00c699e5fa234d4a2f99a000df7f97b6443b","first_computed_at":"2026-05-17T23:58:14.286940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:14.286940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z4h3ABsGPV/TnNxIz+QUYlKXx8fuKDVuzZ0+L6lKlwjrVXdNeQ1OaukNIfDhGksVIxQOWGX7O0WQPho4sa9dDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:14.287521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6ab1e76072fc8a070cd5666115ed6c2a34a73717a9fccdc43f373354e6a6e94","sha256:a0364aa8365577c836018b47350474d72e709910d971677e0ae2b9fe210290e8"],"state_sha256":"c1b8c88379d8c6b19051c5e74887dee7d0384fb4b471b1cfea6b87d4f84dc49b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jyrjOqkXgxZY+mOpogMQlgKebDz4v/Kfp6AXXADEpz+ym39lCxYFjzaRKk50gD3h7De3qnP1SweTHibM8km0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:57:06.973904Z","bundle_sha256":"d50d11856201052c6d8a60ffd4e5621ad8502f86bed735cf51b3c2b3da22a0e3"}}