{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QFHRBNALLBLMFMFZAAL3OZGIXE","short_pith_number":"pith:QFHRBNAL","canonical_record":{"source":{"id":"1008.0919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-05T07:02:29Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"04a6016cda46b855a88abb96ab0940fdbe1e6ad721c16b3653747d62762a6f09","abstract_canon_sha256":"ce663e421e7c56b226638557adf22f48fb284a2ce0dea733ebc5cf4b63bda40a"},"schema_version":"1.0"},"canonical_sha256":"814f10b40b5856c2b0b90017b764c8b91ad39b70a61119207d25ebfd7ca610c6","source":{"kind":"arxiv","id":"1008.0919","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0919","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0919v1","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0919","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"pith_short_12","alias_value":"QFHRBNALLBLM","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QFHRBNALLBLMFMFZ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QFHRBNAL","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QFHRBNALLBLMFMFZAAL3OZGIXE","target":"record","payload":{"canonical_record":{"source":{"id":"1008.0919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-05T07:02:29Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"04a6016cda46b855a88abb96ab0940fdbe1e6ad721c16b3653747d62762a6f09","abstract_canon_sha256":"ce663e421e7c56b226638557adf22f48fb284a2ce0dea733ebc5cf4b63bda40a"},"schema_version":"1.0"},"canonical_sha256":"814f10b40b5856c2b0b90017b764c8b91ad39b70a61119207d25ebfd7ca610c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:34.986961Z","signature_b64":"t0hbHjWuHAAbGb5sZUrTSSkbhF3aXfMO3IV+4b1lTnzMN4HfX4tUwc61lkDd+B/9POarzWoi028oGbJi2pucDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"814f10b40b5856c2b0b90017b764c8b91ad39b70a61119207d25ebfd7ca610c6","last_reissued_at":"2026-05-18T04:42:34.986282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:34.986282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.0919","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:42:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Livpb/nn8fi7LbVNoPfGK7LGHR+XC0yvEUP33aPnNKhpzJA11vCrT53TX1Xf5X2+lgFQ3aHZnt0s7Ys3dmt5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:40.137346Z"},"content_sha256":"f3b1d839ec4c8f033e77c65a3945db21a80faeca62eceb0d57fcf0bafc07b92e","schema_version":"1.0","event_id":"sha256:f3b1d839ec4c8f033e77c65a3945db21a80faeca62eceb0d57fcf0bafc07b92e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QFHRBNALLBLMFMFZAAL3OZGIXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressive Sensing over Graphs","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, Weiyu Xu","submitted_at":"2010-08-05T07:02:29Z","abstract_excerpt":"In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are interested in recovering sparse vectors representing the properties of the edges from a graph. Unlike existing compressive sensing results, the collective additive measurements we are allowed to take must follow connected paths over the underlying graph. For a sufficiently connected graph with $n$ nodes, it is shown that, using $O(k \\log(n))$ path measurements, we are able to recover any $k$-sparse link vector (with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0919","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:42:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wQok0HaKbYYLL1RaVDblof1FGEmIXcaaGZ2k7XBi6xeFvlpbYlXk9+Hd7ouRzwJgOwgknkF4aW61zJ6J4q+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:40.137741Z"},"content_sha256":"b351763df40c8721f3804afa515ca0ad355227df7f2bd3257abb24309cc5cf6c","schema_version":"1.0","event_id":"sha256:b351763df40c8721f3804afa515ca0ad355227df7f2bd3257abb24309cc5cf6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFHRBNALLBLMFMFZAAL3OZGIXE/bundle.json","state_url":"https://pith.science/pith/QFHRBNALLBLMFMFZAAL3OZGIXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFHRBNALLBLMFMFZAAL3OZGIXE/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-30T12:05:40Z","links":{"resolver":"https://pith.science/pith/QFHRBNALLBLMFMFZAAL3OZGIXE","bundle":"https://pith.science/pith/QFHRBNALLBLMFMFZAAL3OZGIXE/bundle.json","state":"https://pith.science/pith/QFHRBNALLBLMFMFZAAL3OZGIXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFHRBNALLBLMFMFZAAL3OZGIXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QFHRBNALLBLMFMFZAAL3OZGIXE","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":"ce663e421e7c56b226638557adf22f48fb284a2ce0dea733ebc5cf4b63bda40a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-05T07:02:29Z","title_canon_sha256":"04a6016cda46b855a88abb96ab0940fdbe1e6ad721c16b3653747d62762a6f09"},"schema_version":"1.0","source":{"id":"1008.0919","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0919","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0919v1","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0919","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"pith_short_12","alias_value":"QFHRBNALLBLM","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QFHRBNALLBLMFMFZ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QFHRBNAL","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:b351763df40c8721f3804afa515ca0ad355227df7f2bd3257abb24309cc5cf6c","target":"graph","created_at":"2026-05-18T04:42:34Z","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":"In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are interested in recovering sparse vectors representing the properties of the edges from a graph. Unlike existing compressive sensing results, the collective additive measurements we are allowed to take must follow connected paths over the underlying graph. For a sufficiently connected graph with $n$ nodes, it is shown that, using $O(k \\log(n))$ path measurements, we are able to recover any $k$-sparse link vector (with ","authors_text":"Ao Tang, Enrique Mallada, Weiyu Xu","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-05T07:02:29Z","title":"Compressive Sensing over Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0919","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:f3b1d839ec4c8f033e77c65a3945db21a80faeca62eceb0d57fcf0bafc07b92e","target":"record","created_at":"2026-05-18T04:42:34Z","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":"ce663e421e7c56b226638557adf22f48fb284a2ce0dea733ebc5cf4b63bda40a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-05T07:02:29Z","title_canon_sha256":"04a6016cda46b855a88abb96ab0940fdbe1e6ad721c16b3653747d62762a6f09"},"schema_version":"1.0","source":{"id":"1008.0919","kind":"arxiv","version":1}},"canonical_sha256":"814f10b40b5856c2b0b90017b764c8b91ad39b70a61119207d25ebfd7ca610c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"814f10b40b5856c2b0b90017b764c8b91ad39b70a61119207d25ebfd7ca610c6","first_computed_at":"2026-05-18T04:42:34.986282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:34.986282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t0hbHjWuHAAbGb5sZUrTSSkbhF3aXfMO3IV+4b1lTnzMN4HfX4tUwc61lkDd+B/9POarzWoi028oGbJi2pucDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:34.986961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.0919","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3b1d839ec4c8f033e77c65a3945db21a80faeca62eceb0d57fcf0bafc07b92e","sha256:b351763df40c8721f3804afa515ca0ad355227df7f2bd3257abb24309cc5cf6c"],"state_sha256":"9def7eb67fbde6ee6ada52791b36e23bba47bbc9547b1971958361da8ec3869c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ceXAylP4loLGuh4d9wyblmV1ZtwtMv8d861YFIM38JOHOQThopfswDSuRxVZBPFMh5Yu5pMcC2+EDR+QWEXMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:05:40.140528Z","bundle_sha256":"f72d477b4e4bf41947b24451d1aa02530af1affca2bae2536b475ad0965d76d2"}}