{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PWWJDFTVL4KA3LM3J5XAVZ7ICW","short_pith_number":"pith:PWWJDFTV","schema_version":"1.0","canonical_sha256":"7dac9196755f140dad9b4f6e0ae7e815aae38ef4c036dea283dd8b0ab1e395b8","source":{"kind":"arxiv","id":"2306.08201","version":2},"attestation_state":"computed","paper":{"title":"Graph Laplacian Learning with Exponential Family Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.LG","authors_text":"Changhao Shi, Gal Mishne","submitted_at":"2023-06-14T02:09:52Z","abstract_excerpt":"Graph signal processing (GSP) is a prominent framework for analyzing signals on non-Euclidean domains. The graph Fourier transform (GFT) uses the combinatorial graph Laplacian matrix to reveal the spectral decomposition of signals in the graph frequency domain. However, a common challenge in applying GSP methods is that in many scenarios the underlying graph of a system is unknown. A solution in such cases is to construct the unobserved graph from available data, which is commonly referred to as graph or network inference. Although different graph inference methods exist, these are restricted "},"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":"2306.08201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-14T02:09:52Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"03b506a8bebfcdce1308f253f86609780dcf3021bf45b4a989f6f6bf883f74cd","abstract_canon_sha256":"f694d92ccc893b11f5b23b94df0b54a75ce0d0eef7370c683a938f7bc996bdb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:29.026423Z","signature_b64":"iYItlXjTZkevBPBa4jNzkhmn9XAHUwpDKun+8yBo/YZF77eKEUictjJ9LWDyOqvFHkTmSjHXGErV/2MM+HcQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dac9196755f140dad9b4f6e0ae7e815aae38ef4c036dea283dd8b0ab1e395b8","last_reissued_at":"2026-07-05T08:30:29.025863Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:29.025863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Laplacian Learning with Exponential Family Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.LG","authors_text":"Changhao Shi, Gal Mishne","submitted_at":"2023-06-14T02:09:52Z","abstract_excerpt":"Graph signal processing (GSP) is a prominent framework for analyzing signals on non-Euclidean domains. The graph Fourier transform (GFT) uses the combinatorial graph Laplacian matrix to reveal the spectral decomposition of signals in the graph frequency domain. However, a common challenge in applying GSP methods is that in many scenarios the underlying graph of a system is unknown. A solution in such cases is to construct the unobserved graph from available data, which is commonly referred to as graph or network inference. Although different graph inference methods exist, these are restricted "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08201","kind":"arxiv","version":2},"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/2306.08201/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":"2306.08201","created_at":"2026-07-05T08:30:29.025924+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.08201v2","created_at":"2026-07-05T08:30:29.025924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08201","created_at":"2026-07-05T08:30:29.025924+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWWJDFTVL4KA","created_at":"2026-07-05T08:30:29.025924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWWJDFTVL4KA3LM3","created_at":"2026-07-05T08:30:29.025924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWWJDFTV","created_at":"2026-07-05T08:30:29.025924+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/PWWJDFTVL4KA3LM3J5XAVZ7ICW","json":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW.json","graph_json":"https://pith.science/api/pith-number/PWWJDFTVL4KA3LM3J5XAVZ7ICW/graph.json","events_json":"https://pith.science/api/pith-number/PWWJDFTVL4KA3LM3J5XAVZ7ICW/events.json","paper":"https://pith.science/paper/PWWJDFTV"},"agent_actions":{"view_html":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW","download_json":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW.json","view_paper":"https://pith.science/paper/PWWJDFTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.08201&json=true","fetch_graph":"https://pith.science/api/pith-number/PWWJDFTVL4KA3LM3J5XAVZ7ICW/graph.json","fetch_events":"https://pith.science/api/pith-number/PWWJDFTVL4KA3LM3J5XAVZ7ICW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW/action/storage_attestation","attest_author":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW/action/author_attestation","sign_citation":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW/action/citation_signature","submit_replication":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW/action/replication_record"}},"created_at":"2026-07-05T08:30:29.025924+00:00","updated_at":"2026-07-05T08:30:29.025924+00:00"}