{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DAIGMM43WSNU7ARXYVYLO6KISZ","short_pith_number":"pith:DAIGMM43","canonical_record":{"source":{"id":"1803.03353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-09T02:07:58Z","cross_cats_sorted":[],"title_canon_sha256":"96935722163c690d44cfd70fbca2d6f3fad10f48641f0cb429a9817c5a11f940","abstract_canon_sha256":"55a01593fd4b4701e267650df161382a093a0e19cf0868a626e1823593c4f237"},"schema_version":"1.0"},"canonical_sha256":"181066339bb49b4f8237c570b7794896682955b58b687542f89230ae529eb70b","source":{"kind":"arxiv","id":"1803.03353","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03353","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03353v2","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03353","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"DAIGMM43WSNU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DAIGMM43WSNU7ARX","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DAIGMM43","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DAIGMM43WSNU7ARXYVYLO6KISZ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-09T02:07:58Z","cross_cats_sorted":[],"title_canon_sha256":"96935722163c690d44cfd70fbca2d6f3fad10f48641f0cb429a9817c5a11f940","abstract_canon_sha256":"55a01593fd4b4701e267650df161382a093a0e19cf0868a626e1823593c4f237"},"schema_version":"1.0"},"canonical_sha256":"181066339bb49b4f8237c570b7794896682955b58b687542f89230ae529eb70b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:17.538767Z","signature_b64":"rEiXEkYbiOEC1PwcVJpikTCKDELtP6dvlfgPiMMOVnvr7b5LznSswUhYoW/BDQylfVgkUV1KNrHf1eoyd88GBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"181066339bb49b4f8237c570b7794896682955b58b687542f89230ae529eb70b","last_reissued_at":"2026-05-17T23:59:17.538313Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:17.538313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03353","source_version":2,"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-17T23:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PWiqispNl4+v3Qu790XUNawMRvFv0yk7+aICrF88xfNVnleneph1fy21/pR5M/UEUt6Z3m0GgVsoGd90k/pKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:40:21.693237Z"},"content_sha256":"9b56e49dec0d56a3ad2c3348647c07d403a4183b88c9c1546374422a54ca9b48","schema_version":"1.0","event_id":"sha256:9b56e49dec0d56a3ad2c3348647c07d403a4183b88c9c1546374422a54ca9b48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DAIGMM43WSNU7ARXYVYLO6KISZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A-Optimal Sampling and Robust Reconstruction for Graph Signals via Truncated Neumann Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Fen Wang, Gene Cheung, Yongchao Wang","submitted_at":"2018-03-09T02:07:58Z","abstract_excerpt":"Graph signal processing (GSP) studies signals that live on irregular data kernels described by graphs. One fundamental problem in GSP is sampling---from which subset of graph nodes to collect samples in order to reconstruct a bandlimited graph signal in high fidelity. In this paper, we seek a sampling strategy that minimizes the mean square error (MSE) of the reconstructed bandlimited graph signals assuming an independent and identically distributed (iid) noise model---leading naturally to the A-optimal design criterion. To avoid matrix inversion, we first prove that the inverse of the informa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03353","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"},"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-17T23:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tDwav76Kvo5eUE+HY/UrbS+Sq4HSpInCUMEBpfrTcD9D0hWscg0I7yhys791lkUhWWTtg8wzTSvh9bp1B8OFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:40:21.693598Z"},"content_sha256":"886692005c2a5128cd279575f0c8b30b32c6b60648a74ea61fda92473f6e02b5","schema_version":"1.0","event_id":"sha256:886692005c2a5128cd279575f0c8b30b32c6b60648a74ea61fda92473f6e02b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAIGMM43WSNU7ARXYVYLO6KISZ/bundle.json","state_url":"https://pith.science/pith/DAIGMM43WSNU7ARXYVYLO6KISZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAIGMM43WSNU7ARXYVYLO6KISZ/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-05-28T09:40:21Z","links":{"resolver":"https://pith.science/pith/DAIGMM43WSNU7ARXYVYLO6KISZ","bundle":"https://pith.science/pith/DAIGMM43WSNU7ARXYVYLO6KISZ/bundle.json","state":"https://pith.science/pith/DAIGMM43WSNU7ARXYVYLO6KISZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAIGMM43WSNU7ARXYVYLO6KISZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DAIGMM43WSNU7ARXYVYLO6KISZ","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":"55a01593fd4b4701e267650df161382a093a0e19cf0868a626e1823593c4f237","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-09T02:07:58Z","title_canon_sha256":"96935722163c690d44cfd70fbca2d6f3fad10f48641f0cb429a9817c5a11f940"},"schema_version":"1.0","source":{"id":"1803.03353","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03353","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03353v2","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03353","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"DAIGMM43WSNU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DAIGMM43WSNU7ARX","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DAIGMM43","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:886692005c2a5128cd279575f0c8b30b32c6b60648a74ea61fda92473f6e02b5","target":"graph","created_at":"2026-05-17T23:59:17Z","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":"Graph signal processing (GSP) studies signals that live on irregular data kernels described by graphs. One fundamental problem in GSP is sampling---from which subset of graph nodes to collect samples in order to reconstruct a bandlimited graph signal in high fidelity. In this paper, we seek a sampling strategy that minimizes the mean square error (MSE) of the reconstructed bandlimited graph signals assuming an independent and identically distributed (iid) noise model---leading naturally to the A-optimal design criterion. To avoid matrix inversion, we first prove that the inverse of the informa","authors_text":"Fen Wang, Gene Cheung, Yongchao Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-09T02:07:58Z","title":"A-Optimal Sampling and Robust Reconstruction for Graph Signals via Truncated Neumann Series"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03353","kind":"arxiv","version":2},"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:9b56e49dec0d56a3ad2c3348647c07d403a4183b88c9c1546374422a54ca9b48","target":"record","created_at":"2026-05-17T23:59:17Z","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":"55a01593fd4b4701e267650df161382a093a0e19cf0868a626e1823593c4f237","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-09T02:07:58Z","title_canon_sha256":"96935722163c690d44cfd70fbca2d6f3fad10f48641f0cb429a9817c5a11f940"},"schema_version":"1.0","source":{"id":"1803.03353","kind":"arxiv","version":2}},"canonical_sha256":"181066339bb49b4f8237c570b7794896682955b58b687542f89230ae529eb70b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"181066339bb49b4f8237c570b7794896682955b58b687542f89230ae529eb70b","first_computed_at":"2026-05-17T23:59:17.538313Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:17.538313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rEiXEkYbiOEC1PwcVJpikTCKDELtP6dvlfgPiMMOVnvr7b5LznSswUhYoW/BDQylfVgkUV1KNrHf1eoyd88GBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:17.538767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03353","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b56e49dec0d56a3ad2c3348647c07d403a4183b88c9c1546374422a54ca9b48","sha256:886692005c2a5128cd279575f0c8b30b32c6b60648a74ea61fda92473f6e02b5"],"state_sha256":"59b6735003eb1eda8ead35c9c657c9e2ea215d24622e560becb1cd4ac7080090"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xu4P7AZRG9ecd2c6hrSbZQmXhPpQbIp6cKUyJ9foiBgDQz54ypob3NQ0jy1HD9AbX1mpDO6F8glIG1Ub2nr0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:40:21.695519Z","bundle_sha256":"0b939f4f3f48bf140325315374564e14efe1d53d00fc78e2f7836065aefd5c70"}}