{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:K2ED5EYN53PFQB33QJ46KUG75I","short_pith_number":"pith:K2ED5EYN","canonical_record":{"source":{"id":"1203.2325","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-03-11T12:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"aa23758d19b44d34170bc9737099c4d6c3f4f9dd94a8a9dba98638326b1e1045","abstract_canon_sha256":"db1afef73020033960bec34ff45243829e3b9b80460a9b314bdb849376bb2e48"},"schema_version":"1.0"},"canonical_sha256":"56883e930deede58077b8279e550dfea162097246fa0792e076a37e7faa5851a","source":{"kind":"arxiv","id":"1203.2325","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2325","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2325v4","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2325","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"K2ED5EYN53PF","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K2ED5EYN53PFQB33","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K2ED5EYN","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:K2ED5EYN53PFQB33QJ46KUG75I","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2325","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-03-11T12:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"aa23758d19b44d34170bc9737099c4d6c3f4f9dd94a8a9dba98638326b1e1045","abstract_canon_sha256":"db1afef73020033960bec34ff45243829e3b9b80460a9b314bdb849376bb2e48"},"schema_version":"1.0"},"canonical_sha256":"56883e930deede58077b8279e550dfea162097246fa0792e076a37e7faa5851a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:35.855353Z","signature_b64":"BSerpfnqRmtmNi7eJiOo8q8nF2kjfJd2VgPeGaXJtg/OJc4HBYGKN9xRDGPpCrwUkJd+tHdYlcXOVl9bOHe+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56883e930deede58077b8279e550dfea162097246fa0792e076a37e7faa5851a","last_reissued_at":"2026-05-18T02:23:35.854593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:35.854593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2325","source_version":4,"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-18T02:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+NDzfaATkCr6C+1attfhlkR0wq4T0f9JtGSfmguhd+3CAKnwIZmbSH3t47anqQnhcPp6AFiMr+G1Bdj24eSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:04:03.097644Z"},"content_sha256":"65e7c06b04876815f6074610d446ba8634c958b86cfda660dfa7d92d4622b701","schema_version":"1.0","event_id":"sha256:65e7c06b04876815f6074610d446ba8634c958b86cfda660dfa7d92d4622b701"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:K2ED5EYN53PFQB33QJ46KUG75I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Dropping Criteria for F-norm Minimization Based Sparse Approximate Inverse Preconditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Qian Zhang, Zhongxiao Jia","submitted_at":"2012-03-11T12:05:27Z","abstract_excerpt":"Dropping tolerance criteria play a central role in Sparse Approximate Inverse preconditioning. Such criteria have received, however, little attention and have been treated heuristically in the following manner: If the size of an entry is below some empirically small positive quantity, then it is set to zero. The meaning of \"small\" is vague and has not been considered rigorously. It has not been clear how dropping tolerances affect the quality and effectiveness of a preconditioner $M$. In this paper, we focus on the adaptive Power Sparse Approximate Inverse algorithm and establish a mathematica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2325","kind":"arxiv","version":4},"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-18T02:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kR6x5ao9gGoeGGDhgXL0zdCXNTlnq01GkZqn9nakNaVY6bbKXWxVeMBkP3GKKZ3ueVxGRdj9AyN8qwjTmrvwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:04:03.097991Z"},"content_sha256":"5870fd5be3eade5494a26d3f2993a59a08adbca4ec02eec812e0e1e48af2178b","schema_version":"1.0","event_id":"sha256:5870fd5be3eade5494a26d3f2993a59a08adbca4ec02eec812e0e1e48af2178b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K2ED5EYN53PFQB33QJ46KUG75I/bundle.json","state_url":"https://pith.science/pith/K2ED5EYN53PFQB33QJ46KUG75I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K2ED5EYN53PFQB33QJ46KUG75I/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-05-28T09:04:03Z","links":{"resolver":"https://pith.science/pith/K2ED5EYN53PFQB33QJ46KUG75I","bundle":"https://pith.science/pith/K2ED5EYN53PFQB33QJ46KUG75I/bundle.json","state":"https://pith.science/pith/K2ED5EYN53PFQB33QJ46KUG75I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K2ED5EYN53PFQB33QJ46KUG75I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:K2ED5EYN53PFQB33QJ46KUG75I","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":"db1afef73020033960bec34ff45243829e3b9b80460a9b314bdb849376bb2e48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-03-11T12:05:27Z","title_canon_sha256":"aa23758d19b44d34170bc9737099c4d6c3f4f9dd94a8a9dba98638326b1e1045"},"schema_version":"1.0","source":{"id":"1203.2325","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2325","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2325v4","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2325","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"K2ED5EYN53PF","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K2ED5EYN53PFQB33","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K2ED5EYN","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:5870fd5be3eade5494a26d3f2993a59a08adbca4ec02eec812e0e1e48af2178b","target":"graph","created_at":"2026-05-18T02:23:35Z","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":"Dropping tolerance criteria play a central role in Sparse Approximate Inverse preconditioning. Such criteria have received, however, little attention and have been treated heuristically in the following manner: If the size of an entry is below some empirically small positive quantity, then it is set to zero. The meaning of \"small\" is vague and has not been considered rigorously. It has not been clear how dropping tolerances affect the quality and effectiveness of a preconditioner $M$. In this paper, we focus on the adaptive Power Sparse Approximate Inverse algorithm and establish a mathematica","authors_text":"Qian Zhang, Zhongxiao Jia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-03-11T12:05:27Z","title":"Robust Dropping Criteria for F-norm Minimization Based Sparse Approximate Inverse Preconditioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2325","kind":"arxiv","version":4},"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:65e7c06b04876815f6074610d446ba8634c958b86cfda660dfa7d92d4622b701","target":"record","created_at":"2026-05-18T02:23:35Z","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":"db1afef73020033960bec34ff45243829e3b9b80460a9b314bdb849376bb2e48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-03-11T12:05:27Z","title_canon_sha256":"aa23758d19b44d34170bc9737099c4d6c3f4f9dd94a8a9dba98638326b1e1045"},"schema_version":"1.0","source":{"id":"1203.2325","kind":"arxiv","version":4}},"canonical_sha256":"56883e930deede58077b8279e550dfea162097246fa0792e076a37e7faa5851a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56883e930deede58077b8279e550dfea162097246fa0792e076a37e7faa5851a","first_computed_at":"2026-05-18T02:23:35.854593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:35.854593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BSerpfnqRmtmNi7eJiOo8q8nF2kjfJd2VgPeGaXJtg/OJc4HBYGKN9xRDGPpCrwUkJd+tHdYlcXOVl9bOHe+Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:35.855353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2325","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65e7c06b04876815f6074610d446ba8634c958b86cfda660dfa7d92d4622b701","sha256:5870fd5be3eade5494a26d3f2993a59a08adbca4ec02eec812e0e1e48af2178b"],"state_sha256":"ed685dc6ddf846e4e5598d00ca1b7aa7fa2aaf9c032d6067447dd1b794bdb114"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yWrQtXDKS3l3WXhNO6ZJ5xvtWj64Kxg0uekB+xWyHaifaJ/7lhk3Piv+42pE6aky2nuWklg9gZBVgLoNCAVGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:04:03.100045Z","bundle_sha256":"e3c58f99e21d6d4caf81742c050a70cb6daf31957d269794b613bdeed78ba219"}}