{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RWBAYXTDFHISGULJIN5AXO4SUR","short_pith_number":"pith:RWBAYXTD","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"},"canonical_sha256":"8d820c5e6329d1235169437a0bbb92a4489c0a8f3bb08e5f83b37ef7eda7feb4","source":{"kind":"arxiv","id":"2402.08105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.08105","created_at":"2026-07-05T07:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"2402.08105v1","created_at":"2026-07-05T07:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08105","created_at":"2026-07-05T07:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"RWBAYXTDFHIS","created_at":"2026-07-05T07:44:27Z"},{"alias_kind":"pith_short_16","alias_value":"RWBAYXTDFHISGULJ","created_at":"2026-07-05T07:44:27Z"},{"alias_kind":"pith_short_8","alias_value":"RWBAYXTD","created_at":"2026-07-05T07:44:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RWBAYXTDFHISGULJIN5AXO4SUR","target":"record","payload":{"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"},"canonical_sha256":"8d820c5e6329d1235169437a0bbb92a4489c0a8f3bb08e5f83b37ef7eda7feb4","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"},"source_kind":"arxiv","source_id":"2402.08105","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-07-05T07:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i9m4y/DFJFOQeTUtPPxGCdzBjlPfpWaKuIgNL2GGfmpj7+5m6gyT545UPGTF6EjJ5xPEzw9CgUrN/aPHWiCNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:52:42.903833Z"},"content_sha256":"be9fef42118155af0b3c6e3df0940e34fb6d743946c07833c8cc79ea382f8c99","schema_version":"1.0","event_id":"sha256:be9fef42118155af0b3c6e3df0940e34fb6d743946c07833c8cc79ea382f8c99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RWBAYXTDFHISGULJIN5AXO4SUR","target":"graph","payload":{"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"},"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-07-05T07:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"492ZsmNljtHrLdYWEapAlcFchn8W9fZ0e2WyBTw15RmhaaD0Bs7tP1J6xejleSBipdkvII11J6BM2E34VLQiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:52:42.904234Z"},"content_sha256":"da2864f926002f43afeddbbcf6b5961ed493c9634866a01ec6612536a86070f4","schema_version":"1.0","event_id":"sha256:da2864f926002f43afeddbbcf6b5961ed493c9634866a01ec6612536a86070f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR/bundle.json","state_url":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWBAYXTDFHISGULJIN5AXO4SUR/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-07-07T15:52:42Z","links":{"resolver":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR","bundle":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR/bundle.json","state":"https://pith.science/pith/RWBAYXTDFHISGULJIN5AXO4SUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWBAYXTDFHISGULJIN5AXO4SUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RWBAYXTDFHISGULJIN5AXO4SUR","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":"651da788327e2a148cf28d2722766b3d6db5c54fcc6724ce8bb511adc51c770e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T22:48:30Z","title_canon_sha256":"61cbb0701f72cb649ca38ccb8f491c890241697f2fa89a68783439c6454bdf7c"},"schema_version":"1.0","source":{"id":"2402.08105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.08105","created_at":"2026-07-05T07:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"2402.08105v1","created_at":"2026-07-05T07:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08105","created_at":"2026-07-05T07:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"RWBAYXTDFHIS","created_at":"2026-07-05T07:44:27Z"},{"alias_kind":"pith_short_16","alias_value":"RWBAYXTDFHISGULJ","created_at":"2026-07-05T07:44:27Z"},{"alias_kind":"pith_short_8","alias_value":"RWBAYXTD","created_at":"2026-07-05T07:44:27Z"}],"graph_snapshots":[{"event_id":"sha256:da2864f926002f43afeddbbcf6b5961ed493c9634866a01ec6612536a86070f4","target":"graph","created_at":"2026-07-05T07:44: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.08105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Changhao Shi, Gal Mishne","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T22:48:30Z","title":"Learning Cartesian Product Graphs with Laplacian Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08105","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:be9fef42118155af0b3c6e3df0940e34fb6d743946c07833c8cc79ea382f8c99","target":"record","created_at":"2026-07-05T07:44: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":"651da788327e2a148cf28d2722766b3d6db5c54fcc6724ce8bb511adc51c770e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T22:48:30Z","title_canon_sha256":"61cbb0701f72cb649ca38ccb8f491c890241697f2fa89a68783439c6454bdf7c"},"schema_version":"1.0","source":{"id":"2402.08105","kind":"arxiv","version":1}},"canonical_sha256":"8d820c5e6329d1235169437a0bbb92a4489c0a8f3bb08e5f83b37ef7eda7feb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d820c5e6329d1235169437a0bbb92a4489c0a8f3bb08e5f83b37ef7eda7feb4","first_computed_at":"2026-07-05T07:44:27.387453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:44:27.387453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+zHIVvIxNDALLOKTy9f81S4VrPwBDzJCvI74s7wzn1djQ4XNKVj/vNuJ2vSx2G1FqmQNIY1apAsFZm57//7NDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:44:27.388106Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.08105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be9fef42118155af0b3c6e3df0940e34fb6d743946c07833c8cc79ea382f8c99","sha256:da2864f926002f43afeddbbcf6b5961ed493c9634866a01ec6612536a86070f4"],"state_sha256":"ca25aaf97da2f2804b495ad569520308afb101f6f0a5aba861b9e533a83512a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDLu61vMJMqRTy9mV62c19W3pc1NKzdg/ByYo9qmux2jVD6yHlJcnVenYg0wqaL6Is7Nkzb+trbUoot86z6IDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:52:42.906218Z","bundle_sha256":"d7105d0e26a8431323cc050f266a154397652645ffd359fdf6c5a278d47fd53d"}}