{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:56RGQ2RQDS2HUS5DT6WKORZDCT","short_pith_number":"pith:56RGQ2RQ","schema_version":"1.0","canonical_sha256":"efa2686a301cb47a4ba39faca7472314cd7c77217129f1f0f51c19043eea5fc8","source":{"kind":"arxiv","id":"2103.03471","version":3},"attestation_state":"computed","paper":{"title":"Joint Network Topology Inference via Structured Fusion Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"De Wen Soh, Kun Guo, Tony Q. S. Quek, Xiao Yang, Yanli Yuan","submitted_at":"2021-03-05T04:42:32Z","abstract_excerpt":"Joint network topology inference represents a canonical problem of jointly learning multiple graph Laplacian matrices from heterogeneous graph signals. In such a problem, a widely employed assumption is that of a simple common component shared among multiple networks. However, in practice, a more intricate topological pattern, comprising simultaneously of sparse, homogeneity and heterogeneity components, would exhibit in multiple networks. In this paper, we propose a general graph estimator based on a novel structured fusion regularization that enables us to jointly learn multiple graph Laplac"},"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":"2103.03471","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2021-03-05T04:42:32Z","cross_cats_sorted":["eess.SP","stat.ML","stat.TH"],"title_canon_sha256":"f9621d2186256820a5e853064cf192099fad7f7d6a0df5b6dae12bbaacf56956","abstract_canon_sha256":"7bb8f2aaa2e6b200e68035fffab3948fa624af04492639b073dd5b2fa7823389"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:56:14.898358Z","signature_b64":"AeVMywFoXfQq6yEzqHWEWl0/hnD3wkcB+zx2xLu7KW4Ka45+tweS5BIEi/CJMJ0ZkTO5uxtf9KQwtuvwUrFIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efa2686a301cb47a4ba39faca7472314cd7c77217129f1f0f51c19043eea5fc8","last_reissued_at":"2026-07-05T02:56:14.897968Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:56:14.897968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Network Topology Inference via Structured Fusion Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"De Wen Soh, Kun Guo, Tony Q. S. Quek, Xiao Yang, Yanli Yuan","submitted_at":"2021-03-05T04:42:32Z","abstract_excerpt":"Joint network topology inference represents a canonical problem of jointly learning multiple graph Laplacian matrices from heterogeneous graph signals. In such a problem, a widely employed assumption is that of a simple common component shared among multiple networks. However, in practice, a more intricate topological pattern, comprising simultaneously of sparse, homogeneity and heterogeneity components, would exhibit in multiple networks. In this paper, we propose a general graph estimator based on a novel structured fusion regularization that enables us to jointly learn multiple graph Laplac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.03471","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.03471/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2103.03471","created_at":"2026-07-05T02:56:14.898023+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.03471v3","created_at":"2026-07-05T02:56:14.898023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.03471","created_at":"2026-07-05T02:56:14.898023+00:00"},{"alias_kind":"pith_short_12","alias_value":"56RGQ2RQDS2H","created_at":"2026-07-05T02:56:14.898023+00:00"},{"alias_kind":"pith_short_16","alias_value":"56RGQ2RQDS2HUS5D","created_at":"2026-07-05T02:56:14.898023+00:00"},{"alias_kind":"pith_short_8","alias_value":"56RGQ2RQ","created_at":"2026-07-05T02:56:14.898023+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/56RGQ2RQDS2HUS5DT6WKORZDCT","json":"https://pith.science/pith/56RGQ2RQDS2HUS5DT6WKORZDCT.json","graph_json":"https://pith.science/api/pith-number/56RGQ2RQDS2HUS5DT6WKORZDCT/graph.json","events_json":"https://pith.science/api/pith-number/56RGQ2RQDS2HUS5DT6WKORZDCT/events.json","paper":"https://pith.science/paper/56RGQ2RQ"},"agent_actions":{"view_html":"https://pith.science/pith/56RGQ2RQDS2HUS5DT6WKORZDCT","download_json":"https://pith.science/pith/56RGQ2RQDS2HUS5DT6WKORZDCT.json","view_paper":"https://pith.science/paper/56RGQ2RQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.03471&json=true","fetch_graph":"https://pith.science/api/pith-number/56RGQ2RQDS2HUS5DT6WKORZDCT/graph.json","fetch_events":"https://pith.science/api/pith-number/56RGQ2RQDS2HUS5DT6WKORZDCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56RGQ2RQDS2HUS5DT6WKORZDCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56RGQ2RQDS2HUS5DT6WKORZDCT/action/storage_attestation","attest_author":"https://pith.science/pith/56RGQ2RQDS2HUS5DT6WKORZDCT/action/author_attestation","sign_citation":"https://pith.science/pith/56RGQ2RQDS2HUS5DT6WKORZDCT/action/citation_signature","submit_replication":"https://pith.science/pith/56RGQ2RQDS2HUS5DT6WKORZDCT/action/replication_record"}},"created_at":"2026-07-05T02:56:14.898023+00:00","updated_at":"2026-07-05T02:56:14.898023+00:00"}