{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7A3UBCP4DYF74MHEWY3ZXKKRVZ","short_pith_number":"pith:7A3UBCP4","schema_version":"1.0","canonical_sha256":"f8374089fc1e0bfe30e4b6379ba951ae7e2775c2c922e59623fc97a6db3b19af","source":{"kind":"arxiv","id":"2606.22742","version":1},"attestation_state":"computed","paper":{"title":"Factored Sparse Approximate Inverse Preconditioning via Spectral Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Francesco Brarda, Rui Peng Li, Tianshi Xu, Vassilis Kalantzis, Yuanzhe Xi","submitted_at":"2026-06-22T01:06:10Z","abstract_excerpt":"In this paper, we study value selection for fixed-pattern factorized sparse approximate inverse preconditioners. Given a prescribed sparsity pattern for a factor $G,$ we choose its admissible entries by optimizing spectral objectives of the congruent preconditioned operator $P(G)=GAG^T.$ This differs from classical sparse approximate inverse and FSAI constructions, which choose entries through algebraic Frobenius-residual criteria. For symmetric positive definite systems, the spectral target is a cluster near $+1.$ For symmetric indefinite systems, where congruence preserves inertia, we introd"},"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":"2606.22742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-06-22T01:06:10Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"4e060acc4029a98cd12b61b92302e558f94d5101b249852d1df76e245af5b7ce","abstract_canon_sha256":"e731c88f55e620255b1b1223b80bd1f6a761b0f665e2397119dc99d22e57d616"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:46.085393Z","signature_b64":"3rlsnzklff2ONsYs9S4ev/wejNVV8mRxEy3Orp22bPf93F2D/YaX7MFcKD4mPDU5ph31VMlnehv/OtLmSbs9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8374089fc1e0bfe30e4b6379ba951ae7e2775c2c922e59623fc97a6db3b19af","last_reissued_at":"2026-06-23T02:13:46.085021Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:46.085021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factored Sparse Approximate Inverse Preconditioning via Spectral Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Francesco Brarda, Rui Peng Li, Tianshi Xu, Vassilis Kalantzis, Yuanzhe Xi","submitted_at":"2026-06-22T01:06:10Z","abstract_excerpt":"In this paper, we study value selection for fixed-pattern factorized sparse approximate inverse preconditioners. Given a prescribed sparsity pattern for a factor $G,$ we choose its admissible entries by optimizing spectral objectives of the congruent preconditioned operator $P(G)=GAG^T.$ This differs from classical sparse approximate inverse and FSAI constructions, which choose entries through algebraic Frobenius-residual criteria. For symmetric positive definite systems, the spectral target is a cluster near $+1.$ For symmetric indefinite systems, where congruence preserves inertia, we introd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22742","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.22742/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.22742","created_at":"2026-06-23T02:13:46.085083+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22742v1","created_at":"2026-06-23T02:13:46.085083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22742","created_at":"2026-06-23T02:13:46.085083+00:00"},{"alias_kind":"pith_short_12","alias_value":"7A3UBCP4DYF7","created_at":"2026-06-23T02:13:46.085083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7A3UBCP4DYF74MHE","created_at":"2026-06-23T02:13:46.085083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7A3UBCP4","created_at":"2026-06-23T02:13:46.085083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7A3UBCP4DYF74MHEWY3ZXKKRVZ","json":"https://pith.science/pith/7A3UBCP4DYF74MHEWY3ZXKKRVZ.json","graph_json":"https://pith.science/api/pith-number/7A3UBCP4DYF74MHEWY3ZXKKRVZ/graph.json","events_json":"https://pith.science/api/pith-number/7A3UBCP4DYF74MHEWY3ZXKKRVZ/events.json","paper":"https://pith.science/paper/7A3UBCP4"},"agent_actions":{"view_html":"https://pith.science/pith/7A3UBCP4DYF74MHEWY3ZXKKRVZ","download_json":"https://pith.science/pith/7A3UBCP4DYF74MHEWY3ZXKKRVZ.json","view_paper":"https://pith.science/paper/7A3UBCP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22742&json=true","fetch_graph":"https://pith.science/api/pith-number/7A3UBCP4DYF74MHEWY3ZXKKRVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/7A3UBCP4DYF74MHEWY3ZXKKRVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7A3UBCP4DYF74MHEWY3ZXKKRVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7A3UBCP4DYF74MHEWY3ZXKKRVZ/action/storage_attestation","attest_author":"https://pith.science/pith/7A3UBCP4DYF74MHEWY3ZXKKRVZ/action/author_attestation","sign_citation":"https://pith.science/pith/7A3UBCP4DYF74MHEWY3ZXKKRVZ/action/citation_signature","submit_replication":"https://pith.science/pith/7A3UBCP4DYF74MHEWY3ZXKKRVZ/action/replication_record"}},"created_at":"2026-06-23T02:13:46.085083+00:00","updated_at":"2026-06-23T02:13:46.085083+00:00"}