{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6LI3L6MWEUBEKSR4KLQYKZ2NVQ","short_pith_number":"pith:6LI3L6MW","canonical_record":{"source":{"id":"1310.1769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-07T13:05:36Z","cross_cats_sorted":[],"title_canon_sha256":"5b58a2f16dcdb0cc42e2cb3d58185ee4858d59fedf5bf44205a29b9b3af58187","abstract_canon_sha256":"edf181fb7e72b7c4703e7090d0264d1d3d15624abf8205935776c9982337028a"},"schema_version":"1.0"},"canonical_sha256":"f2d1b5f9962502454a3c52e185674dac12bdd2c1587af849c45e98e88e3e6638","source":{"kind":"arxiv","id":"1310.1769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1769","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1769v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1769","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"6LI3L6MWEUBE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6LI3L6MWEUBEKSR4","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6LI3L6MW","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6LI3L6MWEUBEKSR4KLQYKZ2NVQ","target":"record","payload":{"canonical_record":{"source":{"id":"1310.1769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-07T13:05:36Z","cross_cats_sorted":[],"title_canon_sha256":"5b58a2f16dcdb0cc42e2cb3d58185ee4858d59fedf5bf44205a29b9b3af58187","abstract_canon_sha256":"edf181fb7e72b7c4703e7090d0264d1d3d15624abf8205935776c9982337028a"},"schema_version":"1.0"},"canonical_sha256":"f2d1b5f9962502454a3c52e185674dac12bdd2c1587af849c45e98e88e3e6638","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:10.641332Z","signature_b64":"qDgfZsy/l69dO+PLB0OlLI4uVqYcP1gH2SsIDo5Cumacc8DPVuL+3ZdmnWQdEcyNeROLp0i+WEimoZ0kpbK5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2d1b5f9962502454a3c52e185674dac12bdd2c1587af849c45e98e88e3e6638","last_reissued_at":"2026-05-18T03:11:10.640525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:10.640525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.1769","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-18T03:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1VxDcMYd4dSHzjRlut1H3C95NfXvwJEXsDrT1giHZlw3BgbBUYsY9dkshh3acfT+o9t+3h/zvDTkLUOIdNHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:16:43.601016Z"},"content_sha256":"cf8ae64723bc600625859c88f74d6a2fcae7b0e3f5ab985ed611643fbeb8ef57","schema_version":"1.0","event_id":"sha256:cf8ae64723bc600625859c88f74d6a2fcae7b0e3f5ab985ed611643fbeb8ef57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6LI3L6MWEUBEKSR4KLQYKZ2NVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Splitting Augmented Lagrangian Method for Low Multilinear-Rank Tensor Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lei Yang, Yufan Li, Zheng-Hai Huang","submitted_at":"2013-10-07T13:05:36Z","abstract_excerpt":"This paper studies a recovery task of finding a low multilinear-rank tensor that fulfills some linear constraints in the general settings, which has many applications in computer vision and graphics. This problem is named as the low multilinear-rank tensor recovery problem. The variable splitting technique and convex relaxation technique are used to transform this problem into a tractable constrained optimization problem. Considering the favorable structure of the problem, we develop a splitting augmented Lagrangian method to solve the resulting problem. The proposed algorithm is easily implem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1769","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-18T03:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yx1AAp8gUBu+cZg7EdxhEYDfuvXp4UCt/dQjAqEUzzGAZ2ctdfSg4xRUcOkDr/S3fV1g+nAryGmvrHa2HoqfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:16:43.601374Z"},"content_sha256":"4902d8d4b7fd141d0d3bdf428efa04ca2c514d421ec1a58a7c9847ee500055e5","schema_version":"1.0","event_id":"sha256:4902d8d4b7fd141d0d3bdf428efa04ca2c514d421ec1a58a7c9847ee500055e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LI3L6MWEUBEKSR4KLQYKZ2NVQ/bundle.json","state_url":"https://pith.science/pith/6LI3L6MWEUBEKSR4KLQYKZ2NVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LI3L6MWEUBEKSR4KLQYKZ2NVQ/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-28T03:16:43Z","links":{"resolver":"https://pith.science/pith/6LI3L6MWEUBEKSR4KLQYKZ2NVQ","bundle":"https://pith.science/pith/6LI3L6MWEUBEKSR4KLQYKZ2NVQ/bundle.json","state":"https://pith.science/pith/6LI3L6MWEUBEKSR4KLQYKZ2NVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LI3L6MWEUBEKSR4KLQYKZ2NVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6LI3L6MWEUBEKSR4KLQYKZ2NVQ","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":"edf181fb7e72b7c4703e7090d0264d1d3d15624abf8205935776c9982337028a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-07T13:05:36Z","title_canon_sha256":"5b58a2f16dcdb0cc42e2cb3d58185ee4858d59fedf5bf44205a29b9b3af58187"},"schema_version":"1.0","source":{"id":"1310.1769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1769","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1769v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1769","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"6LI3L6MWEUBE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6LI3L6MWEUBEKSR4","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6LI3L6MW","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:4902d8d4b7fd141d0d3bdf428efa04ca2c514d421ec1a58a7c9847ee500055e5","target":"graph","created_at":"2026-05-18T03:11:10Z","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":"This paper studies a recovery task of finding a low multilinear-rank tensor that fulfills some linear constraints in the general settings, which has many applications in computer vision and graphics. This problem is named as the low multilinear-rank tensor recovery problem. The variable splitting technique and convex relaxation technique are used to transform this problem into a tractable constrained optimization problem. Considering the favorable structure of the problem, we develop a splitting augmented Lagrangian method to solve the resulting problem. The proposed algorithm is easily implem","authors_text":"Lei Yang, Yufan Li, Zheng-Hai Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-07T13:05:36Z","title":"A Splitting Augmented Lagrangian Method for Low Multilinear-Rank Tensor Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1769","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:cf8ae64723bc600625859c88f74d6a2fcae7b0e3f5ab985ed611643fbeb8ef57","target":"record","created_at":"2026-05-18T03:11:10Z","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":"edf181fb7e72b7c4703e7090d0264d1d3d15624abf8205935776c9982337028a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-07T13:05:36Z","title_canon_sha256":"5b58a2f16dcdb0cc42e2cb3d58185ee4858d59fedf5bf44205a29b9b3af58187"},"schema_version":"1.0","source":{"id":"1310.1769","kind":"arxiv","version":1}},"canonical_sha256":"f2d1b5f9962502454a3c52e185674dac12bdd2c1587af849c45e98e88e3e6638","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2d1b5f9962502454a3c52e185674dac12bdd2c1587af849c45e98e88e3e6638","first_computed_at":"2026-05-18T03:11:10.640525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:10.640525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qDgfZsy/l69dO+PLB0OlLI4uVqYcP1gH2SsIDo5Cumacc8DPVuL+3ZdmnWQdEcyNeROLp0i+WEimoZ0kpbK5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:10.641332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf8ae64723bc600625859c88f74d6a2fcae7b0e3f5ab985ed611643fbeb8ef57","sha256:4902d8d4b7fd141d0d3bdf428efa04ca2c514d421ec1a58a7c9847ee500055e5"],"state_sha256":"a31d48633fe1c8d4427cbf92b28f0afc05f610d210f9d2cc3547bb587765c494"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OhUDbK+BYAMjraJU+DdDE8W9SXGii1fKTdSKP5nHUes0g+ehVDtRVu//DzO9py9sWUiDwjMdYv+r/RobYnBDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:16:43.603396Z","bundle_sha256":"ef81a3511e6e98dc788665e7c3dec1570b58272d03b0f6cf20ac9c1eb173ae5f"}}