{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KWG3VENMC436JVEULYRPSW35SR","short_pith_number":"pith:KWG3VENM","canonical_record":{"source":{"id":"2603.10277","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-10T23:38:48Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"0d1493176696133d377eb2c7c8e107aa9134d36cfa17e3aae507ca83fce38b4b","abstract_canon_sha256":"173e2332e8f8352f9559374575ea53602fb44df588cb6ed982b90ff942f1594e"},"schema_version":"1.0"},"canonical_sha256":"558dba91ac1737e4d4945e22f95b7d94694c1be4756ada217368ed419e2f64cb","source":{"kind":"arxiv","id":"2603.10277","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.10277","created_at":"2026-06-25T01:18:37Z"},{"alias_kind":"arxiv_version","alias_value":"2603.10277v3","created_at":"2026-06-25T01:18:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.10277","created_at":"2026-06-25T01:18:37Z"},{"alias_kind":"pith_short_12","alias_value":"KWG3VENMC436","created_at":"2026-06-25T01:18:37Z"},{"alias_kind":"pith_short_16","alias_value":"KWG3VENMC436JVEU","created_at":"2026-06-25T01:18:37Z"},{"alias_kind":"pith_short_8","alias_value":"KWG3VENM","created_at":"2026-06-25T01:18:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KWG3VENMC436JVEULYRPSW35SR","target":"record","payload":{"canonical_record":{"source":{"id":"2603.10277","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-10T23:38:48Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"0d1493176696133d377eb2c7c8e107aa9134d36cfa17e3aae507ca83fce38b4b","abstract_canon_sha256":"173e2332e8f8352f9559374575ea53602fb44df588cb6ed982b90ff942f1594e"},"schema_version":"1.0"},"canonical_sha256":"558dba91ac1737e4d4945e22f95b7d94694c1be4756ada217368ed419e2f64cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:37.254248Z","signature_b64":"l5A6MLTeUyqCg4yUBrhgz3V17Kp20j0HlFzo5sJNGnfKhMNHCGyzUy7MGwHxw8YRVZBvK+AaEOnrzxvLlVtaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"558dba91ac1737e4d4945e22f95b7d94694c1be4756ada217368ed419e2f64cb","last_reissued_at":"2026-06-25T01:18:37.253900Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:37.253900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.10277","source_version":3,"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-06-25T01:18:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8OFIP6Pvvk1eiZ7GfRZuikaHapL6bb9t7eo+l+/F4VJtT2k3hPd3pjm9ZH4sTAdxz0I5qHWQjnS1pCozC0kHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:48:35.378993Z"},"content_sha256":"e10faa2f555100101b76ea014824ea24ebb99e6327d8f4d27b585da906e870d2","schema_version":"1.0","event_id":"sha256:e10faa2f555100101b76ea014824ea24ebb99e6327d8f4d27b585da906e870d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KWG3VENMC436JVEULYRPSW35SR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimating condition number with Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Erin Carson, Xinye Chen","submitted_at":"2026-03-10T23:38:48Z","abstract_excerpt":"In this paper, we propose a fast method for estimating the condition number of sparse matrices using graph neural networks (GNNs). For efficient deployment of GNNs, we introduce a graph feature construction with $\\mathrm{O}(\\mathrm{nnz} + n)$ complexity, where $\\mathrm{nnz}$ is the number of non-zero elements in the matrix and $n$ denotes the matrix dimension. We propose two schemes for estimating the matrix condition number using GNNs; One follows by decomposing the condition number and predicts the relatively more computationally intensive part $\\|\\mathbf{A}^{-1}\\|$, without explicitly formi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.10277","kind":"arxiv","version":3},"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/2603.10277/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"},"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-06-25T01:18:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VE++edgl+m4NFKH7Szsa6gX+/IUAxfJ+KpN3KbqASUHEmX8wI1gpbAwH1CXwu/Zf56/nf8TElDIBbxVvU7hqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:48:35.379393Z"},"content_sha256":"1e5070ffbbf8dbcfc87b48584d7f6f6154a789f053fc827fbf01d8b944f904a2","schema_version":"1.0","event_id":"sha256:1e5070ffbbf8dbcfc87b48584d7f6f6154a789f053fc827fbf01d8b944f904a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWG3VENMC436JVEULYRPSW35SR/bundle.json","state_url":"https://pith.science/pith/KWG3VENMC436JVEULYRPSW35SR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWG3VENMC436JVEULYRPSW35SR/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-29T06:48:35Z","links":{"resolver":"https://pith.science/pith/KWG3VENMC436JVEULYRPSW35SR","bundle":"https://pith.science/pith/KWG3VENMC436JVEULYRPSW35SR/bundle.json","state":"https://pith.science/pith/KWG3VENMC436JVEULYRPSW35SR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWG3VENMC436JVEULYRPSW35SR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KWG3VENMC436JVEULYRPSW35SR","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":"173e2332e8f8352f9559374575ea53602fb44df588cb6ed982b90ff942f1594e","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-10T23:38:48Z","title_canon_sha256":"0d1493176696133d377eb2c7c8e107aa9134d36cfa17e3aae507ca83fce38b4b"},"schema_version":"1.0","source":{"id":"2603.10277","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.10277","created_at":"2026-06-25T01:18:37Z"},{"alias_kind":"arxiv_version","alias_value":"2603.10277v3","created_at":"2026-06-25T01:18:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.10277","created_at":"2026-06-25T01:18:37Z"},{"alias_kind":"pith_short_12","alias_value":"KWG3VENMC436","created_at":"2026-06-25T01:18:37Z"},{"alias_kind":"pith_short_16","alias_value":"KWG3VENMC436JVEU","created_at":"2026-06-25T01:18:37Z"},{"alias_kind":"pith_short_8","alias_value":"KWG3VENM","created_at":"2026-06-25T01:18:37Z"}],"graph_snapshots":[{"event_id":"sha256:1e5070ffbbf8dbcfc87b48584d7f6f6154a789f053fc827fbf01d8b944f904a2","target":"graph","created_at":"2026-06-25T01:18:37Z","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/2603.10277/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a fast method for estimating the condition number of sparse matrices using graph neural networks (GNNs). For efficient deployment of GNNs, we introduce a graph feature construction with $\\mathrm{O}(\\mathrm{nnz} + n)$ complexity, where $\\mathrm{nnz}$ is the number of non-zero elements in the matrix and $n$ denotes the matrix dimension. We propose two schemes for estimating the matrix condition number using GNNs; One follows by decomposing the condition number and predicts the relatively more computationally intensive part $\\|\\mathbf{A}^{-1}\\|$, without explicitly formi","authors_text":"Erin Carson, Xinye Chen","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-10T23:38:48Z","title":"Estimating condition number with Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.10277","kind":"arxiv","version":3},"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:e10faa2f555100101b76ea014824ea24ebb99e6327d8f4d27b585da906e870d2","target":"record","created_at":"2026-06-25T01:18:37Z","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":"173e2332e8f8352f9559374575ea53602fb44df588cb6ed982b90ff942f1594e","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-10T23:38:48Z","title_canon_sha256":"0d1493176696133d377eb2c7c8e107aa9134d36cfa17e3aae507ca83fce38b4b"},"schema_version":"1.0","source":{"id":"2603.10277","kind":"arxiv","version":3}},"canonical_sha256":"558dba91ac1737e4d4945e22f95b7d94694c1be4756ada217368ed419e2f64cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"558dba91ac1737e4d4945e22f95b7d94694c1be4756ada217368ed419e2f64cb","first_computed_at":"2026-06-25T01:18:37.253900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:18:37.253900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l5A6MLTeUyqCg4yUBrhgz3V17Kp20j0HlFzo5sJNGnfKhMNHCGyzUy7MGwHxw8YRVZBvK+AaEOnrzxvLlVtaCA==","signature_status":"signed_v1","signed_at":"2026-06-25T01:18:37.254248Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.10277","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e10faa2f555100101b76ea014824ea24ebb99e6327d8f4d27b585da906e870d2","sha256:1e5070ffbbf8dbcfc87b48584d7f6f6154a789f053fc827fbf01d8b944f904a2"],"state_sha256":"b49647e7a39ff0f49c5cd3cbf4e073dad4f86a9b891d485c1fe02335f53f0286"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bfBTEpNdYEh/uYrWjKWT5fyd3ZOS1D+9YFCGf3xzWUnKPK3GsmtIppwH4I5VxCxPK4fs3Q5NPvSkL8yNyK79Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T06:48:35.381400Z","bundle_sha256":"be229a45ad0e62ddebd1827986cd9a6c424a3fdb6e8e9569b9d67590b3f07b4e"}}