{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:C3EBJXPI4YM65WQXDOGQQBNPGD","short_pith_number":"pith:C3EBJXPI","canonical_record":{"source":{"id":"1109.0367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-02T06:58:36Z","cross_cats_sorted":[],"title_canon_sha256":"d9de30dbfe5dfbb3fc842dc05d86b3e438e06a0a4ffc80382a98cfa3c29e320d","abstract_canon_sha256":"a2068c84fe4d5316dc125693e9eda884e62e11318855dcb02042d3cf421479b7"},"schema_version":"1.0"},"canonical_sha256":"16c814dde8e619eeda171b8d0805af30d62c5ba56036c9665684e14a12a3c4d4","source":{"kind":"arxiv","id":"1109.0367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0367","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0367v1","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0367","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"pith_short_12","alias_value":"C3EBJXPI4YM6","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C3EBJXPI4YM65WQX","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C3EBJXPI","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:C3EBJXPI4YM65WQXDOGQQBNPGD","target":"record","payload":{"canonical_record":{"source":{"id":"1109.0367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-02T06:58:36Z","cross_cats_sorted":[],"title_canon_sha256":"d9de30dbfe5dfbb3fc842dc05d86b3e438e06a0a4ffc80382a98cfa3c29e320d","abstract_canon_sha256":"a2068c84fe4d5316dc125693e9eda884e62e11318855dcb02042d3cf421479b7"},"schema_version":"1.0"},"canonical_sha256":"16c814dde8e619eeda171b8d0805af30d62c5ba56036c9665684e14a12a3c4d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:15.854874Z","signature_b64":"9iyceU0VsRbNeG6zMThu1Dt+bcq93ErwndMlqlV60hzzRZvVqZSKEO4En8vdr5JpiDjETZrszEHa+0TBW++dBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16c814dde8e619eeda171b8d0805af30d62c5ba56036c9665684e14a12a3c4d4","last_reissued_at":"2026-05-18T04:14:15.854123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:15.854123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.0367","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-18T04:14:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ukoe1giiYL/Hj2bJEe9GmhvccaFvqbfFJpZEnEHoE6jfw6RT2jXGDiw2brmzcgqLq7unel9ct8XOdXQWfaRcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:22:38.478460Z"},"content_sha256":"2edea9ad85f18c2980bb5ec0cdbb71cfa025ad14550a9aea10566f78e4ed2dc2","schema_version":"1.0","event_id":"sha256:2edea9ad85f18c2980bb5ec0cdbb71cfa025ad14550a9aea10566f78e4ed2dc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:C3EBJXPI4YM65WQXDOGQQBNPGD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Risheng Liu, Zhixun Su, Zhouchen Lin","submitted_at":"2011-09-02T06:58:36Z","abstract_excerpt":"Low-rank representation (LRR) is an effective method for subspace clustering and has found wide applications in computer vision and machine learning. The existing LRR solver is based on the alternating direction method (ADM). It suffers from $O(n^3)$ computation complexity due to the matrix-matrix multiplications and matrix inversions, even if partial SVD is used. Moreover, introducing auxiliary variables also slows down the convergence. Such a heavy computation load prevents LRR from large scale applications. In this paper, we generalize ADM by linearizing the quadratic penalty term and allow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0367","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-18T04:14:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/HeBKV+py99VlWWxvUCvGSRhryM1kgbWyCu+Pird9hKlmW2BxggxrJIVi3zE78SmsRbZo12iTGJVkPtGbMuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:22:38.479177Z"},"content_sha256":"a1d0bd94fd2532edb8aa2d7e2785f10cc01600494fa207c45413cc9b83cf2c8c","schema_version":"1.0","event_id":"sha256:a1d0bd94fd2532edb8aa2d7e2785f10cc01600494fa207c45413cc9b83cf2c8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3EBJXPI4YM65WQXDOGQQBNPGD/bundle.json","state_url":"https://pith.science/pith/C3EBJXPI4YM65WQXDOGQQBNPGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3EBJXPI4YM65WQXDOGQQBNPGD/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-20T00:22:38Z","links":{"resolver":"https://pith.science/pith/C3EBJXPI4YM65WQXDOGQQBNPGD","bundle":"https://pith.science/pith/C3EBJXPI4YM65WQXDOGQQBNPGD/bundle.json","state":"https://pith.science/pith/C3EBJXPI4YM65WQXDOGQQBNPGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3EBJXPI4YM65WQXDOGQQBNPGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C3EBJXPI4YM65WQXDOGQQBNPGD","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":"a2068c84fe4d5316dc125693e9eda884e62e11318855dcb02042d3cf421479b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-02T06:58:36Z","title_canon_sha256":"d9de30dbfe5dfbb3fc842dc05d86b3e438e06a0a4ffc80382a98cfa3c29e320d"},"schema_version":"1.0","source":{"id":"1109.0367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0367","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0367v1","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0367","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"pith_short_12","alias_value":"C3EBJXPI4YM6","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C3EBJXPI4YM65WQX","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C3EBJXPI","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:a1d0bd94fd2532edb8aa2d7e2785f10cc01600494fa207c45413cc9b83cf2c8c","target":"graph","created_at":"2026-05-18T04:14:15Z","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":"Low-rank representation (LRR) is an effective method for subspace clustering and has found wide applications in computer vision and machine learning. The existing LRR solver is based on the alternating direction method (ADM). It suffers from $O(n^3)$ computation complexity due to the matrix-matrix multiplications and matrix inversions, even if partial SVD is used. Moreover, introducing auxiliary variables also slows down the convergence. Such a heavy computation load prevents LRR from large scale applications. In this paper, we generalize ADM by linearizing the quadratic penalty term and allow","authors_text":"Risheng Liu, Zhixun Su, Zhouchen Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-02T06:58:36Z","title":"Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0367","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:2edea9ad85f18c2980bb5ec0cdbb71cfa025ad14550a9aea10566f78e4ed2dc2","target":"record","created_at":"2026-05-18T04:14:15Z","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":"a2068c84fe4d5316dc125693e9eda884e62e11318855dcb02042d3cf421479b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-02T06:58:36Z","title_canon_sha256":"d9de30dbfe5dfbb3fc842dc05d86b3e438e06a0a4ffc80382a98cfa3c29e320d"},"schema_version":"1.0","source":{"id":"1109.0367","kind":"arxiv","version":1}},"canonical_sha256":"16c814dde8e619eeda171b8d0805af30d62c5ba56036c9665684e14a12a3c4d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16c814dde8e619eeda171b8d0805af30d62c5ba56036c9665684e14a12a3c4d4","first_computed_at":"2026-05-18T04:14:15.854123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:15.854123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9iyceU0VsRbNeG6zMThu1Dt+bcq93ErwndMlqlV60hzzRZvVqZSKEO4En8vdr5JpiDjETZrszEHa+0TBW++dBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:15.854874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.0367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2edea9ad85f18c2980bb5ec0cdbb71cfa025ad14550a9aea10566f78e4ed2dc2","sha256:a1d0bd94fd2532edb8aa2d7e2785f10cc01600494fa207c45413cc9b83cf2c8c"],"state_sha256":"671b02388fd149f2c54447dc477669f723379433f82ad1db053c5b22f48e92d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i8HV8YVES8437cCQ2BaJiv/9ed6TtAjI/9cq80+rYN6j6VSW1HBsZMhN5sQ5rDX4NhZgQEIjSDsY3iiKg3i7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T00:22:38.482839Z","bundle_sha256":"cc57e6e975ef1ae40b6bd65b6e2717743496ee821c787c06079e4deabfb444a7"}}