{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OZCGMVDEMSJFCTADEWYZIPZWOQ","short_pith_number":"pith:OZCGMVDE","canonical_record":{"source":{"id":"1811.12542","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-29T23:52:55Z","cross_cats_sorted":[],"title_canon_sha256":"38dd6bb894f794ee5768546aee14805b2ec9a0d905c5782fa1f11cb695923c9f","abstract_canon_sha256":"abcb16723db9c133c420905c6db640cbcd65ff15692e7c46ccd5a11eafa73dcd"},"schema_version":"1.0"},"canonical_sha256":"76446654646492514c0325b1943f367420d381fe5beea1c82a7a2f96facf8e4b","source":{"kind":"arxiv","id":"1811.12542","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12542","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12542v4","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12542","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"OZCGMVDEMSJF","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZCGMVDEMSJFCTAD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZCGMVDE","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OZCGMVDEMSJFCTADEWYZIPZWOQ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.12542","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-29T23:52:55Z","cross_cats_sorted":[],"title_canon_sha256":"38dd6bb894f794ee5768546aee14805b2ec9a0d905c5782fa1f11cb695923c9f","abstract_canon_sha256":"abcb16723db9c133c420905c6db640cbcd65ff15692e7c46ccd5a11eafa73dcd"},"schema_version":"1.0"},"canonical_sha256":"76446654646492514c0325b1943f367420d381fe5beea1c82a7a2f96facf8e4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.160552Z","signature_b64":"5Dijwkpx+3t7f69YHNd/SkG9sylsYxa20Chf4YxxW1RKmcIosnav7BVCtH7yAXucwGdbRY9bFAuwM4h52UOhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76446654646492514c0325b1943f367420d381fe5beea1c82a7a2f96facf8e4b","last_reissued_at":"2026-05-17T23:45:15.159825Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.159825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.12542","source_version":4,"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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MK/25U4c5Zo8E82PitDUn8q4yCkR8GCCQfGNRVk9HNOyNMAacHpg9Oex0DNDHKolHTVrOmxSADLZ32ZMsCR6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:49:47.476162Z"},"content_sha256":"c2867ecfa90c1f124a24c39608140944559d1a53c43526b56fa3ee82c3e5fca5","schema_version":"1.0","event_id":"sha256:c2867ecfa90c1f124a24c39608140944559d1a53c43526b56fa3ee82c3e5fca5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OZCGMVDEMSJFCTADEWYZIPZWOQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blue-Noise Sampling on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Alejandro Parada-Mayorga, Daniel L. Lau, Gonzalo R. Arce, Jhony H. Giraldo","submitted_at":"2018-11-29T23:52:55Z","abstract_excerpt":"In the area of graph signal processing, a graph is a set of nodes arbitrarily connected by weighted links; a graph signal is a set of scalar values associated with each node; and sampling is the problem of selecting an optimal subset of nodes from which a graph signal can be reconstructed. This paper proposes the use of spatial dithering on the vertex domain of the graph, as a way to conveniently find statistically good sampling sets. This is done establishing that there is a family of good sampling sets characterized on the vertex domain by a maximization of the distance between sampling node"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12542","kind":"arxiv","version":4},"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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MM9vA+VYvc5WpAsRCDahTLD653bNrhB3ySBi4fLoXrGQzhGzN5wGblIMX1nNVS7ASyZ1HiUNOMSfQE+HiB0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:49:47.476875Z"},"content_sha256":"92caf3dbd3f30fef1b4d17629afca77e0da7307b627907d3fc09bc493fd3d300","schema_version":"1.0","event_id":"sha256:92caf3dbd3f30fef1b4d17629afca77e0da7307b627907d3fc09bc493fd3d300"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ/bundle.json","state_url":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ/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-09T03:49:47Z","links":{"resolver":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ","bundle":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ/bundle.json","state":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OZCGMVDEMSJFCTADEWYZIPZWOQ","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":"abcb16723db9c133c420905c6db640cbcd65ff15692e7c46ccd5a11eafa73dcd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-29T23:52:55Z","title_canon_sha256":"38dd6bb894f794ee5768546aee14805b2ec9a0d905c5782fa1f11cb695923c9f"},"schema_version":"1.0","source":{"id":"1811.12542","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12542","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12542v4","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12542","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"OZCGMVDEMSJF","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZCGMVDEMSJFCTAD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZCGMVDE","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:92caf3dbd3f30fef1b4d17629afca77e0da7307b627907d3fc09bc493fd3d300","target":"graph","created_at":"2026-05-17T23:45:15Z","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":"In the area of graph signal processing, a graph is a set of nodes arbitrarily connected by weighted links; a graph signal is a set of scalar values associated with each node; and sampling is the problem of selecting an optimal subset of nodes from which a graph signal can be reconstructed. This paper proposes the use of spatial dithering on the vertex domain of the graph, as a way to conveniently find statistically good sampling sets. This is done establishing that there is a family of good sampling sets characterized on the vertex domain by a maximization of the distance between sampling node","authors_text":"Alejandro Parada-Mayorga, Daniel L. Lau, Gonzalo R. Arce, Jhony H. Giraldo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-29T23:52:55Z","title":"Blue-Noise Sampling on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12542","kind":"arxiv","version":4},"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:c2867ecfa90c1f124a24c39608140944559d1a53c43526b56fa3ee82c3e5fca5","target":"record","created_at":"2026-05-17T23:45:15Z","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":"abcb16723db9c133c420905c6db640cbcd65ff15692e7c46ccd5a11eafa73dcd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-29T23:52:55Z","title_canon_sha256":"38dd6bb894f794ee5768546aee14805b2ec9a0d905c5782fa1f11cb695923c9f"},"schema_version":"1.0","source":{"id":"1811.12542","kind":"arxiv","version":4}},"canonical_sha256":"76446654646492514c0325b1943f367420d381fe5beea1c82a7a2f96facf8e4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76446654646492514c0325b1943f367420d381fe5beea1c82a7a2f96facf8e4b","first_computed_at":"2026-05-17T23:45:15.159825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:15.159825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Dijwkpx+3t7f69YHNd/SkG9sylsYxa20Chf4YxxW1RKmcIosnav7BVCtH7yAXucwGdbRY9bFAuwM4h52UOhCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:15.160552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.12542","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2867ecfa90c1f124a24c39608140944559d1a53c43526b56fa3ee82c3e5fca5","sha256:92caf3dbd3f30fef1b4d17629afca77e0da7307b627907d3fc09bc493fd3d300"],"state_sha256":"8b35ab343490123fdd904be66bb238bf702f1c88eeb2a49b8ef95afb79bbe5c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TUHCd6gCRl05J2nJ/wKOQUOhl4UwPDLT5J4AhfRW5agEDDU9JTNsCzUAw3UDBitfFdbcqVXxrD14KiBEk2KkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:49:47.480541Z","bundle_sha256":"1f954ead1a20db67e18318e180c5a60f8018b7282a6c372ee25f611b13bd7f13"}}