{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XLQHATG727ZFVMTC5QZQKENZVV","short_pith_number":"pith:XLQHATG7","schema_version":"1.0","canonical_sha256":"bae0704cdfd7f25ab262ec330511b9ad507aa94dd8692defca5c98ad31fcc37b","source":{"kind":"arxiv","id":"1606.08085","version":2},"attestation_state":"computed","paper":{"title":"Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Madeleine S. Kotzagiannidis, Pier Luigi Dragotti","submitted_at":"2016-06-26T20:56:06Z","abstract_excerpt":"With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of Innovation (FRI) theory to the graph domain, and can be applied to arbitrary graphs via suitable approximation schemes. At its core, the introduced Graph-FRI-framework states that any K-sparse signal on the vertices of a circulant graph can be perfectly reconstructed from its dimensionality-reduced representation in the graph spectral domain, the Graph Fourier"},"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":"1606.08085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-26T20:56:06Z","cross_cats_sorted":[],"title_canon_sha256":"eaeb3e2a54664cdc06307fc874d7e1bf2d99c528a50d1469a32ed96e659d7870","abstract_canon_sha256":"9d52bb2e978f505315604eb04c07be5902580cfb3c501784fbbfd5087e08f421"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:21.313881Z","signature_b64":"SUAEY22OnkHizOOnmzOx8yqIjsdcopolhR7uw3UW/8eBiWQuU++7nfWEf5MZuOiwLEwVy0nc65TFgMmU2joICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bae0704cdfd7f25ab262ec330511b9ad507aa94dd8692defca5c98ad31fcc37b","last_reissued_at":"2026-05-18T00:32:21.313223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:21.313223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Madeleine S. Kotzagiannidis, Pier Luigi Dragotti","submitted_at":"2016-06-26T20:56:06Z","abstract_excerpt":"With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of Innovation (FRI) theory to the graph domain, and can be applied to arbitrary graphs via suitable approximation schemes. At its core, the introduced Graph-FRI-framework states that any K-sparse signal on the vertices of a circulant graph can be perfectly reconstructed from its dimensionality-reduced representation in the graph spectral domain, the Graph Fourier"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08085","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":"1606.08085","created_at":"2026-05-18T00:32:21.313344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08085v2","created_at":"2026-05-18T00:32:21.313344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08085","created_at":"2026-05-18T00:32:21.313344+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLQHATG727ZF","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLQHATG727ZFVMTC","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLQHATG7","created_at":"2026-05-18T12:30:51.357362+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/XLQHATG727ZFVMTC5QZQKENZVV","json":"https://pith.science/pith/XLQHATG727ZFVMTC5QZQKENZVV.json","graph_json":"https://pith.science/api/pith-number/XLQHATG727ZFVMTC5QZQKENZVV/graph.json","events_json":"https://pith.science/api/pith-number/XLQHATG727ZFVMTC5QZQKENZVV/events.json","paper":"https://pith.science/paper/XLQHATG7"},"agent_actions":{"view_html":"https://pith.science/pith/XLQHATG727ZFVMTC5QZQKENZVV","download_json":"https://pith.science/pith/XLQHATG727ZFVMTC5QZQKENZVV.json","view_paper":"https://pith.science/paper/XLQHATG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08085&json=true","fetch_graph":"https://pith.science/api/pith-number/XLQHATG727ZFVMTC5QZQKENZVV/graph.json","fetch_events":"https://pith.science/api/pith-number/XLQHATG727ZFVMTC5QZQKENZVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLQHATG727ZFVMTC5QZQKENZVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLQHATG727ZFVMTC5QZQKENZVV/action/storage_attestation","attest_author":"https://pith.science/pith/XLQHATG727ZFVMTC5QZQKENZVV/action/author_attestation","sign_citation":"https://pith.science/pith/XLQHATG727ZFVMTC5QZQKENZVV/action/citation_signature","submit_replication":"https://pith.science/pith/XLQHATG727ZFVMTC5QZQKENZVV/action/replication_record"}},"created_at":"2026-05-18T00:32:21.313344+00:00","updated_at":"2026-05-18T00:32:21.313344+00:00"}