{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QR7I5RWEKOWGT56MJXV5BMLTRC","short_pith_number":"pith:QR7I5RWE","schema_version":"1.0","canonical_sha256":"847e8ec6c453ac69f7cc4debd0b173888383e09812701c4ab2403f274f39ded5","source":{"kind":"arxiv","id":"1705.02202","version":1},"attestation_state":"computed","paper":{"title":"Structured sampling and fast reconstruction of smooth graph signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SI","authors_text":"Gilles Puy, Patrick P\\'erez","submitted_at":"2017-02-26T21:56:55Z","abstract_excerpt":"This work concerns sampling of smooth signals on arbitrary graphs. We first study a structured sampling strategy for such smooth graph signals that consists of a random selection of few pre-defined groups of nodes. The number of groups to sample to stably embed the set of $k$-bandlimited signals is driven by a quantity called the \\emph{group} graph cumulative coherence. For some optimised sampling distributions, we show that sampling $O(k\\log(k))$ groups is always sufficient to stably embed the set of $k$-bandlimited signals but that this number can be smaller -- down to $O(\\log(k))$ -- depend"},"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":"1705.02202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-26T21:56:55Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"08c973bf705929c12fed8f5d176e7aee69f239141fcbe8592713d600baae2ab0","abstract_canon_sha256":"45902a15936d2097031366926224813299c3b5968f2b69181863a5c5f4e5d815"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:00.421653Z","signature_b64":"Sh+K0GxR92hh7DCMn0p4eY5gQlhGvadSySWPPwN1UM/mhUI50c+RkkjDFfzgLNJTJ2qexbN9RRLkcvaWXeIMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"847e8ec6c453ac69f7cc4debd0b173888383e09812701c4ab2403f274f39ded5","last_reissued_at":"2026-05-18T00:45:00.421212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:00.421212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured sampling and fast reconstruction of smooth graph signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SI","authors_text":"Gilles Puy, Patrick P\\'erez","submitted_at":"2017-02-26T21:56:55Z","abstract_excerpt":"This work concerns sampling of smooth signals on arbitrary graphs. We first study a structured sampling strategy for such smooth graph signals that consists of a random selection of few pre-defined groups of nodes. The number of groups to sample to stably embed the set of $k$-bandlimited signals is driven by a quantity called the \\emph{group} graph cumulative coherence. For some optimised sampling distributions, we show that sampling $O(k\\log(k))$ groups is always sufficient to stably embed the set of $k$-bandlimited signals but that this number can be smaller -- down to $O(\\log(k))$ -- depend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02202","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":"1705.02202","created_at":"2026-05-18T00:45:00.421280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02202v1","created_at":"2026-05-18T00:45:00.421280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02202","created_at":"2026-05-18T00:45:00.421280+00:00"},{"alias_kind":"pith_short_12","alias_value":"QR7I5RWEKOWG","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QR7I5RWEKOWGT56M","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QR7I5RWE","created_at":"2026-05-18T12:31:39.905425+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/QR7I5RWEKOWGT56MJXV5BMLTRC","json":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC.json","graph_json":"https://pith.science/api/pith-number/QR7I5RWEKOWGT56MJXV5BMLTRC/graph.json","events_json":"https://pith.science/api/pith-number/QR7I5RWEKOWGT56MJXV5BMLTRC/events.json","paper":"https://pith.science/paper/QR7I5RWE"},"agent_actions":{"view_html":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC","download_json":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC.json","view_paper":"https://pith.science/paper/QR7I5RWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02202&json=true","fetch_graph":"https://pith.science/api/pith-number/QR7I5RWEKOWGT56MJXV5BMLTRC/graph.json","fetch_events":"https://pith.science/api/pith-number/QR7I5RWEKOWGT56MJXV5BMLTRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC/action/storage_attestation","attest_author":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC/action/author_attestation","sign_citation":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC/action/citation_signature","submit_replication":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC/action/replication_record"}},"created_at":"2026-05-18T00:45:00.421280+00:00","updated_at":"2026-05-18T00:45:00.421280+00:00"}