{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DOIJ7WMCW2GUVO3UEKUIYFLMSA","short_pith_number":"pith:DOIJ7WMC","canonical_record":{"source":{"id":"1904.09841","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-22T13:01:07Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"73da82aec40ab54ff92da3b2cf1f40ca97b06868c803b2ac37df6b608cc09755","abstract_canon_sha256":"e780d0c0e6ffb6f2ef37cdbbe74270531d7187d2cf8177e1b784453f918f9474"},"schema_version":"1.0"},"canonical_sha256":"1b909fd982b68d4abb7422a88c156c903d673b0c46051e561fb5ab6c2189d17d","source":{"kind":"arxiv","id":"1904.09841","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09841","created_at":"2026-06-04T20:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09841v4","created_at":"2026-06-04T20:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09841","created_at":"2026-06-04T20:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"DOIJ7WMCW2GU","created_at":"2026-06-04T20:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"DOIJ7WMCW2GUVO3U","created_at":"2026-06-04T20:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"DOIJ7WMC","created_at":"2026-06-04T20:14:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DOIJ7WMCW2GUVO3UEKUIYFLMSA","target":"record","payload":{"canonical_record":{"source":{"id":"1904.09841","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-22T13:01:07Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"73da82aec40ab54ff92da3b2cf1f40ca97b06868c803b2ac37df6b608cc09755","abstract_canon_sha256":"e780d0c0e6ffb6f2ef37cdbbe74270531d7187d2cf8177e1b784453f918f9474"},"schema_version":"1.0"},"canonical_sha256":"1b909fd982b68d4abb7422a88c156c903d673b0c46051e561fb5ab6c2189d17d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:14:26.672288Z","signature_b64":"SfCNVpvyyBPZWkv5Hx3CTPjz1G6Ou3TpmFcvvoSlZtH3rl4SAyahrrNg3gqTKVIYVW+7lknhYLPx1XSm7XcqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b909fd982b68d4abb7422a88c156c903d673b0c46051e561fb5ab6c2189d17d","last_reissued_at":"2026-06-04T20:14:26.671854Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:14:26.671854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.09841","source_version":4,"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-04T20:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o14LJWJdYv/+XpLccwKbyjc82a3WA/9Xti93yvuFwnofIrr3CpoKKqCTH5hLoIaMvTvBjTTNzT/d+nFdmMDvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T22:27:37.632882Z"},"content_sha256":"e54bd86f6c5ba246badf281158c36c33ed65052efe82d1a55d4d64f7a2ddd0ad","schema_version":"1.0","event_id":"sha256:e54bd86f6c5ba246badf281158c36c33ed65052efe82d1a55d4d64f7a2ddd0ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DOIJ7WMCW2GUVO3UEKUIYFLMSA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Cameron Musco, Christopher Musco, David P. Woodruff","submitted_at":"2019-04-22T13:01:07Z","abstract_excerpt":"In $masked\\ low-rank\\ approximation$, one is given $A \\in \\mathbb{R}^{n \\times n}$ and binary mask matrix $W \\in \\{0,1\\}^{n \\times n}$. The goal is to find a rank-$k$ matrix $L$ for which: $$cost(L) = \\sum_{i=1}^{n} \\sum_{j = 1}^{n} W_{i,j} \\cdot (A_{i,j} - L_{i,j} )^2 \\leq OPT + \\epsilon \\|A\\|_F^2 ,$$ where $OPT = \\min_{rank-k\\ \\hat{L}} cost(\\hat L)$ and $\\epsilon$ is a given error parameter. Depending on the choice of $W$, this problem captures factor analysis, low-rank plus diagonal decomposition, robust PCA, low-rank matrix completion, low-rank plus block matrix approximation, and many pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09841","kind":"arxiv","version":4},"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/1904.09841/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-04T20:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nGHrJkph7QOy2Y6DRRqnsKyHULUmIkgppwORzDesdLAOClSnQd4Zj8C22S5kreMHO2hy5rjIYm/gc+BvVc5HCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T22:27:37.633266Z"},"content_sha256":"06947959e5a56d11d147430796a53d1371e854514c84ec800e12c5cc4ea31e16","schema_version":"1.0","event_id":"sha256:06947959e5a56d11d147430796a53d1371e854514c84ec800e12c5cc4ea31e16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOIJ7WMCW2GUVO3UEKUIYFLMSA/bundle.json","state_url":"https://pith.science/pith/DOIJ7WMCW2GUVO3UEKUIYFLMSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOIJ7WMCW2GUVO3UEKUIYFLMSA/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-19T22:27:37Z","links":{"resolver":"https://pith.science/pith/DOIJ7WMCW2GUVO3UEKUIYFLMSA","bundle":"https://pith.science/pith/DOIJ7WMCW2GUVO3UEKUIYFLMSA/bundle.json","state":"https://pith.science/pith/DOIJ7WMCW2GUVO3UEKUIYFLMSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOIJ7WMCW2GUVO3UEKUIYFLMSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DOIJ7WMCW2GUVO3UEKUIYFLMSA","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":"e780d0c0e6ffb6f2ef37cdbbe74270531d7187d2cf8177e1b784453f918f9474","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-22T13:01:07Z","title_canon_sha256":"73da82aec40ab54ff92da3b2cf1f40ca97b06868c803b2ac37df6b608cc09755"},"schema_version":"1.0","source":{"id":"1904.09841","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09841","created_at":"2026-06-04T20:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09841v4","created_at":"2026-06-04T20:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09841","created_at":"2026-06-04T20:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"DOIJ7WMCW2GU","created_at":"2026-06-04T20:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"DOIJ7WMCW2GUVO3U","created_at":"2026-06-04T20:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"DOIJ7WMC","created_at":"2026-06-04T20:14:26Z"}],"graph_snapshots":[{"event_id":"sha256:06947959e5a56d11d147430796a53d1371e854514c84ec800e12c5cc4ea31e16","target":"graph","created_at":"2026-06-04T20:14:26Z","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/1904.09841/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In $masked\\ low-rank\\ approximation$, one is given $A \\in \\mathbb{R}^{n \\times n}$ and binary mask matrix $W \\in \\{0,1\\}^{n \\times n}$. The goal is to find a rank-$k$ matrix $L$ for which: $$cost(L) = \\sum_{i=1}^{n} \\sum_{j = 1}^{n} W_{i,j} \\cdot (A_{i,j} - L_{i,j} )^2 \\leq OPT + \\epsilon \\|A\\|_F^2 ,$$ where $OPT = \\min_{rank-k\\ \\hat{L}} cost(\\hat L)$ and $\\epsilon$ is a given error parameter. Depending on the choice of $W$, this problem captures factor analysis, low-rank plus diagonal decomposition, robust PCA, low-rank matrix completion, low-rank plus block matrix approximation, and many pro","authors_text":"Cameron Musco, Christopher Musco, David P. Woodruff","cross_cats":["cs.LG","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-22T13:01:07Z","title":"Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09841","kind":"arxiv","version":4},"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:e54bd86f6c5ba246badf281158c36c33ed65052efe82d1a55d4d64f7a2ddd0ad","target":"record","created_at":"2026-06-04T20:14:26Z","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":"e780d0c0e6ffb6f2ef37cdbbe74270531d7187d2cf8177e1b784453f918f9474","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-22T13:01:07Z","title_canon_sha256":"73da82aec40ab54ff92da3b2cf1f40ca97b06868c803b2ac37df6b608cc09755"},"schema_version":"1.0","source":{"id":"1904.09841","kind":"arxiv","version":4}},"canonical_sha256":"1b909fd982b68d4abb7422a88c156c903d673b0c46051e561fb5ab6c2189d17d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b909fd982b68d4abb7422a88c156c903d673b0c46051e561fb5ab6c2189d17d","first_computed_at":"2026-06-04T20:14:26.671854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:14:26.671854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SfCNVpvyyBPZWkv5Hx3CTPjz1G6Ou3TpmFcvvoSlZtH3rl4SAyahrrNg3gqTKVIYVW+7lknhYLPx1XSm7XcqCg==","signature_status":"signed_v1","signed_at":"2026-06-04T20:14:26.672288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09841","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e54bd86f6c5ba246badf281158c36c33ed65052efe82d1a55d4d64f7a2ddd0ad","sha256:06947959e5a56d11d147430796a53d1371e854514c84ec800e12c5cc4ea31e16"],"state_sha256":"4051a5c815e9e130fd900866d7a881597f9416837bd0c450bfdc3c7f32ccf7e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+y8bLsY3fwGIfy06pf98QKc90fWFXXbbKEW72JlBffBdxl2QXUZOlVcfW5Ch1nCzrhEdAfe7jqC4+cGRBAjNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T22:27:37.635338Z","bundle_sha256":"01a1dbc1de279d9704802c8d716cd3cb724a89819c04008af9f339f7dabe562e"}}