{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QR7I5RWEKOWGT56MJXV5BMLTRC","short_pith_number":"pith:QR7I5RWE","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"},"canonical_sha256":"847e8ec6c453ac69f7cc4debd0b173888383e09812701c4ab2403f274f39ded5","source":{"kind":"arxiv","id":"1705.02202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02202","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02202v1","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02202","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"QR7I5RWEKOWG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QR7I5RWEKOWGT56M","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QR7I5RWE","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QR7I5RWEKOWGT56MJXV5BMLTRC","target":"record","payload":{"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"},"canonical_sha256":"847e8ec6c453ac69f7cc4debd0b173888383e09812701c4ab2403f274f39ded5","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"},"source_kind":"arxiv","source_id":"1705.02202","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AVtUpc5BigGwQjlApjyBk+fcYLNLR+dRasz4giiOoNjs+yFM+u2P2m3693+tX+jb8T0yMd9MgD45aN0lEjb2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:16:03.117262Z"},"content_sha256":"b4eab83c6fcf5fc8712bf27355a4650c36588190ec2edaa0119553683f8e8f0a","schema_version":"1.0","event_id":"sha256:b4eab83c6fcf5fc8712bf27355a4650c36588190ec2edaa0119553683f8e8f0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QR7I5RWEKOWGT56MJXV5BMLTRC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sClj33KHx5amyOl3pOkeQ4iz1zU4OsuOmT0vonasb+FQTHGHExyLEEUucYCG0Sat28iWhwuT5aBNZYuj0ML4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:16:03.117639Z"},"content_sha256":"f27ad78762e729da9bd9a9b49aa96ca48756cb715ba973a4f73a23d9c6124583","schema_version":"1.0","event_id":"sha256:f27ad78762e729da9bd9a9b49aa96ca48756cb715ba973a4f73a23d9c6124583"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC/bundle.json","state_url":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QR7I5RWEKOWGT56MJXV5BMLTRC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T20:16:03Z","links":{"resolver":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC","bundle":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC/bundle.json","state":"https://pith.science/pith/QR7I5RWEKOWGT56MJXV5BMLTRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QR7I5RWEKOWGT56MJXV5BMLTRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QR7I5RWEKOWGT56MJXV5BMLTRC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"45902a15936d2097031366926224813299c3b5968f2b69181863a5c5f4e5d815","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-26T21:56:55Z","title_canon_sha256":"08c973bf705929c12fed8f5d176e7aee69f239141fcbe8592713d600baae2ab0"},"schema_version":"1.0","source":{"id":"1705.02202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02202","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02202v1","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02202","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"QR7I5RWEKOWG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QR7I5RWEKOWGT56M","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QR7I5RWE","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:f27ad78762e729da9bd9a9b49aa96ca48756cb715ba973a4f73a23d9c6124583","target":"graph","created_at":"2026-05-18T00:45:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Gilles Puy, Patrick P\\'erez","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-26T21:56:55Z","title":"Structured sampling and fast reconstruction of smooth graph signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02202","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b4eab83c6fcf5fc8712bf27355a4650c36588190ec2edaa0119553683f8e8f0a","target":"record","created_at":"2026-05-18T00:45:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"45902a15936d2097031366926224813299c3b5968f2b69181863a5c5f4e5d815","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-26T21:56:55Z","title_canon_sha256":"08c973bf705929c12fed8f5d176e7aee69f239141fcbe8592713d600baae2ab0"},"schema_version":"1.0","source":{"id":"1705.02202","kind":"arxiv","version":1}},"canonical_sha256":"847e8ec6c453ac69f7cc4debd0b173888383e09812701c4ab2403f274f39ded5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"847e8ec6c453ac69f7cc4debd0b173888383e09812701c4ab2403f274f39ded5","first_computed_at":"2026-05-18T00:45:00.421212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:00.421212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sh+K0GxR92hh7DCMn0p4eY5gQlhGvadSySWPPwN1UM/mhUI50c+RkkjDFfzgLNJTJ2qexbN9RRLkcvaWXeIMCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:00.421653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4eab83c6fcf5fc8712bf27355a4650c36588190ec2edaa0119553683f8e8f0a","sha256:f27ad78762e729da9bd9a9b49aa96ca48756cb715ba973a4f73a23d9c6124583"],"state_sha256":"97ac92173ad9d02e4f77b17e91a11d973fb89745bfdd3890ae4e9846f94032f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDlFhZUVN4lY4qizQjsg8e0XYUMofvsSHuG+2gGc+v2+erGJcPxj3gLdxaLsEdqKFxJlHpHlYmxo5nQmD3yJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:16:03.119592Z","bundle_sha256":"b77dff9eb37fc4fd72e7e8d620e5fe994dbd6f089d2309dd51a1f0d5f76cbd81"}}