{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RWBAYXTDFHISGULJIN5AXO4SUR","short_pith_number":"pith:RWBAYXTD","schema_version":"1.0","canonical_sha256":"8d820c5e6329d1235169437a0bbb92a4489c0a8f3bb08e5f83b37ef7eda7feb4","source":{"kind":"arxiv","id":"2402.08105","version":1},"attestation_state":"computed","paper":{"title":"Learning Cartesian Product Graphs with Laplacian Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Changhao Shi, Gal Mishne","submitted_at":"2024-02-12T22:48:30Z","abstract_excerpt":"Graph Laplacian learning, also known as network topology inference, is a problem of great interest to multiple communities. In Gaussian graphical models (GM), graph learning amounts to endowing covariance selection with the Laplacian structure. In graph signal processing (GSP), it is essential to infer the unobserved graph from the outputs of a filtering system. In this paper, we study the problem of learning Cartesian product graphs under Laplacian constraints. The Cartesian graph product is a natural way for modeling higher-order conditional dependencies and is also the key for generalizing "},"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":"2402.08105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T22:48:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"61cbb0701f72cb649ca38ccb8f491c890241697f2fa89a68783439c6454bdf7c","abstract_canon_sha256":"651da788327e2a148cf28d2722766b3d6db5c54fcc6724ce8bb511adc51c770e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:27.388106Z","signature_b64":"+zHIVvIxNDALLOKTy9f81S4VrPwBDzJCvI74s7wzn1djQ4XNKVj/vNuJ2vSx2G1FqmQNIY1apAsFZm57//7NDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d820c5e6329d1235169437a0bbb92a4489c0a8f3bb08e5f83b37ef7eda7feb4","last_reissued_at":"2026-07-05T07:44:27.387453Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:27.387453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Cartesian Product Graphs with Laplacian Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Changhao Shi, Gal Mishne","submitted_at":"2024-02-12T22:48:30Z","abstract_excerpt":"Graph Laplacian learning, also known as network topology inference, is a problem of great interest to multiple communities. In Gaussian graphical models (GM), graph learning amounts to endowing covariance selection with the Laplacian structure. In graph signal processing (GSP), it is essential to infer the unobserved graph from the outputs of a filtering system. In this paper, we study the problem of learning Cartesian product graphs under Laplacian constraints. The Cartesian graph product is a natural way for modeling higher-order conditional dependencies and is also the key for generalizing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08105","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.08105/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":"2402.08105","created_at":"2026-07-05T07:44:27.387534+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.08105v1","created_at":"2026-07-05T07:44:27.387534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08105","created_at":"2026-07-05T07:44:27.387534+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWBAYXTDFHIS","created_at":"2026-07-05T07:44:27.387534+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWBAYXTDFHISGULJ","created_at":"2026-07-05T07:44:27.387534+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWBAYXTD","created_at":"2026-07-05T07:44:27.387534+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/RWBAYXTDFHISGULJIN5AXO4SUR","json":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR.json","graph_json":"https://pith.science/api/pith-number/RWBAYXTDFHISGULJIN5AXO4SUR/graph.json","events_json":"https://pith.science/api/pith-number/RWBAYXTDFHISGULJIN5AXO4SUR/events.json","paper":"https://pith.science/paper/RWBAYXTD"},"agent_actions":{"view_html":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR","download_json":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR.json","view_paper":"https://pith.science/paper/RWBAYXTD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.08105&json=true","fetch_graph":"https://pith.science/api/pith-number/RWBAYXTDFHISGULJIN5AXO4SUR/graph.json","fetch_events":"https://pith.science/api/pith-number/RWBAYXTDFHISGULJIN5AXO4SUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR/action/storage_attestation","attest_author":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR/action/author_attestation","sign_citation":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR/action/citation_signature","submit_replication":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR/action/replication_record"}},"created_at":"2026-07-05T07:44:27.387534+00:00","updated_at":"2026-07-05T07:44:27.387534+00:00"}