{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PDBV5L7W2SVVSMR4R7XLE4PP6B","short_pith_number":"pith:PDBV5L7W","canonical_record":{"source":{"id":"2605.17362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T10:07:23Z","cross_cats_sorted":[],"title_canon_sha256":"fa6a01babdc594e20c113fe3e99ea5b7d60580e1a746f30687eb41adea117d9d","abstract_canon_sha256":"11c3a73f5b54da6ab4d2d55c4949f809e51d272aeab6ff93e84cce5d69f0c6e4"},"schema_version":"1.0"},"canonical_sha256":"78c35eaff6d4ab59323c8feeb271eff06b1f389efda0bbf17dbcbbc3af9273fd","source":{"kind":"arxiv","id":"2605.17362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17362","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17362v1","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17362","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"PDBV5L7W2SVV","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_16","alias_value":"PDBV5L7W2SVVSMR4","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_8","alias_value":"PDBV5L7W","created_at":"2026-05-20T00:03:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PDBV5L7W2SVVSMR4R7XLE4PP6B","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T10:07:23Z","cross_cats_sorted":[],"title_canon_sha256":"fa6a01babdc594e20c113fe3e99ea5b7d60580e1a746f30687eb41adea117d9d","abstract_canon_sha256":"11c3a73f5b54da6ab4d2d55c4949f809e51d272aeab6ff93e84cce5d69f0c6e4"},"schema_version":"1.0"},"canonical_sha256":"78c35eaff6d4ab59323c8feeb271eff06b1f389efda0bbf17dbcbbc3af9273fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:54.418147Z","signature_b64":"q5jVrfuE08MIpPNURX2qUp4cYfkBoK25fQB/7Rr7n5uKtYDy4eoxMGaCRGekMSrbAyL8MQkD8dRBf9WRAqSrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78c35eaff6d4ab59323c8feeb271eff06b1f389efda0bbf17dbcbbc3af9273fd","last_reissued_at":"2026-05-20T00:03:54.417248Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:54.417248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17362","source_version":1,"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-05-20T00:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fE5ovAwnGdnRIK2seHtE6s3DQd5y64ptO6+BoQdEsn0hGuarFf0E/Cxiy+/d0M0cdZklZYaEhIGt82mOoOcnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:41:56.371984Z"},"content_sha256":"b0056e6199e5948841255ce1bba9d78cda5b8ac30ba094902d9a1139b65cd956","schema_version":"1.0","event_id":"sha256:b0056e6199e5948841255ce1bba9d78cda5b8ac30ba094902d9a1139b65cd956"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PDBV5L7W2SVVSMR4R7XLE4PP6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Huiyuan Li, Shuzi Niu, Tao Yuan, Wenjia Wu, Ziwei Li","submitted_at":"2026-05-17T10:07:23Z","abstract_excerpt":"Matrix reordering in large sparse solvers seeks a permutation that minimizes factorization fill-in to reduce memory and computation. Because the minimum fill-in ordering problem is NP-complete and fill-in is implicit in the sparsity pattern, graph-theoretic heuristics are used. Existing reinforcement learning methods either ignore sparsity patterns--missing the global fill-in--or lack local exact fill-in feedback. We propose a graph policy optimization method, modeling fill-ins from global and local views: both the policy and value networks use a multi-hop graph neural backbone to embed global"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17362","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.17362/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.785066Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.719779Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e2329a1d64337e65766263ec745788cd751629c5c7a7e665001ebe36b8bf94d8"},"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-05-20T00:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bs2q7D9FLr1FFTqaUEPvsPrbx2yu8etNUfZ2IiskXoT+Vce4OePMffLs3E64mmhfcdfLv9i1RHkl8ST6Yn9SCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:41:56.372752Z"},"content_sha256":"ee288730ce45f9c442d9e79e9384a9d0f7953d849ff4d801d46c4fda6e85d3e5","schema_version":"1.0","event_id":"sha256:ee288730ce45f9c442d9e79e9384a9d0f7953d849ff4d801d46c4fda6e85d3e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDBV5L7W2SVVSMR4R7XLE4PP6B/bundle.json","state_url":"https://pith.science/pith/PDBV5L7W2SVVSMR4R7XLE4PP6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDBV5L7W2SVVSMR4R7XLE4PP6B/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-05-22T04:41:56Z","links":{"resolver":"https://pith.science/pith/PDBV5L7W2SVVSMR4R7XLE4PP6B","bundle":"https://pith.science/pith/PDBV5L7W2SVVSMR4R7XLE4PP6B/bundle.json","state":"https://pith.science/pith/PDBV5L7W2SVVSMR4R7XLE4PP6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDBV5L7W2SVVSMR4R7XLE4PP6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PDBV5L7W2SVVSMR4R7XLE4PP6B","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":"11c3a73f5b54da6ab4d2d55c4949f809e51d272aeab6ff93e84cce5d69f0c6e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T10:07:23Z","title_canon_sha256":"fa6a01babdc594e20c113fe3e99ea5b7d60580e1a746f30687eb41adea117d9d"},"schema_version":"1.0","source":{"id":"2605.17362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17362","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17362v1","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17362","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"PDBV5L7W2SVV","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_16","alias_value":"PDBV5L7W2SVVSMR4","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_8","alias_value":"PDBV5L7W","created_at":"2026-05-20T00:03:54Z"}],"graph_snapshots":[{"event_id":"sha256:ee288730ce45f9c442d9e79e9384a9d0f7953d849ff4d801d46c4fda6e85d3e5","target":"graph","created_at":"2026-05-20T00:03:54Z","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":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.785066Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.719779Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17362/integrity.json","findings":[],"snapshot_sha256":"e2329a1d64337e65766263ec745788cd751629c5c7a7e665001ebe36b8bf94d8","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Matrix reordering in large sparse solvers seeks a permutation that minimizes factorization fill-in to reduce memory and computation. Because the minimum fill-in ordering problem is NP-complete and fill-in is implicit in the sparsity pattern, graph-theoretic heuristics are used. Existing reinforcement learning methods either ignore sparsity patterns--missing the global fill-in--or lack local exact fill-in feedback. We propose a graph policy optimization method, modeling fill-ins from global and local views: both the policy and value networks use a multi-hop graph neural backbone to embed global","authors_text":"Huiyuan Li, Shuzi Niu, Tao Yuan, Wenjia Wu, Ziwei Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17362","kind":"arxiv","version":1},"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:b0056e6199e5948841255ce1bba9d78cda5b8ac30ba094902d9a1139b65cd956","target":"record","created_at":"2026-05-20T00:03:54Z","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":"11c3a73f5b54da6ab4d2d55c4949f809e51d272aeab6ff93e84cce5d69f0c6e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T10:07:23Z","title_canon_sha256":"fa6a01babdc594e20c113fe3e99ea5b7d60580e1a746f30687eb41adea117d9d"},"schema_version":"1.0","source":{"id":"2605.17362","kind":"arxiv","version":1}},"canonical_sha256":"78c35eaff6d4ab59323c8feeb271eff06b1f389efda0bbf17dbcbbc3af9273fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78c35eaff6d4ab59323c8feeb271eff06b1f389efda0bbf17dbcbbc3af9273fd","first_computed_at":"2026-05-20T00:03:54.417248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:54.417248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q5jVrfuE08MIpPNURX2qUp4cYfkBoK25fQB/7Rr7n5uKtYDy4eoxMGaCRGekMSrbAyL8MQkD8dRBf9WRAqSrDg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:54.418147Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0056e6199e5948841255ce1bba9d78cda5b8ac30ba094902d9a1139b65cd956","sha256:ee288730ce45f9c442d9e79e9384a9d0f7953d849ff4d801d46c4fda6e85d3e5"],"state_sha256":"7cfa2fba353bdaafbcbe7d8bcc01f5f0186ed759e2992624b69bfa1027cfd01d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3NaivQ/xX+8Az7qfuoByyTAhIKecSq6NJRu8QqV9qr0zUAZczxKMbCbaZqjeykKMKIWjRib4yq/0RedOPBkBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T04:41:56.376815Z","bundle_sha256":"112bfe29c38c46ec27b4bc3a90e44f97d6f5848eb6084db5b8efc96c900db8f6"}}