{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FK6Y7KWN5FQAPEAZRXJICYULGU","short_pith_number":"pith:FK6Y7KWN","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"},"canonical_sha256":"2abd8faacde9600790198dd281628b353f7a915771207d11264a5673ea74cf0a","source":{"kind":"arxiv","id":"1108.0443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0443","created_at":"2026-05-18T04:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0443v1","created_at":"2026-05-18T04:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0443","created_at":"2026-05-18T04:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"FK6Y7KWN5FQA","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FK6Y7KWN5FQAPEAZ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FK6Y7KWN","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FK6Y7KWN5FQAPEAZRXJICYULGU","target":"record","payload":{"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"},"canonical_sha256":"2abd8faacde9600790198dd281628b353f7a915771207d11264a5673ea74cf0a","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"},"source_kind":"arxiv","source_id":"1108.0443","source_version":1,"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-18T04:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/sPBK2N6JylvzQlleJ/3WFeOBDc/kBni2P815+6HYt69dTiTFIyI6m7zwnEM6Pslt7Ww0HPurRRgdvwveo/hAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:25:31.720110Z"},"content_sha256":"9c0d8ebc252771997af689a28b4b3c72b78d915f2b4423b746454a851a58c026","schema_version":"1.0","event_id":"sha256:9c0d8ebc252771997af689a28b4b3c72b78d915f2b4423b746454a851a58c026"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FK6Y7KWN5FQAPEAZRXJICYULGU","target":"graph","payload":{"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"},"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-18T04:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9tS4fUZr14NYCqeAUTU3ii2DdEtfkgY/xeRjNhLuvXzvBluseJd+dzbzOCFaQcR1Vc+box1rMsx2iTHf+1NtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:25:31.720476Z"},"content_sha256":"2830a8e962c3d0bcea6b03fad7771ae9ba27fc4c41e954671316ee88c43637b0","schema_version":"1.0","event_id":"sha256:2830a8e962c3d0bcea6b03fad7771ae9ba27fc4c41e954671316ee88c43637b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU/bundle.json","state_url":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FK6Y7KWN5FQAPEAZRXJICYULGU/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-05-30T05:25:31Z","links":{"resolver":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU","bundle":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU/bundle.json","state":"https://pith.science/pith/FK6Y7KWN5FQAPEAZRXJICYULGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FK6Y7KWN5FQAPEAZRXJICYULGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FK6Y7KWN5FQAPEAZRXJICYULGU","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":"a0b2a5b19f5cf9897d7198a9cb55b3d5d8e21c699ac24aa867e88073ab741e26","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-01T22:09:23Z","title_canon_sha256":"907b7a5543e82b8f80b2cd58c53ceed235d98866e0e9e5de2955f0fc871609f5"},"schema_version":"1.0","source":{"id":"1108.0443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0443","created_at":"2026-05-18T04:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0443v1","created_at":"2026-05-18T04:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0443","created_at":"2026-05-18T04:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"FK6Y7KWN5FQA","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FK6Y7KWN5FQAPEAZ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FK6Y7KWN","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:2830a8e962c3d0bcea6b03fad7771ae9ba27fc4c41e954671316ee88c43637b0","target":"graph","created_at":"2026-05-18T04:16:30Z","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":"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.","authors_text":"Ao Tang, Enrique Mallada, Meng Wang, Weiyu Xu","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-01T22:09:23Z","title":"Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0443","kind":"arxiv","version":1},"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:9c0d8ebc252771997af689a28b4b3c72b78d915f2b4423b746454a851a58c026","target":"record","created_at":"2026-05-18T04:16:30Z","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":"a0b2a5b19f5cf9897d7198a9cb55b3d5d8e21c699ac24aa867e88073ab741e26","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-01T22:09:23Z","title_canon_sha256":"907b7a5543e82b8f80b2cd58c53ceed235d98866e0e9e5de2955f0fc871609f5"},"schema_version":"1.0","source":{"id":"1108.0443","kind":"arxiv","version":1}},"canonical_sha256":"2abd8faacde9600790198dd281628b353f7a915771207d11264a5673ea74cf0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2abd8faacde9600790198dd281628b353f7a915771207d11264a5673ea74cf0a","first_computed_at":"2026-05-18T04:16:30.441108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:30.441108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"znq3hKjz6Bu89QZmhf7CNDO26PTJcd1KUSNHwNgeUvJRf74qpdH7V3gD6wyDtbrpypcx1am0MnrFq4al4REMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:30.441659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.0443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c0d8ebc252771997af689a28b4b3c72b78d915f2b4423b746454a851a58c026","sha256:2830a8e962c3d0bcea6b03fad7771ae9ba27fc4c41e954671316ee88c43637b0"],"state_sha256":"8880d7f77aad7159364d8639682186e9190ceb9df0115f6f148a9b9d844e65c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jDX6kkUYb9b4zfNLROeFiRHTEEmJ67xqj4QWJwwCc6n9i6KkQyMlBOSpv+JafWwmmfeGpoM9nMyF+K1oqNs5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:25:31.722503Z","bundle_sha256":"df8b71bf838e8bdf3b8769f58764aef3d585c3ed69fbc9a05a15322ebd2eb42f"}}