{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HD3XVWFIB2D33BW4FL7U2NUZL6","short_pith_number":"pith:HD3XVWFI","canonical_record":{"source":{"id":"1711.00142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-31T23:29:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"51167c6ece534f1bea775af5042b9c587f4252f0c7501983de21ea1f505d5d07","abstract_canon_sha256":"fb7bba0fa47ceda91d911bb4b9ba6c4d74875de66f486b4295d76f74016b154b"},"schema_version":"1.0"},"canonical_sha256":"38f77ad8a80e87bd86dc2aff4d36995f9d923fb33a4be7ca12d8a7e038de76ef","source":{"kind":"arxiv","id":"1711.00142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00142","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00142v1","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00142","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"HD3XVWFIB2D3","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HD3XVWFIB2D33BW4","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HD3XVWFI","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HD3XVWFIB2D33BW4FL7U2NUZL6","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-31T23:29:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"51167c6ece534f1bea775af5042b9c587f4252f0c7501983de21ea1f505d5d07","abstract_canon_sha256":"fb7bba0fa47ceda91d911bb4b9ba6c4d74875de66f486b4295d76f74016b154b"},"schema_version":"1.0"},"canonical_sha256":"38f77ad8a80e87bd86dc2aff4d36995f9d923fb33a4be7ca12d8a7e038de76ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:35.101043Z","signature_b64":"Ebkq05cyjrOrzO95VK8s1rQboy2Eush7zO3hPm7MAatwrcnhYZxor1dQTjeS1S1lYtXZ27p2P3gHfBMK0PLoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38f77ad8a80e87bd86dc2aff4d36995f9d923fb33a4be7ca12d8a7e038de76ef","last_reissued_at":"2026-05-18T00:31:35.100529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:35.100529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00142","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:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/mWIZRQ2J26XFOu8spptbnaHCluM7tujQI8taM9j6jTIE/tQx/uaVKQK7D+P1IYbLbzkNvEQQO9CPa6Q/sECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:22:24.995362Z"},"content_sha256":"ffc4bc9cf7e3f436ae1ea57d82c16a5aa7d69f4ef83d4fd8ac074ad7f79dc1ee","schema_version":"1.0","event_id":"sha256:ffc4bc9cf7e3f436ae1ea57d82c16a5aa7d69f4ef83d4fd8ac074ad7f79dc1ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HD3XVWFIB2D33BW4FL7U2NUZL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling and Reconstruction of Graph Signals via Weak Submodularity and Semidefinite Relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Abolfazl Hashemi, Gonzalo Mateos, Haris Vikalo, Rasoul Shafipour","submitted_at":"2017-10-31T23:29:25Z","abstract_excerpt":"We study the problem of sampling a bandlimited graph signal in the presence of noise, where the objective is to select a node subset of prescribed cardinality that minimizes the signal reconstruction mean squared error (MSE). To that end, we formulate the task at hand as the minimization of MSE subject to binary constraints, and approximate the resulting NP-hard problem via semidefinite programming (SDP) relaxation. Moreover, we provide an alternative formulation based on maximizing a monotone weak submodular function and propose a randomized-greedy algorithm to find a sub-optimal subset. We t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00142","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:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dp4cTbUBjQQuROs0nCH39ATGkgionWaTejeQi7BO0oVEtjmKhv3g5dXjJnTIo5rjQFNvuKQnGLgqbNnds3ZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:22:24.996038Z"},"content_sha256":"82a23599f059b5acd3795c021e575eef18bbb26e4733a290e04769f04e79bb17","schema_version":"1.0","event_id":"sha256:82a23599f059b5acd3795c021e575eef18bbb26e4733a290e04769f04e79bb17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HD3XVWFIB2D33BW4FL7U2NUZL6/bundle.json","state_url":"https://pith.science/pith/HD3XVWFIB2D33BW4FL7U2NUZL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HD3XVWFIB2D33BW4FL7U2NUZL6/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-12T05:22:24Z","links":{"resolver":"https://pith.science/pith/HD3XVWFIB2D33BW4FL7U2NUZL6","bundle":"https://pith.science/pith/HD3XVWFIB2D33BW4FL7U2NUZL6/bundle.json","state":"https://pith.science/pith/HD3XVWFIB2D33BW4FL7U2NUZL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HD3XVWFIB2D33BW4FL7U2NUZL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HD3XVWFIB2D33BW4FL7U2NUZL6","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":"fb7bba0fa47ceda91d911bb4b9ba6c4d74875de66f486b4295d76f74016b154b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-31T23:29:25Z","title_canon_sha256":"51167c6ece534f1bea775af5042b9c587f4252f0c7501983de21ea1f505d5d07"},"schema_version":"1.0","source":{"id":"1711.00142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00142","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00142v1","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00142","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"HD3XVWFIB2D3","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HD3XVWFIB2D33BW4","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HD3XVWFI","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:82a23599f059b5acd3795c021e575eef18bbb26e4733a290e04769f04e79bb17","target":"graph","created_at":"2026-05-18T00:31:35Z","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":"We study the problem of sampling a bandlimited graph signal in the presence of noise, where the objective is to select a node subset of prescribed cardinality that minimizes the signal reconstruction mean squared error (MSE). To that end, we formulate the task at hand as the minimization of MSE subject to binary constraints, and approximate the resulting NP-hard problem via semidefinite programming (SDP) relaxation. Moreover, we provide an alternative formulation based on maximizing a monotone weak submodular function and propose a randomized-greedy algorithm to find a sub-optimal subset. We t","authors_text":"Abolfazl Hashemi, Gonzalo Mateos, Haris Vikalo, Rasoul Shafipour","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-31T23:29:25Z","title":"Sampling and Reconstruction of Graph Signals via Weak Submodularity and Semidefinite Relaxation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00142","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:ffc4bc9cf7e3f436ae1ea57d82c16a5aa7d69f4ef83d4fd8ac074ad7f79dc1ee","target":"record","created_at":"2026-05-18T00:31:35Z","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":"fb7bba0fa47ceda91d911bb4b9ba6c4d74875de66f486b4295d76f74016b154b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-31T23:29:25Z","title_canon_sha256":"51167c6ece534f1bea775af5042b9c587f4252f0c7501983de21ea1f505d5d07"},"schema_version":"1.0","source":{"id":"1711.00142","kind":"arxiv","version":1}},"canonical_sha256":"38f77ad8a80e87bd86dc2aff4d36995f9d923fb33a4be7ca12d8a7e038de76ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38f77ad8a80e87bd86dc2aff4d36995f9d923fb33a4be7ca12d8a7e038de76ef","first_computed_at":"2026-05-18T00:31:35.100529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:35.100529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ebkq05cyjrOrzO95VK8s1rQboy2Eush7zO3hPm7MAatwrcnhYZxor1dQTjeS1S1lYtXZ27p2P3gHfBMK0PLoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:35.101043Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffc4bc9cf7e3f436ae1ea57d82c16a5aa7d69f4ef83d4fd8ac074ad7f79dc1ee","sha256:82a23599f059b5acd3795c021e575eef18bbb26e4733a290e04769f04e79bb17"],"state_sha256":"349f9df7eca5d62cac32a303c118a730072320d6b8e991301c43dde530e00fcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocWmXrczpXlF9yS9PFv0gnir7Zffr6xc/Z0dgRpIrsQvUOHD5B3H+QX5oEeLLRssGd7oiV1Nusg8CBcm7z2TAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:22:24.999241Z","bundle_sha256":"5f82fd863dfe84f12ebc87218cff2cd4ae70702acc36a592f27c33c72d126804"}}