{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5OEVK4KL3KWJSZC2QMVGKF7KCY","short_pith_number":"pith:5OEVK4KL","schema_version":"1.0","canonical_sha256":"eb8955714bdaac99645a832a6517ea1625d3bc977a70a35d4eab77ac9dbba848","source":{"kind":"arxiv","id":"1512.00775","version":1},"attestation_state":"computed","paper":{"title":"Uncertainty Principle and Sampling of Signals Defined on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT","math.SP"],"primary_cat":"cs.IT","authors_text":"Mikhail Tsitsvero, Paolo Di Lorenzo, Sergio Barbarossa","submitted_at":"2015-12-02T17:02:24Z","abstract_excerpt":"In many applications, from sensor to social networks, gene regulatory networks or big data, observations can be represented as a signal defined over the vertices of a graph. Building on the recently introduced Graph Fourier Transform, the first contribution of this paper is to provide an uncertainty principle for signals on graph. As a by-product of this theory, we show how to build a dictionary of maximally concentrated signals on vertex/frequency domains. Then, we establish a direct relation between uncertainty principle and sampling, which forms the basis for a sampling theorem of signals d"},"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":"1512.00775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-02T17:02:24Z","cross_cats_sorted":["cs.DM","math.IT","math.SP"],"title_canon_sha256":"9f121e3ddf6e9d86d2bd3d9e045cf7b1cfe09eec40c7158fe6f51ebf5cc29fb6","abstract_canon_sha256":"b4999810e2926656ec8120ddaefd41efd87b9dbe85e2b36f16ef3219c168cb58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:25.126144Z","signature_b64":"BU1dl/gBpK383C6gjzpwKDX06Atr42wdq5ctpVfRIJ9FzIXv+Wj47kbS4cZBT0Eynzcq90NS5tEoJGnFskQiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb8955714bdaac99645a832a6517ea1625d3bc977a70a35d4eab77ac9dbba848","last_reissued_at":"2026-05-18T01:25:25.125661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:25.125661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncertainty Principle and Sampling of Signals Defined on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT","math.SP"],"primary_cat":"cs.IT","authors_text":"Mikhail Tsitsvero, Paolo Di Lorenzo, Sergio Barbarossa","submitted_at":"2015-12-02T17:02:24Z","abstract_excerpt":"In many applications, from sensor to social networks, gene regulatory networks or big data, observations can be represented as a signal defined over the vertices of a graph. Building on the recently introduced Graph Fourier Transform, the first contribution of this paper is to provide an uncertainty principle for signals on graph. As a by-product of this theory, we show how to build a dictionary of maximally concentrated signals on vertex/frequency domains. Then, we establish a direct relation between uncertainty principle and sampling, which forms the basis for a sampling theorem of signals d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00775","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":"1512.00775","created_at":"2026-05-18T01:25:25.125739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.00775v1","created_at":"2026-05-18T01:25:25.125739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00775","created_at":"2026-05-18T01:25:25.125739+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OEVK4KL3KWJ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OEVK4KL3KWJSZC2","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OEVK4KL","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/5OEVK4KL3KWJSZC2QMVGKF7KCY","json":"https://pith.science/pith/5OEVK4KL3KWJSZC2QMVGKF7KCY.json","graph_json":"https://pith.science/api/pith-number/5OEVK4KL3KWJSZC2QMVGKF7KCY/graph.json","events_json":"https://pith.science/api/pith-number/5OEVK4KL3KWJSZC2QMVGKF7KCY/events.json","paper":"https://pith.science/paper/5OEVK4KL"},"agent_actions":{"view_html":"https://pith.science/pith/5OEVK4KL3KWJSZC2QMVGKF7KCY","download_json":"https://pith.science/pith/5OEVK4KL3KWJSZC2QMVGKF7KCY.json","view_paper":"https://pith.science/paper/5OEVK4KL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.00775&json=true","fetch_graph":"https://pith.science/api/pith-number/5OEVK4KL3KWJSZC2QMVGKF7KCY/graph.json","fetch_events":"https://pith.science/api/pith-number/5OEVK4KL3KWJSZC2QMVGKF7KCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OEVK4KL3KWJSZC2QMVGKF7KCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OEVK4KL3KWJSZC2QMVGKF7KCY/action/storage_attestation","attest_author":"https://pith.science/pith/5OEVK4KL3KWJSZC2QMVGKF7KCY/action/author_attestation","sign_citation":"https://pith.science/pith/5OEVK4KL3KWJSZC2QMVGKF7KCY/action/citation_signature","submit_replication":"https://pith.science/pith/5OEVK4KL3KWJSZC2QMVGKF7KCY/action/replication_record"}},"created_at":"2026-05-18T01:25:25.125739+00:00","updated_at":"2026-05-18T01:25:25.125739+00:00"}