{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QSZMITHIMC6DAVPRMODM7SZ6JJ","short_pith_number":"pith:QSZMITHI","schema_version":"1.0","canonical_sha256":"84b2c44ce860bc3055f16386cfcb3e4a53d6a74d8ad9a01de50db82ed360d7cb","source":{"kind":"arxiv","id":"2605.17339","version":1},"attestation_state":"computed","paper":{"title":"Bridging the Gap between Sparse Matrix Reordering and Factorization: A Deep Learning Framework for Fill-in Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Huiyuan Li, Shuzi Niu, Tao Yuan, Ziwei Li","submitted_at":"2026-05-17T09:15:42Z","abstract_excerpt":"Sparse matrix reordering can significantly reduce the fill-in during matrix factorization, thereby decreasing the computational and storage requirements in sparse matrix computations. Finding a minimal fill-in ordering is known to be an NP-hard problem. Moreover, there is a paradox: matrix reordering is applied before matrix factorization, but fill-ins that matrix reordering methods aim at are generated from matrix factorization. To bridge the gap between reordering and factorization, we propose a deep learning framework to minimize a fill-in surrogate function based on spectral embedding. Fir"},"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":"2605.17339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T09:15:42Z","cross_cats_sorted":[],"title_canon_sha256":"1e72ad5a73697e1c8ea7d2619ddfd1a9900f1a6a19054d0cde81af275a6ebced","abstract_canon_sha256":"85bb1b9cda1242738fbd82bf016c0509c8427f7d6d3f2042a5bc743b4967ebe7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:53.012418Z","signature_b64":"qx5Jsn7uxrbCHcW0ghqGd36G7vh88YDgmqEf75HYhtw77RSDb2+m0KEM5grOcJMyKV/K5c+8OmOuEaImkOJ1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84b2c44ce860bc3055f16386cfcb3e4a53d6a74d8ad9a01de50db82ed360d7cb","last_reissued_at":"2026-05-20T00:03:53.011548Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:53.011548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bridging the Gap between Sparse Matrix Reordering and Factorization: A Deep Learning Framework for Fill-in Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Huiyuan Li, Shuzi Niu, Tao Yuan, Ziwei Li","submitted_at":"2026-05-17T09:15:42Z","abstract_excerpt":"Sparse matrix reordering can significantly reduce the fill-in during matrix factorization, thereby decreasing the computational and storage requirements in sparse matrix computations. Finding a minimal fill-in ordering is known to be an NP-hard problem. Moreover, there is a paradox: matrix reordering is applied before matrix factorization, but fill-ins that matrix reordering methods aim at are generated from matrix factorization. To bridge the gap between reordering and factorization, we propose a deep learning framework to minimize a fill-in surrogate function based on spectral embedding. Fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17339","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/2605.17339/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.803283Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.738471Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"74b537487fcbd653594085f6a878c9757106e2f67aee6eca8a042281f6b034fe"},"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":"2605.17339","created_at":"2026-05-20T00:03:53.011696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17339v1","created_at":"2026-05-20T00:03:53.011696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17339","created_at":"2026-05-20T00:03:53.011696+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSZMITHIMC6D","created_at":"2026-05-20T00:03:53.011696+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSZMITHIMC6DAVPR","created_at":"2026-05-20T00:03:53.011696+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSZMITHI","created_at":"2026-05-20T00:03:53.011696+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/QSZMITHIMC6DAVPRMODM7SZ6JJ","json":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ.json","graph_json":"https://pith.science/api/pith-number/QSZMITHIMC6DAVPRMODM7SZ6JJ/graph.json","events_json":"https://pith.science/api/pith-number/QSZMITHIMC6DAVPRMODM7SZ6JJ/events.json","paper":"https://pith.science/paper/QSZMITHI"},"agent_actions":{"view_html":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ","download_json":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ.json","view_paper":"https://pith.science/paper/QSZMITHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17339&json=true","fetch_graph":"https://pith.science/api/pith-number/QSZMITHIMC6DAVPRMODM7SZ6JJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QSZMITHIMC6DAVPRMODM7SZ6JJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ/action/storage_attestation","attest_author":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ/action/author_attestation","sign_citation":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ/action/citation_signature","submit_replication":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ/action/replication_record"}},"created_at":"2026-05-20T00:03:53.011696+00:00","updated_at":"2026-05-20T00:03:53.011696+00:00"}