{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K7BSMFM47646XLYAK6M7AOKX33","short_pith_number":"pith:K7BSMFM4","canonical_record":{"source":{"id":"1811.01586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T10:15:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b46f177cfd63d66c16441a233834c723dfd4a1b9e99a37638e229e300c42f458","abstract_canon_sha256":"e66d656c75d9dee8359250afba7a5315e3064beb86a4ead8809f14e6bd2d6fd7"},"schema_version":"1.0"},"canonical_sha256":"57c326159cffb9ebaf005799f03957dec72e4e2e70bdf031a832d2aa102229ad","source":{"kind":"arxiv","id":"1811.01586","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01586","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01586v1","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01586","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"pith_short_12","alias_value":"K7BSMFM47646","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K7BSMFM47646XLYA","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K7BSMFM4","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K7BSMFM47646XLYAK6M7AOKX33","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T10:15:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b46f177cfd63d66c16441a233834c723dfd4a1b9e99a37638e229e300c42f458","abstract_canon_sha256":"e66d656c75d9dee8359250afba7a5315e3064beb86a4ead8809f14e6bd2d6fd7"},"schema_version":"1.0"},"canonical_sha256":"57c326159cffb9ebaf005799f03957dec72e4e2e70bdf031a832d2aa102229ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:33.890835Z","signature_b64":"v8h9NqFHYOBAGAC+jTAc5GjmhSJaTIXngj6QD3z/+TSVea3ciRNWKq3TfNby3u3Q3bSMpbpy6dHJVUeEXNuBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c326159cffb9ebaf005799f03957dec72e4e2e70bdf031a832d2aa102229ad","last_reissued_at":"2026-05-18T00:01:33.890297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:33.890297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01586","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-05-18T00:01:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RsLo7MwSNICcxb0B56qu08apnoBTkK4yb5hfg8hfcVXYUfb6MrWAl+pLq/iqXA8IcgDSprCdWlZIBOhrk4x3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:36:00.072145Z"},"content_sha256":"1e46b276a31447ebc417f4939ba9d8b8a493eae65ffe8555b1fc0c7772c41294","schema_version":"1.0","event_id":"sha256:1e46b276a31447ebc417f4939ba9d8b8a493eae65ffe8555b1fc0c7772c41294"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K7BSMFM47646XLYAK6M7AOKX33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supervised Linear Regression for Graph Learning from Graph Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arun Venkitaraman, Hermina Petric Maretic, Pascal Frossard, Saikat Chatterjee","submitted_at":"2018-11-05T10:15:39Z","abstract_excerpt":"We propose a supervised learning approach for predicting an underlying graph from a set of graph signals. Our approach is based on linear regression. In the linear regression model, we predict edge-weights of a graph as the output, given a set of signal values on nodes of the graph as the input. We solve for the optimal regression coefficients using a relevant optimization problem that is convex and uses a graph-Laplacian based regularization. The regularization helps to promote a specific graph spectral profile of the graph signals. Simulation experiments demonstrate that our approach predict"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01586","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":""},"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-05-18T00:01:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5hBjPy1R5ftbab/tiXu+q8NXTrHQSQr3U3iVdJQz3yVLBnqluGmay85Oc//odyM0KPAexXDK5e157+/Z99zAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:36:00.072521Z"},"content_sha256":"fa1453ce2d7e585ec354b0da8a7c88e1ae689d852ee85c5abbfe97674694104e","schema_version":"1.0","event_id":"sha256:fa1453ce2d7e585ec354b0da8a7c88e1ae689d852ee85c5abbfe97674694104e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7BSMFM47646XLYAK6M7AOKX33/bundle.json","state_url":"https://pith.science/pith/K7BSMFM47646XLYAK6M7AOKX33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7BSMFM47646XLYAK6M7AOKX33/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-06-20T12:36:00Z","links":{"resolver":"https://pith.science/pith/K7BSMFM47646XLYAK6M7AOKX33","bundle":"https://pith.science/pith/K7BSMFM47646XLYAK6M7AOKX33/bundle.json","state":"https://pith.science/pith/K7BSMFM47646XLYAK6M7AOKX33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7BSMFM47646XLYAK6M7AOKX33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K7BSMFM47646XLYAK6M7AOKX33","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":"e66d656c75d9dee8359250afba7a5315e3064beb86a4ead8809f14e6bd2d6fd7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T10:15:39Z","title_canon_sha256":"b46f177cfd63d66c16441a233834c723dfd4a1b9e99a37638e229e300c42f458"},"schema_version":"1.0","source":{"id":"1811.01586","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01586","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01586v1","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01586","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"pith_short_12","alias_value":"K7BSMFM47646","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K7BSMFM47646XLYA","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K7BSMFM4","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:fa1453ce2d7e585ec354b0da8a7c88e1ae689d852ee85c5abbfe97674694104e","target":"graph","created_at":"2026-05-18T00:01:33Z","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"},"paper":{"abstract_excerpt":"We propose a supervised learning approach for predicting an underlying graph from a set of graph signals. Our approach is based on linear regression. In the linear regression model, we predict edge-weights of a graph as the output, given a set of signal values on nodes of the graph as the input. We solve for the optimal regression coefficients using a relevant optimization problem that is convex and uses a graph-Laplacian based regularization. The regularization helps to promote a specific graph spectral profile of the graph signals. Simulation experiments demonstrate that our approach predict","authors_text":"Arun Venkitaraman, Hermina Petric Maretic, Pascal Frossard, Saikat Chatterjee","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T10:15:39Z","title":"Supervised Linear Regression for Graph Learning from Graph Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01586","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:1e46b276a31447ebc417f4939ba9d8b8a493eae65ffe8555b1fc0c7772c41294","target":"record","created_at":"2026-05-18T00:01:33Z","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":"e66d656c75d9dee8359250afba7a5315e3064beb86a4ead8809f14e6bd2d6fd7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T10:15:39Z","title_canon_sha256":"b46f177cfd63d66c16441a233834c723dfd4a1b9e99a37638e229e300c42f458"},"schema_version":"1.0","source":{"id":"1811.01586","kind":"arxiv","version":1}},"canonical_sha256":"57c326159cffb9ebaf005799f03957dec72e4e2e70bdf031a832d2aa102229ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57c326159cffb9ebaf005799f03957dec72e4e2e70bdf031a832d2aa102229ad","first_computed_at":"2026-05-18T00:01:33.890297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:33.890297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v8h9NqFHYOBAGAC+jTAc5GjmhSJaTIXngj6QD3z/+TSVea3ciRNWKq3TfNby3u3Q3bSMpbpy6dHJVUeEXNuBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:33.890835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01586","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e46b276a31447ebc417f4939ba9d8b8a493eae65ffe8555b1fc0c7772c41294","sha256:fa1453ce2d7e585ec354b0da8a7c88e1ae689d852ee85c5abbfe97674694104e"],"state_sha256":"c4831efff9c33ef92fba0bdf8718a59e48d2788a8412a1a46442ec8a01f92692"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5knG/l25vk2L42U1HrzgqOB05AwmUVgup/qhOKu+C/MWnGzKhCbyMBf0Nvix+j9UWBlP2iBkQtmRs5jffvATAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T12:36:00.074438Z","bundle_sha256":"07eae86593d38339040c4f237e2625f2feeee76b8ec46a96a165e40e7e95546d"}}