{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:V5QUEOVELN2E7DK6R7GU2CJ43F","short_pith_number":"pith:V5QUEOVE","schema_version":"1.0","canonical_sha256":"af61423aa45b744f8d5e8fcd4d093cd94916e7d7d3b8d8b071339f058de3736e","source":{"kind":"arxiv","id":"1507.00280","version":1},"attestation_state":"computed","paper":{"title":"Network Lasso: Clustering and Optimization in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.AP","stat.ME"],"primary_cat":"cs.SI","authors_text":"David Hallac, Jure Leskovec, Stephen Boyd","submitted_at":"2015-07-01T16:25:38Z","abstract_excerpt":"Convex optimization is an essential tool for modern data analysis, as it provides a framework to formulate and solve many problems in machine learning and data mining. However, general convex optimization solvers do not scale well, and scalable solvers are often specialized to only work on a narrow class of problems. Therefore, there is a need for simple, scalable algorithms that can solve many common optimization problems. In this paper, we introduce the \\emph{network lasso}, a generalization of the group lasso to a network setting that allows for simultaneous clustering and optimization on g"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1507.00280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-07-01T16:25:38Z","cross_cats_sorted":["math.OC","stat.AP","stat.ME"],"title_canon_sha256":"2bf67801aebe9cd45e78bb841fe94cfd4415dddb85ac4c5487eed8b9d56a2e49","abstract_canon_sha256":"358b427ec39b41fc4d4fffc0a118bd3e396b99ff50e8c9765100451f28bc4f29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:29.333975Z","signature_b64":"rIPgIxIjAm2ogurCJr0um88MIfZCL3bPZU3xcAXKsjcvcA95QF7ec7YGEF/GZE9B7cgXQ9G/UhBdmPmb0BNvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af61423aa45b744f8d5e8fcd4d093cd94916e7d7d3b8d8b071339f058de3736e","last_reissued_at":"2026-05-18T01:37:29.333328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:29.333328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Lasso: Clustering and Optimization in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.AP","stat.ME"],"primary_cat":"cs.SI","authors_text":"David Hallac, Jure Leskovec, Stephen Boyd","submitted_at":"2015-07-01T16:25:38Z","abstract_excerpt":"Convex optimization is an essential tool for modern data analysis, as it provides a framework to formulate and solve many problems in machine learning and data mining. However, general convex optimization solvers do not scale well, and scalable solvers are often specialized to only work on a narrow class of problems. Therefore, there is a need for simple, scalable algorithms that can solve many common optimization problems. In this paper, we introduce the \\emph{network lasso}, a generalization of the group lasso to a network setting that allows for simultaneous clustering and optimization on g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00280","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.00280","created_at":"2026-05-18T01:37:29.333425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00280v1","created_at":"2026-05-18T01:37:29.333425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00280","created_at":"2026-05-18T01:37:29.333425+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5QUEOVELN2E","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5QUEOVELN2E7DK6","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5QUEOVE","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V5QUEOVELN2E7DK6R7GU2CJ43F","json":"https://pith.science/pith/V5QUEOVELN2E7DK6R7GU2CJ43F.json","graph_json":"https://pith.science/api/pith-number/V5QUEOVELN2E7DK6R7GU2CJ43F/graph.json","events_json":"https://pith.science/api/pith-number/V5QUEOVELN2E7DK6R7GU2CJ43F/events.json","paper":"https://pith.science/paper/V5QUEOVE"},"agent_actions":{"view_html":"https://pith.science/pith/V5QUEOVELN2E7DK6R7GU2CJ43F","download_json":"https://pith.science/pith/V5QUEOVELN2E7DK6R7GU2CJ43F.json","view_paper":"https://pith.science/paper/V5QUEOVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00280&json=true","fetch_graph":"https://pith.science/api/pith-number/V5QUEOVELN2E7DK6R7GU2CJ43F/graph.json","fetch_events":"https://pith.science/api/pith-number/V5QUEOVELN2E7DK6R7GU2CJ43F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5QUEOVELN2E7DK6R7GU2CJ43F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5QUEOVELN2E7DK6R7GU2CJ43F/action/storage_attestation","attest_author":"https://pith.science/pith/V5QUEOVELN2E7DK6R7GU2CJ43F/action/author_attestation","sign_citation":"https://pith.science/pith/V5QUEOVELN2E7DK6R7GU2CJ43F/action/citation_signature","submit_replication":"https://pith.science/pith/V5QUEOVELN2E7DK6R7GU2CJ43F/action/replication_record"}},"created_at":"2026-05-18T01:37:29.333425+00:00","updated_at":"2026-05-18T01:37:29.333425+00:00"}