{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3XQMAUEUCNWG22TVEPHW77IJU5","short_pith_number":"pith:3XQMAUEU","schema_version":"1.0","canonical_sha256":"dde0c05094136c6d6a7523cf6ffd09a7554e889ad7e6050528b16b1a1688b4ab","source":{"kind":"arxiv","id":"1609.03448","version":1},"attestation_state":"computed","paper":{"title":"Learning Sparse Graphs Under Smoothness Prior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.LG","authors_text":"Alfred O. Hero III, Geert Leus, Sijia Liu, Sundeep Prabhakar Chepuri","submitted_at":"2016-09-12T15:31:20Z","abstract_excerpt":"In this paper, we are interested in learning the underlying graph structure behind training data. Solving this basic problem is essential to carry out any graph signal processing or machine learning task. To realize this, we assume that the data is smooth with respect to the graph topology, and we parameterize the graph topology using an edge sampling function. That is, the graph Laplacian is expressed in terms of a sparse edge selection vector, which provides an explicit handle to control the sparsity level of the graph. We solve the sparse graph learning problem given some training data in b"},"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":"1609.03448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-12T15:31:20Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"54cf86e457011e4ed72655c77013d855172c0ed2007ab4e70477c2ae0b4e504a","abstract_canon_sha256":"ef69e6ab8a48ab5992f81ee671dab279f4bb1092afb5369d74d37b363cf8a16b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:45.758992Z","signature_b64":"ZM7C0bKjZFofZ+uuZc2WIQale8+DxE8Va/ICqJPYmcyPbBVqSwskJ8NGOnK64DHvk/5BlOjOcqWsuTgJZgr2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dde0c05094136c6d6a7523cf6ffd09a7554e889ad7e6050528b16b1a1688b4ab","last_reissued_at":"2026-05-18T00:16:45.758549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:45.758549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Sparse Graphs Under Smoothness Prior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.LG","authors_text":"Alfred O. Hero III, Geert Leus, Sijia Liu, Sundeep Prabhakar Chepuri","submitted_at":"2016-09-12T15:31:20Z","abstract_excerpt":"In this paper, we are interested in learning the underlying graph structure behind training data. Solving this basic problem is essential to carry out any graph signal processing or machine learning task. To realize this, we assume that the data is smooth with respect to the graph topology, and we parameterize the graph topology using an edge sampling function. That is, the graph Laplacian is expressed in terms of a sparse edge selection vector, which provides an explicit handle to control the sparsity level of the graph. We solve the sparse graph learning problem given some training data in b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03448","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":"1609.03448","created_at":"2026-05-18T00:16:45.758634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03448v1","created_at":"2026-05-18T00:16:45.758634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03448","created_at":"2026-05-18T00:16:45.758634+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XQMAUEUCNWG","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XQMAUEUCNWG22TV","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XQMAUEU","created_at":"2026-05-18T12:29:58.707656+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/3XQMAUEUCNWG22TVEPHW77IJU5","json":"https://pith.science/pith/3XQMAUEUCNWG22TVEPHW77IJU5.json","graph_json":"https://pith.science/api/pith-number/3XQMAUEUCNWG22TVEPHW77IJU5/graph.json","events_json":"https://pith.science/api/pith-number/3XQMAUEUCNWG22TVEPHW77IJU5/events.json","paper":"https://pith.science/paper/3XQMAUEU"},"agent_actions":{"view_html":"https://pith.science/pith/3XQMAUEUCNWG22TVEPHW77IJU5","download_json":"https://pith.science/pith/3XQMAUEUCNWG22TVEPHW77IJU5.json","view_paper":"https://pith.science/paper/3XQMAUEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03448&json=true","fetch_graph":"https://pith.science/api/pith-number/3XQMAUEUCNWG22TVEPHW77IJU5/graph.json","fetch_events":"https://pith.science/api/pith-number/3XQMAUEUCNWG22TVEPHW77IJU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XQMAUEUCNWG22TVEPHW77IJU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XQMAUEUCNWG22TVEPHW77IJU5/action/storage_attestation","attest_author":"https://pith.science/pith/3XQMAUEUCNWG22TVEPHW77IJU5/action/author_attestation","sign_citation":"https://pith.science/pith/3XQMAUEUCNWG22TVEPHW77IJU5/action/citation_signature","submit_replication":"https://pith.science/pith/3XQMAUEUCNWG22TVEPHW77IJU5/action/replication_record"}},"created_at":"2026-05-18T00:16:45.758634+00:00","updated_at":"2026-05-18T00:16:45.758634+00:00"}