{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QEVOPI47Z6KK56ETXDL2RK5BOK","short_pith_number":"pith:QEVOPI47","canonical_record":{"source":{"id":"1308.5626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-26T16:17:32Z","cross_cats_sorted":["cs.NA","math.NA","stat.TH"],"title_canon_sha256":"abddcbddd4fe889ddcc2b2527787cf31d6bace5936cc604d9519c78b33849cb2","abstract_canon_sha256":"8e1e5457f19977b529d311a91e4ad90b5b6a5c365cd620121f078cec2d7ecda4"},"schema_version":"1.0"},"canonical_sha256":"812ae7a39fcf94aef893b8d7a8aba172b4f65bd1aee7da4bc47d8b62bb1d74c6","source":{"kind":"arxiv","id":"1308.5626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5626","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5626v1","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5626","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"QEVOPI47Z6KK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QEVOPI47Z6KK56ET","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QEVOPI47","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QEVOPI47Z6KK56ETXDL2RK5BOK","target":"record","payload":{"canonical_record":{"source":{"id":"1308.5626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-26T16:17:32Z","cross_cats_sorted":["cs.NA","math.NA","stat.TH"],"title_canon_sha256":"abddcbddd4fe889ddcc2b2527787cf31d6bace5936cc604d9519c78b33849cb2","abstract_canon_sha256":"8e1e5457f19977b529d311a91e4ad90b5b6a5c365cd620121f078cec2d7ecda4"},"schema_version":"1.0"},"canonical_sha256":"812ae7a39fcf94aef893b8d7a8aba172b4f65bd1aee7da4bc47d8b62bb1d74c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:43.626376Z","signature_b64":"lIIXgqjIGRaAIr2crLnma67TK3iFHknhNgjCM4jf4SiVWWZt/73UbPYQgl8un3MfUhG5sVojOvKfN28QSzWkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"812ae7a39fcf94aef893b8d7a8aba172b4f65bd1aee7da4bc47d8b62bb1d74c6","last_reissued_at":"2026-05-18T01:12:43.626005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:43.626005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.5626","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-18T01:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UxSX02e4ZKF2o9k7eiWr8TnysPXV4rgFAL8CPOF6Wpj3m3w3ltaQvEGkMHiyNLnp/5MGoZ8gorxsQDvWS6RGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:35:48.425235Z"},"content_sha256":"ab0c1ebe703ca21594abf82b0805491a5d98bbdfafadebdf452a7e6ee3e1828c","schema_version":"1.0","event_id":"sha256:ab0c1ebe703ca21594abf82b0805491a5d98bbdfafadebdf452a7e6ee3e1828c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QEVOPI47Z6KK56ETXDL2RK5BOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Progressive Statistical Method for Preconditioning Matrix-Free Solution of High-Order Discretization of Linear Time-Dependent Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.TH"],"primary_cat":"math.ST","authors_text":"A. Ghasemi, L. K. Taylor","submitted_at":"2013-08-26T16:17:32Z","abstract_excerpt":"Preconditioning of a linear system obtained from spectral discretization of time-dependent PDEs often results in a full matrix which is expensive to compute and store specially when the problem size increases. A matrix-free implementation is usually applied to resolve this issue. In this framework, preconditioning is typically challenging since the entries of the matrix are not explicitly available. In this short note, we propose a statistical approach to gradually create a preconditioner matrix by collecting the information obtained from matrix-vector product in the Arnoldi loop of an unpreco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5626","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-18T01:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3YMZ45BhqJun9tfL/Yw6q2Z6Ua7Z96FLJBERXdQgPb752zrLEuu4TEFA4x+JXum6wWW2mAEPE62cyHDJWMcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:35:48.425615Z"},"content_sha256":"02537e92f8d9f5e8024cc486443aa83ff513397ba07f8696852d39a7f5347ceb","schema_version":"1.0","event_id":"sha256:02537e92f8d9f5e8024cc486443aa83ff513397ba07f8696852d39a7f5347ceb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEVOPI47Z6KK56ETXDL2RK5BOK/bundle.json","state_url":"https://pith.science/pith/QEVOPI47Z6KK56ETXDL2RK5BOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEVOPI47Z6KK56ETXDL2RK5BOK/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-28T10:35:48Z","links":{"resolver":"https://pith.science/pith/QEVOPI47Z6KK56ETXDL2RK5BOK","bundle":"https://pith.science/pith/QEVOPI47Z6KK56ETXDL2RK5BOK/bundle.json","state":"https://pith.science/pith/QEVOPI47Z6KK56ETXDL2RK5BOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEVOPI47Z6KK56ETXDL2RK5BOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QEVOPI47Z6KK56ETXDL2RK5BOK","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":"8e1e5457f19977b529d311a91e4ad90b5b6a5c365cd620121f078cec2d7ecda4","cross_cats_sorted":["cs.NA","math.NA","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-26T16:17:32Z","title_canon_sha256":"abddcbddd4fe889ddcc2b2527787cf31d6bace5936cc604d9519c78b33849cb2"},"schema_version":"1.0","source":{"id":"1308.5626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5626","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5626v1","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5626","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"QEVOPI47Z6KK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QEVOPI47Z6KK56ET","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QEVOPI47","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:02537e92f8d9f5e8024cc486443aa83ff513397ba07f8696852d39a7f5347ceb","target":"graph","created_at":"2026-05-18T01:12:43Z","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":"Preconditioning of a linear system obtained from spectral discretization of time-dependent PDEs often results in a full matrix which is expensive to compute and store specially when the problem size increases. A matrix-free implementation is usually applied to resolve this issue. In this framework, preconditioning is typically challenging since the entries of the matrix are not explicitly available. In this short note, we propose a statistical approach to gradually create a preconditioner matrix by collecting the information obtained from matrix-vector product in the Arnoldi loop of an unpreco","authors_text":"A. Ghasemi, L. K. Taylor","cross_cats":["cs.NA","math.NA","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-26T16:17:32Z","title":"A Progressive Statistical Method for Preconditioning Matrix-Free Solution of High-Order Discretization of Linear Time-Dependent Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5626","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:ab0c1ebe703ca21594abf82b0805491a5d98bbdfafadebdf452a7e6ee3e1828c","target":"record","created_at":"2026-05-18T01:12:43Z","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":"8e1e5457f19977b529d311a91e4ad90b5b6a5c365cd620121f078cec2d7ecda4","cross_cats_sorted":["cs.NA","math.NA","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-26T16:17:32Z","title_canon_sha256":"abddcbddd4fe889ddcc2b2527787cf31d6bace5936cc604d9519c78b33849cb2"},"schema_version":"1.0","source":{"id":"1308.5626","kind":"arxiv","version":1}},"canonical_sha256":"812ae7a39fcf94aef893b8d7a8aba172b4f65bd1aee7da4bc47d8b62bb1d74c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"812ae7a39fcf94aef893b8d7a8aba172b4f65bd1aee7da4bc47d8b62bb1d74c6","first_computed_at":"2026-05-18T01:12:43.626005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:43.626005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lIIXgqjIGRaAIr2crLnma67TK3iFHknhNgjCM4jf4SiVWWZt/73UbPYQgl8un3MfUhG5sVojOvKfN28QSzWkBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:43.626376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab0c1ebe703ca21594abf82b0805491a5d98bbdfafadebdf452a7e6ee3e1828c","sha256:02537e92f8d9f5e8024cc486443aa83ff513397ba07f8696852d39a7f5347ceb"],"state_sha256":"45ac4e33de36aa52e961accdf87f368c4ab21c7fbb9543e2626fe37997cf0f3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IrCeo7TYyghF/+oa1YAqu5NpGHNPFgnkMrjnF/G9Xs1TnZx2sza/0j5X0boF015o5l3M0o2X7nsLXqBdIGwHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T10:35:48.427493Z","bundle_sha256":"36aa93806ab047cfd426bb103e85d23c5aa509a15e254c5ea18ecb670e0e307f"}}