{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:PWWJDFTVL4KA3LM3J5XAVZ7ICW","short_pith_number":"pith:PWWJDFTV","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"},"canonical_sha256":"7dac9196755f140dad9b4f6e0ae7e815aae38ef4c036dea283dd8b0ab1e395b8","source":{"kind":"arxiv","id":"2306.08201","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.08201","created_at":"2026-07-05T08:30:29Z"},{"alias_kind":"arxiv_version","alias_value":"2306.08201v2","created_at":"2026-07-05T08:30:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08201","created_at":"2026-07-05T08:30:29Z"},{"alias_kind":"pith_short_12","alias_value":"PWWJDFTVL4KA","created_at":"2026-07-05T08:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"PWWJDFTVL4KA3LM3","created_at":"2026-07-05T08:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"PWWJDFTV","created_at":"2026-07-05T08:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:PWWJDFTVL4KA3LM3J5XAVZ7ICW","target":"record","payload":{"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"},"canonical_sha256":"7dac9196755f140dad9b4f6e0ae7e815aae38ef4c036dea283dd8b0ab1e395b8","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"},"source_kind":"arxiv","source_id":"2306.08201","source_version":2,"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-05T08:30:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWxOXdquFMHT43H4z0YvB1WG9NLN8+5Rmhh9yQQ09ba5Op6xILDiqwVqSzQlPJA9R9ZehLUWepgIRCs3kh4cAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:01:21.129763Z"},"content_sha256":"5c214ee5003412b9348089451619e04b8ab0bf52b849c2acd1551d359a04d4a7","schema_version":"1.0","event_id":"sha256:5c214ee5003412b9348089451619e04b8ab0bf52b849c2acd1551d359a04d4a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:PWWJDFTVL4KA3LM3J5XAVZ7ICW","target":"graph","payload":{"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"},"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-05T08:30:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4HClmy2ma4cuVXuv3c/Sg28Pd5Pl/FIPSHyjfXO3aSEyX36cmvoMotGCjm5xACo/BsdBKRMh4eCeeJPCpARFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:01:21.130142Z"},"content_sha256":"8fcf50a0654fee4b6e2812170f73287d177370a516107c6ea2a7d4da188e710c","schema_version":"1.0","event_id":"sha256:8fcf50a0654fee4b6e2812170f73287d177370a516107c6ea2a7d4da188e710c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW/bundle.json","state_url":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW/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-07T09:01:21Z","links":{"resolver":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW","bundle":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW/bundle.json","state":"https://pith.science/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWWJDFTVL4KA3LM3J5XAVZ7ICW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PWWJDFTVL4KA3LM3J5XAVZ7ICW","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":"f694d92ccc893b11f5b23b94df0b54a75ce0d0eef7370c683a938f7bc996bdb2","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-14T02:09:52Z","title_canon_sha256":"03b506a8bebfcdce1308f253f86609780dcf3021bf45b4a989f6f6bf883f74cd"},"schema_version":"1.0","source":{"id":"2306.08201","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.08201","created_at":"2026-07-05T08:30:29Z"},{"alias_kind":"arxiv_version","alias_value":"2306.08201v2","created_at":"2026-07-05T08:30:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08201","created_at":"2026-07-05T08:30:29Z"},{"alias_kind":"pith_short_12","alias_value":"PWWJDFTVL4KA","created_at":"2026-07-05T08:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"PWWJDFTVL4KA3LM3","created_at":"2026-07-05T08:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"PWWJDFTV","created_at":"2026-07-05T08:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:8fcf50a0654fee4b6e2812170f73287d177370a516107c6ea2a7d4da188e710c","target":"graph","created_at":"2026-07-05T08:30:29Z","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/2306.08201/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Changhao Shi, Gal Mishne","cross_cats":["eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-14T02:09:52Z","title":"Graph Laplacian Learning with Exponential Family Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08201","kind":"arxiv","version":2},"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:5c214ee5003412b9348089451619e04b8ab0bf52b849c2acd1551d359a04d4a7","target":"record","created_at":"2026-07-05T08:30:29Z","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":"f694d92ccc893b11f5b23b94df0b54a75ce0d0eef7370c683a938f7bc996bdb2","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-14T02:09:52Z","title_canon_sha256":"03b506a8bebfcdce1308f253f86609780dcf3021bf45b4a989f6f6bf883f74cd"},"schema_version":"1.0","source":{"id":"2306.08201","kind":"arxiv","version":2}},"canonical_sha256":"7dac9196755f140dad9b4f6e0ae7e815aae38ef4c036dea283dd8b0ab1e395b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dac9196755f140dad9b4f6e0ae7e815aae38ef4c036dea283dd8b0ab1e395b8","first_computed_at":"2026-07-05T08:30:29.025863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:30:29.025863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iYItlXjTZkevBPBa4jNzkhmn9XAHUwpDKun+8yBo/YZF77eKEUictjJ9LWDyOqvFHkTmSjHXGErV/2MM+HcQAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:30:29.026423Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.08201","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c214ee5003412b9348089451619e04b8ab0bf52b849c2acd1551d359a04d4a7","sha256:8fcf50a0654fee4b6e2812170f73287d177370a516107c6ea2a7d4da188e710c"],"state_sha256":"9f87d7cfc82a5febdbf04d83ab1a5e2bd683989ebecccb2297c06504e5f72676"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DH2GbnQ/+JxwvSG2H/I+AN2DR9dwxyLuwFBcB6fDfOX/JpboNmdVUASWZGfuMXKhLkAx7ZvOhGq+IEtSj0jhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:01:21.132115Z","bundle_sha256":"8c1f0dcb15d6b0e87e9e2b481c42148df337f524183b1203593642aef588f8a1"}}