{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:X2MWYWNFHVEFDMLYVL3YX3YOTE","short_pith_number":"pith:X2MWYWNF","canonical_record":{"source":{"id":"2507.03833","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-04T22:57:33Z","cross_cats_sorted":[],"title_canon_sha256":"3ca8d0cb09798b63b6b84a70dfccc30026cb41b750d5489a6ac53a4666808b4c","abstract_canon_sha256":"e1c19639b2ac08ef0c0e8f49d646c8e710feb1cc53fdf573281ddbeb369723fd"},"schema_version":"1.0"},"canonical_sha256":"be996c59a53d4851b178aaf78bef0e992c723557dcad42a74c21a40e3efec2b8","source":{"kind":"arxiv","id":"2507.03833","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.03833","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"arxiv_version","alias_value":"2507.03833v2","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03833","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_12","alias_value":"X2MWYWNFHVEF","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_16","alias_value":"X2MWYWNFHVEFDMLY","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_8","alias_value":"X2MWYWNF","created_at":"2026-07-05T11:37:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:X2MWYWNFHVEFDMLYVL3YX3YOTE","target":"record","payload":{"canonical_record":{"source":{"id":"2507.03833","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-04T22:57:33Z","cross_cats_sorted":[],"title_canon_sha256":"3ca8d0cb09798b63b6b84a70dfccc30026cb41b750d5489a6ac53a4666808b4c","abstract_canon_sha256":"e1c19639b2ac08ef0c0e8f49d646c8e710feb1cc53fdf573281ddbeb369723fd"},"schema_version":"1.0"},"canonical_sha256":"be996c59a53d4851b178aaf78bef0e992c723557dcad42a74c21a40e3efec2b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:45.472342Z","signature_b64":"IV/hhiizvW9Iur7TOieUxWlfz6btcvCwWcgdl5LuEZrbCeOYZy6y6hc9f5jT0BB2qUnMQ6tSO6cyQel0oAbaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be996c59a53d4851b178aaf78bef0e992c723557dcad42a74c21a40e3efec2b8","last_reissued_at":"2026-07-05T11:37:45.471795Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:45.471795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.03833","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-05T11:37:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQpZj/KIZLPamClzgDhyIGE0KvJCqMoSKeoLAsdY7FNtzCLcPnmw7Xxf1eo0tCftR5DCmG/0numVu/QVD6iSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:30:54.597554Z"},"content_sha256":"0122a5545122833714714e434ba5a4e0ec61a6142c2c5d872457fecd7aa46c1b","schema_version":"1.0","event_id":"sha256:0122a5545122833714714e434ba5a4e0ec61a6142c2c5d872457fecd7aa46c1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:X2MWYWNFHVEFDMLYVL3YX3YOTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Longling Geng, Mert Pilanci, Rajat Vadiraj Dwaraknath, Sungyoon Kim","submitted_at":"2025-07-04T22:57:33Z","abstract_excerpt":"Iterative methods for computing matrix functions have been extensively studied and their convergence speed can be significantly improved with the right tuning of parameters and by mixing different iteration types. Handtuning the design options for optimal performance can be cumbersome, especially in modern computing environments: numerous different classical iterations and their variants exist, each with non-trivial per-step cost and tuning parameters. To this end, we propose MatRL -- a reinforcement learning based framework that automatically discovers iterative algorithms for computing matri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03833","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/2507.03833/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-05T11:37:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STRUsb2qAlyqGkSErL/eADKTQUiVr9+HrgzJoA/e2z3FybHer4a5Fg2EuhJpsFPTwCC8l/pJCvYXA5bXsnf1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:30:54.598424Z"},"content_sha256":"b518e69079a700cbccd89c062bd0b761ca4c8c8c32df6a3bdb1100a56de70bab","schema_version":"1.0","event_id":"sha256:b518e69079a700cbccd89c062bd0b761ca4c8c8c32df6a3bdb1100a56de70bab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2MWYWNFHVEFDMLYVL3YX3YOTE/bundle.json","state_url":"https://pith.science/pith/X2MWYWNFHVEFDMLYVL3YX3YOTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2MWYWNFHVEFDMLYVL3YX3YOTE/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-07T18:30:54Z","links":{"resolver":"https://pith.science/pith/X2MWYWNFHVEFDMLYVL3YX3YOTE","bundle":"https://pith.science/pith/X2MWYWNFHVEFDMLYVL3YX3YOTE/bundle.json","state":"https://pith.science/pith/X2MWYWNFHVEFDMLYVL3YX3YOTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2MWYWNFHVEFDMLYVL3YX3YOTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:X2MWYWNFHVEFDMLYVL3YX3YOTE","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":"e1c19639b2ac08ef0c0e8f49d646c8e710feb1cc53fdf573281ddbeb369723fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-04T22:57:33Z","title_canon_sha256":"3ca8d0cb09798b63b6b84a70dfccc30026cb41b750d5489a6ac53a4666808b4c"},"schema_version":"1.0","source":{"id":"2507.03833","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.03833","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"arxiv_version","alias_value":"2507.03833v2","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03833","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_12","alias_value":"X2MWYWNFHVEF","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_16","alias_value":"X2MWYWNFHVEFDMLY","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_8","alias_value":"X2MWYWNF","created_at":"2026-07-05T11:37:45Z"}],"graph_snapshots":[{"event_id":"sha256:b518e69079a700cbccd89c062bd0b761ca4c8c8c32df6a3bdb1100a56de70bab","target":"graph","created_at":"2026-07-05T11:37:45Z","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/2507.03833/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Iterative methods for computing matrix functions have been extensively studied and their convergence speed can be significantly improved with the right tuning of parameters and by mixing different iteration types. Handtuning the design options for optimal performance can be cumbersome, especially in modern computing environments: numerous different classical iterations and their variants exist, each with non-trivial per-step cost and tuning parameters. To this end, we propose MatRL -- a reinforcement learning based framework that automatically discovers iterative algorithms for computing matri","authors_text":"Longling Geng, Mert Pilanci, Rajat Vadiraj Dwaraknath, Sungyoon Kim","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03833","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:0122a5545122833714714e434ba5a4e0ec61a6142c2c5d872457fecd7aa46c1b","target":"record","created_at":"2026-07-05T11:37:45Z","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":"e1c19639b2ac08ef0c0e8f49d646c8e710feb1cc53fdf573281ddbeb369723fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-04T22:57:33Z","title_canon_sha256":"3ca8d0cb09798b63b6b84a70dfccc30026cb41b750d5489a6ac53a4666808b4c"},"schema_version":"1.0","source":{"id":"2507.03833","kind":"arxiv","version":2}},"canonical_sha256":"be996c59a53d4851b178aaf78bef0e992c723557dcad42a74c21a40e3efec2b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be996c59a53d4851b178aaf78bef0e992c723557dcad42a74c21a40e3efec2b8","first_computed_at":"2026-07-05T11:37:45.471795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:45.471795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IV/hhiizvW9Iur7TOieUxWlfz6btcvCwWcgdl5LuEZrbCeOYZy6y6hc9f5jT0BB2qUnMQ6tSO6cyQel0oAbaAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:45.472342Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.03833","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0122a5545122833714714e434ba5a4e0ec61a6142c2c5d872457fecd7aa46c1b","sha256:b518e69079a700cbccd89c062bd0b761ca4c8c8c32df6a3bdb1100a56de70bab"],"state_sha256":"e717a9ed9afe06e8cf5b62f78b9a84270b587a5650dfb881550ec8094592343a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQ8f9vjneTQ5hgOOHLu6EMmoofPxS/x3hPF9Bn65m3d5vlZxvYJGGFjnMO5+7DDMI22L09nWd36giTrSuEozBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T18:30:54.607265Z","bundle_sha256":"7e8473e5354449a5bafd9eba381936f2af8775c5dd0ed4c13f5e4aa88723c5f4"}}