{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BRCVWPAZSC3RRMBJ7HBJ2VT3QL","short_pith_number":"pith:BRCVWPAZ","canonical_record":{"source":{"id":"1706.10285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-30T17:32:48Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"8d340c35757e7def88b933f161f97448383d203a996d2d34925585c0d2804d0b","abstract_canon_sha256":"95070212a71ced912337f4e77396c0427585070d34d3055f75de7ec903e7393f"},"schema_version":"1.0"},"canonical_sha256":"0c455b3c1990b718b029f9c29d567b82c58d33c889ec3003d68498d28d551fa6","source":{"kind":"arxiv","id":"1706.10285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.10285","created_at":"2026-06-04T18:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1706.10285v1","created_at":"2026-06-04T18:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10285","created_at":"2026-06-04T18:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"BRCVWPAZSC3R","created_at":"2026-06-04T18:10:58Z"},{"alias_kind":"pith_short_16","alias_value":"BRCVWPAZSC3RRMBJ","created_at":"2026-06-04T18:10:58Z"},{"alias_kind":"pith_short_8","alias_value":"BRCVWPAZ","created_at":"2026-06-04T18:10:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BRCVWPAZSC3RRMBJ7HBJ2VT3QL","target":"record","payload":{"canonical_record":{"source":{"id":"1706.10285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-30T17:32:48Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"8d340c35757e7def88b933f161f97448383d203a996d2d34925585c0d2804d0b","abstract_canon_sha256":"95070212a71ced912337f4e77396c0427585070d34d3055f75de7ec903e7393f"},"schema_version":"1.0"},"canonical_sha256":"0c455b3c1990b718b029f9c29d567b82c58d33c889ec3003d68498d28d551fa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T18:10:58.557201Z","signature_b64":"umyhHObnCfu5WlTNGyyC+iR4slOkwG/2wynePQsY/Q93yxJ2qpuMfMpPiMI0kf0XR97QP5JcEckBnNnw6tX+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c455b3c1990b718b029f9c29d567b82c58d33c889ec3003d68498d28d551fa6","last_reissued_at":"2026-06-04T18:10:58.556741Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T18:10:58.556741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.10285","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-06-04T18:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUOsL5UXCQwbsnN7VTyfSCMfgNwP+Uc051eLLcf24xkl+QSkEZ/2dWv4g8clqomoIB4lcvFdO4N6oHq0eRkdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:37:48.620084Z"},"content_sha256":"9484f3438f6bfce04705379f5515f4699b5047ec664ace8376cb1c1224de0c68","schema_version":"1.0","event_id":"sha256:9484f3438f6bfce04705379f5515f4699b5047ec664ace8376cb1c1224de0c68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BRCVWPAZSC3RRMBJ7HBJ2VT3QL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic estimation of the rank 1 cross approximation accuracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alexander Osinsky","submitted_at":"2017-06-30T17:32:48Z","abstract_excerpt":"In the construction of low-rank matrix approximation and maximum element search it is effective to use maxvol algorithm. Nevertheless, even in the case of rank 1 approximation the algorithm does not always converge to the maximum matrix element, and it is unclear how often close to the maximum element can be found. In this article it is shown that with a certain degree of randomness in the matrix and proper selection of the starting column, the algorithm with high probability in a few steps converges to an element, which module differs little from the maximum. It is also shown that with more s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10285","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/1706.10285/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-04T18:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGw+cGVoxBaG0pKAinLPFPuuFpIs3TA6jz/M6hsmVUrRbIviOTXeK4tjPemn9eidjWW1XXVm/Bm93aZrjwLxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:37:48.620483Z"},"content_sha256":"7b93f7422cfa0504d41aafd9d108c3e19cf55935cb5221120d56dccfe7274142","schema_version":"1.0","event_id":"sha256:7b93f7422cfa0504d41aafd9d108c3e19cf55935cb5221120d56dccfe7274142"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRCVWPAZSC3RRMBJ7HBJ2VT3QL/bundle.json","state_url":"https://pith.science/pith/BRCVWPAZSC3RRMBJ7HBJ2VT3QL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRCVWPAZSC3RRMBJ7HBJ2VT3QL/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-27T16:37:48Z","links":{"resolver":"https://pith.science/pith/BRCVWPAZSC3RRMBJ7HBJ2VT3QL","bundle":"https://pith.science/pith/BRCVWPAZSC3RRMBJ7HBJ2VT3QL/bundle.json","state":"https://pith.science/pith/BRCVWPAZSC3RRMBJ7HBJ2VT3QL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRCVWPAZSC3RRMBJ7HBJ2VT3QL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BRCVWPAZSC3RRMBJ7HBJ2VT3QL","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":"95070212a71ced912337f4e77396c0427585070d34d3055f75de7ec903e7393f","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-30T17:32:48Z","title_canon_sha256":"8d340c35757e7def88b933f161f97448383d203a996d2d34925585c0d2804d0b"},"schema_version":"1.0","source":{"id":"1706.10285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.10285","created_at":"2026-06-04T18:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1706.10285v1","created_at":"2026-06-04T18:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10285","created_at":"2026-06-04T18:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"BRCVWPAZSC3R","created_at":"2026-06-04T18:10:58Z"},{"alias_kind":"pith_short_16","alias_value":"BRCVWPAZSC3RRMBJ","created_at":"2026-06-04T18:10:58Z"},{"alias_kind":"pith_short_8","alias_value":"BRCVWPAZ","created_at":"2026-06-04T18:10:58Z"}],"graph_snapshots":[{"event_id":"sha256:7b93f7422cfa0504d41aafd9d108c3e19cf55935cb5221120d56dccfe7274142","target":"graph","created_at":"2026-06-04T18:10:58Z","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/1706.10285/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the construction of low-rank matrix approximation and maximum element search it is effective to use maxvol algorithm. Nevertheless, even in the case of rank 1 approximation the algorithm does not always converge to the maximum matrix element, and it is unclear how often close to the maximum element can be found. In this article it is shown that with a certain degree of randomness in the matrix and proper selection of the starting column, the algorithm with high probability in a few steps converges to an element, which module differs little from the maximum. It is also shown that with more s","authors_text":"Alexander Osinsky","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-30T17:32:48Z","title":"Probabilistic estimation of the rank 1 cross approximation accuracy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10285","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:9484f3438f6bfce04705379f5515f4699b5047ec664ace8376cb1c1224de0c68","target":"record","created_at":"2026-06-04T18:10:58Z","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":"95070212a71ced912337f4e77396c0427585070d34d3055f75de7ec903e7393f","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-30T17:32:48Z","title_canon_sha256":"8d340c35757e7def88b933f161f97448383d203a996d2d34925585c0d2804d0b"},"schema_version":"1.0","source":{"id":"1706.10285","kind":"arxiv","version":1}},"canonical_sha256":"0c455b3c1990b718b029f9c29d567b82c58d33c889ec3003d68498d28d551fa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c455b3c1990b718b029f9c29d567b82c58d33c889ec3003d68498d28d551fa6","first_computed_at":"2026-06-04T18:10:58.556741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T18:10:58.556741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"umyhHObnCfu5WlTNGyyC+iR4slOkwG/2wynePQsY/Q93yxJ2qpuMfMpPiMI0kf0XR97QP5JcEckBnNnw6tX+Aw==","signature_status":"signed_v1","signed_at":"2026-06-04T18:10:58.557201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.10285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9484f3438f6bfce04705379f5515f4699b5047ec664ace8376cb1c1224de0c68","sha256:7b93f7422cfa0504d41aafd9d108c3e19cf55935cb5221120d56dccfe7274142"],"state_sha256":"4b86ac40d7647db493c79439bc484a858608be20ddb3d9b57d955da04e842344"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2x9wX5dLXgDwGDwl481Ti/gzanl0DnKDo6W3OhX31ZHJh45Fhl0LiS0A6QM2+n0WI36H8uMeLXEFvovZvSPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:37:48.622446Z","bundle_sha256":"c1293c1b61db29eb42bfb7c414a8f0dadc2e7df94a33d965f728a2608f5906ec"}}