{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FK6Y7KWN5FQAPEAZRXJICYULGU","short_pith_number":"pith:FK6Y7KWN","schema_version":"1.0","canonical_sha256":"2abd8faacde9600790198dd281628b353f7a915771207d11264a5673ea74cf0a","source":{"kind":"arxiv","id":"1108.0443","version":1},"attestation_state":"computed","paper":{"title":"Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ao Tang, Enrique Mallada, Meng Wang, Weiyu Xu","submitted_at":"2011-08-01T22:09:23Z","abstract_excerpt":"This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgraph. We provide explicit measurement constructions for several special graphs. A general measurement construction algorithm is also proposed and evaluated. For any given graph $G$ with $n$ nodes, we derive order optimal upper bounds of the minimum number of measurements needed to recover any $k$-sparse vector over $G$ ($M^G_{k,n}$). Our study suggests that $M^G_{k,n}$ may serve as a graph connectivity metric."},"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":"1108.0443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-01T22:09:23Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"907b7a5543e82b8f80b2cd58c53ceed235d98866e0e9e5de2955f0fc871609f5","abstract_canon_sha256":"a0b2a5b19f5cf9897d7198a9cb55b3d5d8e21c699ac24aa867e88073ab741e26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:30.441659Z","signature_b64":"znq3hKjz6Bu89QZmhf7CNDO26PTJcd1KUSNHwNgeUvJRf74qpdH7V3gD6wyDtbrpypcx1am0MnrFq4al4REMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2abd8faacde9600790198dd281628b353f7a915771207d11264a5673ea74cf0a","last_reissued_at":"2026-05-18T04:16:30.441108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:30.441108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ao Tang, Enrique Mallada, Meng Wang, Weiyu Xu","submitted_at":"2011-08-01T22:09:23Z","abstract_excerpt":"This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgraph. We provide explicit measurement constructions for several special graphs. A general measurement construction algorithm is also proposed and evaluated. For any given graph $G$ with $n$ nodes, we derive order optimal upper bounds of the minimum number of measurements needed to recover any $k$-sparse vector over $G$ ($M^G_{k,n}$). Our study suggests that $M^G_{k,n}$ may serve as a graph connectivity metric."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0443","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.0443","created_at":"2026-05-18T04:16:30.441189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.0443v1","created_at":"2026-05-18T04:16:30.441189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0443","created_at":"2026-05-18T04:16:30.441189+00:00"},{"alias_kind":"pith_short_12","alias_value":"FK6Y7KWN5FQA","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FK6Y7KWN5FQAPEAZ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FK6Y7KWN","created_at":"2026-05-18T12:26:28.662955+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/FK6Y7KWN5FQAPEAZRXJICYULGU","json":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU.json","graph_json":"https://pith.science/api/pith-number/FK6Y7KWN5FQAPEAZRXJICYULGU/graph.json","events_json":"https://pith.science/api/pith-number/FK6Y7KWN5FQAPEAZRXJICYULGU/events.json","paper":"https://pith.science/paper/FK6Y7KWN"},"agent_actions":{"view_html":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU","download_json":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU.json","view_paper":"https://pith.science/paper/FK6Y7KWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.0443&json=true","fetch_graph":"https://pith.science/api/pith-number/FK6Y7KWN5FQAPEAZRXJICYULGU/graph.json","fetch_events":"https://pith.science/api/pith-number/FK6Y7KWN5FQAPEAZRXJICYULGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU/action/storage_attestation","attest_author":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU/action/author_attestation","sign_citation":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU/action/citation_signature","submit_replication":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU/action/replication_record"}},"created_at":"2026-05-18T04:16:30.441189+00:00","updated_at":"2026-05-18T04:16:30.441189+00:00"}