{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:234RKAN6MAXILQ3RLOIWOOKOO7","short_pith_number":"pith:234RKAN6","schema_version":"1.0","canonical_sha256":"d6f91501be602e85c3715b9167394e77cec7f871806c88ec591ce113fa931911","source":{"kind":"arxiv","id":"2501.16130","version":2},"attestation_state":"computed","paper":{"title":"ReFill: Reinforcement Learning for Fill-In Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elfarouk Harb, Ho Shan Lam","submitted_at":"2025-01-27T15:20:41Z","abstract_excerpt":"Efficiently solving sparse linear systems $Ax=b$, where $A$ is a large, sparse, symmetric positive semi-definite matrix, is a core challenge in scientific computing, machine learning, and optimization. A major bottleneck in Gaussian elimination for these systems is fill-in, the creation of non-zero entries that increase memory and computational cost. Minimizing fill-in is NP-hard, and existing heuristics like Minimum Degree and Nested Dissection offer limited adaptability across diverse problem instances.\n  We introduce \\textit{ReFill}, a reinforcement learning framework enhanced by Graph Neur"},"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":"2501.16130","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-27T15:20:41Z","cross_cats_sorted":[],"title_canon_sha256":"03c7b8d14c981a9da179b0d9452e44e56fcfca651b3181fb48c241decb0a2311","abstract_canon_sha256":"13258e5a2367b9857c1df7639c57d99f91c19fb33d1686d7febc40123e6440db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:02.919852Z","signature_b64":"XBW8BJKEwYuZVXXiOwdFJBD/jTZzp3QvsDvT1PUsI8UaP0LovDzYtPGYrwxDPwg75pT8hTspcHDs3rLHq376Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6f91501be602e85c3715b9167394e77cec7f871806c88ec591ce113fa931911","last_reissued_at":"2026-07-05T10:07:02.919435Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:02.919435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReFill: Reinforcement Learning for Fill-In Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elfarouk Harb, Ho Shan Lam","submitted_at":"2025-01-27T15:20:41Z","abstract_excerpt":"Efficiently solving sparse linear systems $Ax=b$, where $A$ is a large, sparse, symmetric positive semi-definite matrix, is a core challenge in scientific computing, machine learning, and optimization. A major bottleneck in Gaussian elimination for these systems is fill-in, the creation of non-zero entries that increase memory and computational cost. Minimizing fill-in is NP-hard, and existing heuristics like Minimum Degree and Nested Dissection offer limited adaptability across diverse problem instances.\n  We introduce \\textit{ReFill}, a reinforcement learning framework enhanced by Graph Neur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16130","kind":"arxiv","version":2},"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/2501.16130/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":"2501.16130","created_at":"2026-07-05T10:07:02.919492+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.16130v2","created_at":"2026-07-05T10:07:02.919492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16130","created_at":"2026-07-05T10:07:02.919492+00:00"},{"alias_kind":"pith_short_12","alias_value":"234RKAN6MAXI","created_at":"2026-07-05T10:07:02.919492+00:00"},{"alias_kind":"pith_short_16","alias_value":"234RKAN6MAXILQ3R","created_at":"2026-07-05T10:07:02.919492+00:00"},{"alias_kind":"pith_short_8","alias_value":"234RKAN6","created_at":"2026-07-05T10:07:02.919492+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/234RKAN6MAXILQ3RLOIWOOKOO7","json":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7.json","graph_json":"https://pith.science/api/pith-number/234RKAN6MAXILQ3RLOIWOOKOO7/graph.json","events_json":"https://pith.science/api/pith-number/234RKAN6MAXILQ3RLOIWOOKOO7/events.json","paper":"https://pith.science/paper/234RKAN6"},"agent_actions":{"view_html":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7","download_json":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7.json","view_paper":"https://pith.science/paper/234RKAN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.16130&json=true","fetch_graph":"https://pith.science/api/pith-number/234RKAN6MAXILQ3RLOIWOOKOO7/graph.json","fetch_events":"https://pith.science/api/pith-number/234RKAN6MAXILQ3RLOIWOOKOO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7/action/storage_attestation","attest_author":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7/action/author_attestation","sign_citation":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7/action/citation_signature","submit_replication":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7/action/replication_record"}},"created_at":"2026-07-05T10:07:02.919492+00:00","updated_at":"2026-07-05T10:07:02.919492+00:00"}