{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LQAOIDGSSWZH2CXTZ7KIEOSXPT","short_pith_number":"pith:LQAOIDGS","schema_version":"1.0","canonical_sha256":"5c00e40cd295b27d0af3cfd4823a577cc81f9b8f769fa9e5c3b5c9d6157905f6","source":{"kind":"arxiv","id":"1510.00297","version":2},"attestation_state":"computed","paper":{"title":"Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aamir Anis, Akshay Gadde, Antonio Ortega","submitted_at":"2015-10-01T16:14:35Z","abstract_excerpt":"We study the problem of selecting the best sampling set for bandlimited reconstruction of signals on graphs. A frequency domain representation for graph signals can be defined using the eigenvectors and eigenvalues of variation operators that take into account the underlying graph connectivity. Smoothly varying signals defined on the nodes are of particular interest in various applications, and tend to be approximately bandlimited in the frequency basis. Sampling theory for graph signals deals with the problem of choosing the best subset of nodes for reconstructing a bandlimited signal from it"},"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":"1510.00297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T16:14:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6bd4cfac228020033638293cdbbab538af924926061da15cf419dc4ea28e07dc","abstract_canon_sha256":"c81bc61253c65e53fa892d0b2a1a956b4677eadcbd61c3ed5946104cdd4c568e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:51.311721Z","signature_b64":"ZMfLhN/1kRyxOT11vTdEKiv5C44RwslNOiYaA+oOjUeWk2Q5cvQQfqAeogLqM5Rcvu3pMbNof3s3Ptki3XWsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c00e40cd295b27d0af3cfd4823a577cc81f9b8f769fa9e5c3b5c9d6157905f6","last_reissued_at":"2026-05-18T01:11:51.311386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:51.311386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aamir Anis, Akshay Gadde, Antonio Ortega","submitted_at":"2015-10-01T16:14:35Z","abstract_excerpt":"We study the problem of selecting the best sampling set for bandlimited reconstruction of signals on graphs. A frequency domain representation for graph signals can be defined using the eigenvectors and eigenvalues of variation operators that take into account the underlying graph connectivity. Smoothly varying signals defined on the nodes are of particular interest in various applications, and tend to be approximately bandlimited in the frequency basis. Sampling theory for graph signals deals with the problem of choosing the best subset of nodes for reconstructing a bandlimited signal from it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00297","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":""},"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":"1510.00297","created_at":"2026-05-18T01:11:51.311441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00297v2","created_at":"2026-05-18T01:11:51.311441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00297","created_at":"2026-05-18T01:11:51.311441+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQAOIDGSSWZH","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQAOIDGSSWZH2CXT","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQAOIDGS","created_at":"2026-05-18T12:29:29.992203+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/LQAOIDGSSWZH2CXTZ7KIEOSXPT","json":"https://pith.science/pith/LQAOIDGSSWZH2CXTZ7KIEOSXPT.json","graph_json":"https://pith.science/api/pith-number/LQAOIDGSSWZH2CXTZ7KIEOSXPT/graph.json","events_json":"https://pith.science/api/pith-number/LQAOIDGSSWZH2CXTZ7KIEOSXPT/events.json","paper":"https://pith.science/paper/LQAOIDGS"},"agent_actions":{"view_html":"https://pith.science/pith/LQAOIDGSSWZH2CXTZ7KIEOSXPT","download_json":"https://pith.science/pith/LQAOIDGSSWZH2CXTZ7KIEOSXPT.json","view_paper":"https://pith.science/paper/LQAOIDGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00297&json=true","fetch_graph":"https://pith.science/api/pith-number/LQAOIDGSSWZH2CXTZ7KIEOSXPT/graph.json","fetch_events":"https://pith.science/api/pith-number/LQAOIDGSSWZH2CXTZ7KIEOSXPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQAOIDGSSWZH2CXTZ7KIEOSXPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQAOIDGSSWZH2CXTZ7KIEOSXPT/action/storage_attestation","attest_author":"https://pith.science/pith/LQAOIDGSSWZH2CXTZ7KIEOSXPT/action/author_attestation","sign_citation":"https://pith.science/pith/LQAOIDGSSWZH2CXTZ7KIEOSXPT/action/citation_signature","submit_replication":"https://pith.science/pith/LQAOIDGSSWZH2CXTZ7KIEOSXPT/action/replication_record"}},"created_at":"2026-05-18T01:11:51.311441+00:00","updated_at":"2026-05-18T01:11:51.311441+00:00"}