{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QSZMITHIMC6DAVPRMODM7SZ6JJ","short_pith_number":"pith:QSZMITHI","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"},"canonical_sha256":"84b2c44ce860bc3055f16386cfcb3e4a53d6a74d8ad9a01de50db82ed360d7cb","source":{"kind":"arxiv","id":"2605.17339","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17339","created_at":"2026-05-20T00:03:53Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17339v1","created_at":"2026-05-20T00:03:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17339","created_at":"2026-05-20T00:03:53Z"},{"alias_kind":"pith_short_12","alias_value":"QSZMITHIMC6D","created_at":"2026-05-20T00:03:53Z"},{"alias_kind":"pith_short_16","alias_value":"QSZMITHIMC6DAVPR","created_at":"2026-05-20T00:03:53Z"},{"alias_kind":"pith_short_8","alias_value":"QSZMITHI","created_at":"2026-05-20T00:03:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QSZMITHIMC6DAVPRMODM7SZ6JJ","target":"record","payload":{"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"},"canonical_sha256":"84b2c44ce860bc3055f16386cfcb3e4a53d6a74d8ad9a01de50db82ed360d7cb","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"},"source_kind":"arxiv","source_id":"2605.17339","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:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNLCzLax5fXO9aHlicYiaYqfO0ckUVS94J9xofuE3T+FIIWJkot274eVc8LJ3zDJ25LqFTKvrbRTRbs1HjGcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T12:45:35.911451Z"},"content_sha256":"4e9e6b212febf37b3c75f40b59bbfadfdbbb74f79184b83ea870a25fb93813ff","schema_version":"1.0","event_id":"sha256:4e9e6b212febf37b3c75f40b59bbfadfdbbb74f79184b83ea870a25fb93813ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QSZMITHIMC6DAVPRMODM7SZ6JJ","target":"graph","payload":{"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"},"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:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIGycFFDLoDevMyIUnAsJs0+zz8uLsRM6fBFeARCKc9NvChVvUy7G9W/dLkVIgyBuVX5MlLj8Yhl0vig6euJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T12:45:35.911859Z"},"content_sha256":"35ed540c2cc8593eb0df60db78c050a1c63ca93c00ea885d48e1944b89aac807","schema_version":"1.0","event_id":"sha256:35ed540c2cc8593eb0df60db78c050a1c63ca93c00ea885d48e1944b89aac807"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:QSZMITHIMC6DAVPRMODM7SZ6JJ","target":"integrity","payload":{"note":"Identifier '10.1016/0956-0521(91)90014-3' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Simon, H. D.: Partitioning of unstructured problems for parallel pro- cessing. Computing Systems in Engineering2(2–3), 135–148 (1991). https://doi.org/10.1016/0956-0521(91)90014-3","arxiv_id":"2605.17339","detector":"doi_compliance","evidence":{"doi":"10.1016/0956-0521(91)90014-3","arxiv_id":null,"ref_index":23,"raw_excerpt":"Simon, H. D.: Partitioning of unstructured problems for parallel pro- cessing. Computing Systems in Engineering2(2–3), 135–148 (1991). https://doi.org/10.1016/0956-0521(91)90014-3","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":23,"audited_at":"2026-05-20T14:52:26.343294Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0956-0521(91)90014-3","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"1ad9fef43f75f045c6fdee03255153b60b4cac81dc4b5ccdfa64252cdf6b3cd9","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":5226,"payload_sha256":"071a5be6a9324ea13c78b76028dfb77f22b1276cc29e2ad35bc56357fc753648","signature_b64":"35Fpc2UccfOt1sdFXywaovrnueUwv6ndOVG8gJ5+2uZpm7l9IckPQvEyXfIAm0n+V5Xe4+9o3Z5qSXqaFZOnDQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T14:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PNnpN4TALclVPP/oG2p4P3zgs71WvV/C75K/q9Bf8vUOW6cNWd1aLFsO9Dh597mDoP6oEnMvBlA7pgWQ+r8uBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T12:45:35.912845Z"},"content_sha256":"6ac2727c8feae63a35b28aeeb14d9d35ad764e11c4f044f87f89285c1cb2ca20","schema_version":"1.0","event_id":"sha256:6ac2727c8feae63a35b28aeeb14d9d35ad764e11c4f044f87f89285c1cb2ca20"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:QSZMITHIMC6DAVPRMODM7SZ6JJ","target":"integrity","payload":{"note":"Identifier '10.1145/214393.214403' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Liu, J. W. H.: Modification of the Minimum-Degree Algorithm by Multiple Elim- ination. ACM Transactions on Mathematical Software (TOMS)11(2), 141–153 (1985). https://doi.org/10.1145/214393.214403","arxiv_id":"2605.17339","detector":"doi_compliance","evidence":{"doi":"10.1145/214393.214403","arxiv_id":null,"ref_index":17,"raw_excerpt":"Liu, J. W. H.: Modification of the Minimum-Degree Algorithm by Multiple Elim- ination. ACM Transactions on Mathematical Software (TOMS)11(2), 141–153 (1985). https://doi.org/10.1145/214393.214403","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":17,"audited_at":"2026-05-20T14:52:26.343294Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/214393.214403","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"3c0be91a7c0b31ec3e58dd7fa93c4b29cc41e36623ce430ff2355d2c92fa1ecf","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":5225,"payload_sha256":"f548aeca052b2edfbb7f3ceed3d287de63c71dd63792302f1335bd8e96959a3f","signature_b64":"G1ZoKh4Tk5Mgdk94FtvbBoMrK0wLlOdN3z3eFWFeQu+S3qRNkURCsBEahhAtcp47OdK0F5lETsLcjB+LojJKDw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T14:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MkWROpPk8CbGWdPgz+xtjHIKq/8LCRp1k62WT/xXf4inj7dgl2AHfa5Xn0UuTevZRT7xCkEBjhdNQKSjIoDzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T12:45:35.913150Z"},"content_sha256":"b8904dd972c27806b2c63ddc11852fa322eefa3a14932997ed9e6fa5541dd7e3","schema_version":"1.0","event_id":"sha256:b8904dd972c27806b2c63ddc11852fa322eefa3a14932997ed9e6fa5541dd7e3"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:QSZMITHIMC6DAVPRMODM7SZ6JJ","target":"integrity","payload":{"note":"Identifier '10.1137/s0895479894262865' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"George, A., Pothen, A.: An analysis of spectral envelope reduction via quadratic assignment problems. SIAM Journal on Matrix Analysis and Applications18(3), 706–732 (1997). https://doi.org/10.1137/S0895479894262865","arxiv_id":"2605.17339","detector":"doi_compliance","evidence":{"doi":"10.1137/s0895479894262865","arxiv_id":null,"ref_index":13,"raw_excerpt":"George, A., Pothen, A.: An analysis of spectral envelope reduction via quadratic assignment problems. SIAM Journal on Matrix Analysis and Applications18(3), 706–732 (1997). https://doi.org/10.1137/S0895479894262865","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":13,"audited_at":"2026-05-20T14:52:26.343294Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/s0895479894262865","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"186275fcb5f2a079f612ae03e7f77513ede3c6bac3de4dbee7b3fe01a755ec0e","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":5224,"payload_sha256":"9f6a28f7e068ae7c93e98d69e5c71d53aa8aa4df8beb01edb31c336d4ec85984","signature_b64":"W/PR8OlbMmEsguyi8o60FONT0HmFH0Ekfi7Y+vfHfbssPgCZqu5asA87+Lr0/l0XEZBqcNodQ78dxt6gXWR5Cg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T14:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUtEaANM7Tc6+xv6GJ3ZDf86tPH21SuvA8hwY0F+Drnp27OOwaz0QCalVUPwCJKUj8g/WKWRsj4LVoR2lTbICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T12:45:35.913459Z"},"content_sha256":"a45669ba0234f57878db3e7384e95c1130e5da4bbd4facce22cccdf7692c1761","schema_version":"1.0","event_id":"sha256:a45669ba0234f57878db3e7384e95c1130e5da4bbd4facce22cccdf7692c1761"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ/bundle.json","state_url":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ/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-21T12:45:35Z","links":{"resolver":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ","bundle":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ/bundle.json","state":"https://pith.science/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSZMITHIMC6DAVPRMODM7SZ6JJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QSZMITHIMC6DAVPRMODM7SZ6JJ","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"85bb1b9cda1242738fbd82bf016c0509c8427f7d6d3f2042a5bc743b4967ebe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T09:15:42Z","title_canon_sha256":"1e72ad5a73697e1c8ea7d2619ddfd1a9900f1a6a19054d0cde81af275a6ebced"},"schema_version":"1.0","source":{"id":"2605.17339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17339","created_at":"2026-05-20T00:03:53Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17339v1","created_at":"2026-05-20T00:03:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17339","created_at":"2026-05-20T00:03:53Z"},{"alias_kind":"pith_short_12","alias_value":"QSZMITHIMC6D","created_at":"2026-05-20T00:03:53Z"},{"alias_kind":"pith_short_16","alias_value":"QSZMITHIMC6DAVPR","created_at":"2026-05-20T00:03:53Z"},{"alias_kind":"pith_short_8","alias_value":"QSZMITHI","created_at":"2026-05-20T00:03:53Z"}],"graph_snapshots":[{"event_id":"sha256:35ed540c2cc8593eb0df60db78c050a1c63ca93c00ea885d48e1944b89aac807","target":"graph","created_at":"2026-05-20T00:03:53Z","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.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"}],"endpoint":"/pith/2605.17339/integrity.json","findings":[],"snapshot_sha256":"74b537487fcbd653594085f6a878c9757106e2f67aee6eca8a042281f6b034fe","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Huiyuan Li, Shuzi Niu, Tao Yuan, Ziwei Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T09:15:42Z","title":"Bridging the Gap between Sparse Matrix Reordering and Factorization: A Deep Learning Framework for Fill-in Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17339","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:4e9e6b212febf37b3c75f40b59bbfadfdbbb74f79184b83ea870a25fb93813ff","target":"record","created_at":"2026-05-20T00:03:53Z","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":"85bb1b9cda1242738fbd82bf016c0509c8427f7d6d3f2042a5bc743b4967ebe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-17T09:15:42Z","title_canon_sha256":"1e72ad5a73697e1c8ea7d2619ddfd1a9900f1a6a19054d0cde81af275a6ebced"},"schema_version":"1.0","source":{"id":"2605.17339","kind":"arxiv","version":1}},"canonical_sha256":"84b2c44ce860bc3055f16386cfcb3e4a53d6a74d8ad9a01de50db82ed360d7cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84b2c44ce860bc3055f16386cfcb3e4a53d6a74d8ad9a01de50db82ed360d7cb","first_computed_at":"2026-05-20T00:03:53.011548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:53.011548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qx5Jsn7uxrbCHcW0ghqGd36G7vh88YDgmqEf75HYhtw77RSDb2+m0KEM5grOcJMyKV/K5c+8OmOuEaImkOJ1AQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:53.012418Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17339","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:6ac2727c8feae63a35b28aeeb14d9d35ad764e11c4f044f87f89285c1cb2ca20","sha256:a45669ba0234f57878db3e7384e95c1130e5da4bbd4facce22cccdf7692c1761","sha256:b8904dd972c27806b2c63ddc11852fa322eefa3a14932997ed9e6fa5541dd7e3"]}],"invalid_events":[],"applied_event_ids":["sha256:4e9e6b212febf37b3c75f40b59bbfadfdbbb74f79184b83ea870a25fb93813ff","sha256:35ed540c2cc8593eb0df60db78c050a1c63ca93c00ea885d48e1944b89aac807"],"state_sha256":"89ed16808baa019a96d056cf74513423b1ae09dc75f028add12d1d88a15d7abd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJYmRzMuO/8AX/10VuJkr/jeRxRbqAirQY275gCD1TGVhrqBWQl98tj4sbBSd5HcLCowEkQCjXxTC3gGpE6EAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T12:45:35.916063Z","bundle_sha256":"db14a201845bce687b3db93a448ddfd569bd25d6d82af2ea38966bcfb7e5616e"}}