{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4D5R7TJZAFOCCMUFCGZPQNYMO3","short_pith_number":"pith:4D5R7TJZ","schema_version":"1.0","canonical_sha256":"e0fb1fcd39015c21328511b2f8370c76d83097ad3a39fbfac744960da1ef1b2c","source":{"kind":"arxiv","id":"1503.06629","version":1},"attestation_state":"computed","paper":{"title":"A Probabilistic Interpretation of Sampling Theory of Graph Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Akshay Gadde, Antonio Ortega","submitted_at":"2015-03-23T13:20:22Z","abstract_excerpt":"We give a probabilistic interpretation of sampling theory of graph signals. To do this, we first define a generative model for the data using a pairwise Gaussian random field (GRF) which depends on the graph. We show that, under certain conditions, reconstructing a graph signal from a subset of its samples by least squares is equivalent to performing MAP inference on an approximation of this GRF which has a low rank covariance matrix. We then show that a sampling set of given size with the largest associated cut-off frequency, which is optimal from a sampling theoretic point of view, minimizes"},"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":"1503.06629","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-23T13:20:22Z","cross_cats_sorted":[],"title_canon_sha256":"5bd774c0c8486f147cb8c711f609561a926f5d7aae18fe908d647621c2ebe7a1","abstract_canon_sha256":"50496f4095f8d291277fba332b6735bcf8a819a6c29852b5d42ac20303734aff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:37.773247Z","signature_b64":"raWB1JIvh3sHFtw3av45EI57rrWNj7Z9ssSnJEc6uTS9mi+YO6dX0ULz2nERoVcW/W0F8g/Mc3OBmVVRYVlXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0fb1fcd39015c21328511b2f8370c76d83097ad3a39fbfac744960da1ef1b2c","last_reissued_at":"2026-05-18T02:20:37.772572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:37.772572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Probabilistic Interpretation of Sampling Theory of Graph Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Akshay Gadde, Antonio Ortega","submitted_at":"2015-03-23T13:20:22Z","abstract_excerpt":"We give a probabilistic interpretation of sampling theory of graph signals. To do this, we first define a generative model for the data using a pairwise Gaussian random field (GRF) which depends on the graph. We show that, under certain conditions, reconstructing a graph signal from a subset of its samples by least squares is equivalent to performing MAP inference on an approximation of this GRF which has a low rank covariance matrix. We then show that a sampling set of given size with the largest associated cut-off frequency, which is optimal from a sampling theoretic point of view, minimizes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06629","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.06629","created_at":"2026-05-18T02:20:37.772694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06629v1","created_at":"2026-05-18T02:20:37.772694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06629","created_at":"2026-05-18T02:20:37.772694+00:00"},{"alias_kind":"pith_short_12","alias_value":"4D5R7TJZAFOC","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4D5R7TJZAFOCCMUF","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4D5R7TJZ","created_at":"2026-05-18T12:29:05.191682+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/4D5R7TJZAFOCCMUFCGZPQNYMO3","json":"https://pith.science/pith/4D5R7TJZAFOCCMUFCGZPQNYMO3.json","graph_json":"https://pith.science/api/pith-number/4D5R7TJZAFOCCMUFCGZPQNYMO3/graph.json","events_json":"https://pith.science/api/pith-number/4D5R7TJZAFOCCMUFCGZPQNYMO3/events.json","paper":"https://pith.science/paper/4D5R7TJZ"},"agent_actions":{"view_html":"https://pith.science/pith/4D5R7TJZAFOCCMUFCGZPQNYMO3","download_json":"https://pith.science/pith/4D5R7TJZAFOCCMUFCGZPQNYMO3.json","view_paper":"https://pith.science/paper/4D5R7TJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06629&json=true","fetch_graph":"https://pith.science/api/pith-number/4D5R7TJZAFOCCMUFCGZPQNYMO3/graph.json","fetch_events":"https://pith.science/api/pith-number/4D5R7TJZAFOCCMUFCGZPQNYMO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4D5R7TJZAFOCCMUFCGZPQNYMO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4D5R7TJZAFOCCMUFCGZPQNYMO3/action/storage_attestation","attest_author":"https://pith.science/pith/4D5R7TJZAFOCCMUFCGZPQNYMO3/action/author_attestation","sign_citation":"https://pith.science/pith/4D5R7TJZAFOCCMUFCGZPQNYMO3/action/citation_signature","submit_replication":"https://pith.science/pith/4D5R7TJZAFOCCMUFCGZPQNYMO3/action/replication_record"}},"created_at":"2026-05-18T02:20:37.772694+00:00","updated_at":"2026-05-18T02:20:37.772694+00:00"}