{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P337IQST2DJOTZ24MLZV2T6GDX","short_pith_number":"pith:P337IQST","canonical_record":{"source":{"id":"1808.06556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-20T16:31:30Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"b9c79df859b99ddc0119824a90623d5dca02e122d469571f9ced5dadc523a4e8","abstract_canon_sha256":"6b5f22eec06bfccf7e8a5bcf34c353e7184ff0617c1104db9c9e120ab535dfe8"},"schema_version":"1.0"},"canonical_sha256":"7ef7f44253d0d2e9e75c62f35d4fc61ddb15d7e6d76fa3298a05f8e96ff53b14","source":{"kind":"arxiv","id":"1808.06556","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06556","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06556v1","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06556","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"pith_short_12","alias_value":"P337IQST2DJO","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P337IQST2DJOTZ24","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P337IQST","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P337IQST2DJOTZ24MLZV2T6GDX","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-20T16:31:30Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"b9c79df859b99ddc0119824a90623d5dca02e122d469571f9ced5dadc523a4e8","abstract_canon_sha256":"6b5f22eec06bfccf7e8a5bcf34c353e7184ff0617c1104db9c9e120ab535dfe8"},"schema_version":"1.0"},"canonical_sha256":"7ef7f44253d0d2e9e75c62f35d4fc61ddb15d7e6d76fa3298a05f8e96ff53b14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:44.462898Z","signature_b64":"Mms+tOPVr7WEQpfe3VqKS5pHaDXBCCnAqpCjTEtkY61bAIxdfD7BJ4Vzi6dJo8lEj1dN8vrDaFuloLHlCWrbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ef7f44253d0d2e9e75c62f35d4fc61ddb15d7e6d76fa3298a05f8e96ff53b14","last_reissued_at":"2026-05-18T00:07:44.462175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:44.462175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06556","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-18T00:07:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSOp9SJtJzoh2H4z0kQXj3K3P+/FWP/jlwA3t/uTnyNy5tluzLnHmxljtoSryQXh7yETnHvGW2WYbSZPGTh1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:46:12.390841Z"},"content_sha256":"be66a407662c79669a260b99b2debb4ef9d244d678eee875a38f5b5468b26308","schema_version":"1.0","event_id":"sha256:be66a407662c79669a260b99b2debb4ef9d244d678eee875a38f5b5468b26308"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P337IQST2DJOTZ24MLZV2T6GDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Triangle Lasso for Simultaneous Clustering and Optimization in Graph Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"En Zhu, Jianping Yin, Kai Xu, Xinwang Liu, Xinzhong Zhu, Yawei Zhao","submitted_at":"2018-08-20T16:31:30Z","abstract_excerpt":"Recently, network lasso has drawn many attentions due to its remarkable performance on simultaneous clustering and optimization. However, it usually suffers from the imperfect data (noise, missing values etc), and yields sub-optimal solutions. The reason is that it finds the similar instances according to their features directly, which is usually impacted by the imperfect data, and thus returns sub-optimal results. In this paper, we propose triangle lasso to avoid its disadvantage. Triangle lasso finds the similar instances according to their neighbours. If two instances have many common neigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06556","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-18T00:07:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7GCPaa8akMbeRO4BU4KpepNQ9R2KLa/q4h/HiMaPracG8z5jEhTnIxtBAnVImKA91pi/DDWek2bV4RbnzvNiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:46:12.391306Z"},"content_sha256":"c62182924d3a5843d94e6abd70d475321b1984cb4c9d6812bf91924f5ff5ee09","schema_version":"1.0","event_id":"sha256:c62182924d3a5843d94e6abd70d475321b1984cb4c9d6812bf91924f5ff5ee09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P337IQST2DJOTZ24MLZV2T6GDX/bundle.json","state_url":"https://pith.science/pith/P337IQST2DJOTZ24MLZV2T6GDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P337IQST2DJOTZ24MLZV2T6GDX/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-31T00:46:12Z","links":{"resolver":"https://pith.science/pith/P337IQST2DJOTZ24MLZV2T6GDX","bundle":"https://pith.science/pith/P337IQST2DJOTZ24MLZV2T6GDX/bundle.json","state":"https://pith.science/pith/P337IQST2DJOTZ24MLZV2T6GDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P337IQST2DJOTZ24MLZV2T6GDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P337IQST2DJOTZ24MLZV2T6GDX","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":"6b5f22eec06bfccf7e8a5bcf34c353e7184ff0617c1104db9c9e120ab535dfe8","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-20T16:31:30Z","title_canon_sha256":"b9c79df859b99ddc0119824a90623d5dca02e122d469571f9ced5dadc523a4e8"},"schema_version":"1.0","source":{"id":"1808.06556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06556","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06556v1","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06556","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"pith_short_12","alias_value":"P337IQST2DJO","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P337IQST2DJOTZ24","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P337IQST","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:c62182924d3a5843d94e6abd70d475321b1984cb4c9d6812bf91924f5ff5ee09","target":"graph","created_at":"2026-05-18T00:07:44Z","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":"Recently, network lasso has drawn many attentions due to its remarkable performance on simultaneous clustering and optimization. However, it usually suffers from the imperfect data (noise, missing values etc), and yields sub-optimal solutions. The reason is that it finds the similar instances according to their features directly, which is usually impacted by the imperfect data, and thus returns sub-optimal results. In this paper, we propose triangle lasso to avoid its disadvantage. Triangle lasso finds the similar instances according to their neighbours. If two instances have many common neigh","authors_text":"En Zhu, Jianping Yin, Kai Xu, Xinwang Liu, Xinzhong Zhu, Yawei Zhao","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-20T16:31:30Z","title":"Triangle Lasso for Simultaneous Clustering and Optimization in Graph Datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06556","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:be66a407662c79669a260b99b2debb4ef9d244d678eee875a38f5b5468b26308","target":"record","created_at":"2026-05-18T00:07:44Z","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":"6b5f22eec06bfccf7e8a5bcf34c353e7184ff0617c1104db9c9e120ab535dfe8","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-20T16:31:30Z","title_canon_sha256":"b9c79df859b99ddc0119824a90623d5dca02e122d469571f9ced5dadc523a4e8"},"schema_version":"1.0","source":{"id":"1808.06556","kind":"arxiv","version":1}},"canonical_sha256":"7ef7f44253d0d2e9e75c62f35d4fc61ddb15d7e6d76fa3298a05f8e96ff53b14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ef7f44253d0d2e9e75c62f35d4fc61ddb15d7e6d76fa3298a05f8e96ff53b14","first_computed_at":"2026-05-18T00:07:44.462175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:44.462175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mms+tOPVr7WEQpfe3VqKS5pHaDXBCCnAqpCjTEtkY61bAIxdfD7BJ4Vzi6dJo8lEj1dN8vrDaFuloLHlCWrbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:44.462898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be66a407662c79669a260b99b2debb4ef9d244d678eee875a38f5b5468b26308","sha256:c62182924d3a5843d94e6abd70d475321b1984cb4c9d6812bf91924f5ff5ee09"],"state_sha256":"4d0d53cf9117349e409a5f910137d7957b90d311c2b5b6dbd0f0e1299779ac8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKbW9TVraGE88fkLO9pM+welMb5qQivzbrjNiiTRoGm8gzn7dnEXwWmlkVrxnx3Lb6lF7bhPnvUV4hugxGAuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:46:12.394391Z","bundle_sha256":"c7feef0db2ff61a4a988c422fd797c90feb642141f68e4b383ad2a460af6ee8d"}}