{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:4AEJGONZ262R66D7Q6OWKYYGZN","short_pith_number":"pith:4AEJGONZ","canonical_record":{"source":{"id":"0806.2339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-06-13T22:00:04Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"0f1137fc62ca780c4a4aba41c88f031bf4dc8b49624fad11bba4e6af45de0051","abstract_canon_sha256":"f29103b2cb7200e3b886aede42ad2fdd68a2a6679d70f2bf768f30f89e8797dc"},"schema_version":"1.0"},"canonical_sha256":"e0089339b9d7b51f787f879d656306cb732696a1728959480c515ec4ea957ecc","source":{"kind":"arxiv","id":"0806.2339","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.2339","created_at":"2026-06-03T22:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"0806.2339v1","created_at":"2026-06-03T22:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.2339","created_at":"2026-06-03T22:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"4AEJGONZ262R","created_at":"2026-06-03T22:06:06Z"},{"alias_kind":"pith_short_16","alias_value":"4AEJGONZ262R66D7","created_at":"2026-06-03T22:06:06Z"},{"alias_kind":"pith_short_8","alias_value":"4AEJGONZ","created_at":"2026-06-03T22:06:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:4AEJGONZ262R66D7Q6OWKYYGZN","target":"record","payload":{"canonical_record":{"source":{"id":"0806.2339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-06-13T22:00:04Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"0f1137fc62ca780c4a4aba41c88f031bf4dc8b49624fad11bba4e6af45de0051","abstract_canon_sha256":"f29103b2cb7200e3b886aede42ad2fdd68a2a6679d70f2bf768f30f89e8797dc"},"schema_version":"1.0"},"canonical_sha256":"e0089339b9d7b51f787f879d656306cb732696a1728959480c515ec4ea957ecc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:06.903055Z","signature_b64":"YeI7b57bGN8DMPmuUuxecBA09b4N8TB6aE9arwLB63bNDo5R5XcsDdq7mSJ6vWBwChKGvldXkE+cnGPVNp7ADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0089339b9d7b51f787f879d656306cb732696a1728959480c515ec4ea957ecc","last_reissued_at":"2026-06-03T22:06:06.902355Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:06.902355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0806.2339","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-03T22:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"niVwP0m6bIBB8qce7JIs8sNaRM71EqW63G2rIGJNa2gabs0VoqGJuU+Kw1BcPdM8oHtl5egtkI4WbagkaPhpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:53:24.315463Z"},"content_sha256":"8181eb012b720388f7decc2415770794ee9f053d55b7df264b67410fd885add5","schema_version":"1.0","event_id":"sha256:8181eb012b720388f7decc2415770794ee9f053d55b7df264b67410fd885add5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:4AEJGONZ262R66D7Q6OWKYYGZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rapid factorization of structured matrices via randomized sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Per-Gunnar Martinsson","submitted_at":"2008-06-13T22:00:04Z","abstract_excerpt":"Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rank-deficient, but have off-diagonal blocks that are. Such matrices arise frequently in numerical analysis and signal processing, and there exist several methods for rapidly performing algebraic operations (matrix-vector multiplications, matrix factorizations, matrix inversio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.2339","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/0806.2339/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-03T22:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYkEbrvo1t87/pIFtRS0/3i6kBrTkVSD6LKeO4yg/7W6iGTJ0RFTcghR0ZBmBM99FV9gRPOfAtg3w0a7t2hYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:53:24.316743Z"},"content_sha256":"74abfc805a976360895797eea443db5673a8ce6b3ffa7e9d1046707164a6f4fd","schema_version":"1.0","event_id":"sha256:74abfc805a976360895797eea443db5673a8ce6b3ffa7e9d1046707164a6f4fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4AEJGONZ262R66D7Q6OWKYYGZN/bundle.json","state_url":"https://pith.science/pith/4AEJGONZ262R66D7Q6OWKYYGZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4AEJGONZ262R66D7Q6OWKYYGZN/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-10T10:53:24Z","links":{"resolver":"https://pith.science/pith/4AEJGONZ262R66D7Q6OWKYYGZN","bundle":"https://pith.science/pith/4AEJGONZ262R66D7Q6OWKYYGZN/bundle.json","state":"https://pith.science/pith/4AEJGONZ262R66D7Q6OWKYYGZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4AEJGONZ262R66D7Q6OWKYYGZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:4AEJGONZ262R66D7Q6OWKYYGZN","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":"f29103b2cb7200e3b886aede42ad2fdd68a2a6679d70f2bf768f30f89e8797dc","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-06-13T22:00:04Z","title_canon_sha256":"0f1137fc62ca780c4a4aba41c88f031bf4dc8b49624fad11bba4e6af45de0051"},"schema_version":"1.0","source":{"id":"0806.2339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.2339","created_at":"2026-06-03T22:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"0806.2339v1","created_at":"2026-06-03T22:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.2339","created_at":"2026-06-03T22:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"4AEJGONZ262R","created_at":"2026-06-03T22:06:06Z"},{"alias_kind":"pith_short_16","alias_value":"4AEJGONZ262R66D7","created_at":"2026-06-03T22:06:06Z"},{"alias_kind":"pith_short_8","alias_value":"4AEJGONZ","created_at":"2026-06-03T22:06:06Z"}],"graph_snapshots":[{"event_id":"sha256:74abfc805a976360895797eea443db5673a8ce6b3ffa7e9d1046707164a6f4fd","target":"graph","created_at":"2026-06-03T22:06:06Z","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/0806.2339/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rank-deficient, but have off-diagonal blocks that are. Such matrices arise frequently in numerical analysis and signal processing, and there exist several methods for rapidly performing algebraic operations (matrix-vector multiplications, matrix factorizations, matrix inversio","authors_text":"Per-Gunnar Martinsson","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-06-13T22:00:04Z","title":"Rapid factorization of structured matrices via randomized sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.2339","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:8181eb012b720388f7decc2415770794ee9f053d55b7df264b67410fd885add5","target":"record","created_at":"2026-06-03T22:06:06Z","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":"f29103b2cb7200e3b886aede42ad2fdd68a2a6679d70f2bf768f30f89e8797dc","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-06-13T22:00:04Z","title_canon_sha256":"0f1137fc62ca780c4a4aba41c88f031bf4dc8b49624fad11bba4e6af45de0051"},"schema_version":"1.0","source":{"id":"0806.2339","kind":"arxiv","version":1}},"canonical_sha256":"e0089339b9d7b51f787f879d656306cb732696a1728959480c515ec4ea957ecc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0089339b9d7b51f787f879d656306cb732696a1728959480c515ec4ea957ecc","first_computed_at":"2026-06-03T22:06:06.902355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:06.902355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YeI7b57bGN8DMPmuUuxecBA09b4N8TB6aE9arwLB63bNDo5R5XcsDdq7mSJ6vWBwChKGvldXkE+cnGPVNp7ADw==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:06.903055Z","signed_message":"canonical_sha256_bytes"},"source_id":"0806.2339","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8181eb012b720388f7decc2415770794ee9f053d55b7df264b67410fd885add5","sha256:74abfc805a976360895797eea443db5673a8ce6b3ffa7e9d1046707164a6f4fd"],"state_sha256":"fa8b1526ec2b2b0b88677841f1f0d97a776adae2ff1d284dfb3079e0837b2a0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ewnu40R7io6+FLp+5EkIgdC8Et5dUA4JLUzieT3gnfcCQ168BygGf4oHDYwBp59+S8IgHcVOyeiTjZyFahc2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T10:53:24.324174Z","bundle_sha256":"a994846a4bd8230f6790b12952ebe8df8f5073054d3421a4c27d5a5294e85504"}}