{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NPSM7HUYPRC2IARHZ3DRCZY3WH","short_pith_number":"pith:NPSM7HUY","schema_version":"1.0","canonical_sha256":"6be4cf9e987c45a40227cec711671bb1e89f4ca507a40c90650c4d322fee2e43","source":{"kind":"arxiv","id":"2110.12387","version":1},"attestation_state":"computed","paper":{"title":"Task-Based Graph Signal Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Baoyun Wang, Haiyang Zhang, Nir Shlezinger, Pei Li, Yonina C. Eldar","submitted_at":"2021-10-24T08:28:48Z","abstract_excerpt":"Graph signals arise in various applications, ranging from sensor networks to social media data. The high-dimensional nature of these signals implies that they often need to be compressed in order to be stored and transmitted. The common framework for graph signal compression is based on sampling, resulting in a set of continuous-amplitude samples, which in turn have to be quantized into a finite bit representation. In this work we study the joint design of graph signal sampling along with quantization, for graph signal compression. We focus on bandlimited graph signals, and show that the compr"},"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":"2110.12387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-10-24T08:28:48Z","cross_cats_sorted":[],"title_canon_sha256":"c7d11c2a03971a70d9f74254dc4e348293c9f1ece0b2f4c0e161886a7a5c8859","abstract_canon_sha256":"f69427447f262a9d84d52282ebf26c01dafd4cc339aab6eec6a6f6b3a55c8169"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:25:19.664994Z","signature_b64":"UHdxbiIJFZEY5PvfcNG+em+q1AxZPWdNw72zFS33lqyKjPSmgM+mGt6Ult61tXNkNF6LRKBMrSB8uJDW+ZyeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6be4cf9e987c45a40227cec711671bb1e89f4ca507a40c90650c4d322fee2e43","last_reissued_at":"2026-07-05T03:25:19.664536Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:25:19.664536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Task-Based Graph Signal Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Baoyun Wang, Haiyang Zhang, Nir Shlezinger, Pei Li, Yonina C. Eldar","submitted_at":"2021-10-24T08:28:48Z","abstract_excerpt":"Graph signals arise in various applications, ranging from sensor networks to social media data. The high-dimensional nature of these signals implies that they often need to be compressed in order to be stored and transmitted. The common framework for graph signal compression is based on sampling, resulting in a set of continuous-amplitude samples, which in turn have to be quantized into a finite bit representation. In this work we study the joint design of graph signal sampling along with quantization, for graph signal compression. We focus on bandlimited graph signals, and show that the compr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.12387","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.12387/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.12387","created_at":"2026-07-05T03:25:19.664598+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.12387v1","created_at":"2026-07-05T03:25:19.664598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.12387","created_at":"2026-07-05T03:25:19.664598+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPSM7HUYPRC2","created_at":"2026-07-05T03:25:19.664598+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPSM7HUYPRC2IARH","created_at":"2026-07-05T03:25:19.664598+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPSM7HUY","created_at":"2026-07-05T03:25:19.664598+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/NPSM7HUYPRC2IARHZ3DRCZY3WH","json":"https://pith.science/pith/NPSM7HUYPRC2IARHZ3DRCZY3WH.json","graph_json":"https://pith.science/api/pith-number/NPSM7HUYPRC2IARHZ3DRCZY3WH/graph.json","events_json":"https://pith.science/api/pith-number/NPSM7HUYPRC2IARHZ3DRCZY3WH/events.json","paper":"https://pith.science/paper/NPSM7HUY"},"agent_actions":{"view_html":"https://pith.science/pith/NPSM7HUYPRC2IARHZ3DRCZY3WH","download_json":"https://pith.science/pith/NPSM7HUYPRC2IARHZ3DRCZY3WH.json","view_paper":"https://pith.science/paper/NPSM7HUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.12387&json=true","fetch_graph":"https://pith.science/api/pith-number/NPSM7HUYPRC2IARHZ3DRCZY3WH/graph.json","fetch_events":"https://pith.science/api/pith-number/NPSM7HUYPRC2IARHZ3DRCZY3WH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPSM7HUYPRC2IARHZ3DRCZY3WH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPSM7HUYPRC2IARHZ3DRCZY3WH/action/storage_attestation","attest_author":"https://pith.science/pith/NPSM7HUYPRC2IARHZ3DRCZY3WH/action/author_attestation","sign_citation":"https://pith.science/pith/NPSM7HUYPRC2IARHZ3DRCZY3WH/action/citation_signature","submit_replication":"https://pith.science/pith/NPSM7HUYPRC2IARHZ3DRCZY3WH/action/replication_record"}},"created_at":"2026-07-05T03:25:19.664598+00:00","updated_at":"2026-07-05T03:25:19.664598+00:00"}