{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2KIKFZFASVRNCZHLTAF7GDRXQJ","short_pith_number":"pith:2KIKFZFA","schema_version":"1.0","canonical_sha256":"d290a2e4a09562d164eb980bf30e37827e576068263c960962f53436f970d115","source":{"kind":"arxiv","id":"1811.03206","version":2},"attestation_state":"computed","paper":{"title":"Reconstruction-Cognizant Graph Sampling using Gershgorin Disc Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Fen Wang, Gene Cheung, Wen Gao, Xianming Liu, Yuanchao Bai","submitted_at":"2018-11-08T01:16:16Z","abstract_excerpt":"Graph sampling with noise is a fundamental problem in graph signal processing (GSP). Previous works assume an unbiased least square (LS) signal reconstruction scheme and select samples greedily via expensive extreme eigenvector computation. A popular biased scheme using graph Laplacian regularization (GLR) solves a system of linear equations for its reconstruction. Assuming this GLR-based scheme, we propose a reconstruction-cognizant sampling strategy to maximize the numerical stability of the linear system---\\textit{i.e.}, minimize the condition number of the coefficient matrix. Specifically,"},"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.03206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-08T01:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"e8f697b4132b4693cc8e73c1f813d649fa3fc0d1e3479b8e7ce6f1106e04b1dc","abstract_canon_sha256":"42b5390b85ced34e10a2952fcc1c89987149cba7e4be29095ad3e10aa622aa7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:50.253663Z","signature_b64":"myA0FZlda04LZjgXdwVAZdgZysRhCFOrJSkomq/YP9bknhN7og64/5Mfodp9YIlp/m9cDMyEZM1Q1NZ/KhaABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d290a2e4a09562d164eb980bf30e37827e576068263c960962f53436f970d115","last_reissued_at":"2026-05-17T23:53:50.252908Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:50.252908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstruction-Cognizant Graph Sampling using Gershgorin Disc Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Fen Wang, Gene Cheung, Wen Gao, Xianming Liu, Yuanchao Bai","submitted_at":"2018-11-08T01:16:16Z","abstract_excerpt":"Graph sampling with noise is a fundamental problem in graph signal processing (GSP). Previous works assume an unbiased least square (LS) signal reconstruction scheme and select samples greedily via expensive extreme eigenvector computation. A popular biased scheme using graph Laplacian regularization (GLR) solves a system of linear equations for its reconstruction. Assuming this GLR-based scheme, we propose a reconstruction-cognizant sampling strategy to maximize the numerical stability of the linear system---\\textit{i.e.}, minimize the condition number of the coefficient matrix. Specifically,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03206","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.03206","created_at":"2026-05-17T23:53:50.253036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03206v2","created_at":"2026-05-17T23:53:50.253036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03206","created_at":"2026-05-17T23:53:50.253036+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KIKFZFASVRN","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KIKFZFASVRNCZHL","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KIKFZFA","created_at":"2026-05-18T12:32:02.567920+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/2KIKFZFASVRNCZHLTAF7GDRXQJ","json":"https://pith.science/pith/2KIKFZFASVRNCZHLTAF7GDRXQJ.json","graph_json":"https://pith.science/api/pith-number/2KIKFZFASVRNCZHLTAF7GDRXQJ/graph.json","events_json":"https://pith.science/api/pith-number/2KIKFZFASVRNCZHLTAF7GDRXQJ/events.json","paper":"https://pith.science/paper/2KIKFZFA"},"agent_actions":{"view_html":"https://pith.science/pith/2KIKFZFASVRNCZHLTAF7GDRXQJ","download_json":"https://pith.science/pith/2KIKFZFASVRNCZHLTAF7GDRXQJ.json","view_paper":"https://pith.science/paper/2KIKFZFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03206&json=true","fetch_graph":"https://pith.science/api/pith-number/2KIKFZFASVRNCZHLTAF7GDRXQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2KIKFZFASVRNCZHLTAF7GDRXQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KIKFZFASVRNCZHLTAF7GDRXQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KIKFZFASVRNCZHLTAF7GDRXQJ/action/storage_attestation","attest_author":"https://pith.science/pith/2KIKFZFASVRNCZHLTAF7GDRXQJ/action/author_attestation","sign_citation":"https://pith.science/pith/2KIKFZFASVRNCZHLTAF7GDRXQJ/action/citation_signature","submit_replication":"https://pith.science/pith/2KIKFZFASVRNCZHLTAF7GDRXQJ/action/replication_record"}},"created_at":"2026-05-17T23:53:50.253036+00:00","updated_at":"2026-05-17T23:53:50.253036+00:00"}