{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JYASJYCNE4LQ3DD4PTUKU6WG7E","short_pith_number":"pith:JYASJYCN","schema_version":"1.0","canonical_sha256":"4e0124e04d27170d8c7c7ce8aa7ac6f90444304e4776083a055a40fadd842903","source":{"kind":"arxiv","id":"1806.01701","version":1},"attestation_state":"computed","paper":{"title":"Graph topology inference based on sparsifying transform learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Paolo Di Lorenzo, Sergio Barbarossa, Stefania Sardellitti","submitted_at":"2018-06-05T14:07:16Z","abstract_excerpt":"Graph-based representations play a key role in machine learning. The fundamental step in these representations is the association of a graph structure to a dataset. In this paper, we propose a method that aims at finding a block sparse representation of the graph signal leading to a modular graph whose Laplacian matrix admits the found dictionary as its eigenvectors. The role of sparsity here is to induce a band-limited representation or, equivalently, a modular structure of the graph. The proposed strategy is composed of two optimization steps: i) learning an orthonormal sparsifying transform"},"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":"1806.01701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-06-05T14:07:16Z","cross_cats_sorted":[],"title_canon_sha256":"e52d16cd03345f2346008e29d0588d6475d91ea19208cb680cedc32a09a6c457","abstract_canon_sha256":"3a4872eb848d7ee0efdb29425ef24773e39f3ecf424177370f452a439e203b28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:27.899110Z","signature_b64":"4//ObjCyiHh75Q+4c0LCwdyys0H2JObmGaZAPBvJldxTi/udt0W8qxqlSLBH9yQOGLkLevT8uQE7sCW45sXWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e0124e04d27170d8c7c7ce8aa7ac6f90444304e4776083a055a40fadd842903","last_reissued_at":"2026-05-17T23:50:27.898343Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:27.898343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph topology inference based on sparsifying transform learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Paolo Di Lorenzo, Sergio Barbarossa, Stefania Sardellitti","submitted_at":"2018-06-05T14:07:16Z","abstract_excerpt":"Graph-based representations play a key role in machine learning. The fundamental step in these representations is the association of a graph structure to a dataset. In this paper, we propose a method that aims at finding a block sparse representation of the graph signal leading to a modular graph whose Laplacian matrix admits the found dictionary as its eigenvectors. The role of sparsity here is to induce a band-limited representation or, equivalently, a modular structure of the graph. The proposed strategy is composed of two optimization steps: i) learning an orthonormal sparsifying transform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01701","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":"1806.01701","created_at":"2026-05-17T23:50:27.898472+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01701v1","created_at":"2026-05-17T23:50:27.898472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01701","created_at":"2026-05-17T23:50:27.898472+00:00"},{"alias_kind":"pith_short_12","alias_value":"JYASJYCNE4LQ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"JYASJYCNE4LQ3DD4","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"JYASJYCN","created_at":"2026-05-18T12:32:33.847187+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/JYASJYCNE4LQ3DD4PTUKU6WG7E","json":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E.json","graph_json":"https://pith.science/api/pith-number/JYASJYCNE4LQ3DD4PTUKU6WG7E/graph.json","events_json":"https://pith.science/api/pith-number/JYASJYCNE4LQ3DD4PTUKU6WG7E/events.json","paper":"https://pith.science/paper/JYASJYCN"},"agent_actions":{"view_html":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E","download_json":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E.json","view_paper":"https://pith.science/paper/JYASJYCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01701&json=true","fetch_graph":"https://pith.science/api/pith-number/JYASJYCNE4LQ3DD4PTUKU6WG7E/graph.json","fetch_events":"https://pith.science/api/pith-number/JYASJYCNE4LQ3DD4PTUKU6WG7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E/action/storage_attestation","attest_author":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E/action/author_attestation","sign_citation":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E/action/citation_signature","submit_replication":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E/action/replication_record"}},"created_at":"2026-05-17T23:50:27.898472+00:00","updated_at":"2026-05-17T23:50:27.898472+00:00"}