{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SDHR6CSUXBE26FW3SCCFW6CLNC","short_pith_number":"pith:SDHR6CSU","canonical_record":{"source":{"id":"2605.17403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T11:54:12Z","cross_cats_sorted":[],"title_canon_sha256":"4842438c0c686eb15539c2572922c6f5ef0730dad600547825a0e79ba46b0dab","abstract_canon_sha256":"381d5eb2f9998335e6224a3d406e3efa4302e43681c43f927eb22490fe65879a"},"schema_version":"1.0"},"canonical_sha256":"90cf1f0a54b849af16db90845b784b68ab09932d22e3410146061e286de368e3","source":{"kind":"arxiv","id":"2605.17403","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17403","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17403v1","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17403","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"SDHR6CSUXBE2","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"pith_short_16","alias_value":"SDHR6CSUXBE26FW3","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"pith_short_8","alias_value":"SDHR6CSU","created_at":"2026-05-20T00:03:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SDHR6CSUXBE26FW3SCCFW6CLNC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T11:54:12Z","cross_cats_sorted":[],"title_canon_sha256":"4842438c0c686eb15539c2572922c6f5ef0730dad600547825a0e79ba46b0dab","abstract_canon_sha256":"381d5eb2f9998335e6224a3d406e3efa4302e43681c43f927eb22490fe65879a"},"schema_version":"1.0"},"canonical_sha256":"90cf1f0a54b849af16db90845b784b68ab09932d22e3410146061e286de368e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:56.707343Z","signature_b64":"8T3KAvpHPt00qAM7t8yp707udwH4ufmY39R+m+QpZ6NgUE5WzpT550mx5RW7JfQneUn7WHHf8/UYTWRvZO3eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90cf1f0a54b849af16db90845b784b68ab09932d22e3410146061e286de368e3","last_reissued_at":"2026-05-20T00:03:56.706503Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:56.706503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17403","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:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjFLiYRdUp2VPNMoNyWBlp3nMpbTQMD5xeI/k7/KsuLLFsbVJC6Br//D+uL9xruk4nPQho7jL6k9OaQ7QqtiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:29:35.606106Z"},"content_sha256":"9c2dd35b45d0be448721e3b6e974719fc2a0552fbcff5f54e2cb82ad027587a7","schema_version":"1.0","event_id":"sha256:9c2dd35b45d0be448721e3b6e974719fc2a0552fbcff5f54e2cb82ad027587a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SDHR6CSUXBE26FW3SCCFW6CLNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-Supervised Learning for Sparse Matrix Reordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fangfang Liu, Huiyuan Li, Shuzi Niu, Tao Yuan, Wenjia Wu, Ziwei Li","submitted_at":"2026-05-17T11:54:12Z","abstract_excerpt":"Rearranging the rows or columns of a sparse matrix using an appropriate ordering can significantly reduce fill-ins, i.e., new nonzeros introduced during matrix factorization, decreasing memory usage and runtime. However, finding an ordering that minimizes fill-ins is NP-complete. Existing approaches, including graph-theoretic and deep learning methods, rely on surrogate objectives without theoretical guarantees. The Fill-Path Theorem reveals a direct and intrinsic relationship between fill-in generation and the sparse structure of the matrix as path triplet inequalities. Here we first employ a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17403","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.17403/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.752176Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.695257Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"2d20c41972e1c84cb7fa13a9d07ea51fa6bb95c98dd4a2348f2097e94d52b652"},"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:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdLBC4DcAiczKz8lRZQG5y+NlIWf+89JLRzDiLxYQR4/nBHU/aAYWN+BJEnVn2s6gwAsGxlbaWAzhCasL8G8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:29:35.606881Z"},"content_sha256":"31cad0576d7587e8474afde29e05c38670701e3b06c20ad2f7666a8838f3b08c","schema_version":"1.0","event_id":"sha256:31cad0576d7587e8474afde29e05c38670701e3b06c20ad2f7666a8838f3b08c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDHR6CSUXBE26FW3SCCFW6CLNC/bundle.json","state_url":"https://pith.science/pith/SDHR6CSUXBE26FW3SCCFW6CLNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDHR6CSUXBE26FW3SCCFW6CLNC/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:29:35Z","links":{"resolver":"https://pith.science/pith/SDHR6CSUXBE26FW3SCCFW6CLNC","bundle":"https://pith.science/pith/SDHR6CSUXBE26FW3SCCFW6CLNC/bundle.json","state":"https://pith.science/pith/SDHR6CSUXBE26FW3SCCFW6CLNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDHR6CSUXBE26FW3SCCFW6CLNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SDHR6CSUXBE26FW3SCCFW6CLNC","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":"381d5eb2f9998335e6224a3d406e3efa4302e43681c43f927eb22490fe65879a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T11:54:12Z","title_canon_sha256":"4842438c0c686eb15539c2572922c6f5ef0730dad600547825a0e79ba46b0dab"},"schema_version":"1.0","source":{"id":"2605.17403","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17403","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17403v1","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17403","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"SDHR6CSUXBE2","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"pith_short_16","alias_value":"SDHR6CSUXBE26FW3","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"pith_short_8","alias_value":"SDHR6CSU","created_at":"2026-05-20T00:03:56Z"}],"graph_snapshots":[{"event_id":"sha256:31cad0576d7587e8474afde29e05c38670701e3b06c20ad2f7666a8838f3b08c","target":"graph","created_at":"2026-05-20T00:03:56Z","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.752176Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.695257Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17403/integrity.json","findings":[],"snapshot_sha256":"2d20c41972e1c84cb7fa13a9d07ea51fa6bb95c98dd4a2348f2097e94d52b652","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Rearranging the rows or columns of a sparse matrix using an appropriate ordering can significantly reduce fill-ins, i.e., new nonzeros introduced during matrix factorization, decreasing memory usage and runtime. However, finding an ordering that minimizes fill-ins is NP-complete. Existing approaches, including graph-theoretic and deep learning methods, rely on surrogate objectives without theoretical guarantees. The Fill-Path Theorem reveals a direct and intrinsic relationship between fill-in generation and the sparse structure of the matrix as path triplet inequalities. Here we first employ a","authors_text":"Fangfang Liu, 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-17T11:54:12Z","title":"Self-Supervised Learning for Sparse Matrix Reordering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17403","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:9c2dd35b45d0be448721e3b6e974719fc2a0552fbcff5f54e2cb82ad027587a7","target":"record","created_at":"2026-05-20T00:03:56Z","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":"381d5eb2f9998335e6224a3d406e3efa4302e43681c43f927eb22490fe65879a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T11:54:12Z","title_canon_sha256":"4842438c0c686eb15539c2572922c6f5ef0730dad600547825a0e79ba46b0dab"},"schema_version":"1.0","source":{"id":"2605.17403","kind":"arxiv","version":1}},"canonical_sha256":"90cf1f0a54b849af16db90845b784b68ab09932d22e3410146061e286de368e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90cf1f0a54b849af16db90845b784b68ab09932d22e3410146061e286de368e3","first_computed_at":"2026-05-20T00:03:56.706503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:56.706503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8T3KAvpHPt00qAM7t8yp707udwH4ufmY39R+m+QpZ6NgUE5WzpT550mx5RW7JfQneUn7WHHf8/UYTWRvZO3eCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:56.707343Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17403","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c2dd35b45d0be448721e3b6e974719fc2a0552fbcff5f54e2cb82ad027587a7","sha256:31cad0576d7587e8474afde29e05c38670701e3b06c20ad2f7666a8838f3b08c"],"state_sha256":"6ecb52662fe17fc307b744e806abd029ea8d38fc29ed762ac2d529eff648d380"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKxadhzOKEeT+V47F3emZI4R4OVJR6fM4StNNRDjNDcvdqbVpkED991YX6WrIHjP6Irjg3uoDZLjY6KcanG6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T04:29:35.610523Z","bundle_sha256":"d73eacb9606fbb981383289f0dd2c0d48a4adba0edacf5c6155dd9629536f320"}}