{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RXPJ6G5MBHPCBYLXDX76Z3LH6Z","short_pith_number":"pith:RXPJ6G5M","canonical_record":{"source":{"id":"2507.10144","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-07-14T10:43:21Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a200e1a6dc0a91e2e298359725bd15fe0324e845bfb1d1e302fba4e45394ff7d","abstract_canon_sha256":"4fa27d2371f2b5b12847889ab269d970d25e050496d9084ceaf6511b5004272d"},"schema_version":"1.0"},"canonical_sha256":"8dde9f1bac09de20e1771dffeced67f67c268fcc50283c02aaba18ced4136283","source":{"kind":"arxiv","id":"2507.10144","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.10144","created_at":"2026-06-02T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2507.10144v2","created_at":"2026-06-02T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10144","created_at":"2026-06-02T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"RXPJ6G5MBHPC","created_at":"2026-06-02T01:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"RXPJ6G5MBHPCBYLX","created_at":"2026-06-02T01:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"RXPJ6G5M","created_at":"2026-06-02T01:03:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RXPJ6G5MBHPCBYLXDX76Z3LH6Z","target":"record","payload":{"canonical_record":{"source":{"id":"2507.10144","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-07-14T10:43:21Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a200e1a6dc0a91e2e298359725bd15fe0324e845bfb1d1e302fba4e45394ff7d","abstract_canon_sha256":"4fa27d2371f2b5b12847889ab269d970d25e050496d9084ceaf6511b5004272d"},"schema_version":"1.0"},"canonical_sha256":"8dde9f1bac09de20e1771dffeced67f67c268fcc50283c02aaba18ced4136283","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:32.667581Z","signature_b64":"qiutPQU74QcwfSzC/jM0waWVGPbN8l9c2grQvr2Bo1bkfQ2HkLTbuWocwb0ruj0JYRs+0bIUZF0jdCwVUlusCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dde9f1bac09de20e1771dffeced67f67c268fcc50283c02aaba18ced4136283","last_reissued_at":"2026-06-02T01:03:32.667168Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:32.667168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.10144","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-06-02T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRH8aKyuGAHlAOs6nlIff9Y8XYz16KVOSYnwMrdPUl019MFAH34i2sBOnjvXCxzYJllYdAltPIUTVCZnBymcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:33:14.417143Z"},"content_sha256":"650bbd139fe7816a2a4804296d5c1eb9b75341dd7aaaf400d4a8ecc60c0c6748","schema_version":"1.0","event_id":"sha256:650bbd139fe7816a2a4804296d5c1eb9b75341dd7aaaf400d4a8ecc60c0c6748"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RXPJ6G5MBHPCBYLXDX76Z3LH6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A structural bound for cluster robustness of randomized small-block Lanczos","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Nian Shao","submitted_at":"2025-07-14T10:43:21Z","abstract_excerpt":"The Lanczos method is a fast and memory-efficient algorithm for solving large-scale symmetric eigenvalue problems. However, its rapid convergence can deteriorate significantly when computing clustered eigenvalues due to a lack of cluster robustness. A promising strategy to enhance cluster robustness -- without substantially compromising convergence speed or memory efficiency -- is to use a random small-block initial, where the block size is greater than one but still much smaller than the cluster size. This leads to the Randomized Small-Block Lanczos (RSBL) method. Despite its empirical effect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10144","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.10144/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-06-02T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utmx2OQmPd2b5xFgT9vYvvZExUnvPeiSJH/SrXNE2UFwcWYsEou7LaammTVsHA1ZAlTNd1ukoyCRaTw3FGsjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:33:14.417532Z"},"content_sha256":"e62e0425a01237c8224de4108968a6252c8d2a5193cc62146142f4ece0f65290","schema_version":"1.0","event_id":"sha256:e62e0425a01237c8224de4108968a6252c8d2a5193cc62146142f4ece0f65290"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXPJ6G5MBHPCBYLXDX76Z3LH6Z/bundle.json","state_url":"https://pith.science/pith/RXPJ6G5MBHPCBYLXDX76Z3LH6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXPJ6G5MBHPCBYLXDX76Z3LH6Z/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-06-27T17:33:14Z","links":{"resolver":"https://pith.science/pith/RXPJ6G5MBHPCBYLXDX76Z3LH6Z","bundle":"https://pith.science/pith/RXPJ6G5MBHPCBYLXDX76Z3LH6Z/bundle.json","state":"https://pith.science/pith/RXPJ6G5MBHPCBYLXDX76Z3LH6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXPJ6G5MBHPCBYLXDX76Z3LH6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RXPJ6G5MBHPCBYLXDX76Z3LH6Z","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":"4fa27d2371f2b5b12847889ab269d970d25e050496d9084ceaf6511b5004272d","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-07-14T10:43:21Z","title_canon_sha256":"a200e1a6dc0a91e2e298359725bd15fe0324e845bfb1d1e302fba4e45394ff7d"},"schema_version":"1.0","source":{"id":"2507.10144","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.10144","created_at":"2026-06-02T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2507.10144v2","created_at":"2026-06-02T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10144","created_at":"2026-06-02T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"RXPJ6G5MBHPC","created_at":"2026-06-02T01:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"RXPJ6G5MBHPCBYLX","created_at":"2026-06-02T01:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"RXPJ6G5M","created_at":"2026-06-02T01:03:32Z"}],"graph_snapshots":[{"event_id":"sha256:e62e0425a01237c8224de4108968a6252c8d2a5193cc62146142f4ece0f65290","target":"graph","created_at":"2026-06-02T01:03:32Z","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.10144/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Lanczos method is a fast and memory-efficient algorithm for solving large-scale symmetric eigenvalue problems. However, its rapid convergence can deteriorate significantly when computing clustered eigenvalues due to a lack of cluster robustness. A promising strategy to enhance cluster robustness -- without substantially compromising convergence speed or memory efficiency -- is to use a random small-block initial, where the block size is greater than one but still much smaller than the cluster size. This leads to the Randomized Small-Block Lanczos (RSBL) method. Despite its empirical effect","authors_text":"Nian Shao","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-07-14T10:43:21Z","title":"A structural bound for cluster robustness of randomized small-block Lanczos"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10144","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:650bbd139fe7816a2a4804296d5c1eb9b75341dd7aaaf400d4a8ecc60c0c6748","target":"record","created_at":"2026-06-02T01:03:32Z","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":"4fa27d2371f2b5b12847889ab269d970d25e050496d9084ceaf6511b5004272d","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-07-14T10:43:21Z","title_canon_sha256":"a200e1a6dc0a91e2e298359725bd15fe0324e845bfb1d1e302fba4e45394ff7d"},"schema_version":"1.0","source":{"id":"2507.10144","kind":"arxiv","version":2}},"canonical_sha256":"8dde9f1bac09de20e1771dffeced67f67c268fcc50283c02aaba18ced4136283","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dde9f1bac09de20e1771dffeced67f67c268fcc50283c02aaba18ced4136283","first_computed_at":"2026-06-02T01:03:32.667168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:32.667168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qiutPQU74QcwfSzC/jM0waWVGPbN8l9c2grQvr2Bo1bkfQ2HkLTbuWocwb0ruj0JYRs+0bIUZF0jdCwVUlusCQ==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:32.667581Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.10144","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:650bbd139fe7816a2a4804296d5c1eb9b75341dd7aaaf400d4a8ecc60c0c6748","sha256:e62e0425a01237c8224de4108968a6252c8d2a5193cc62146142f4ece0f65290"],"state_sha256":"221304dafb83bb1ab96416ac1d7e9b68005eb6d870674f0f096771961a951b32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2N334Be/uy+cXOhtmIomty8wYEUx7OlBiiGIrfhefnkF3CvDosmsc8+TMusLU6B1HTZhFXmJeoSZIm32ZmDLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:33:14.420130Z","bundle_sha256":"a90a8328e360b5df6ef0adc19050377d091df19ffbeb56fc54fd56f6aaae17ef"}}