{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OZCGMVDEMSJFCTADEWYZIPZWOQ","short_pith_number":"pith:OZCGMVDE","schema_version":"1.0","canonical_sha256":"76446654646492514c0325b1943f367420d381fe5beea1c82a7a2f96facf8e4b","source":{"kind":"arxiv","id":"1811.12542","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.12542","created_at":"2026-05-17T23:45:15.159916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12542v4","created_at":"2026-05-17T23:45:15.159916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12542","created_at":"2026-05-17T23:45:15.159916+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZCGMVDEMSJF","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZCGMVDEMSJFCTAD","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZCGMVDE","created_at":"2026-05-18T12:32:43.782077+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/OZCGMVDEMSJFCTADEWYZIPZWOQ","json":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ.json","graph_json":"https://pith.science/api/pith-number/OZCGMVDEMSJFCTADEWYZIPZWOQ/graph.json","events_json":"https://pith.science/api/pith-number/OZCGMVDEMSJFCTADEWYZIPZWOQ/events.json","paper":"https://pith.science/paper/OZCGMVDE"},"agent_actions":{"view_html":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ","download_json":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ.json","view_paper":"https://pith.science/paper/OZCGMVDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12542&json=true","fetch_graph":"https://pith.science/api/pith-number/OZCGMVDEMSJFCTADEWYZIPZWOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/OZCGMVDEMSJFCTADEWYZIPZWOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ/action/storage_attestation","attest_author":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ/action/author_attestation","sign_citation":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ/action/citation_signature","submit_replication":"https://pith.science/pith/OZCGMVDEMSJFCTADEWYZIPZWOQ/action/replication_record"}},"created_at":"2026-05-17T23:45:15.159916+00:00","updated_at":"2026-05-17T23:45:15.159916+00:00"}