{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G5QKWXDH5RKEHOQZLNIKBYZV7F","short_pith_number":"pith:G5QKWXDH","canonical_record":{"source":{"id":"1608.05754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-08-19T23:07:08Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"75febc1608c0d550d119f3cade2133174dfacb56bd449d8f5f8778e288f8c5b9","abstract_canon_sha256":"5b35d5828a3bd88fea68fb97f83bb039bc98f1158c64afae1f23b19d6685a276"},"schema_version":"1.0"},"canonical_sha256":"3760ab5c67ec5443ba195b50a0e335f979ebbd7c6dd43dabef08a2cb2cdda0ef","source":{"kind":"arxiv","id":"1608.05754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05754","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05754v1","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05754","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"pith_short_12","alias_value":"G5QKWXDH5RKE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G5QKWXDH5RKEHOQZ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G5QKWXDH","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G5QKWXDH5RKEHOQZLNIKBYZV7F","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-08-19T23:07:08Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"75febc1608c0d550d119f3cade2133174dfacb56bd449d8f5f8778e288f8c5b9","abstract_canon_sha256":"5b35d5828a3bd88fea68fb97f83bb039bc98f1158c64afae1f23b19d6685a276"},"schema_version":"1.0"},"canonical_sha256":"3760ab5c67ec5443ba195b50a0e335f979ebbd7c6dd43dabef08a2cb2cdda0ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:17.810265Z","signature_b64":"mzarD6uyXvW9O46QJzuyAPt6TxQ0qwK+/7pQ5WqXhHNCU0JQc/l53l7NOsyKDk8wIQo2yzNglYUlV/smmFjlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3760ab5c67ec5443ba195b50a0e335f979ebbd7c6dd43dabef08a2cb2cdda0ef","last_reissued_at":"2026-05-18T00:42:17.809630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:17.809630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05754","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-18T00:42:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGBH6v6KvWcOou7mYC0Xyn6SpM+W1x6WPveOhZjo870AIdbrxkpQaaA5qBagdUfsoAdx3hfK4cYn+LZWStlXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:45:05.178764Z"},"content_sha256":"a8288a9144ebe210616f75db40d3838df9a4a8cbb9dd4cf993c2e47cdbdcf983","schema_version":"1.0","event_id":"sha256:a8288a9144ebe210616f75db40d3838df9a4a8cbb9dd4cf993c2e47cdbdcf983"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G5QKWXDH5RKEHOQZLNIKBYZV7F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast estimation of approximate matrix ranks using spectral densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"cs.NA","authors_text":"Abd-Krim Seghouane, Shashanka Ubaru, Yousef Saad","submitted_at":"2016-08-19T23:07:08Z","abstract_excerpt":"In many machine learning and data related applications, it is required to have the knowledge of approximate ranks of large data matrices at hand. In this paper, we present two computationally inexpensive techniques to estimate the approximate ranks of such large matrices. These techniques exploit approximate spectral densities, popular in physics, which are probability density distributions that measure the likelihood of finding eigenvalues of the matrix at a given point on the real line. Integrating the spectral density over an interval gives the eigenvalue count of the matrix in that interva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05754","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":""},"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-18T00:42:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mspJrdIzf0sqim2/XNFjQWpA7eKPK1QfnTypG2/itTUDrvNCl/vev7XzR4pX9W8kn/1dpaoc6K8K27j3bI0+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:45:05.179505Z"},"content_sha256":"01d9234a372f63a7f6ba5c312e4099bb0a147400b82b86cddaae3fd916c91796","schema_version":"1.0","event_id":"sha256:01d9234a372f63a7f6ba5c312e4099bb0a147400b82b86cddaae3fd916c91796"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G5QKWXDH5RKEHOQZLNIKBYZV7F/bundle.json","state_url":"https://pith.science/pith/G5QKWXDH5RKEHOQZLNIKBYZV7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G5QKWXDH5RKEHOQZLNIKBYZV7F/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-30T16:45:05Z","links":{"resolver":"https://pith.science/pith/G5QKWXDH5RKEHOQZLNIKBYZV7F","bundle":"https://pith.science/pith/G5QKWXDH5RKEHOQZLNIKBYZV7F/bundle.json","state":"https://pith.science/pith/G5QKWXDH5RKEHOQZLNIKBYZV7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G5QKWXDH5RKEHOQZLNIKBYZV7F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G5QKWXDH5RKEHOQZLNIKBYZV7F","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":"5b35d5828a3bd88fea68fb97f83bb039bc98f1158c64afae1f23b19d6685a276","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-08-19T23:07:08Z","title_canon_sha256":"75febc1608c0d550d119f3cade2133174dfacb56bd449d8f5f8778e288f8c5b9"},"schema_version":"1.0","source":{"id":"1608.05754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05754","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05754v1","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05754","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"pith_short_12","alias_value":"G5QKWXDH5RKE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G5QKWXDH5RKEHOQZ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G5QKWXDH","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:01d9234a372f63a7f6ba5c312e4099bb0a147400b82b86cddaae3fd916c91796","target":"graph","created_at":"2026-05-18T00:42:17Z","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"},"paper":{"abstract_excerpt":"In many machine learning and data related applications, it is required to have the knowledge of approximate ranks of large data matrices at hand. In this paper, we present two computationally inexpensive techniques to estimate the approximate ranks of such large matrices. These techniques exploit approximate spectral densities, popular in physics, which are probability density distributions that measure the likelihood of finding eigenvalues of the matrix at a given point on the real line. Integrating the spectral density over an interval gives the eigenvalue count of the matrix in that interva","authors_text":"Abd-Krim Seghouane, Shashanka Ubaru, Yousef Saad","cross_cats":["cs.LG","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-08-19T23:07:08Z","title":"Fast estimation of approximate matrix ranks using spectral densities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05754","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:a8288a9144ebe210616f75db40d3838df9a4a8cbb9dd4cf993c2e47cdbdcf983","target":"record","created_at":"2026-05-18T00:42:17Z","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":"5b35d5828a3bd88fea68fb97f83bb039bc98f1158c64afae1f23b19d6685a276","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-08-19T23:07:08Z","title_canon_sha256":"75febc1608c0d550d119f3cade2133174dfacb56bd449d8f5f8778e288f8c5b9"},"schema_version":"1.0","source":{"id":"1608.05754","kind":"arxiv","version":1}},"canonical_sha256":"3760ab5c67ec5443ba195b50a0e335f979ebbd7c6dd43dabef08a2cb2cdda0ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3760ab5c67ec5443ba195b50a0e335f979ebbd7c6dd43dabef08a2cb2cdda0ef","first_computed_at":"2026-05-18T00:42:17.809630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:17.809630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mzarD6uyXvW9O46QJzuyAPt6TxQ0qwK+/7pQ5WqXhHNCU0JQc/l53l7NOsyKDk8wIQo2yzNglYUlV/smmFjlAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:17.810265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8288a9144ebe210616f75db40d3838df9a4a8cbb9dd4cf993c2e47cdbdcf983","sha256:01d9234a372f63a7f6ba5c312e4099bb0a147400b82b86cddaae3fd916c91796"],"state_sha256":"3066d770968aef7ffd8b4be1dfdca397310b700a84f8077da008b5c79011636f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0CUlqrToRUWleVRHbkASEIKvEEpSanQbw95Oh3r1thBml+hdU5Yu4JnRn8lglnkmSnbLdpXoSPc4FYU6fabmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:45:05.183258Z","bundle_sha256":"7875a586d62dc00a084418fbd26dfbf6da073a0cc3bed0f5b793045ef433ca50"}}