{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:234RKAN6MAXILQ3RLOIWOOKOO7","short_pith_number":"pith:234RKAN6","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"},"canonical_sha256":"d6f91501be602e85c3715b9167394e77cec7f871806c88ec591ce113fa931911","source":{"kind":"arxiv","id":"2501.16130","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.16130","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"arxiv_version","alias_value":"2501.16130v2","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16130","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_12","alias_value":"234RKAN6MAXI","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_16","alias_value":"234RKAN6MAXILQ3R","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_8","alias_value":"234RKAN6","created_at":"2026-07-05T10:07:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:234RKAN6MAXILQ3RLOIWOOKOO7","target":"record","payload":{"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"},"canonical_sha256":"d6f91501be602e85c3715b9167394e77cec7f871806c88ec591ce113fa931911","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"},"source_kind":"arxiv","source_id":"2501.16130","source_version":2,"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-07-05T10:07:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HClSQtgWvs3ef2MqyK1ZeVxTD8nDHFwqskijNeJCpaVzEZgB5s48SnD15/xlEgI7l58uW/+rPEW5kEvxzy9BAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:42:14.645165Z"},"content_sha256":"f8d0fdf5254d2cc513a2fb3fb13cfda882dfad5201f929eb55010d3d14cbe65a","schema_version":"1.0","event_id":"sha256:f8d0fdf5254d2cc513a2fb3fb13cfda882dfad5201f929eb55010d3d14cbe65a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:234RKAN6MAXILQ3RLOIWOOKOO7","target":"graph","payload":{"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"},"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-07-05T10:07:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SEYBFNNFnWDs251WRgxLYiV9of3kVabOedagc1OY065X5BZrSLdNcT0knJxbDS+MmXeckbITwK99if1OiHhLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:42:14.645714Z"},"content_sha256":"b4486159d6a3f1ad534e7e4ad1306ab74b80afbc98614222d43ee96fdf560d54","schema_version":"1.0","event_id":"sha256:b4486159d6a3f1ad534e7e4ad1306ab74b80afbc98614222d43ee96fdf560d54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7/bundle.json","state_url":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/234RKAN6MAXILQ3RLOIWOOKOO7/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-08-11T17:42:14Z","links":{"resolver":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7","bundle":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7/bundle.json","state":"https://pith.science/pith/234RKAN6MAXILQ3RLOIWOOKOO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/234RKAN6MAXILQ3RLOIWOOKOO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:234RKAN6MAXILQ3RLOIWOOKOO7","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":"13258e5a2367b9857c1df7639c57d99f91c19fb33d1686d7febc40123e6440db","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-27T15:20:41Z","title_canon_sha256":"03c7b8d14c981a9da179b0d9452e44e56fcfca651b3181fb48c241decb0a2311"},"schema_version":"1.0","source":{"id":"2501.16130","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.16130","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"arxiv_version","alias_value":"2501.16130v2","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16130","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_12","alias_value":"234RKAN6MAXI","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_16","alias_value":"234RKAN6MAXILQ3R","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_8","alias_value":"234RKAN6","created_at":"2026-07-05T10:07:02Z"}],"graph_snapshots":[{"event_id":"sha256:b4486159d6a3f1ad534e7e4ad1306ab74b80afbc98614222d43ee96fdf560d54","target":"graph","created_at":"2026-07-05T10:07:02Z","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/2501.16130/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Elfarouk Harb, Ho Shan Lam","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16130","kind":"arxiv","version":2},"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:f8d0fdf5254d2cc513a2fb3fb13cfda882dfad5201f929eb55010d3d14cbe65a","target":"record","created_at":"2026-07-05T10:07:02Z","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":"13258e5a2367b9857c1df7639c57d99f91c19fb33d1686d7febc40123e6440db","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-27T15:20:41Z","title_canon_sha256":"03c7b8d14c981a9da179b0d9452e44e56fcfca651b3181fb48c241decb0a2311"},"schema_version":"1.0","source":{"id":"2501.16130","kind":"arxiv","version":2}},"canonical_sha256":"d6f91501be602e85c3715b9167394e77cec7f871806c88ec591ce113fa931911","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6f91501be602e85c3715b9167394e77cec7f871806c88ec591ce113fa931911","first_computed_at":"2026-07-05T10:07:02.919435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:07:02.919435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XBW8BJKEwYuZVXXiOwdFJBD/jTZzp3QvsDvT1PUsI8UaP0LovDzYtPGYrwxDPwg75pT8hTspcHDs3rLHq376Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:07:02.919852Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.16130","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8d0fdf5254d2cc513a2fb3fb13cfda882dfad5201f929eb55010d3d14cbe65a","sha256:b4486159d6a3f1ad534e7e4ad1306ab74b80afbc98614222d43ee96fdf560d54"],"state_sha256":"e7a4bd13ea5be0778c179482db925ca94762ed264ba7f45d2c8fd61227a25014"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMyWCy7Zfib5MZ7zQB7K+8mZJKQMCsLWnW9jqWMGQYSw9Rma+rrsJaQagZVsnWScLePiWjuOF+SPyeTA/1NhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T17:42:14.650544Z","bundle_sha256":"ab388472fe82f4c0d1736ef03b19e3b4ccb10797ae2b091677661033fa38d5c9"}}