{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JYASJYCNE4LQ3DD4PTUKU6WG7E","short_pith_number":"pith:JYASJYCN","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"},"canonical_sha256":"4e0124e04d27170d8c7c7ce8aa7ac6f90444304e4776083a055a40fadd842903","source":{"kind":"arxiv","id":"1806.01701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01701","created_at":"2026-05-17T23:50:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01701v1","created_at":"2026-05-17T23:50:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01701","created_at":"2026-05-17T23:50:27Z"},{"alias_kind":"pith_short_12","alias_value":"JYASJYCNE4LQ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JYASJYCNE4LQ3DD4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JYASJYCN","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JYASJYCNE4LQ3DD4PTUKU6WG7E","target":"record","payload":{"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"},"canonical_sha256":"4e0124e04d27170d8c7c7ce8aa7ac6f90444304e4776083a055a40fadd842903","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"},"source_kind":"arxiv","source_id":"1806.01701","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-17T23:50:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZXJKBN94RXOrw0CzOSwrXJmIuU/SsUZlLicyz2GBw/E+9g60GieRyTQZAPxKD7I7GzFOAfc1Hb/4qQkEdwtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:12:06.114439Z"},"content_sha256":"faa0b28aa33b605e782487f555c2d1b9520b5486567ef2f36c5666cccc364fdb","schema_version":"1.0","event_id":"sha256:faa0b28aa33b605e782487f555c2d1b9520b5486567ef2f36c5666cccc364fdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JYASJYCNE4LQ3DD4PTUKU6WG7E","target":"graph","payload":{"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"},"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-17T23:50:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJ4qEBQGQtStOJeQ6jGRH8jabJUWBx1OYu7niIvfcOjCCO4oWnPSg0ENjYZR04lgWLSKBmgdMmWkq/e/K9MgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:12:06.114775Z"},"content_sha256":"cfac3882eeaba16a7e1287834c00ae5d032dc827dc0aa36fcecc4d2ded0e3142","schema_version":"1.0","event_id":"sha256:cfac3882eeaba16a7e1287834c00ae5d032dc827dc0aa36fcecc4d2ded0e3142"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E/bundle.json","state_url":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E/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-06-20T10:12:06Z","links":{"resolver":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E","bundle":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E/bundle.json","state":"https://pith.science/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYASJYCNE4LQ3DD4PTUKU6WG7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JYASJYCNE4LQ3DD4PTUKU6WG7E","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":"3a4872eb848d7ee0efdb29425ef24773e39f3ecf424177370f452a439e203b28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-06-05T14:07:16Z","title_canon_sha256":"e52d16cd03345f2346008e29d0588d6475d91ea19208cb680cedc32a09a6c457"},"schema_version":"1.0","source":{"id":"1806.01701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01701","created_at":"2026-05-17T23:50:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01701v1","created_at":"2026-05-17T23:50:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01701","created_at":"2026-05-17T23:50:27Z"},{"alias_kind":"pith_short_12","alias_value":"JYASJYCNE4LQ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JYASJYCNE4LQ3DD4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JYASJYCN","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:cfac3882eeaba16a7e1287834c00ae5d032dc827dc0aa36fcecc4d2ded0e3142","target":"graph","created_at":"2026-05-17T23:50:27Z","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":"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","authors_text":"Paolo Di Lorenzo, Sergio Barbarossa, Stefania Sardellitti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-06-05T14:07:16Z","title":"Graph topology inference based on sparsifying transform learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01701","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:faa0b28aa33b605e782487f555c2d1b9520b5486567ef2f36c5666cccc364fdb","target":"record","created_at":"2026-05-17T23:50:27Z","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":"3a4872eb848d7ee0efdb29425ef24773e39f3ecf424177370f452a439e203b28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-06-05T14:07:16Z","title_canon_sha256":"e52d16cd03345f2346008e29d0588d6475d91ea19208cb680cedc32a09a6c457"},"schema_version":"1.0","source":{"id":"1806.01701","kind":"arxiv","version":1}},"canonical_sha256":"4e0124e04d27170d8c7c7ce8aa7ac6f90444304e4776083a055a40fadd842903","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e0124e04d27170d8c7c7ce8aa7ac6f90444304e4776083a055a40fadd842903","first_computed_at":"2026-05-17T23:50:27.898343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:27.898343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4//ObjCyiHh75Q+4c0LCwdyys0H2JObmGaZAPBvJldxTi/udt0W8qxqlSLBH9yQOGLkLevT8uQE7sCW45sXWCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:27.899110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faa0b28aa33b605e782487f555c2d1b9520b5486567ef2f36c5666cccc364fdb","sha256:cfac3882eeaba16a7e1287834c00ae5d032dc827dc0aa36fcecc4d2ded0e3142"],"state_sha256":"f95c1ea72a01a6411b3cc9af8bca9fa3ae7fbc39e2aa3db09b83d8e0db98bf6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cLMBaocCSXQse4n1Wylcnro/C8zQpj08/g4AcR5GXGbh7N2txdEoJ+ZoGWljAQWiKBi2L+2gEDij2jM5qfrKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:12:06.116645Z","bundle_sha256":"783358d3fff72534f25098d7237459cf9dc1d67e6ee4c818606ff3b601033f81"}}